Volume-6 , Issue-5 , May - 2018 Go Back

Huge dataset is widely used in various scientific applications. Hence, data replication is highly required to manage large volumes of data in a distributed manner. This improves the data access rate, reduces access latency and increases data availability. This paper presents a comprehensive review of the existing static and dynamic replication mechanisms along with the features. Static mechanisms determine the location of replication nodes during the design phase while the dynamic mechanisms select the replication nodes at the runtime. The dynamic replication approaches allow their associated replication strategies to be adjusted at the runtime according to the changes in user behavior and network topology. Also, they are applicable for a service-oriented environment where the number and location of the users who intend to access data often have to be determined in a highly dynamic fashion.

Cloud, Data Grid, Dynamic Replication, Static Replication

[1] S. Goel and R. Buyya, "Data replication strategies in wide-area distributed systems," in Enterprise service computing: from concept to deployment, ed: IGI Global, 2007, pp. 211-241.
[2] O. Wolfson, S. Jajodia, and Y. Huang, "An adaptive data replication algorithm," ACM Transactions on Database Systems (TODS), vol. 22, pp. 255-314, 1997.
[3] S. Ghemawat, H. Gobioff, and S.-T. Leung, The Google file system vol. 37: ACM, 2003.
[4] R. M. Rahman, K. Barker, and R. Alhajj, "Replica placement design with static optimality and dynamic maintainability," in Cluster Computing and the Grid, 2006. CCGRID 06. Sixth IEEE International Symposium on, 2006, pp. 4 pp.-437.
[5] K. Shvachko, H. Kuang, S. Radia, and R. Chansler, "The hadoop distributed file system," in Mass storage systems and technologies (MSST), 2010 IEEE 26th symposium on, 2010, pp. 1-10.
[6] U. Čibej, B. Slivnik, and B. Robič, "The complexity of static data replication in data grids," Parallel Computing, vol. 31, pp. 900-912, 2005.
[7] T. Loukopoulos and I. Ahmad, "Static and adaptive distributed data replication using genetic algorithms," Journal of Parallel and Distributed Computing, vol. 64, pp. 1270-1285, 2004.
[8] H. Lamehamedi, Z. Shentu, B. Szymanski, and E. Deelman, "Simulation of dynamic data replication strategies in data grids," in Parallel and Distributed Processing Symposium, 2003. Proceedings. International, 2003, p. 10 pp.
[9] R.-S. Chang and H.-P. Chang, "A dynamic data replication strategy using access-weights in data grids," The Journal of Supercomputing, vol. 45, pp. 277-295, 2008.
[10] S. Acharya and S. B. Zdonik, "An efficient scheme for dynamic data replication," 1993.
[11] H. Huang, W. Hung, and K. G. Shin, "FS2: dynamic data replication in free disk space for improving disk performance and energy consumption," in ACM SIGOPS Operating Systems Review, 2005, pp. 263-276.
[12] S.-M. Park, J.-H. Kim, Y.-B. Ko, and W.-S. Yoon, "Dynamic data grid replication strategy based on Internet hierarchy," in International Conference on Grid and Cooperative Computing, 2003, pp. 838-846.
[13] W. Li, Y. Yang, and D. Yuan, "A novel cost-effective dynamic data replication strategy for reliability in cloud data centres," in IEEE ninth international conference on Dependable, autonomic and secure computing (DASC), 2011, pp. 496-502.
[14] N. Saadat and A. M. Rahmani, "PDDRA: A new pre-fetching based dynamic data replication algorithm in data grids," Future Generation Computer Systems, vol. 28, pp. 666-681, 2012.
[15] X. Sun, J. Zheng, Q. Liu, and Y. Liu, "Dynamic data replication based on access cost in distributed systems," in Fourth International Conference on Computer Sciences and Convergence Information Technology, 2009. ICCIT`09. , 2009, pp. 829-834.
[16] M. Tang, B.-S. Lee, X. Tang, and C.-K. Yeo, "The impact of data replication on job scheduling performance in the Data Grid," Future Generation Computer Systems, vol. 22, pp. 254-268, 2006.
[17] S.-Q. Long, Y.-L. Zhao, and W. Chen, "MORM: A Multi-objective Optimized Replication Management strategy for cloud storage cluster," Journal of Systems Architecture, vol. 60, pp. 234-244, 2014.
[18] A. Doğan, "A study on performance of dynamic file replication algorithms for real-time file access in data grids," Future Generation Computer Systems, vol. 25, pp. 829-839, 2009.
[19] K. Shvachko, H. Kuang, S. Radia, and R. Chansler, "The hadoop distributed file system," in IEEE 26th symposium on Mass storage systems and technologies (MSST), 2010, pp. 1-10.
[20] Q. Wei, B. Veeravalli, B. Gong, L. Zeng, and D. Feng, "CDRM: A cost-effective dynamic replication management scheme for cloud storage cluster," in IEEE International Conference on Cluster Computing (CLUSTER), 2010, pp. 188-196.
[21] M. Lei, S. V. Vrbsky, and X. Hong, "An on-line replication strategy to increase availability in data grids," Future Generation Computer Systems, vol. 24, pp. 85-98, 2008.
[22] R. M. Rahman, K. Barker, and R. Alhajj, "Replica placement design with static optimality and dynamic maintainability," in Sixth IEEE International Symposium on Cluster Computing and the Grid, 2006. CCGRID 06., 2006, pp. 4 pp.-437.
[23] D.-W. Sun, G.-R. Chang, S. Gao, L.-Z. Jin, and X.-W. Wang, "Modeling a dynamic data replication strategy to increase system availability in cloud computing environments," Journal of computer science and technology, vol. 27, pp. 256-272, 2012.
[24] D. Nukarapu, B. Tang, L. Wang, and S. Lu, "Data replication in data intensive scientific applications with performance guarantee," IEEE Transactions on Parallel and Distributed Systems, vol. 22, pp. 1299-1306, 2011.
[25] S. U. Khan and I. Ahmad, "Comparison and analysis of ten static heuristics-based Internet data replication techniques," Journal of Parallel and Distributed Computing, vol. 68, pp. 113-136, 2008.
[26] A. Cidon, R. Stutsman, S. Rumble, S. Katti, J. Ousterhout, and M. Rosenblum, "MinCopysets: Derandomizing replication in cloud storage," in The 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2013.
[27] Y. Qu and N. Xiong, "RFH: A resilient, fault-tolerant and high-efficient replication algorithm for distributed cloud storage," in Parallel Processing (ICPP), 2012 41st International Conference on, 2012, pp. 520-529.
[28] L.-W. Lee, P. Scheuermann, and R. Vingralek, "File assignment in parallel I/O systems with minimal variance of service time," IEEE Transactions on Computers, vol. 49, pp. 127-140, 2000.
[29] O. A.-H. Hassan, L. Ramaswamy, J. Miller, K. Rasheed, and E. R. Canfield, "Replication in overlay networks: A multi-objective optimization approach," in International Conference on Collaborative Computing: Networking, Applications and Worksharing, 2008, pp. 512-528.
[30] Z. Zeng and B. Veeravalli, "Optimal metadata replications and request balancing strategy on cloud data centers," Journal of Parallel and Distributed Computing, vol. 74, pp. 2934-2940, 2014.
[31] T. Chen, R. Bahsoon, and A.-R. H. Tawil, "Scalable service-oriented replication with flexible consistency guarantee in the cloud," Information Sciences, vol. 264, pp. 349-370, 2014.
[32] Y. Chen, A. Das, W. Qin, A. Sivasubramaniam, Q. Wang, and N. Gautam, "Managing server energy and operational costs in hosting centers," in ACM SIGMETRICS performance evaluation review, 2005, pp. 303-314.
[33] M. Lin, A. Wierman, L. L. Andrew, and E. Thereska, "Dynamic right-sizing for power-proportional data centers," IEEE/ACM Transactions on Networking, vol. 21, pp. 1378-1391, 2013.
[34] M. Björkqvist, L. Y. Chen, and W. Binder, "Optimizing service replication in clouds," in Proceedings of the Winter Simulation Conference, 2011, pp. 3312-3322.
[35] N. K. Gill and S. Singh, "Dynamic cost-aware re-replication and rebalancing strategy in cloud system," in Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA) 2014, 2015, pp. 39-47.
[36] D. Boru, D. Kliazovich, F. Granelli, P. Bouvry, and A. Y. Zomaya, "Energy-efficient data replication in cloud computing datacenters," Cluster computing, vol. 18, pp. 385-402, 2015.
[37] D. A. Tran, K. Nguyen, and C. Pham, "S-CLONE: Socially-aware data replication for social networks," Computer Networks, vol. 56, pp. 2001-2013, 2012.
[38] K. Ranganathan and I. Foster, "Identifying dynamic replication strategies for a high-performance data grid," in International Workshop on Grid Computing, 2001, pp. 75-86.
[39] N. Mansouri, G. H. Dastghaibyfard, and E. Mansouri, "Combination of data replication and scheduling algorithm for improving data availability in Data Grids," Journal of Network and Computer Applications, vol. 36, pp. 711-722, 2013.
[40] M. Bsoul, A. Al-Khasawneh, Y. Kilani, and I. Obeidat, "A threshold-based dynamic data replication strategy," The Journal of Supercomputing, vol. 60, pp. 301-310, 2012.
[41] C. L. Abad, Y. Lu, and R. H. Campbell, "DARE: Adaptive data replication for efficient cluster scheduling," in Cluster Computing (CLUSTER), 2011 IEEE International Conference on, 2011, pp. 159-168.
[42] X. Zhuo, Q. Li, W. Gao, G. Cao, and Y. Dai, "Contact duration aware data replication in delay tolerant networks," in Network Protocols (ICNP), 2011 19th IEEE International Conference on, 2011, pp. 236-245.
[43] M.-K. Hussein and M.-H. Mousa, "A light-weight data replication for cloud data centers environment," International Journal of Engineering and Innovative Technology, vol. 1, pp. 169-175, 2012.
[44] Z. Wang, T. Li, N. Xiong, and Y. Pan, "A novel dynamic network data replication scheme based on historical access record and proactive deletion," The Journal of Supercomputing, vol. 62, pp. 227-250, 2012.
[45] V. Andronikou, K. Mamouras, K. Tserpes, D. Kyriazis, and T. Varvarigou, "Dynamic QoS-aware data replication in grid environments based on data “importance”," Future Generation Computer Systems, vol. 28, pp. 544-553, 2012.
[46] K. Sashi and A. S. Thanamani, "Dynamic replication in a data grid using a modified BHR region based algorithm," Future Generation Computer Systems, vol. 27, pp. 202-210, 2011.
[47] J.-W. Lin, C.-H. Chen, and J. M. Chang, "QoS-aware data replication for data-intensive applications in cloud computing systems," IEEE Transactions on Cloud Computing, vol. 1, pp. 101-115, 2013.
[48] X. Bai, H. Jin, X. Liao, X. Shi, and Z. Shao, "RTRM: a response time-based replica management strategy for cloud storage system," in International Conference on Grid and Pervasive Computing, 2013, pp. 124-133.
[49] S. Gopinath and E. Sherly, "A Weighted Dynamic Data Replication Management for Cloud Data Storage Systems," International Journal of Applied Engineering Research, vol. 12, pp. 15517-15524, 2017.
[50] L. Azari, A. M. Rahmani, H. A. Daniel, and N. N. Qader, "A data replication algorithm for groups of files in data grids," Journal of Parallel and Distributed Computing, vol. 113, pp. 115-126, 2018.
[51] T. Amjad, M. Sher, and A. Daud, "A survey of dynamic replication strategies for improving data availability in data grids," Future Generation Computer Systems, vol. 28, pp. 337-349, 2012.
[52] U. Tos, R. Mokadem, A. Hameurlain, T. Ayav, and S. Bora, "Dynamic replication strategies in data grid systems: a survey," The Journal of Supercomputing, vol. 71, pp. 4116-4140, 2015.
[53] Z. Sann and T. T. Soe, "Agricultural Loan System Using Data Replication Method," 2017.
[54] R. Reka and T. Parithimarkalaignan, "Recovering Data Stability Service for Preserving Rational Data in Cloud Environment," 2017.
[55] S. kathuria, "A Survey on Security Provided by Multi-Clouds in Cloud Computing," International Journal of Scientific Research in Network Security and Communication vol. 6, pp. 23-27, 2018.
[56] Ganesan.T, Tamizharasan.P, and S. G. Murugan.S, "A Shared Memory Technique for Windows Environment through Virtualization," International Journal of Scientific Research in Network Security and Communication, vol. 1, pp. 17-22, 2013.
[57] S. K. Yadav, G. Singh, and D. S. Yadav, "ANALYSIS OF A DATABASE REPLICATION ALGORITHM UNDER LOAD SHARING IN NETWORKS," Journal of Engineering Science and Technology, vol. 11, pp. 193-211, 2016.
[58] T. Loukopoulos, I. Ahmad, and D. Papadias, "An overview of data replication on the Internet," in Parallel Architectures, Algorithms and Networks, 2002. I-SPAN`02. Proceedings. International Symposium on, 2002, pp. 31-36.

R. Bhuvaneswari, T.N. Ravi, "A Review of Static and Dynamic Data Replication Mechanisms for Distributed Systems," International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.953-964, 2018.

Gesture recognition is a mode for computers to begin to comprehend human body language, thus structuring a better-off channel between machines and humans than primitive text user interfaces or even GUIs. It enables humans to communicate with the machine and interact naturally without any intervention of mechanical devices. This technology not only saves time to unlock or operate any device but also makes human-computer interaction natural. The focus of this paper is on building a hand gesture recognition device using image processing for controlling the appliances by simple hand gestures instead of using any remote control devices or switches, thereby making user interaction as natural as possible. This is achieved by building a robotic arm using leap motion, Arduino UNO and different types of motors.

Gesture recognition, image processing, leap motion, human-computer interaction

M. Sathiyanarayanan, T. Mulling, B. Nazir , “Leap Motion Device for Gesture Controlling an Unmanned Ground Vehicle (Robot)”, International Journal of Engineering Development and Research , Vol.4, Issue.4, pp.178-187, 2016.
[2] B.L. Malleswari, I.Y. Sree, B.K. Madhavi, Swapna.M, “Bomb Defusing Robot Controlled by Gestures with Arduino and Leap Motion”, International Journal of Scientific Engineering and Technology Research, Vol.4, Issue.24, pp.4652-4658, 2015.
[3] S.Ameur, A.B. Khalifa, M.S. Bouhlel, “A Comprehensive Leap Motion Database For Hand Gesture Recognition”, In the Proceedings of the 2016 7th International Conference on Sciences of Electronics, Technologies of Information and Telecommunications, Tunisia, pp.514-519, 2016.
[4] J. Fu, B. Jiang, X. Yang, “Intelligent Hardware Multi-Model Interaction Design”, In the Proceedings of the 2016 7th IEEE International Conference on Software Engineering and Service Science, China, pp.718-721, 2016.
[5] I. Staretu, C. Moldovan, “Leap Motion Device Used to Control a Real Anthropomorphic Gripper”, International Journal of Advanced Robotic Systems, Vol.13, Issue.3, pp.1-12, 2016.
[6] L. Shao, “Hand movement and gesture recognition using Leap Motion Controller”, 2016 Dissertation, Stanford University, USA, 2016.
[7] G. Krastev, M. Andreeva, “A Software Tool for Experimental Study Leap Motion”, International Journal of Computer Science & Information Technology, Vol.7, Issue.6, pp.145-153, 2015.
[8] V. Neelapala, S. Malarvizhi, “Environment Monitoring System Based On Wireless Sensor Networks Using Open Source Hardware”, International Journal of Engineering Research and Sports Science, Vol.2, Issue.4, pp.1-4, 2015.

K. A. Jain, P. Mishra, L. Arora, M.S. Kotian, "Hardware Interaction using Hand Gestures," International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.965-969, 2018.

: Let G=(V,E) be a graph and let ψ be a graphoidal cover of G. Define f^* in ψ with f *(P) = f(v1)+ f(vn)+∑_(i=1)^(n-1)▒〖f(v_i v_(i+1) )=〗 k is a constant, where f^* is the induced labeling on . Then, we say that G admits  - magic graphoidal total labeling of G. In this paper we formulated a reverse process of magic graphoidal called reverse-magic graphoidal labeling and proved C_n, Parachute W_(n,2), Armed Crown C_n Ѳ P_n , K_(1,n)×K_2 are reverse magic graphoidal.

Graphoidal Constant, Graphoidal Cover, Magic Graphoidal, reverse magic graphoidal

[1] B.D.Acharya and E.Sampathkumar, Graphoidal covers and Graphoidal covering number of a graph, Indian J. pure appl.Math.,18(10):882-890,October 1987.
[2]. Frank Harary, Graph Theory, Narosa Publishing House, New Delhi, 2001
[3]. J.A . Gallian, A dynamic survey of graph labeling, The Electronic journal of Combinatrorics,16(2013),# D Jonathan L Gross, Jay Yellen, Hand book of Graph Theory CRC Press,Washington(2003).
[4] Ismail Sahul Hamid and Maya Joseph, Induced label graphoidals graphs, ACTA UNIV. SAPIENTIAE, INFORMATICA, 6 , 2,178-189(2014).
[5] S.Subhashini, K. Nagarajan, Cycle related Magic graphoidal graphs, International Journal of Mathematical Archive(IJMA), Volume 7, Issue 4, May (2016)
[6] K. Nagarajan, A. Najarajan, S. Somasundran, m- graphoidal Path Covers of a graph, Proceedings of the Fifth International Conference on Number Theory and Samarandache Notations, 58-67,(2009).
[7] Purnima Guptha, Rajesh Singh and S . Arumugam, Graphoidal Lenghth and Graphoidal Covering Number of a Graph, In ICTCSDM 2016, S. Arumugam, Jay Bagga, L. W. Beineke and B. S. Panda(Eds). Lecture Notes in Compt. Sci,. 10398, 305-311(2017).
[8] S. Arumugam, Purnima Guptha AND Rajesh Singh, Bounds on Graphoidal Length of a graph, Electronic Notes in Discrete Mathematics, 53,113-122,(2016).
[9] S. Sharief Basha, Reverse Super Edge- Magic Labeling on W-trees. International Journal of Computer Engineering In Research Trends, Vol 2, Issue 11, November 2015.
[10] I. Sahul Hamid and A. Anitha, On Label Graphoidal Covering Number-1, Transactions on Combinatorics, Vol.1, No.4, , 25-33,(2012) .
[11] S. Sharief Basha and K. Madhusudhan Reddy, Reverse magic strength of Festoon Trees, Italian Journal of Pure and Applied Mathematics-N 33-,191-200, 2014 .
[13] Md. Shakeel, Shaik Sharief Basha, K.J.Sarmasmieee, Reverse vertex magic labeling of Complete graphs.Research Journal of Pharmacy and Technology, Volume 9, Issue No.10,(2016).
[12] Basha, S.Sharief, Reddy, K.Madhusudhan, Shakeel M.D, Reverse Super Edge- Magic Labeling in Extended Duplicate Graph of Path, Global Journal of Pure and Applied Mathematics, Vol.9, Issue 6, p 585, November 2013.

Mini.S.Thomas, Mathew Varkey T.K, "Reverse -Magic Graphoidal on Circle Related Graphs," International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.970-976, 2018.

Cloud computing is a potential and assuring IT technique which helps the users to provide shared computing resources on demand. In recent days the companies are depending up on cloud resources for storage and processing of data. As the control of company’s data is handed to the third party the primary factors under utmost concern at the time of information retrieval are security and authentication. Authentication is essential in integration flows between applications for a suite of cloud services enabling users to deploy integrations with security. In my research paper we have used token based OAuth mechanism to provide authentication and query based framework for information retrieval. OAuth is a very secured authentication mechanism that is used to access the data from the source system. Secure retrieval mechanism is used for pulling the data from the cloud. The authentication technique used in our research paper is enhanced by using handshaking process with the source system and token generation in encrypted format. Analysis and implementation of this mechanism in the demo system illustrates its level of security.

Cloud Integrations, OAuth Mechanism, OData Framework

Johannes K. Chiang, Eric H.W. Yen, Yen-Hua Chun, Authentication, Authorization and File Synchronization on Hybrid Cloud on Case of Google Docs, Hadoop, And Linux Local Hosts, IEEE DOI 10.1109/ISBAST,2013
[2]. Ja-Hwa Liu, Shi-Kai Huang: “A Research into Protection Mechanism for Cloud Information Security”, Proc. of the 2010 Conference on Computer Vision, Image Processing and Information, Zhongli Taiwan, Jun. 9, 2010
[3]. Liang-Jie Zhang, Quan Zhou, “CCOA: Cloud Computing Open Architecture,” IEEE DOI 10.1109/ICWS, 2009.
[4]. Harry Katzian Jr, “On the Privacy of Cloud Computing”, International Journal of Management and Information Systems. Littleton: Second Quarter 2010. Vol. 14, Iss. 2; p. 1
[5]. Bhaskar Prasad Rimal, Eunmi Choi, Ian Lumb, "A Taxonomy and Survey of Cloud Computing Systems”, ncm, pp.44-51, 2009 Fifth International Joint Conference on INC, IMS and IDC, 2009
[6]. W Michael Ryan, Christopher M Loeffler, “Insights into Cloud Computing” Intellectual Property & Technology Law Journal. Clifton: Nov 2010. Vol. 22, Iss. 11; p. 22
[7]. Qingqing Xie, Liangmin Wang and Hong Zhong “Non-Repudiable Query Answer Authentication Scheme over Anonymous Cloud Data”, 2016 International Conference on Advanced Cloud and Big Data, IEEE DOI 10.1109

G. Neelima, I. Ramesh Babu, "A Novel information retrieval mechanism with secure authentication for third party applications in cloud based integration," International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.977-985, 2018.

Blackhole attack revealing, PCBHA (Prevention of a Co-operative Black Hole Attack) is a reviewed AODV routing protocol that is proposed in order to avert cooperative black holes. First, it runs each authorized user with a default fidelity level and after spreading a RREQ, a source node waits to accept resumed RREPs from the adjoining nodes and then chooses a near node of a greater fidelity level, which exceeds the threshold value, for passing the information packs. The target node will yield an ACK note after getting information packets, and the source node may add 1 to the fidelity level of the adjacent node, upon receiving of an ACK answer. If no ACK reaction is established, 1 is deducted from the fidelity level, which shows a potential black hole node on this route and information packets are released before reaching the end point node.

Biometrics, Attacks, Secrecy, MANET

[1] Ashish Mishra., [2010], “Multimodal Biometrics it is: Need for Future Systems”, International Journal of Computer Applications, Vol. 3, No.4, pp. 28 – 33.
[2] Aureli Soria-Frisch, Alejandro Riera and Stephen Dunne., [2010], “Fusion Operators for Multi-modal BiometricAuthentication Based On Physiological Signals”, 978-1-4244-8126-2/10/$26.00 ©2010 IEEE.
[3] Bahgat S F, Ghoniemy S, and Alotabi M., [2013], “Proposed Multimodal palm-veins- face Biometric Authentication”, International journal of advanced computer science and applications, Vol.4, No. 6.
[4] Besbes F, Trichili H and Solaiman B., [2008], “Multimodal Biometric System Based on Fingerprint Identification and Iris Recognition”, in the Proceedings of 3rd Int. IEEE Conf. Inf. Commun. Technol.: From Theory to Applications (ICTTA 2008), DOI: 10.1109/ICTTA.2008.4530129, pp. 1 – 5.
[5] Biometric Data Interchange Formats—Part 6: Iris Image Data, ISO/IEC, 19794-6, Mar. 2004, draft Version, [Online].
[6] Ramalingam M and Thiagarasu V., [2014], “Cluster Based Stretch and Shrink Method for Manet Using Load Balancing, Nearest Neighbor and Rule Mining”, International Journal of Engineering Sciences & Research Technology.
[7] Bo Yang, Ryo Yamamoto and Yoshiaki Tanaka., [2013], “Dempster-Shafer Evidence Theory Based Trust Management Strategy against Cooperative Black Hole Attacks and Gray Hole Attacks in MANETs”, ICACT Transactions on Advanced Communications Technology(TACT), Vol. 2(3), pp. 223 – 232, May, 2013.
[8] Ramalingam M., Prabhusundhar P, Thiagarasu V, “Biometric Based Intrusion Detection System using Dempster-Shafer Theory for Mobile Ad hoc Network Security”, International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169 Volume: 5 Issue: 7, pp. 384 – 391, June-2017.
[9] Ramalingam M and Thiagarasu V., [2014], “Cluster Based Stretch and Shrink Method for Manet Using Load Balancing, Nearest Neighbor and Rule Mining”, International Journal of Engineering Sciences & Research Technology, 3(10.): October, 2014, ISSN: 2277-9655.
[10] Bolle. R., [1999], “System and Methods for Determining the Quality of Fingerprint Images”, United States patent number US596356.
[11] Lim. E, Jiang. X and Yau. W., [2002], “Fingerprint Quality and Validity Analysis”, in the proceedings of IEEE International Conference on Image Processing (ICIP ’02), pp. 469 –472.
[12] M. Ramalingam, V Thiagarasu, “Routing and Broadcasting in MANET: A comprehensive Analysis based on, Routing technique, Clustering and Architectural Model”, International Journal of Engineering Sciences & Research Technology, ISSN: 2277-9655, IJESRT 3 (11), November 2014.
[13] Lingxuan Hu D. E, [2005], “Using Directional Antennas to Prevent Wormhole Attack”, 2005.

P. Prabhusundhar, B. Srinivasan, M. Ramalingam, "Detection Mechanism against the Attacks in MANET and Biometric Classification," International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.986-990, 2018.

Email is considered to be one of the most effective ways of communication source. It has gained attention because of the fastest and cost-effective means of source of communication. But with the enormous increase in its usage leads to its exploitation as it has become fascinated approach for the today’s businesses. Email spam is the sending of unsolicited email in bulk to the randomly selected recipients for the purpose of advertising has become a serious concern. These unwanted emails not only occupy network bandwidth and memory space for communicating but can be used by the attackers in order to steal the user’s identity. By looking at the prevailing scenarios there is a need for a solution that can manage the spam issue quite efficiently. The goal of this paper is to provide insight into an issue of spam email, and the highlight of this paper is the key findings of filtering techniques used for spam detection based on analysis of the content and non-content part of email.

Spamming, Whitelist, Blacklist, Greylist , ham, CR systems, Heuristics, Signatures

[1] Rekha, S. Negi, “ A Review on Different Spam Detection Approaches”, International Journal of Emerging Trends and Technology , Vol. 11, No.6, pp. 315-318, 2014.
[2] G. V. Cormack, T. R. Lynam, “On-line Supervised Spam Filter Evaluation” , ACM Transactions on Information Systems (TOIS), Vol.25, No.3, 2007.
[3] P. Sharma, U. Bhardwaj, “ Machine Learning Based Spam E-Mail Detection” , International Journal of Intelligent Engineering & Systems , Vol.11, No.3, pp. 1-10, 2018.
[4] R. Bansod, R. S. Mangrulkar, V.G.Bhujade, “Text and Image based Spam Email Classification using an ANN Model- an Approach”, International Journal on Recent and Innovation Trends in Computing and Communication , Vol. 3, No. 5, pp.115-118, 2015.
[5] O. Saad, A. Darwish, R. Faraj, “A Survey of machine learning techniques for Spam Filtering” , International Journal of Computer Science and Network Security, Vol.12, No.2, pp.66-73, 2012.
[6] H. Kaur, P. Verma, “SURVEY OF E-MAIL SPAM DETECTION USING SUPERVISED APPROACH WITH FEATURE SELECTION”, INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY (IJESRT) , Vol.6, No. 4, pp. 1-10, 2017.
[7] G. Fumera, I. Pillai, F. Roli, “ Spam Filtering Based On The Analysis Of Text Information Embedded Into Images” , Journal of Machine Learning Research, Vol.7, pp.2699-2720, 2006.
[8] A. Bhowmick, S. M. Hazarika, “ Advances in Electronics,Communication and Computing”, Springer Publication, Singapore, pp. 573-582, 2016
[9] C.C. Wang, S.Y. Chen, ‘Using Header Session Messages to Anti-Spamming’, Computers & Security, Vol.26, No.5, pp. 381-390, 2007.
[10] M. Z. Hayat, J. Basiri, L. Seyedhossein, A. Shakery, “Content-Based Concept Drift Detection for Email Spam Filtering”, In the Proceedings of 2010 5th International Symposium on TeleCommunications (IST’2010), pp. 531-536, 2010.
[11] O. Al-jarrah, I. Khater, B. Al-duwairi, “Identifying Potentially Useful Email Header Features for Email Spam Filtering”, In the Proceedings of The Sixth International Conference on Digital Society, pp. 140-145, 2012.
[12] E. P. Sanz, “E-mail Spam Filtering”, Advances in Computers, Vol. 74, pp. 45-114, 2008.
[13] M. Andreolini, A. Bulgarelli, M. Colajanni, F. Mazzoni, “Honeyspam : Honeypots Fighting Spam at the Source”, In the Proceedings of 2005 the Steps to Reducing Unwanted Traffic on the internet Workshop, Cambridge, MA, pp. 77-83, 2005.
[14] M. Dagar, R. Popli, “Honeypots: Virtual Network Intrusion Monitoring System”, International Journal of Scientific Research in Network Security and Communication, Vol. 6, No. 2, pp.45-49, 2018.
[15] D. Mallampati, “An Efficient Spam Filtering using Supervised Machine Learning Techniques”, International Journal of Scientific Research in Computer Sciences and Engineering”, Vol. 6, No. 2, pp.33-37, 2018.

A. Ahuja, "Analysis of Filtering Techniques for Spam Email Detection," International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.991-997, 2018.

online customer reviews is a great platform for collecting large volume of information for sentiment analysis. Users of the online shopping site Amazon are confident to post reviews of the item that they purchase. A Little attempt is made by Amazon to restrict or limit the content of these reviews. We utilize product clients review comments about product and review around retailers from Amazon as data set and classify review content by subjectivity/objectivity and negative/positive state of mind of buyer. Such reviews are helpful to some extent, promising both the shoppers and products makers. This paper presents an experimental study of efficacy of classifying item review by posting the keyword. The Classification algorithm uses only the overall review scores to understand sentiment behind each review and extract the important aspects about the product. We developed an efficient classifier form to categorize the provided review is either a positive review or negative review by analyzing the presentation of different classification algorithm on the review data corpus. Clustering techniques are used to identify key sentiment characteristics to provide them to the users, which helps the user to understand the aspects of the products/service they wish to buy or experience.

opining mining or sentiment analysis, natural language processing, Amazon reviews, learning automata, machine learning

[1] C. D. Manning and H. Sch ¨ utze, Foundations of statistical natural language processing. MIT press, 1999.
[2] D. Jurafsky and H. James, “Speech and language processing an introduction to natural language processing, computational linguistics, and speech,” 2000.
[3] OnePlus One (Sandstone Black, 64GB) http://www.amazon.in/OnePlus-One-SandstoneBlack- 64GB/dp/B00OK2ZW5W. Accessed November 11, 2015.
[4] T. Mikolov, I. Sutskever, K. Chen, G. Corrado, and J. Dean, “Distributedrepresentations of words and phrases and their compositionality,”The Conference on Neural Information Processing Systems,2013.
[5] T. Mikolov, K. Chen, G. Corrado, and J. Dean, “Efficient estimationof word representations in vector space,” International Conferenceon Learning Representations, 2013.
[6] Carenini, G., Ng, R. and Zwart, E. Extracting Knowledge from Evaluative Text. Proceedings of the Third International Conference on Knowledge Capture (K-CAP’05), 2005.
[7] Dave, D., Lawrence, A., and Pennock, D. Mining the Peanut Gallery: Opinion Extraction and Semantic Classification of Product Reviews. Proceedings of International World Wide Web Conference (WWW’03), 2003.
[8] S. ChandraKala1 and C. Sindhu2, “OPINION MINING AND SENTIMENT CLASSIFICATION: A SURVEY,”.Vol .3(1),Oct2012,420-427.
[9] Subhabrata Mukherjee,Pushpak Bhattacharyya,"Feature Specific Sentiment Analysis for product Reviews",IET,2015,IIT Bombay.
[10] Himabindu Lakkaraju, Chiranjib Bhattacharyya,Indrajit Bhattacharyya and Srujana Merugu,"Exploiting Coherence for the simultaneous discovery of latent facts and associated sentiments",SIAM International Conference on Data Mining (SDM),April2011.
[11] Minqing Hu and Bing Liu,"Miming and Summarizing customer reviews", KDD 04: proceedings of the tenth ACM SIGKDD international Conference on knowledge discovery and data mining.
[12] Jian Jin and Ping Ji,"Mining online productreviews to identify consumers FineGrinedConcerns",IET,2015,Hong Kong SAR,Chaina.
[13] Liu B (2014) The science of detecting fake reviews. http://content26.com/blog/bing-liu-the-science-of-detecting-fake-reviews/.
[14] Jindal N, Liu B (2008) Opinion spam and analysis In: Proceedings of the 2008 International Conference on, Web Search and Data Mining, WSDM ’08, 219–230.. ACM, New York, NY, USA.Google Scholar
[15] Mukherjee A, Liu B, Glance N (2012) Spotting fake reviewer groups in consumer reviews In: Proceedings of the 21st, International Conference on World Wide Web, WWW ’12, 191–200.. ACM, New York, NY, USA.

T. Gowri, "Sentiment analysis on Amazon Reviews Data," International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.998-1003, 2018.

Combinatorial Algorithm frequently called Combinatorial Computing, deals with problem on how to carry out computations on discrete mathematical structures. It is all about finding patterns or arrangements that are best possible ways to satisfy certain constraints. Popularity of Combinatorial Algorithm is increasing day by day because outside the traditional areas of applications of mathematics to the physical sciences, discrete mathematical structures (e.g. permutation, graph etc.) occur more frequently than continuous ones, and the fraction of all computing time spent on problem that arise in the physical science is decreasing. Starting about 1970s, computer scientists experienced a phenomena called “Floyd’s Lemma”: problems that seemed to required n3 operations could actually be solve in O(n2); problem that seemed to require n2 time could be handled in O(nlogn) and also nlogn was often reducible to O(n). Besides this, running time of O(2n) can be reducible to O(1.5n) to O(1.3n) etc. Thus, though unlike other fields Combinatorial Algorithm does not have a few “fundamental theorem” that form the core of the subject matter and from which most of the result can be derived, the art of writing such algorithm in a tricky way or improvement of existing algorithms rather improvement in processor speeds, can save years or even centuries of computer time. Having back and forth over the territory of the Combinatorial Algorithm so often, the author is now charged to prepare the paper for looking the field from our view point in a nutshell with a special emphasize on Graph and real life applications of graph algorithms in the areas like network routing, information security, vulnerability analysis, storage of data and Coding and Information Theory.

Graph, Combinatorial Algorithms, Security, Integity, Storage Space

[1]. Reingold, E. M., Nievergelt, J., & Deo, N. (1977). Combinatorial algorithms: theory and practice. Prentice Hall College Div.
[2]. Knuth, D. E. (2005). The Art of Computer Programming. Fascicle 4A-Generating All Trees, vol. 4.
[3]. Chekuri, C., & Pal, M. (2005, October). A recursive greedy algorithm for walks in directed graphs. In Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on (pp. 245-253). IEEE.
[4]. Even, S. (2011). Graph algorithms. Cambridge University Press.
[5]. Reif, John H. (1985). Depth-first search is inherently sequential. Information Processing Letters. 20 (5). doi:10.1016/0020-0190(85)90024-9.
[6]. Quinn, M. J., & Deo, N. (1984). Parallel graph algorithms. ACM Computing Surveys (CSUR), 16(3), 319-348.
[7]. Erciyes, K. (2018). Distributed Graph Algorithms. In Guide to Graph Algorithms (pp. 117-136). Springer, Cham.
[8]. Graham, R. L., & Hell, P. (1985). On the history of the minimum spanning tree problem. Annals of the History of Computing, 7(1), 43-57.
[9]. Hoffman, K. L., Padberg, M., & Rinaldi, G. (2013). Traveling salesman problem. In Encyclopedia of operations research and management science (pp. 1573-1578). Springer US.
[10]. Sewell, E. C. (1996). An improved algorithm for exact graph coloring. Cliques, coloring, and satisfiability: second DIMACS implementation challenge, 26, 359-372.
[11]. Even, G., Naor, J., Rao, S., & Schieber, B. (1999). Fast approximate graph partitioning algorithms. SIAM Journal on Computing, 28(6), 2187-2214.
[12]. Golomb, S. W., & Baumert, L. D. (1965). Backtrack programming. Journal of the ACM (JACM), 12(4), 516-524.
[13]. Wang, X., Wang, X., & Wilkes, D. M. (2009). A divide-and-conquer approach for minimum spanning tree-based clustering. IEEE Transactions on Knowledge and Data Engineering, 21(7), 945-958.
[14]. Bellman, R. (1962). Dynamic programming treatment of the travelling salesman problem. Journal of the ACM (JACM), 9(1), 61-63.
[15]. Levitin, A., & Papalaskari, M. A. (2002, February). Using puzzles in teaching algorithms. In ACM SIGCSE Bulletin (Vol. 34, No. 1, pp. 292-296). ACM.
[16]. Garey, M. R., Johnson, D. S., & Tarjan, R. E. (1976). The planar Hamiltonian circuit problem is NP-complete. SIAM Journal on Computing, 5(4), 704-714.
[17]. Gazit, H. (1986, October). An optimal randomized parallel algorithm for finding connected components in a graph. In Foundations of Computer Science, 1986., 27th Annual Symposium on (pp. 492-501). IEEE.
[18]. Greenberg, H. J. (1998). Greedy algorithms for minimum spanning tree. University of Colorado at Denver.
[19]. Kernighan, B. W., & Lin, S. (1970). An efficient heuristic procedure for partitioning graphs. The Bell system technical journal, 49(2), 291-307.
[20]. Amestoy, P. R., Davis, T. A., & Duff, I. S. (1996). An approximate minimum degree ordering algorithm. SIAM Journal on Matrix Analysis and Applications, 17(4), 886-905.
[21]. Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999). An improved ant System algorithm for thevehicle Routing Problem. Annals of operations research, 89, 319-328.
[22]. Henzinger, M. R., Henzinger, T. A., & Kopke, P. W. (1995, October). Computing simulations on finite and infinite graphs. In Foundations of Computer Science, 1995. Proceedings., 36th Annual Symposium on (pp. 453-462). IEEE.
[23]. Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976). Some simplified NP-complete graph problems. Theoretical computer science, 1(3), 237-267.
[24]. Alekseev, V. E., Boliac, R., Korobitsyn, D. V., & Lozin, V. V. (2007). NP-hard graph problems and boundary classes of graphs. Theoretical Computer Science, 389(1-2), 219-236.
[25]. Mathon, R. (1979). A note on the graph isomorphism counting problem. Information Processing Letters, 8(3), 131-136.
[26]. Yuan, S. Y., & Kuo, S. Y. (1998). A new technique for optimization problems in graph theory. IEEE Transactions on Computers, 47(2), 190-196.
[27]. LEWIN, K (1936). Principles of Topological Psycology. Mc-Graw-Hill, New York.
[28]. Deo, N. (2004). “Graph theory with applications to engineering and computer science.” PHI.
[29]. Rosen, K. H. (2007). Discrete mathematics and its applications. Amc, 10(12), 824.
[30]. Madkour, A., Aref, W. G., Rehman, F. U., Rahman, M. A., & Basalamah, S. (2017). A survey of shortest-path algorithms. arXiv preprint arXiv:1705.02044.
[31]. Radhakrishnan, S., Racherla, G., Sekharan, C. N., Rao, N. S., & Batsell, S. G. (1999). DST-a routing protocol for ad hoc networks using distributed spanning trees. In Wireless Communications and Networking Conference, 1999. WCNC. 1999 IEEE (Vol. 3, pp. 1543-1547). IEEE.
[32]. Sensarma, D., &Majumder, K. “A Comparative Analysis of the Ant Based Systems for QoS Routing in MANET.” In Recent Trends in Computer Networks and Distributed Systems Security (pp. 485-496). Springer Berlin Heidelberg, 2012.
[33]. Sensarma, D., andMajumder, K.“AMTR: The ANT Based QOS Aware Multipath Temporally Ordered Routing Algorithm for MANETs”, AISC- 2013, CS & IT-CSCP 2013, pp. 389–396, 2014.
[34]. Sensarma, D., andMajumder, K. “An efficient ant based qos aware intelligent temporally ordered routing algorithm for manets.” International Journal of Computer Networks & Communications (IJCNC), Vol. 5, No. 4, PP.189-203, Jul. 2013.
[35]. Sensarma, D., and Majumder, K. “HAQR: TheHierarchical ANT based QOS aware On-demandRoutingfor MANETS.”WimoA- 2013,CS & IT-CSCP 2013, pp.193-202, 2013.
[36]. Sensarma, D., andMajumder, K. “A Novel Hierarchical Ant Based QoS aware Intelligent Routing Scheme for MANETs.” International Journal of Computer Networks & Communications (IJCNC), Vol. 5, No. 6, PP.215-229, Nov. 2013.
[37]. Sensarma, D., andMajumder, K.“IWDRA: An Intelligent Water Drop Based QoS-Aware Routing Algorithm for MANETs.” Proceedings of the International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA) 2013. Springer International Publishing, 2014.
[38]. Rajaram, V., Kumatharan, N., & Srividhya, S. Study on Applications of Graph Theory in Wireless Sensor Networks.
[39]. Mears, C., De La Banda, M. G., & Wallace, M.,“On implementing symmetry detection.” Constraints, 14(4), 2009, 443-477.
[40]. Albertson, Michael O., and Karen L. Collins. “Symmetry breaking in graphs.” Electron. J. Combin 3, no. 1 (1996): R18.
[41]. Harary, F. R. A. N. K. “Methods of destroying the symmetries of a graph.” Bull. Malasyan Math. Sc. Soc 24, no. 2 (2001): 183-191.
[42]. Sensarma, D., and Sarma, S. S. A Unified Framework for Security and Storage of Information. International Journal of Advance Engineering and Research Development, Vol. 2, Issue 1, PP.197-203, 2015.
[43]. Kahate, A. Cryptography and network security. Tata McGraw-Hill Education, 2013.
[44]. Ustimenko, V. (2001). CRYPTIM: Graphs as tools for symmetric encryption. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, PP. 278-286, 2001.
[45]. Ustimenko, V. “On Graph-Based Cryptography and Symbolic Computations.”Serdica Journal of Computing 1, no. 2 (2007): 131-156.
[46]. Sensarma, D., Banerjee, S., and Basuli, K. A New Scheme for Key Exchange. International Journal of Modern Engineering Research (IJMER), ISSN (Online): 2249-6645, 2(3), 2012.
[47]. Sensarma, D., and Sarma, S. S. GMDES: A GRAPH BASED MODIFIED DATA ENCRYPTION STANDARD ALGORITHM WITH ENHANCED SECURITY. International Journal of Research in Engineering and Technology, eISSN: 2319-1163, Vol. 3, Issue. 3, PP. 653-660, Mar-2014.
[48]. Shih, F. Y. Digital watermarking and steganography: fundamentals and techniques. CRC Press, 2007.
[49]. Hetzl, S., and Petra, M. “A graph–theoretic approach to steganography.” In Communications and Multimedia Security, pp. 119-128. Springer Berlin Heidelberg, 2005.
[50]. Wu, H., Wang, H., Zhao, H., & Yu, X. (2015). Multi-layer assignment steganography using graph-theoretic approach. Multimedia Tools and Applications, 74(18), 8171-8196.
[51]. Venkatesan, R., Vazirani, V., and Sinha, S. “A graph theoretic approach to software watermarking.” In Information Hiding, pp. 157-168. Springer Berlin Heidelberg, 2001.
[52]. Halder, R., Dasgupta,P.,Naskar,S., and Sarma., S. S. “An Internet-based IP Protection Scheme for Circuit Designs using Linear Feedback Shift Register-based Locking.”Engineering Letters 19, no. 2 (2011): 84.
[53]. Qu, G., &Potkonjak, M.,“Hiding signatures in graph coloring solutions.” In Information Hiding (pp. 348-367). Springer Berlin Heidelberg, (2000, January).
[54]. Kahng, A. B., Lach, J., Mangione-Smith, W. H., Mantik, S., Markov, I. L., Potkonjak, M., & Wolfe, G., “Constraint-based watermarking techniques for design IP protection.”Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, 20(10), 1236-1252, 2001.
[55]. Sensarma, D., & Sarma, S. S. (2015). Data Hiding using Graphical Code based Steganography Technique. arXiv preprint arXiv:1509.08743.
[56]. Collberg, Christian S., Thomborson, C. and Gregg M. Townsend. “Dynamic graph-based software fingerprinting.” ACM Transactions on Programming Languages and Systems (TOPLAS) 29, no. 6 (2007): 35.
[57]. G. Brassard, C. Crepeau. “Non-Transitive Transfer of Confidence: A PerfectZeroKnowledge Interactive Protocol for SAT and Beyond.” Proc. of the 27th Annual Symp. on Foundations of Computer Science: 188-195, 1986.
[58]. M. Blum. “How to Prove a Theorem So No One Else Can Claim It.” Proceedings of the International Congress of Mathematicians: 1444-1451, 1986.
[59]. D. Lapidot, A. Shamir. “A one-round, two-prover, zero-knowledge protocol for NP.” Combinatorica, 15(2): 203-214, June, 1995.
[60]. Horan, V., & Gudaitis, M. (2011). Investigation of Zero Knowledge Proof Approaches Based on Graph Theory. AIR FORCE RESEARCH LAB ROME NY INFORMATION DIRECTORATE.
[61]. Sensarma, D., & Sarma, S. S. (2015). A survey on different graph based anomaly detection techniques. Indian Journal of Science and Technology, 8(31).
[62]. Liu, K., and Terzi, E. “Towards identity anonymization on graphs.” InProceedings of the 2008 ACM SIGMOD international conference on Management of data, pp. 93-106. ACM, 2008.
[63]. Zou, L., Chen, L., &Özsu, M. T. “K-automorphism: A general framework for privacy preserving network publication.” Proceedings of the VLDB Endowment, 2(1), 946-957, (2009).
[64]. Moazzami, D. (2016). Towards a measure of vulnerability, tenacity of a Graph. Journal of Algorithms and Computation, 48(1), 149-154.
[65]. Li, F., & Li, X. (2004). On the integrity of graphs. In Parallel and Distributed Computing and Systems (Vol. 16, pp. 577-582).
[66]. Le-Phuoc, D., Quoc, H. N. M., Quoc, H. N., Nhat, T. T., & Hauswirth, M. (2016). The Graph of Things: A step towards the Live Knowledge Graph of connected things. Web Semantics: Science, Services and Agents on the World Wide Web, 37, 25-35.
[67]. Angles, R., & Gutierrez, C. (2008). Survey of graph database models. ACM Computing Surveys (CSUR), 40(1), 1.
[68]. Meyerhenke, H., & Gehweiler, J. (2010). On dynamic graph partitioning and graph clustering using diffusion. In Dagstuhl Seminar Proceedings. Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
[69]. Zhou, F. (2015). Graph compression. Department of Computer Science and Helsinki Institute for Information Technology HIIT, 1-12.
[70]. Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., & Raghavan, P. (2009, June). On compressing social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 219-228). ACM.
[71]. Sensarma, D., & Sarma, S. S. (2017). A Graph Theoretic Approach for Minimizing Storage Space using Bin Packing Heuristics. INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 8(2), 29-39.
[72]. Sensarma, D., Banerjee, S., Basuli, K., Naskar, S., & Sarma, S. S. (2012). On an optimization technique using Binary Decision Diagram. arXiv preprint arXiv:1203.2505.
[73]. Hamming, R. W. Coding and information theory. Prentice-Hall, Inc., 1986.
[74]. Jungnickel, D., & Vanstone, S. A. (1997). Graphical codes revisited. IEEE Transactions on Information Theory, 43(1), 136-146.
[75]. Tanner, R. M., Sridhara, D., Sridharan, A., Fuja, T. E., & Costello, D. J. (2004). LDPC block and convolutional codes based on circulant matrices. IEEE Transactions on Information Theory, 50(12), 2966-2984.
[76]. Luby, M. G., Mitzenmacher, M., Shokrollahi, M. A., & Spielman, D. A. (2001). Improved low-density parity-check codes using irregular graphs. IEEE Transactions on Information Theory, 47(2), 585-598.
[77]. Gadouleau, M., & Riis, S. (2011). Graph-theoretical constructions for graph entropy and network coding based communications. IEEE Transactions on Information Theory, 57(10), 6703-6717.

Debajit Sensarma, "On Combinatorial Algorithms with Special Emphasize on Graph and Graph Algorithms," International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.1004-1013, 2018.

The Internet of Things characterized as interconnection of exceptionally identifiable inserted processing gadgets inside the current framework. Sooner rather than later the world will be overlaid with correspondence of installed gadgets making a "Savvy World". The world is splashed in the web and now the Internet of Things is additionally picking up a considerable measure of consideration. However, the utilization of the web innovation in library administration is at its earliest stages. In spite of the fact that standardized tag or BLE-BEACONS based library administration framework has raised effectively in the current past, it has its own constraints. The proposed framework depends on the BLE-BEACONS innovation where BLE-BEACONS are inserted on the books shelf and the client advanced mobile phone can connect to it through its Bluetooth device for simple, productive and efficient physical browsing in library. This framework utilizes client`s own advanced mobile phone to see the whole book data available on multiple BLE-BEACONS device in its range. One of the significant objectives of this IoT based "Brilliant Library System" is rearranging the client`s undertaking of hunting down the books and issuing books.

Internet of Things (IOT) BLE-BEACONS; Arduino-uno kit; BLE-HC05 module; Android Application

[1] John A. Stankovic, “Directions for the Internet of Things”, Internet of Things Journal, IEEE, Volume 1, Issue 1, pp. 3-9, 2014.
[2] A. Pravin Renold, Joshi Rani, “Internet Based RFID Library management system”.
[3] Faheem Zafari, Ioannis Papapanagiotou and Konstantinos Christidis, “location for Internet of Things equipped Smart Buildings”.
[4] Shayan Nalbandian “A survey on Internet of Things: Applications and challenges”.
[5] Haiming Cheng; Ling Huang; He Xu; Yifan Hu; Xu An Wang “Design and Implementation of Library Books Search and Management System Using RFID Technology”.
[6] A. Fennani, H. Hamam. “An Optimized RFID-Based Academic Library”.
[7] Ahmad Tarmizi Bin Abdullah; Ismarani Binti Ismail; Azlina Binti Ibrahim; Mohd Zikrul Hakim Bin Noor “Library shelf management system using RFID technology”.
[8] R. Faragher, R. Harle “An Analysis of the Accuracy of Bluetooth Low Energy for Indoor Positioning Applications”.
[9] Yuta Miyagawa; Norihisa Segawa “Construction of Indoor Location Search System Using Bluetooth Low Energy”.
[10] Ankush A.Kalbandhe; Shailaja. C. Patil “Indoor Positioning System using Bluetooth Low Energy”.

Aarti Supe, Yogesh K. Waghchaure, Raj R. Shede, Rohit R. Sutar, Parag B. Borse, "Transforming Physical Browsing in Library using IoT," International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.1014-1017, 2018.

Nowadays, energy usage is increasing due to higher demand than its supply. The electrical energy is mostly utilised in the form of lighting in commercial and residential buildings. The traditional illuminance system uses more electricity than light emitting diode (LED) used in the intelligent lighting system. As the dimming of LEDs can save the extra energy. Therefore, the energy efficient lighting provides better utilisation of the electrical energy. The prime objective of the work presented in this paper is to model intelligent LED lighting system prototype to generate light of the required illuminance level in a room considering energy efficiency and comfort with the integration of daylight. In this system the softwares viz. Proteus and Arduino IDE have been used to evaluate the functioning of the prototype. This lighting system can be monitored online through IoT Platform.

Intelligent Lighting System, Online Monitoring, Energy Efficiency, Visual and Thermal Comfort

References
[1] D. Kaur, A. Mukherjee, V. P. Upadhyay, G. Kumar, and S. Raja, "Simulation of Dimmer Circuit for Daylight Harvesting," Energy Procedia, vol. 14, pp. 1075-1081, 2012.
[2] M. A. Özçelik, "The design and implementation of PV-based intelligent distributed sensor LED lighting in daylight exposed room environment," Sustainable Computing: Informatics and Systems, vol. 13, pp. 61-69, 2017.
[3] L. Doulos, A. Tsangrassoulis, and F. Topalis, "Quantifying energy savings in daylight responsive systems: The role of dimming electronic ballasts," Energy and Buildings, vol. 40, no. 1, pp. 36-50, 2008.
[4] A. Pandharipande and D. Caicedo, "Smart indoor lighting systems with luminaire-based sensing: A review of lighting control approaches," Energy and Buildings, vol. 104, pp. 369-377, 2015.
[5] C. de Bakker, M. Aries, H. Kort, and A. Rosemann, "Occupancy-based lighting control in open-plan office spaces: A state-of-the-art review," Building and Environment, vol. 112, pp. 308-321, 2017.
[6] A. M. Aparna K, "Smart Lighting System using Raspberry PI," International Journal of Innovative Research in Science, Engineering and Technology, vol. 04, no. 07, pp. 5113-5121, 2015.
[7] A. P. A. Page, P. Ferrão, J. Fournier, B. Lacarrière, and O. Le Corre, "Thermal Assessment of Buildings on Occupants Behavior and the Adaptive Thermal Comfort Approach and the Adaptive Thermal Comfort Approach " Energy Procedia, vol. 115, pp. 265-271, 2017.
[8] S. C. Turner, ASHRAE STANDARD (Thermal Environmental Conditions for Human Occupancy). 2010.
[9] J. F. N. Iftikhar A. Raja, Kathryn J. McCartney, Michael A. Humphreys, "Thermal comfort: use of controls in naturally ventilated buildings," Energy and Buildings, vol. 33, no. 2001, pp. 235-244, 2001.
[10] Y. Zhang, L. Huang, and Y. Zhou, "Analysis of Indoor Thermal Comfort of Test Model Building Installing Double-Glazed Window with Curtains Based on CFD," Procedia Engineering, vol. 121, pp. 1990-1997, 2015.
[11] A.Pandey, A.Gautam, M.tiwari, "IOT Based Home Automation Using Arduino and ESP8266," International Journal of Computer Sciences and Engineering, vol. 6, no. 4, pp. 267-271, 2018.
[12] A. K. Kratika Gupta, Suraj Rasal, Varsha S. Rasal, "Importance of Sensor Readings and Its Secured Delivery in Internet of Things," International Journal of Computer Sciences and Engineering, vol. 6, no. 1, pp. 320-325, 2018.

Deepak Makkar, Poonam Syal, "Smart Lighting and Interior Blinds Control through IoT," International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.1018-1023, 2018.