FORMULATION OF 3D EUCLIDEAN DISTANCE FOR NETWORK CLUSTERING IN WIRELESS SENSOR NETWORK
In wireless sensor networks, nodes operating under dynamic topology are often correlated with their behavior. Correlated behavior may pose devastating impact towards network connectivity. A node may change its behaviour from cooperative node to misbehave node which directly affects the networkâ€™s connectivity. Misbehaviour nodes tend to have correlated effect which creates partitioning within the network. To improve network connectivity in providing an efficient communication in the events of the correlated behaviors, a new formulation of correlated degree to perform network clustering is required. This paper proposes a formulation on correlated degree using 3D Euclidean distance to achieve higher network connectivity under correlated node behavior. The key idea behind the 3D Euclidean distance in network clustering is to identify a set of sensors whose sensed values present some data correlation referring to correlated degree. The correlated degree is formulated based on three-point distance within a correlation region to identify the level of node correlation within neighboring nodes. In addition, the correlated degree also be able to detect the same group of node behavior which is grouped in correlated regions. 3D Euclidean distance is shown in mathematical analysis and how the new formulation calculates correlated degree is also discussed. It is also expected that the new 3D Euclidean distance formulation may help correlation region to change it cluster formation dynamically to achieve the required network connectivity.
J. G. Foley, â€œSensor Networks and Their Applications : Investigating the Role of Sensor Web Enablement A Thesis submitted for the degree of Communications Engineering Doctorate ( EngD ),â€ Thesis (Eng.D.), no. March, 2014.
Y. Wang, Y. Lin, Y. Lin, and H. Chang, â€œA Grid-Based Clustering Routing Protocol for Wireless Sensor Networks,â€ In Advances in Intelligent Systems and Applications-vol1, pp. 491-499, 2013.
X.-X. Liu, â€œA Survey on Clustering Routing Protocols in Wireless Sensor Networks,â€ Sensors, vol. 12, pp. 11113â€“11153, 2012.
F. Xing and W. Wang, â€œOn the Survivability of Wireless Ad Hoc Networks in the Presence of Routing Malfunction,â€ IEEE Trans. Dependable Secur. Comput., vol. 7, no. 3, pp. 284â€“299, 2010.
A. H. Azni, R. Ahmad, and Z. Noh, â€œSurvivability modeling and analysis of mobile ad hoc network with correlated node behavior,â€ Procedia Eng., vol. 53, pp. 435â€“440, 2013.
L. A. Villas, A. Boukerche, H. A. B. F. De Oliveira, R. B. De Araujo, and A. A. F. Loureiro, â€œA spatial correlation aware algorithm to perform efficient data collection in wireless sensor networks,â€ Ad Hoc Networks, vol. 12, no. 1, pp. 69â€“85, 2014.
Y. Huang, J. F. MartÃnez, V. HernÃ¡ndez DÃaz, and J. Sendr, â€œA novel topology control approach to maintain the node degree in dynamic Wireless Sensor Networks,â€ Sensors (Switzerland), vol. 14, no. 3, pp. 4672â€“4688, 2014.
S. K. Gupta, A. Ranjan, and G. Sharma, â€œClustering Techniques for Wireless Sensor Networks,â€ Int. J. Emerg. Trends Sci. Technol. Clust., vol. 02, no. 06, pp. 2694â€“2698, 2015.
Mardin. W,Yassein MB, Khamayseh Y, and Ghaleb BA.Rotated Hybrid , Energy-Efficient and Distributed (R-HEED) Clustering Protocol in WSN.wseas transactions on communications, vol 13, pp.275-290. 2014.
R. Khan, S. A. Madani, K. Hayat, and S. U. Khan, â€œClustering-based power-controlled routing for mobile wireless sensor networks,â€ Int. J. Commun. Syst., 2011.
S. Peiravi, A., Mashhadi, H. R., and Hamed Javadi, â€œAn optimal energy-efficient clustering method in wireless sensor networks using multi-objective genetic algorithm,â€ Int. J. Commun. Syst., vol. 26, no. 1, pp. 114â€“126, 2013.
M. A. Rana, Jigish, and Sangeeta Vhatkar, â€œComparative Study of PEGASIS and PDCH Protocols in Wireless Sensor Network,â€ Int. J. Comput. Appl., no. Icwet, pp. 13â€“18, 2015.
P. G. Suguna. R, â€œEnergy Conservation in MANET Using Power Saving Protocol BECA / AFECA,â€ vol. 2, pp. 196â€“199, 2013.
Y. Xu, J. Heidemann, and D. Estrin, â€œAdaptive energy-conserving routing for multihop ad hoc networks,â€ Res. Rep. 527, USC/Information Sci. Inst., 2000.
M. Inanc, M. Magdon-ismail, B. Yener, and C. Science, â€œPower Optimal Connectivity and Coverage in Wireless Sensor Networks,â€ Tech. Reports 2003, pp. 1â€“12, 2003.
J. Lee, S. Member, and W. Cheng, â€œFuzzy-Logic-Based Clustering Approach for Energy Predication,â€ vol. 12, no. 9, 2012.
C. G. Gunn, â€œDoing Euclidean Plane Geometry Using Projective Geometric Algebra,â€ Adv. Appl. Clifford Algebr., vol. 27, no. 2, pp. 1203â€“1232, 2016.
A. Singh, A. Yadav, and A. Rana, â€œK-means with Three different Distance Metrics,â€ Int. J. Comput. Appl., vol. 67, no. 10, pp. 13â€“17, 2013.
R. V Kulkarni and G. K. Venayagamoorthy, â€œParticle Swarm Optimization in Wireless Sensor Networks : A Brief Survey,â€ IEEE Trans. Syst. Man. Cybern., pp. 1â€“7, 2009.
A. Thakkar and K. Kotecha, â€œCluster head election for energy and delay constraint applications of wireless sensor network,â€ IEEE Sens. J., vol. 14, no. 8, pp. 2658â€“2664, 2014.
W. H. Liao, Y. Kao, and Y. S. Li, â€œA sensor deployment approach using glowworm swarm optimization algorithm in wireless sensor networks,â€ Expert Syst. Appl., vol. 38, no. 10, pp. 12180â€“12188, 2011.
L. a Villas, D. L. Guidoni, R. B. Araujo, A. Boukerche, and A. a F. Loureiro, â€œA Scalable and Dynamic Data Aggregation Aware Routing Protocol for Wireless Sensor Networks,â€ 13th ACM Int. Conf. Model. Anal. Simul. Wirel. Mob. Syst., pp. 110â€“117, 2010.
B. G. Leroux, â€œStatistical methods for studying associations between variables,â€ no. 2, 1998.
The submitter hereby warrants that the Work (collectively, the “Materials”) is original and that he/she is the author of the Materials. To the extent the Materials incorporate text passages, figures, data or other material from the works of others, the undersigned has obtained any necessary permissions. Where necessary, the undersigned has obtained all third party permissions and consents to grant the license above and has all copies of such permissions and consents.
The submitter represents that he/she has the power and authority to make and execute this assignment. The submitter agrees to indemnify and hold harmless the COMPUSOFT from any damage or expense that may arise in the event of a breach of any of the warranties set forth above. For authenticity, validity and originality of the research paper the author/authors will be totally responsible.