Deploying mobile cluster heads in wireless sensor network using heuristic protocol

https://doi.org/10.53730/ijhs.v6nS7.13128

Authors

  • N. Santhana Krishna Research Scholar, Department of Computer Science, AJK College of Arts and Science,Coimbatore, Tamilnadu - 641105, India
  • B. Suresh Kumar Assistant Professor, Department of Computer Science, AJK College of Arts and Science, Coimbatore, Tamilnadu - 641105, India

Keywords:

Wireless sensor network, Linear programming formulation, Optimization model Mobile base station, Greedy heuristic protocol, NetworkLifetime, LPP

Abstract

Exploiting mobile base stations in wireless sensor network increases longevity as it is very effective in dealing with the power hole problem. Mobile sinks are elements used to collect data from network sensors nodes. The movement of the sink eventually changes the sensors of a single hop which will prevent the formation of the hotspot thereby improving the life of the network to a critical level. In this paper we propose the Greedy Heuristic Protocol for Data Collection called GHPDC which selfishly selects energy-rich sites for a mobile channel. Apart from this the paper also proposes the formation of Linear Programming which enhances the station duration which will have a direct impact on prolonging the life of the network. The design of the system line takes into account the residual power of the sensor nodes to determine the amount of time for the base station to halt.

Downloads

Download data is not yet available.

References

Akyildiz, I.F., Su, W., Sankarasubramaniam, Y. and Cayirci, E., 2002. Wireless sensor networks: a survey. Computer networks, 38(4), pp.393-422.

J. Li, P. Mohapatra, “An analytical model for the energy hole problem in many-to-one sensor networks”, in: Vehicular Technology Conference, 2005.

Pradeepa, K., W. Regis Anne, and S. Duraisamy. "Design and implementation issues of clustering in wireless sensor networks." International Journal of Computer Applications 47.11,2012.

Shi, Y., &Hou, Y. T. (2012). Some fundamental results on base station movement problem for wireless sensor networks’, IEEE / ACM Transactions on Networking (TON), 20(4), pp. 1054-1067.

E. M. Saad, M. H. Awadalla, M. A. Saleh, H. Keshk, and R. R.Darwish, “A data gathering algorithm for a mobile sink in large scale sensor networks,” in Proceedings of the 4th International Conference on Wireless and Mobile Communications (ICWMC’08), pp. 207–213, IEEE, 2008.

X. Zhang, L. Zhang, G. Chen, and X. Zou, “Probabilistic path selection in wireless sensor networks with controlled mobility,” in Proceedings of the International Conference onWireless Communications Signal Processing, pp. 1–5, IEEE, 2009.

G. Xing, T. Wang, W. Jia, and M. Li, “Rendezvous design algorithms for wireless sensor networks with a mobile base station,” in Proceedings of the 9th ACM International Symposiumon Mobile Ad Hoc Networking and Computing (MobiHoc ’08), pp. 231–240, 2008.

Pradeepa, K., W. Regis Anne, and S. Duraisamy. "Improved sensor network lifetime using multiple mobile sinks: A new predetermined trajectory." In 2010 Second International conference on Computing, Communication and Networking Technologies, pp. 1-6. IEEE, 2010.

L. Chen, X. Jianxin, X. Peng, and X. Kui, “An energy-efficient and relay hop bounded mobile data gathering algorithm in wireless sensor networks,” International Journal of Distributed Sensor Networks, vol. 2015, Article ID 680301, 9 pages, 2015.

Y. Chen, X. Lv, S. Lu, and T. Ren, “A Lifetime Optimization Algorithm Limited by Data Transmission Delay and Hops for Mobile Sink-Based Wireless Sensor Networks,” Journal of Sensors, vol. 2017, Article ID 7507625, 11 pages, 2017.

Pradeepa, K., and S. Duraisamy. "Energy efficient positioning of mobile base stations to improve wireless sensor network lifetime." International Journal of Sensor Networks 20.2 (2016): 92-103.

Y. Chen, X. Lv, S. Lu, and T. Ren, “A Lifetime OptimizationAlgorithm Limited by Data Transmission Delay and Hopsfor Mobile Sink-Based Wireless Sensor Networks,” Journal ofSensors, vol. 2017, Article ID 7507625, 11 pages, 2017.

M. Mishra, K. Nitesh, and P. K. Jana, “A delay-bound efficient path design algorithm for mobile sink in wireless sensor networks,” in Proceedings of the 3rd International Conference onRecent Advances in Information Technology (RAIT ’16), pp. 72–77, IEEE, 2016.

C. Cheng and C. Yu, “Mobile data gathering with bounded relayin wireless sensor network,” IEEE Internet of Tings Journal, pp. 1–16, 2018.

C. Zhu, S. Wu, G. Han, L. Shu, and H. Wu, “A tree-cluster-based data-gathering algorithm for industrial WSNs with a mobile sink,” IEEE Access, vol. 3, no. 4, pp. 381–396, 2015.

J.-Y. Chang and T.-H. Shen, “An efcient tree-based power saving scheme for wireless sensor networks with mobile sink,”IEEE Sensors Journal, vol. 16, no. 20, pp. 7545–7557, 2016.

O. Jerew and K. Blackmore, “Estimation of hop count in multihop wireless sensor networks with arbitrary node density,”International Journal of Wireless and Mobile Computing, vol. 7,no. 3, pp. 207–216, 2014

Published

30-09-2022

How to Cite

Krishna, N. S., & Kumar, B. S. (2022). Deploying mobile cluster heads in wireless sensor network using heuristic protocol. International Journal of Health Sciences, 6(S7), 5279–5294. https://doi.org/10.53730/ijhs.v6nS7.13128

Issue

Section

Peer Review Articles