Volume-6 , Issue-6 , Jun - 2018 Go Back

Recognizing offline handwritten characters is a challenging problem and is considered to be more significant than the recognition of on-line handwritten characters. This study is undertaken to resolve the issue of offline handwritten character recognition for Gurmukhi script, one of the prominent scripts in the northern part of India. The Gurmukhi character images are presented using a single layer as well as multi-layer histogram of gradient features. Once the character images are represented using these features, one-against-all classification strategy, implemented through Support Vector Machine and k-Nearest Neighbour classifiers, is employed to recognize these characters. A dataset of 3500 handwritten Gurmukhi characters written by different writers is created and the scope of the Histogram Oriented Gradient (HOG) and Pyramid Histogram Oriented Gradient (PHOG) features is explored for the recognition of offline handwritten Gurmukhi characters. The simulation study reveals character recognition accuracy of 99.1% with SVM classifier for PHOG feature. The technique is robust to inter-class and intra-class variations present in the Gurmukhi script and has significant scope of application to the recognition of other scripts too.

Offline Gurmukhi Handwritten Character Recognition, Optical Character Recognition, Histogram Oriented Gradient Feature, Pyramid Histogram Oriented Gradient Feature, Support Vector Machine Classifier, k-NN Classifier

[1] M. Kumar, M. K. Jindal, and R. K. Sharma, “Classification of characters and grading writers in offline handwritten Gurmukhi script,” Proc. Int. Conf. Image Inf. Process., ICIIP 2011.
[2] U. Pal, R. Jayadevan, and N. Sharma, “Handwriting Recognition in Indian Regional Scripts,” ACM Trans. Asian Lang. Inf. Process., 2012.
[3] E. Kavallieratou and S. Stamatatos, “Discrimination of machine-printed from handwritten text using simple structural characteristics,” Proc. 17th Int. Conf. Pattern Recognition, Vol.1, p. 437–440, ICPR 2004.
[4] A. K. Jain, “Data clustering: 50 years beyond K-means,” Pattern Recognit. Lett., vol. 31, no. 8, pp. 651–666, 2010.
[5] M. Kumar, M. K. Jindal, and R. K. Sharma, “Review on OCR for handwritten indian scripts character recognition,” Commun. Comput. Inf. Sci., vol. 205 CCIS, pp. 268–276, 2011.
[6] K. Singh Siddharth, M. Jangid, R. Dhir, and R. Rani, “Handwritten Gurmukhi Character Recognition Using Statistical and Background Directional Distribution Features.” International Journal on Computer Science and Engineering (IJCSE) 3, no. 06, 2011.
[7] D. Sharma and P. Jhajj, “Recognition of Isolated Handwritten Characters of Gurumukhi Script using Neocognitron,” Int. J. Comput. Appl., vol. 4, no. 8, pp. 9–17, 2010.
[8] Due Trier, A. K. Jain, and T. Taxt, “Feature extraction methods for character recognition-A survey,” Pattern Recognit., vol. 29, no. 4, pp. 641–662, 1996.
[9] M. K. Mahto, K. Bhatia, and R. K. Sharma, “Combined Horizontal and Vertical Projection Feature Extraction Technique for Gurmukhi Handwritten Character Recognition,” In International Conference on Advances in Computer Engineering and Applications (ICACEA), pp. 59–65, 2015.
[10] C. L. Liu and C. Y. Suen, “A new benchmark on the recognition of handwritten Bangla and Farsi numeral characters,” Pattern Recognit., vol. 42, no. 12, pp. 3287–3295, 2009.
[11] H. Ma and D. Doermann, “Word Level Script Identification for Scanned Document Images,” SPIE Conf. Doc. Recognit. Retr., pp. 124–135, 2004.
[12] Zheng, Y., Liu, C. and Ding, X., "Single-character type identification." In Document Recognition and Retrieval IX, Vol. 4670, pp. 49-57, December 2001.
[13] Zhou, L., Lu, Y., & Tan, C. L. "Bangla/English script identification based on analysis of connected component profiles." In International Workshop on Document Analysis Systems, pp. 243-254, 2006.
[14] S. Haboubi, S. Maddouri, N. Ellouze, “Diff´ erenciation de documents textes Arabe et Latin par filtre de Gabor”, 2007.
[15] S. Mozaffari and P. Bahar, “Farsi/arabic handwritten from machine-printed words discrimination,” In Proceedings - International Workshop on Frontiers in Handwriting Recognition, IWFHR, 2012.
[16] G. Muhammad, M. H. Al-Hammadi, M. Hussain, and G. Bebis, “Image forgery detection using steerable pyramid transform and local binary pattern,” Mach. Vis. Appl., vol. 25, no. 4, pp. 985–995, 2014.
[17] S. D. Connell and A. K. Jain, “Recognition of Unconstrained On-Line Devanagari Characters,” ICPR, pp. 1–4, 2000.
[18] A. F. R. Rahman, R. Rahman, and M. C. Fairhurst, “Recognition of handwritten Bengali characters: A novel multistage approach,” Pattern Recognit., 35(5), 997-1006, 2002.
[19] H. Ma and D. Doermann, “Adaptive Hindi OCR Using Generalized Hausdorff Image Comparison”, ACM Transactions on Asian Language Information Processing (TALIP), 2(3), 193-218, 2003.
[20] U. Pal, K. Roy, and F. Kimura, “A Lexicon-Driven Handwritten City-Name Recognition Scheme for Indian Postal Automation,” IEICE transactions on information and systems, no. 5, pp. 1146–1158, 2009.
[21] V. Deepu, S. Madhvanath, and A. G. Ramakrishnan, “Principal component analysis for online handwritten character recognition,” Pattern Recognit. (ICPR), 17th Int. Conf., vol. 2, no. 2, p. 327–330 Vol.2, 2004.
[22] N. Sharma and U. Pal, “Recognition of off-line handwritten devnagari characters using quadratic classifier,” Comput. Vision, Graph. …, pp. 805–816, 2006.
[23] U. Bhattacharya, M. Shridhar, and S. K. Parui, “On Recognition of Handwritten,” Comput. Vision, Graph., pp. 817–828, 2006.
[24] M. A. Rahman and A. El Saddik, “Modified syntactic method to recognize Bengali handwritten characters,” IEEE Trans. Instrum. Meas., vol. 56, no. 6, pp. 2623–2632, 2007.
[25] U. Pal, T. Wakabayashi, and F. Kimura, “Handwritten bangla compound character recognition using gradient feature,” Proc. - 10th Int. Conf. Inf. Technol. ICIT 2007, pp. 208–213, 2007.
[26] A. Sharma, R. Kumar, and R. K. Sharma, “Online Handwritten Gurmukhi Character Recognition Using Elastic Matching.” Image and Signal Processing, 2008. CISP`08. Congress on. Vol. 2. IEEE, 2008.
[27] D. Singh, M. Dutta, and S. H. Singh, “Neural Network Based Handwritten Hindi Character Recognition System.” In Proceedings of the 2nd Bangalore Annual Compute Conference 2009.
[28] N. Das, B. Das, R. Sarkar, S. Basu, M. Kundu, and M. Nasipuri, “Handwritten Bangla Basic and Compound character recognition using MLP and SVM classifier,” J. Comput., vol. 2, no. 2, pp. 2151–9617, 2010.
[29] M. Kumar, “Offline handwritten Gurmukhi character recognition : Study of different feature-classifier combinations,” In Proceeding of the workshop on Document Analysis and Recognition, pp. 94-99, ACM, 2012.
[30] S. Iamsa-at and P. Horata, “Handwritten Character Recognition Using Histograms of Oriented Gradient Features in Deep Learning of Artificial Neural Network,” Int. Conf. IT Converg. Secur. 2013., no. 1, pp. 1–5, 2013.
[31] E. Hassan, “Exploiting multimedia content: A machine learning based approach,” Electron. Lett. Comput. Vis. Image Anal., vol. 13, no. 2, p. 69, 2014.
[32] N. Dalal, B. Triggs, N. Dalal, B. Triggs, O. Gradients, and D. Cordelia, “Histograms of Oriented Gradients for Human Detection”, Computer Vision and Pattern Recognition, (CVPR), IEEE Computer Society Conference on. Vol. 1. 2005.
[33] J. Arróspide, L. Salgado, and M. Camplani, “Image-based on-road vehicle detection using cost-effective Histograms of Oriented Gradients,” J. Vis. Commun. Image Represent., 2013.
[34] Q. Zhu, S. Avidan, M. C. Yeh, and K. T. Cheng, “Fast Human Detection Using a Cascade of Histograms of Oriented Gradients,” IEEE Conf. Comput. Vis. Pattern Recognit., vol. 2, pp. 1491–1498, 2006.
[35] A. Bosch, A. Zisserman, and X. Munoz, “Representing shape with a spatial pyramid kernel,” in Proceedings of the 6th ACM international conference on Image and video retrieval - CIVR ’07, 2007.
[36] D. Salvi, J. Zhou, J. Waggoner, and S. Wang, “Handwritten Text Segmentation using Average Longest Path Algorithm.” In Applications of Computer Vision (WACV), 2013 IEEE Workshop on, pp. 505-512. IEEE, 2013
[37] Y. Bai, L. Guo, L. Jin, and Q. Huang, “A novel feature extraction method using pyramid histogram of orientation gradients for smile recognition,” in Proceedings - International Conference on Image Processing, ICIP, 2009.
[38] C. Cortes and V. Vapnik, “Support-Vector Networks,” Mach. Learn., vol. 20, no. 3, pp. 273–297, 1995.
[39] V. N. Vapnik, “An overview of statistical learning theory.,” IEEE Trans. Neural Netw., vol. 10, no. 5, pp. 988–99, 1999.
[40] C.-C. Chang and C.-J. Lin, “Libsvm,” ACM Trans. Intell. Syst. Technol., vol. 2, no. 3, pp. 1–27, 2011.
[41] B. B. Chaudhuri and A. Majumdar, “Curvelet-based multi SVM recognizer for offline handwritten bangla: A major Indian script,” in Proceedings of the International Conference on Document Analysis and Recognition, ICDAR, 2007.
[42] A. Dhurandhar, K. Shankarnarayanan, and R. Jawale, “Robust pattern recognition scheme for devanagari script,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2005.
[43] R. Kohavi, “A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection,” Appear. Int. Jt. Conf. Articial Intell., pp. 1–7, 1995.

M.K. Mahto, K. Bhatia, R.K. Sharma, "Robust Offline Gurmukhi Handwritten Character Recognition using Multilayer Histogram Oriented Gradient Features," International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.915-925, 2018.

Online networking is quickly getting to be one of the mediums of decision for understanding the social beat of an area. To survey this social beat it is basic to have an exact appraisal of who is saying what in web-based social networking. Fear monger bunches like al-quida, Indian mujahedeen, ISIS and other psychological oppressor bunches are spreading their purposeful publicity utilizing web or distinctive web-based social networking sites like Facebook, Twitter and Google+. Essential plan to stop or diminish spreading of psychological oppression is to expel these records. To execute this thought needs bunches of human endeavors which incorporate perusing part of data and dissecting contain. So to lessen human endeavors we will make a framework which recognize message given by fear based oppressor amass on twitter. Our framework will arrange tweets and discovers tweets are supporting ISIS gathering or not. We need to fabricate a framework which will give better outcome for analyzers.

Terrorism, ISIS, social media radical content, text mining, natural language processing, user cluster

[1] Ms. Pooja S. Kade1, Prof. N.M. Dhande, “ A Paper on Web Data Segmentation for Terrorism Detection using Named Entity Recognition Technique” presented at International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395 – 0056, p-ISSN: 2395 – 0072,Volume: 04 Issue: 01 | Jan -2017,
[2] Budak Arpinar & Ugur Kursuncu and Dilshod Achilov, “Social Media Analytics to Identify and Counter Islamist Extremism: Systematic Detection, Evaluation, and Challenging of Extremist Narratives Online” presented at International Conference on Collaboration Technologies and Systems. 978 – 1 – 5090 – 2300 – 4 /16 2016 IEEE.
[3] Surajit Dasgupta, Chandan Prakash, “Intelligent Detection of Influential Nodes in Networks” presented at International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT) , 978 – 1 – 4673 – 9939 – 5 /16, 2016-IEEE,
[4] Michael Ashcroft, Ali Fisher, Lisa Kaati, Enghin Omer, Nico Prucha, “Detecting Jihadist Messages on Twitter” presented at European Intelligence and Security Informatics Conference 978 – 1 – 4799 – 8657 – 6 /15, 2015 IEEE.
[5] Sonali Vighne, Priyanka Trimbake, Anjali Musmade, Ashwini Merukar, Sandip Pandit, “An Approach to Detect Terror Related Activities on Net” presented at IJARIIE-ISSN(O)-2395 – 4396, Vol-2 Issue-1 2016.
[6] Wei Wei Carnegie, Kenneth Joseph, Huan Liu, Kathleen M. Carley,” The Fragility of Twitter Social Networks Against Suspended Users” International Conference on Advances in Social Networks Analysis and Mining, 2015 ISBN: 978 – 1 – 4503 – 3854, 2015 IEEE/ACM.
[7] Sharath Kumar A and Sanjay Singh, ” Detection of User Cluster with Suspicious Activity in Online Social Networking Sites” Second International Conference on Advanced Computing, Networking and Security, 978 – 0 – 7695 – 5127 - 2/13,2013 IEEE
[8] Ala Berzinji, Frzand Sherko Abdullah, Ali Hayder kakei, “Analysis of Terrorist Groups on Facebook”, 978 – 0 – 7695 – 5062 – 6 /13, IEEE.

A.L. Munani, B.A. Tanawala, P.B. Swadas, "Prediction of Online Spread of Terrorism on Twitter Using Naïve Bayes And SVM Classification," International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.926-929, 2018.

The network on chip (NoC) has replace traditional system on chip (SoC) to meet the communication requirement. The communication on NoC chip is carried out by means of router. For implementing better NoC, the router should be efficiently designed. The paper reviews NoC router and NoC parameters which affects the router design. Design of NoC router depends on network topology, switching techniques and routing algorithm. The Eight port router for different topology design is synthesized and simulated using Verilog code. A comparative study is made on the based of power analyses for different topologies of the 8 port NoC router. It is observed that design of 8 port routers of Octagon, Mesh, Ring, Star, and Torus are having same leakage power. It has been observed that Star topology is less in power consumption as compared to Octagon, Mesh, Ring, Torus and Fat tree topology for 8port NoC router.

Network on chip (NOC), Systen on Chip(SOC), Topologies

M. Palesi, R.Holsmark, S. Kumar, and V. Catania, “Application-specific routing algorithms for a network on chip,” IEEE Transactions on Parallel and Distributed Systems, vol. 20, no3 pp. 316-339, 2009
[2] L. Benini and D. Micheli, Networks on Chips: A New SoC Paradigm, IEEE Computer, vol.35 pp.70-78(2002).
[3] V. Dumitriu and G. N. Khan, “Throughput- oriented NOC topology generation and analysis for high-performance SOC,” IEEE Transactions on VLSI Systems, vol. in press 2009.
[4] A. Chien, “A cost and speed model for k-ary n-Cube Wormhole Routers,” IEEE Transactions on Parallel and Distributed Systems, vol.9, no2, pp.29-36, Feb 1998.
[5] B. H. Meyer, J.J. Pieper, J.M. Paul, J.E. Nelson, S. M. Pieper and A.G.Rowe, “Power-performance simulation and design strategies for single-chip heterogeneous multiprocessors,” IEEE transactions on Computers, vol.54, no. 6, pp.684-697, Jun 2005.
[6] L. S. Peh and W. J. Dalley, A delay model for router microarchitectures,” IEEE Micro, vol.21, no. 1, pp. 26-34, Jan. 2001.
[7] T. Bjerregaard and K. Mahadevan, “A survey of research and practices of network-on-chip,”ACM Computing Surveys, vol. 38, pp.38, pp.1-51, Mar. 2006.
[8] V. Pavlidis and E. Friedman,” Interconnect-based design methodologies for three-dimensional integrated circuits’’ Proceeding of the IEEE, vol.97, no.1, pp.123-140, 2009.
[9] H. Elmiligi, A. Morgan, M. W. EI-Kharashi, and F. Gebli, “ Power Aware Topology Optimization for Network-on-chips,” in a proceeding of the IEEE International Symposium on Circuits and SystemsConference on Design and Test of Integrated Systems in Nanoscale Technology, Era Cario, Egypt, Apr. 6-9, 2009, pp.107-112.
[10] Axel Jantsch and Hannu Tenhunen(Eds.), Networks on a chip, Kluwer Academic Publishers, 2003
[11] A Delay-Aware Topology-based Design for Network-on-chip Applications By Haytham Elmiligi, Ahmed A. Morgan, M. Watheq El-Kharashi, Fayez Gebali.IEEE transaction, 2009.
[12] Khalid Latif, Tiberiu Seceleanu, Hannu Tenhunen, “Power and Area Efficient Design of Network-on-Chip Router Through Utilization of Idle Buffers”, In the proceedings of the 2010 17th IEEE International Conference and Workshops on Engineering of Computer Based Systems.
[13] Cheng Liu•, Liyi Xiao, Fangfa Fu, Design and “Analysis of On-Chip Router”, IJCTT, Aug 2011
[14] W. Zhou, Y. Zhang, and Z. Mao,” An application specific NOC mapping for the optimized delay,” in a proceeding of the IEEE International Conference on Design and Test of Integrated Systems in Nanoscale Technology, Tunis, Tunisia , Sept. 5-7, 2006, pp. 184-188.
[15] M. Nickray, M.Dehyadgari, and A. Afzali-kusha, “Power and Delay optimization for a network on chip,” in Proceedings of the 2005 European Conference on Circuit Theory and Designs, Cork, Ireland, Aug-28-2 Sept. 2005, pp. 273-276.
[16] H. Elmiligi, A. A. Morgan, M. W. EI-Kharashi and F. Gebli, “ A reliability-aware design methodology for network-on-chip applications,” in proceeding of the IEEE International Conference on Design and Test of Integrated Systems in Nano scale Technology ,Era Cario, Egypt, Apr. 6-9, 2009, pp. 107-112.
[17] M. Mirza-Aghatabar+,S.Koohi+, S. Hessabi*, M. Pedram†,” An Empirical Investigation of Mesh and Torus NoC Topologies Under Different Routing Algorithms and Traffic Models”, IEEE International Conference on Digital System DSD 2007.
[18] Victor Dumitriu and Gul N. Khan, ”Throughput-Oriented NoC Topology Generation and Analysis for High-Performance SoCs”, IEEE transactions on very large scale integration (vlsi) systems, vol. 17, no. 10, october 2009.
[19] Mahmoud Moadeli1, Ali Shahrabi2, Wim Vanderbauwhede1, Mohamed Ould-Khaoua1,” An Analytical Performance Model for the Spidergon NoC”, IEEE 21st International Conference on Advanced Networking and Applications (AINA`07) 2007.
[20] Ville Rantala, Teijo Lehtonen, Juha Plosila, ‘Network on Chip Routing Algorithms,” Journal of Systems Architecture, TUCS Technical Report No 779, pp. 5-7, August 2006
[21] K.Shiney, .K.V.Subrahmanyam and S Chandra Sekhar “High throughput compact delay-insensitive asynchronous NoC router” IJCSE, October 2014

L. Bobinson Singha, Champa Tanga, "Analysis of Power Consumptions in 8 Port NOC Router for Different Topologies," International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.930-935, 2018.

This paper presents a low power 2 bit magnitude comparator. The speed and power of comparator have important influence on performance of complex arithmetic and logical circuitries such as ADC, Memory chips etc. It plays a vital role in various DSP, high speed data processors, microprocessors, microcontroller based applications. The proposed comparator design is compared with different logic styles such as PTL, Domino logic, and Transmission gates with voltage sweep. The simulations are carried out on Mentor Graphics (ELDO tool) using 90 nm technology and in Micowind using 180 nm technologies. Simulation is done on 0.6V, 0.8V, 1V and 1.2V respectively. It is found that power is least dissipates in 0.6 V that is 48.82pW.but it has the longest delay of 53.098ns.The simulation results of proposed design using 90 nm technology show improvement in power delay product, 60.26% in greater than circuit, 56.14% in lesser than circuit and 59.48% in equals to function.

Magniude Comparator, CMOS technology, Domino logic, PDP,Coupling

[1] A.Gupta, “A Design of low power magnitude comparator” , In the Proceedings of the 2017 International conference on Cloud Computing, Data Science and Engineering, India,pp.754 – 758,2017
[2] M.Torikul, “The design of low power high speed comparator using 0.13um CMOS” In the Proceedings of 2016 International Conference on Advances in Electrical, Electronic and Systems Engineering (ICAEES),pp.72 – 76,2016.
[3] N.Azizi,“Design of A Low Power 0.25 µm CMOS Comparator for Sigma-Delta Analog-to-Digital Converter” In the Proceedings of 2015 IEEE Student Conference on Research and Development (SCOReD),pp.638-642,2015.
[4] G.Sharma,“ Comparative Analysis of a 2-bit Magnitude Comparator using various High Performance Techniques” In the Proceedings of 2015 International Conference on Communications and Signal Processing (ICCSP),pp. 0079- 0083,2015
[5] D.Kumar ,“Design of low power two bit magnitude comparator using adiabatic logic” In the Proceedings of 2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS),pp. 1- 6, 2016
[6] Weste and Kamaran, “Principles of CMOS VLSI Design”, Pearson Publications,Education Asia, pp.334-360.2014.
[7] N. Prasanna , H. Sumitha,“Design of High Speed Digital CMOS Comparator Using Parallel Prefix Tree” Volume 4 Issue 10,2015, International Journal of Science and Research,pp.204-207,2015
[8] R. Pawar,V.Munguwadi “Wireless Mesh Network Link Failure Issues and Challenges” International Journal of Scientific Research in Network Security and Communication, Volume-6, Issue-3, pp. 28-38 June 2018

M.N. Vaidya, S.R. Patil, "To Design Low power Magnitude Comparator using CMOS Technology," International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.936-939, 2018.

Mobile ad hoc networks (MANETs) are composed of battery operated devices. These devices have limited battery capacity, which makes energy a scarce resource in MANETs. Energy conservation is crucial in such networks. Even though a node may not have any message of its own to transmit, its battery is drained when it acts as a router and forwards packets for other nodes. The frequent route discovery attempts in dynamic networks can affect the performance adversely. Multipath on demand protocols try to alleviate these problems by computing multiple paths in a single route discovery attempt. In order to utilize the limited energy source effectively and extend the lifetime of the network, routing protocols should be energy efficient. The energy consumption is not only affected by the network operations but also by the mobility pattern of the nodes. In this work, a well-known multipath routing protocol ad hoc on demand multipath distance vector (AOMDV) is evaluated for the energy consumption under different mobility patterns. The evaluation is done under different mobility models and results are reported for various parameters.

AOMDV, Energy, MANET, Mobility model, Routing

[1] E. M. Royer and C. K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks”, IEEE Personal Communications, Vol. 6, Issue. 2, pp. 46-55, 1999.
[2] C. Perkins and E. Royer “Ad Hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, MANET Working Group, draft-ietf-manet-aodv-05.txt, pp. 1-37, 2003.
[3] C. E. Perkins and E. M. Royer, “Ad hoc on-demand distance vector routing,” In the Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100, 2009.
[4] D. B. Johnson, D. A. Maltz, and J. Broch, “Dynamic source routing protocol for wireless ad hoc network,” IEEE Journal on Selected Areas in Communication, Vol. 3, Issue 3, pp. 431–439, 1985.
[5] Y.-B. Ko and N. H. Vaidya, “Location Aided Routing in Mobile Ad Hoc Networks,” ACM Journal of Wireless Networks, Vol. 6, Issue 4, pp. 307-321, 2000.
[6] M. K. Marina and S. R. Das, “Ad hoc on-demand multipath distance vector routing,” Wireless Communication Mobile Computing, pp. 969–988, 2006.
[7] M. Singh, S. G. Lee, D. Singh, and H. J. Lee, “Impact and Performance of Mobility Models in Wireless Ad-hoc Networks,” In the Proceedings of IEEE Fourth International Conference on Computer Sciences and Convergence Information Technology, pp. 139-143, 2009
[8] M. Z. Oo and M. Othman, “Analysis of Single-path and Multi-path AODVs over Manhattan Grid Mobility Model for Mobile Ad Hoc Networks,” In the Proceedings of IEEE ICEIE, pp. 214-218, 2010.
[9] M. Izuan, M. Saad, and Z. A. Zukarnain, “Performance Analysis of Random-Based Mobility Models in MANET Routing Protocol,” European Journal of Scientific Research, Vol. 32, Issue 4, pp. 444-454, 2009.
[10] R. Huang, Y. Zhuang, and Q. Cao, “Simulation and Analysis of Protocols in Ad Hoc Network,” In the Proceedings of IEEE International Conference on Electronic Computer Technology, pp. 169-173, 2009.
[11] S. Doshi, S. Bhandare, and T.X. Brown, “An On-demand minimum energy routing protocol for a wireless ad hoc network,” ACM SIGMOBILE Mobile Computing and Communications Review, Vol. 6, Issue 3, pp. 50–66, 2002.
[12] S. Gowrishankar, T. G. Basavaraju, and S. K. Sarkar, “Effect of Random Mobility Models Pattern in Mobile Ad hoc Networks,” International Journal of Computer Science and Network Security, Vol.7, Issue 6, 2007.
[13] S.M. Senouci and M. Naimi, “New Routing for Balanced Energy Consumption in Mobile Ad Hoc Networks,” In the Proceedings of the 2nd ACM International Workshop on Performance Evaluation of Wireless Adhoc, Sensor, and Ubiquitous Networks, pp. 238-241, 2005.
[14] M.C. Domingo, D. Remondo and O. Leon, “A simple routing scheme for improving ad hoc network survivability,” In the Proceedings of IEEE GLOBECOM’03, pp. 718–723, 2003.
[15] X. Wang, Q. Liu, and N. Xu, “The Energy-Saving Routing Protocol Based on AODV,” In the Proceedings of IEEE Fourth International Conference on Natural Computation, pp. 276-280, 2008.
[16] L. Tie-Yuan, C. Liang, and G. Tian-Long, “Analyzing the Impact of Entity Mobility Models on the Performance of Routing Protocols in the MANET,” In the Proceedings of IEEE 3rd International conference on Genetic and Evolutionary Computing, WGEC `09, pp. 56-59, 2009.
[17] D.B. Johnson and D.A. Maltz, “Dynamic source routing in ad hoc wireless networks,” Mobile Computing, Vol. 353, pp. 153–181, 1996.
[18] B. Liang and Z. J. Haas, “Predictive distance-based mobility management for multidimensional PCS networks,” IEEE/ACM Transactions on Networking, Vol. 11, Issue 5, pp. 718–732, 2003.
[19] X. Hong, M. Gerla, G. Pei, and C.-C. Chiang, “A group mobility model for ad hoc wireless networks,” In the Proceedings of ACM/IEEE MSWiM’99, pp. 53-60, 1999.
[20] Fan Bai, Narayanan Sadagopan, and Ahmed Helmy, “IMPORTANT: A framework to systematically analyze the impact of mobility on performance of routing protocols for ad hoc networks,” In the Proceedings of IEEE INFOCOM, pp. 825-835, 2003.

B. Kumar, "Energy Efficiency of Multipath Routing in Mobile Ad Hoc Networks," International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.940-944, 2018.

With the rapid growth of internet all type of services are available online to decrease the user efforts and to make every task easy. A variety of web applications are available for these activities. Web applications contain confidential data of organizations and databases or other information sources. It can be attacked by attackers or hackers, if there are any vulnerabilities present in the web application. So, there is a need to implement security approaches and algorithms to detect the web vulnerabilities. This paper presents a Hybrid algorithm to detect web application vulnerabilities. The proposed hybrid algorithm, KMPS is a combination of Sunday search algorithm and KMP string matching algorithm. KMPS consists of shifting steps and matching steps to detect the attacks and is compared with the existing BM pattern matching algorithm. The results show that the proposed algorithm performs better than BM pattern matching algorithm in context of searching time, accuracy and throughput.

Web application security, SQLi, Cross-site scripting, Cross-site request, forgery, buffer overflow, KMPS hybrid algorithm

[1] Nagpal, B., Chauhan, N., & Singh, N. (2017). “SECSIX: security engine for CSRF, SQL injection and XSS attacks.” International Journal of System Assurance Engineering and Management, 8(2), 631-644.
[2] Saleh, A. Z. M., Rozali, N. A., Buja, A. G., Jalil, K. A., Ali, F. H. M., & Rahman, T. F. A. (2015). “A method for web application vulnerabilities detection by using boyer-moore string matching algorithm.” Procedia Computer Science, 72, 112-121.
[3] Yu, F. (2015). “Malicious url detection algorithm based on bm pattern matching.” International Journal of Security and Its Applications, 9(9), 33-44.
[4] Mahmoud, S. K., Alfonse, M., Roushdy, M. I., & Salem, A. B. M. (2017, December). “A comparative analysis of Cross Site Scripting (XSS) detecting and defensive techniques.” In Intelligent Computing and Information Systems (ICICIS), 2017 Eighth International Conference on (pp. 36-42). IEEE.
[5] Marashdih, A. W., & Zaaba, Z. F. (2017, October). “Detection and Removing Cross Site Scripting Vulnerability in PHP Web Application.” In Promising Electronic Technologies (ICPET), 2017 International Conference on (pp. 26-31). IEEE.
[6] Thomé, J., Shar, L. K., Bianculli, D., & Briand, L. (2017, May). “Search-driven string constraint solving for vulnerability detection.” In Software Engineering (ICSE), 2017 IEEE/ACM 39th International Conference on (pp. 198-208). IEEE.
[7] Gupta, S. (2016, December). “Efficient malicious domain detection using word segmentation and BM pattern matching.” In Recent Advances and Innovations in Engineering (ICRAIE), 2016 International Conference on (pp. 1-6). IEEE.
[8] Prashanth, S. K., Rao, N. S., & Kumar, C. S. (2016, March). “Hybrid Cuckoo search—ABC algorithm based vulnerabilities mapping and security in clouds.” In Electrical, Electronics, and Optimization Techniques (ICEEOT), International Conference on (pp. 2569-2572). IEEE.
[9] Yu, J., Tao, D., & Lin, Z. (2016, August). “A hybrid web log based intrusion detection model.” In Cloud Computing and Intelligence Systems (CCIS), 2016 4th International Conference on (pp. 356-360). IEEE.
[10] MUIRURI, C. K., Ruhiu, S., & Moturi, C. A. (2015). “A HYBRID ALGORITHM FOR DETECTING WEB-BASED APPLICATIONS VULNERABILITIES.”
[11] Patel, N., & Shekokar, N. (2015). “Implementation of pattern matching algorithm to defend SQLIA.” Procedia Computer Science, 45, 453-459.
[12] Hazel, J. J., Valarmathie, P., & Saravanan, R. (2015, February). “Guarding web application with multi-Angled attack detection.” In Soft-Computing and Networks Security (ICSNS), 2015 International Conference on (pp. 1-4). IEEE.
[13] Qiao, J., & Zhang, H. (2015, September). “Improvement of BM algorithm in intrusion detection system.” In Software Engineering and Service Science (ICSESS), 2015 6th IEEE International Conference on (pp. 652-655). IEEE.
[14] Srivastava, M. (2014, March). “Algorithm to prevent back end database against SQL injection attacks.” In Computing for Sustainable Global Development (INDIACom), 2014 International Conference on (pp. 754-757). IEEE.
[15] Trinh, M. T., Chu, D. H., & Jaffar, J. (2014, November). “S3: A symbolic string solver for vulnerability detection in web applications.” In Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security (pp. 1232-1243). ACM.
[16] Kadhim, H. A., & AbdulRashidx, N. (2014, June). “Maximum-shift string matching algorithms.” In Computer and Information Sciences (ICCOINS), 2014 International Conference on (pp. 1-6). IEEE.
[17] Razzaq, A., Anwar, Z., Ahmad, H. F., Latif, K., & Munir, F. (2014). “Ontology for attack detection: An intelligent approach to web application security.” Computers & security, 45, 124-146.
[18] Shar, L. K., Tan, H. B. K., & Briand, L. C. (2013, May). “Mining SQL injection and cross site scripting vulnerabilities using hybrid program analysis.” In Proceedings of the 2013 International Conference on Software Engineering (pp. 642-651). IEEE Press.
[19] Ding, S., Tan, H. B. K., Shar, L. K., & Padmanabhuni, B. M. (2013, December). “Towards a Hybrid Framework for Detecting Input Manipulation Vulnerabilities.” In Software Engineering Conference (APSEC), 2013 20th Asia-Pacific (Vol. 1, pp. 363-370). IEEE.
[20] Lu, C. W., Lu, C. L., & Lee, R. C. (2013). “A new filtration method and a hybrid strategy for approximate string matching.” Theoretical Computer Science, 481, 9-17.
[21] Chang, C., & Wang, H. (2012, March). “Comparison of two-dimensional string matching algorithms.” In Computer Science and Electronics Engineering (ICCSEE), 2012 International Conference on (Vol. 3, pp. 608-611). IEEE.
[22] Xian-feng, H., Yu-bao, Y., & Lu, X. (2010, August). “Hybrid pattern-matching algorithm based on BM-KMP algorithm.” In Advanced Computer Theory and Engineering (ICACTE), 2010 3rd International Conference on (Vol. 5, pp. V5-310). IEEE.
[23] Shreekishan Jewliya, "Analysis of Web Application Security", International Journal of Computer Sciences and Engineering, Vol.5, Issue.9, pp.215-220, 2017.
[24] Sandeep D Sukhdeve and Hemlata Channe, "A Survey on Content Injection Attacks", International Journal of Computer Sciences and Engineering, Vol.3, Issue.11, pp.70-74, 2015.

Komal, S. Deswal, "KMPS: A Hybrid Algorithm to Detect Web Application Vulnerabilities," International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.945-949, 2018.

Cloud computing is now a very common term among IT peoples. In cloud computing all the computing services like servers, networking devices, application is available over the Internet. Many people can share and access different application and resources as per their need and privileges of access & authorities. In cloud computing security & privacy of data is most important point which required lot of attention by the cloud service provider. Authentication is the main concern in existing security solutions, but neglect a subtle privacy issue during a user challenging the cloud server to request other users for data sharing. User’s privacy is reveal by the challenged access request no matter it obtain the access permission or not. Ambition of this paper is to investigate and estimate the most important security techniques for data sheltering in cloud computing. We have proposed a Privacy Preserving Authentication Protocol based on Shared Authority (PPSA). Share access authority is achieved by the anonymous access request and analyzing and observing privacy. Data security is enhanced by using attribute base control system, which allows users to access their own data. To provide the data accessing from the other trusted party and sharing among the multiple users proxy re-encryption scheme is used by the cloud server. It indicates that the proposed scenario is possibly applied for enhanced privacy- preservation and security in cloud applications. We have done the review study on this scenario. In this paper we will focused on implementation of this review with assuring an improved result.

ECDH, SHA512, Authentication protocols, Cloud computing, Cloud computing security, Data security

[1]. Hong Liu, Huansheng Ning, Qingxu Xiong and Lairence T. Yang,” Shared Authority Based Privacy-Preserving Authentication protocol in Cloud Computing” IEEE Transactions on Parallel and Distributed Systems ( Volume: 26, Issue: 1, Jan. 2015 )
[2]. Antonis Michalas, “Sharing in the Rain: Secure and Efficient Data Sharing” for the cloud” 11th International Conference or Internet Technology and Secured Transaction(ICITST)2016.
[3]. 3.Ghassan O. Karame, Claudio soriente, Krzysztof Lichota, Srdjan Capkun” Securing Cloud Data under Key Exposure” IEEE Transactions on Cloud Computing ( Volume: PP, Issue: 99 )Feb 2017.
[4]. 4.Jianghong Wei, Wenfen Liu, Xuexian Hu” Secure Data Sharing in Cloud Computing Using Revocable-Storage Identity-Based Encryption”. IEEE Transactions on Cloud Computing ( Volume: PP, Issue: 99 )March 2016
[5]. 5. Mazhar Ali, Saif U. R. Malik, Samee U. Khan” DaSCE: Data Security for Cloud Environment with Semi-Trusted Third Party” IEEE Transactions on Cloud Computing ( Volume: 5, Issue: 4,)June 2015.
[6]. 6. P. Vidhya L Lakshmi, Dr. S. Sankar Ganesh, usi“A secure cloud storage system with data forwarding ng proxy re-encryption scheme”, international journal for trends in engg and tech , April 2015.
[7]. 7. Apurva Gomase, Prof.Vikrant Chole, ”Secure system implementation using attribute based encryption”, ijates,Vol.No.03,Special issue No.01,Nov 2015.
[8]. 8. Jingwei Li, dan Lin, Anna Cinzia Suicciarini, Jin Li, Chunfu Jia” Towards Privacy-Preserving Storage and Retrieval in Multiple Clouds” IEEE Transactions on Cloud Computing ( Volume: 5, Issue: 3, July-Sept. 1 2017 )October 2015.
[9]. 9. ] Deyanchen, hongzhao, ”Data security and privacy protection issue in cloud computing”IEEE conference of computer science and electronics engg, 2013.

[10]. 10.Farheen Quazi & Prof. Vikrant Chole “Implementation on Proxy-re-encryption based security mechanism to authenticate shared access in cloud computing" International Journal of Scholarly Research (IJSR) Vol-1, Issue-2, 2017

[11]. 11. Archana Singh Parmar, Monika Sharma,”Improving Data Storage Security in Cloud Computing using Elliptic Curve” International Journal of Engineering Science and Computing(Vol -7,Issue- 4)April 2017.
[12]. 12. . Shweta Singh, Tabrez Nafis, Ankita Sethi,”Cloud Computing: Security Issues & Solution”International Journal of Computational Intelligence Research (Volume 13, Number 6, 2017).
[13]. 13. Balamurugan Balusamy, P. Venkata Krishna, G. S. Tamizh Arasi, and Victor Chang,” A Secured Access Control Technique for Cloud Computing Environment Using Attribute Based Hierarchical Structure and Token Granting System” International Journal of Network Security (Vol.19, No.4, PP.559-572, July 2017)
[14]. 14. Mohamed Ali Hamza, Jianfei Sun, Xuyun Nie, Zhiquan Qin, and Hu Xiong,” Revocable ABE with Bounded Ciphertext in Cloud Computing” International Journal of Network Security(Vol.19, issue:6)Nov 2017.
[15]. 15. Prabhleen Kaur Soul, Sunil Saini,”data security approach in cloud computing using SHA”international research journal of engineering and technology(Vol:4, Issue:6)June2017.
[16]. 16. P K Akulwar, R. V. Dharmadhikari, S. S. Turambekar, S. C. Dolli “Cloud Computing: Data Storage Protocols and Security Techniques” International Journal of Scientific Research in Computer Science and Engineering Volume: 6, Issue: 2, 2018

Ritu Pathak, Lalit Chourasia, Rahul Sharma, "Implementation on Shared Access Authentication in Cloud Computing Using Encryption Based Security Mechanism," International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.950-954, 2018.

Music Information Retrieval (MIR) is a science of retrieving information about music both statically and dynamically. Music Information Retrieval is a high learning curve and is beyond the knowledge of text Information Retrieval (IR). The two main approaches in which MIR is dealt with is meta-data based and content based. The classification of music based on compositions, artists and other static information is called text-based retrieval. The content based MIR actually focuses on musical content retrieval such as pitch, melody, rhythm etc. which can be used for extracting audio features for identification and classification of ragas dynamically.

MIR, ICM, HPS, Pattern recognition

[1] http://onlinecourses.nptel.ac.in
[2] http://en.wikipedia.org/wiki/Glossary_of_Carnatic_music_terms
[3] V. Krishnan, Mathematics of Melakartha Ragas in Carnatic Music, UMass Lowell, August 2012.
[4] R. Shridhar, et al., “Raga Identification of Carnatic music for Music Information Retrieval”, International Journal of Recent Trends in Engineering, Vol. 1(1), pp. 571-574, 2009.
[5] p. Dighe, et al., ”Swara Histogram Based Structural Analysis And identification Of Indian Classical Ragas”,International Society for Music Information Retrieval, 2013.
[6] M. Kamble, "Raga Identification Techniques of Indian Classical Music: An Overview”,Innovation in engineering science and technology (NCIEST-2015), pp. 100 – 105, 2015.
[7] R. Joseph, et al., ”Carnatic Raga Recognition”, Indian Journal of Science and Technology, Vol 10(13), 17485-110326, April 2017.
[8] P. Reddy, et al., “Automatic Raaga Identification System for Carnatic Music Using Hidden Markov Model”, Global Journal of Computer Science and Technology,Vol. 11(22) December 2011.
[9] K. Srimanip, et al., ” A Comparative Study Of Carnatic And Hindustani Raga Systems By Neural Network Approach”, International Journal of Neural Networks,Vol 2(1), pp. 35-38, 2012.
[10] P. Rao et al.,“Audio Metadata Extraction: The Case For Hindustani Classical Music” Department Of Electrical Engineering, Indian Institute Of Technology Bombay, Proc. of SPCOM 2012.
[11] P. Kirthika, et al., “Frequency Based Audio Feature Extraction For Raga Based Musical Information Retrieval Using LPC and LSI”, Journal of Theoretical and Applied Information Technology, Vol. 69(3), Pg. No. 582 – 588, November 2014..
[12] S. Dutta, et al. “Raga Verification In Carnatic Music Using Longest Common Segment Set”, 16th International Society for Music Information Retrieval Conference, 2015, pp. 605 – 611.
[13] P. Rajshri, et al., “Harmonium Raga Recognition”, International Journal of Machine Learning and Computing, Vol. 3(4), pp. 352 – 356, August 2013.
[14] Y.Yorozu,M.Hirano,K.Oka,andY.Tagawa,Electronspectroscopystudiesonmagneto-opticalmediaandplasticsubstrateinterface,” IEEETransl.J.Magn.Japan,vol.2,pp.740–741,August1987[Digests9thAnnualConf.MagneticsJapan,p.301,1982].
[15] S. Shetty, et al, “Clustering of Ragas Based on Jump Sequence for Automatic Raga Identification”, ICIP, CCIS 292, pp. 318–328, 2012.
[16] S. Chakraborty, et al., “An Interesting Application Of Simple Exponential Smoothing In Music Analysis”, International Journal on Soft Computing, Artificial Intelligence and Applications (IJSCAI), Vol.2(4), pp. 37 – 44, August 2013.
[17] J. Serra, et al., “Assessing The Tuning Of Sung Indian Classical Music”, International Society for Music Information Retrieval, © 2011
[18] S. Shetty, et al, “Clustering of Ragas Based on Jump Sequence for Automatic Raga Identification”, ICIP, CCIS 292, pp. 318–328, 2012.
[19] G. K. Kouduri, et al., “A Survey of Raaga Recognition Techniques and Improvements to the State-of-the-Art”, Proc. of sound and Music computing, 2011.
[20] T. Rao, et al., "Some Studies on of Raaga Emotions of Singers Using Gaussian Mixture Model", International Journal for Modern Trends in Science and Technology, Vol. 3(1), pp. 149-153, 2017.
[21] B. Tiple, et al., “Analysis of Features for Mood Detection in North Indian Classical Music - A Literature Review”, International Journal of Research in computer and communication Technology , Vol. 6(6), pp. 181-185, June- 2017.
[22] 52. K. M. S. Prasad et al., "Speech Features Extraction Techniques for Robust Emotional Speech Analysis/Recognition", Indian Journal of Science and Technology, Vol 10(3), pp 10i3 - 110571

V. Kaimal, S. Barde, "Introduction to Identification of Raga in Carnatic Music and its Corresponding Hindustani Music," International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.955-958, 2018.

A real time compression on cloud is an activity where compression takes place at the time of uploading a file on cloud and save it on cloud storage space in compressed form. In this paper, we come up with a same activity where compression and decompression take place on Amazon EC2 over the internet. With increasing need and usage of file sharing between user and servers, the demands for storage have been always kept increased, but the problem of storage space is still there. So to reduce the space for large files, compression is always a good idea. We have used Huffman coding and LZ77 compression technique in it to create lossless compression environment The files get compressed and decompressed at real time on Amazon EC2 where compression of files take place at the time of uploading and decompression is taking place at the time of downloading files to the local machine from Amazon EC2. The user gets the file in original size as well as in same file format as it was before being compressed and uploaded. Multiple users can create accounts and can manage their accounts separately by adding their data of any data format and get it compressed on Amazon EC2 cloud. One major advantage of the proposed system is that it is implemented on Amazon EC2 cloud and is used over the internet; it means that multiple users can access it at a particular instant of time from multiple locations and get their files compressed.

Cloud computing, Amazon EC2, Real Time compression, Amazon web services

[1] J. Murty, “Programming amazon web services: S3, EC2, SQS, FPS, and SimpleDB”,O`Reilly Media, Inc, USA,pp.51-251, 2008.
[2] R.P. Padhy, M.R. Patra, S.C. Satapathy,"X-as-a-Service: Cloud Computing with Google App Engine, Amazon Web Services, Microsoft Azure and Force", International Journal of Computer Science and Telecommunications, Vol.2, Issue.9, pp.8-16,2011.
[3] J. Varia,S. Mathew,“Overview of Amazon Web Services”, Amazon Web Services, pp.1-22,2017.
[4] Q. Zhang, L. Cheng, R. Boutaba,"Cloud computing: state-of-the-art and research challenges",Journal of internet services and applications,Vol.1, Issue.1, pp.7-18,2010.
[5] V. Patidar, M. Kumbhkar, “Analysis of Cloud Computing Security Issues in Software as a Service Vishnu”, International Journal of Scientific Research in Computer Science and Engineering, Vol.2, Issue.3, pp.1-5, 2014.
[6] U.Kaur, M. Mahajan, D. Singh, “A Comparative Analysis of Trust Models in Cloud Computing”, International Journal of Scientific Research in Network Security and Communication, Vol.6, Issue.2, pp.19-23.
[7] P. Kokkinos, T. A. Varvarigou, A. Kretsis, P. Soumplis, E. A. Varvarigos,”Cost and utilization optimization of Amazon EC2 instances”, In the proceedings of the 2013 IEEE Sixth International Conference on Cloud Computing Cost, USA, pp.518-525,2013.
[8] G. Kulkarni, R. Sutar, J. Gambhir, “Cloud computing-Infrastructure as service-Amazon EC2”, International Journal of Engineering Research and Applications,Vol.2, Issue.1, pp.117-125, 2012.
[9] M. Sharma, "Compression using Huffman coding", International Journal of Computer Science and Network Security, Vol.10, Issue.5, pp.133-141,2010.
[10] D. Mathpal, M. Darji, S. Mehta, “A Research Paper on Lossless Data Compression Techniques”, International Journal for Innovative Research in Science & Technology, Vol.4, Issue.1, pp.190-194,2017.
[11] K. Sharma, K. Gupta, “Lossless Data Compression Techniques and Their Performance”, In the proceedings of the International Conference on Computing, Communication and Automation (ICCCA2017), India, pp.256-261,2017.
[12] S. Porwal, Y. Chaudhary, J. Joshi, M. Jain, "Data compression methodologies for lossless data and comparison between algorithms", International Journal of Engineering Science and Innovative Technology, Vol.2, Issue.2, pp.142-147,2013.
[13] S. Kreft, G. Navarro, “LZ77-like compression with fast random access”, 2010 Data Compression Conference, Snowbird, Utah, USA, pp.239-248,2010.
[14] J. Shoba, S. Sivakumar,“A Study on Data Compression Using Huffman Coding Algorithms”, International Journal of Computer Science Trends and Technology, Vol.5, Issue.1, pp.58-63,2017.
[15] A. Shahbahrami, R. Bahrampour, M.S. Rostami, M.A. Mobarhan, "Evaluation of huffman and arithmetic algorithms for multimedia compression standards",International Journal of Computer Science, Engineering and Applications,Vol.1, Issue.4, pp.34-47,2011.

J. Singh, V. Thapar, "Development of Real Time System for File Compression on Amazon EC2," International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.959-966, 2018.

A wireless sensor network (WSN) comprises of economic power obliged sensor nodes gathering information from the detecting territory and transmits information towards the base station synergistically. The essential objective of wireless sensor network is to improve the node life expectancy, soundness period and throughput of network. The WSN nodes are confined by energy, stockpiling limit, and processing power. So grouping is utilized to enhance lifetime and strength. Group directing protocol assumes an imperative part for development of energy and soundness of the network. In this paper a new technique Enhance Threshold Sensitive Stable Election Protocol (ETSEP) is proposed and evaluated for heterogeneous wireless sensor network. In this technique cluster head election probability dynamically changes. The ETSEP is simulated using MATLAB and found that it performs better than Stable Election Protocol (SEP), Threshold Sensitive Stable Election protocol (TSEP) and Zonal Stable Election Protocol(ZSEP) in terms of stability and network lifetime. ETSEP builds more stable routing environment as compared to SEP, TSEP and ZSEP. Simulation results shows that our protocol performs better than SEP, TSEP and ZSEP.

Clustering, Data aggregation, Stable-aware routing protocol, Heterogeneous environment, Wireless sensor network

[1] Paola G. Vinueza Naranjo, Mohammad Shojafar, AjithAbrahamy and Enzo Baccarelli, “A New Stable Election-based Routing Algorithm to Preserve Aliveness and Energy in Fog-supported Wireless Sensor Networks”, International Conference on Systems, Man, and Cybernetics, Budapest, Hungary, IEEE, 2016, pp: 002413-002418.
[2] Taochun Wang,Ji Zhang, YonglongLuo, KaizhongZuo, and Xintao Ding, “An Efficient and Secure Itinerary-based Data Aggregation Algorithm for WSNs”, Trustcom/BigDataSE/ICESS, Sydney, NSW, Australia, IEEE 2017, pp: 433-440.
[3] SelvakumarSasirekha and SankaranarayananSwamynathan, “Cluster-Chain Mobile Agent Routing Algorithm for Efficient Data Aggregation in Wireless Sensor Network”, Journal Of Communications And Networks, Vol. 19, No. 4, August 2017.
[4] Jitender Grover, Shikha and Mohit Sharma, “Location Based Protocols in Wireless Sensor Network – A Review”, IEEE Fifth International Conference on Computing, Communications and Networking Technologies (ICCCNT 2014), Hefei, Anhui, China, DOI: 10.1109/ICCCNT.2014.6962990, pp. 1-5, July 11-13, 2014.
[5] Jitender Grover, Shikha Sharma and Mohit Sharma, “Reliable SPIN in Wireless Sensor Network”, IEEE 3rd International Conference on Reliability, Infocom Technologies and Optimization (ICRITO 2014), Amity University, Noida, DOI: 10.1109/ICRITO.2014.7014694, pp. 01-06, October 8-10, 2014.
[6] Sara El-Refaay, Marianne A. Azer and NashwaAbdelbaki, “Cluster Head Election in Wireless Sensor Networks”, 10th International Confernce on Information Assurance and Security, Okinawa, Japan, IEEE, 2014, pp: 1-5.
[7] Radheyshyam Sharma, ManojMisra and RajdeepNiyogi, “RaMaN: A Dynamic Clustering Protocol Resilient against Colluded Role-Manipulability and Node Replication Attacks”, International Conference on High Performance Computing & Simulation (HPCS), Bologna, Italy, IEEE, 2014, pp: 871-876.
[8] Li Shi, Liu Mengyao and Xia Li, “WSN Data Fusion Approach Based on Improved BP Algorithm and Clustering Protocol”, 27th Chinese Control and Decision Conference, Qingdao, China, IEEE, 2015, pp: 1450-1454.
[9] K. Arul Prasath and T. Shankar, “RMCHS: Ridge Method Based Cluster Head Selection for Energy Efficient Clustering Hierarchy Protocol in WSN”, International Conference on Smart Technologies and Management for Computing, Communication, Controls, Energy and Materials, Chennai, India, IEEE, 2015, pp: 64-70.
[10] Tripti Agrawal and Rajendra Singh Kushwah, “Layered Clustering Routing Protocol with Overlapping Cluster Heads in WSN”, Fifth International Conference on Communication Systems and Network Technologies, Gwalior, India, IEEE, 2015, pp: 244-248.
[11] MeenakshiDiwakar and Sushil Kumar, “An Energy Efficient Level Based Clustering Routing Protocol For Wireless Sensor Networks”,International Journal Of Advanced Smart Sensor Network Systems ( IJASSN ), Vol 2, No.2, April 2012.
[12] E.K. Neena, C. Balakrishnan, "Cluster Based Certificate Revocation of Attacker�s Nodes in MANET", International Journal of Computer Sciences and Engineering, Vol.2, Issue.1, pp.23-27, 2014.
[13] D. Suresh, K. Selvakumar, "A Hop Based Robust Routing Protocol in Wireless Sensor Network", International Journal of Computer Sciences and Engineering, Vol.2, Issue.8, pp.78-81, 2014.

Poonam Dabas and Abhinav Mahajan, "Enhanced Stable Election Protocol for Cluster based Routing by using Advanced Nodes in WSN," International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.967-971, 2018.