Distributed Algorithms for Maximizing Lifetime of WSNs with Heterogeneity and Adjustable Sensing Range for Different Deployment Strategies

Full Text (PDF, 640KB), PP.101-108

Views: 0 Downloads: 0


Samayveer Singh 1,* Ajay K Sharma 2

1. Department of Computer Engineering, Netaji Subhas Institute of Technology, New Delhi, India

2. Department of Computer Science and Engineering, National Institute of Technology, Jalandhar, Punjab, India

* Corresponding author.

DOI: https://doi.org/10.5815/ijitcs.2013.08.10

Received: 7 Nov. 2012 / Revised: 25 Feb. 2013 / Accepted: 20 Apr. 2013 / Published: 8 Jul. 2013

Index Terms

Energy Efficiency, Heterogeneity, Lifetime, Deployment


Focus of this paper is on energy heterogeneity and distributed algorithms for scheduling and adjustable range. The problem of lifetime enhancement of wireless sensor networks is dealt with the adjustment of transmission or sensing range of the sensor nodes and implementation of heterogeneous energy model. In this work, we deploy the sensor nodes in 2-D using triangular, square, and hexagonal tiles. The initial energies of the sensors and their positions along with the positions of targets are known. For this environment, we investigate the maximum achievable lifetime using heterogeneous deterministic energy efficient protocol with adjustable sensing range (HADEEPS) and heterogeneous load balancing protocol with adjustable sensing range (HALBPS). We observe that deploying the sensors in triangular tiles gives better lifetime.

Cite This Paper

Samayveer Singh, Ajay K Sharma, "Distributed Algorithms for Maximizing Lifetime of WSNs with Heterogeneity and Adjustable Sensing Range for Different Deployment Strategies", International Journal of Information Technology and Computer Science(IJITCS), vol.5, no.8, pp.101-108, 2013. DOI:10.5815/ijitcs.2013.08.10


[1]M. Cardei, J. Wu, and M. Lu, “Improving network lifetime using sensors with adjustable sensing ranges,” Int. Journal of Sensor Networks, (IJSNET), 2006, 1(2).

[2]M. Cardei, J. Wu, N. Lu, and M.O. Pervaiz, “Maximum Network Lifetime with Adjustable Range”, IEEE Int. Conf. on Wireless and Mobile Computing, Networking and Communications (WiMob’05), Aug. 2005. 

[3]P. Berman, G. Calinescu, C. Shah, and A. Zelikovsky, “Power efficient monitoring management in sensor networks,” Wireless Communications and Networking Conf. (WCNC), 2004, vol.4, pp. 2329–2334.

[4]P. Berman, G. Calinescu, C. Shah and A. Zelikovsky, “Power Efficient Monitoring Management in Sensor Networks,” IEEE Wireless Communication and Networking Conf. (WCNC’04), Atlanta, March 2004, pp. 2329-2334.

[5]D. Brinza, And A. Zelikovsky, “DEEPS: Deterministic Energy-Efficient Protocol for Sensor networks”, ACIS International Workshop on Self-Assembling Wireless Networks (SAWN’06), Proc. Of SNPD, 2006, pp. 261-266.

[6]A. Dhawan, C. T. Vu, A. Zelikovsky, Y. Li, and S. K. Prasad, “Maximum Lifetime of Sensor Networks with Adjustable Sensing Range,” 2nd ACIS Int. Workshop on Self assembling Wireless Networks, (SAWN 2006), Las Vegas, NV, 2006, June 19-20.

[7]M. Cardei, M.T. Thai, Y. Li, and W. Wu, “Energy-efficient target coverage in wireless sensor networks”, In Proc. Of IEEE Infocom, 2005.

[8]S. K. Prasad and A. Dhawan, “Distributed Algorithms for lifetime of Wireless Sensor Networks Based on Dependencies Among Cover Sets”. In Proceedings of the 14th Int. Conf. on High Performance Computing, Springer, 2007, pp. 381-392.

[9]A. Dhawan and S. K. Prasad, “A Distributed Algorithmic Framework for Coverage Problems in Wireless Sensor Networks”. In Proceedings of the 22nd IEEE Parallel and Distributed Processing Symposium, 2008.

[10]A. Dhawan, and S. K. Prasad, “Energy efficient distributed algorithms for sensor target coverage based on properties of an optimal schedule,” HiPC: 15th Int. Conf. on High Performance Computing, LNCS 5374, 2008.

[11]A. Dhawan, “Maximizing the Lifetime of Wireless Sensor Networks”, Physical Sciences, Engineering and Technology, Wireless Sensor Networks / Book 1”, 2012, ISBN 979-953-307-825-9.

[12]J. Lu, and T. Suda, “Coverage-aware self-scheduling in sensor networks,” 18th Annual Workshop on Computer Communications (CCW) 2003, pp. 117–123.

[13]J. W. Huang, C. M. Hung , K. C. Yang and J. S. Wang, “Energy-efficient probabilistic target coverage in wireless sensor networks,” 17th IEEE Int. Conf. on Networks (ICON), Singapore, 2011, 14-16 Dec. 2011, pp. 53 – 58.

[14]M. Khan, G. Pandurangan and B. Bhargava, “Energy-Efficient Routing Schemes for Sensor Networks”, Technical Report, West Lafayette, IN 47907 CSD TR #03-013, May 2003.

[15]M. Khan, G. Pandurangan and B. Bhargava, “Energy-Efficient Routing Schemes for Wireless Sensor Networks”, Technical Report, CSD TR 03-013, Department of Computer Science, Purdue University, July 2003.

[16]E. S. Biagioni and G. Sasaki, “Wireless Sensor Placement for Reliable and Efficient Data Collection,” hicss, 36th Annual Hawaii Int. Conf. on System Sciences (HICSS’03), 2003, vol. 5, pp.127b.

[17]D. Kumar, T. S. Aseri, and R. B. Patel, “EEHC: Energy efficient heterogeneous clustered scheme for wireless sensor networks”, Int. Journal of Computer Communications, Elsevier, 2009, 32(4): 662-667.

[18]Y. Mao, Z. Liu, L. Zhang, and X. Li, “An Effective Data Gathering Scheme in Heterogeneous Energy Wireless Sensor Networks,” Int. Conf. on Computational Science and Engineering, 2009, vol. 1, pp.338-343.

[19]D. Kumar, T. S. Aseri, and R.B Patel “EECHE: Energy-efficient cluster head election protocol for heterogeneous Wireless Sensor Networks,” in Proceedings of ACM Int. Conf. on Computing, Communication and Control-09 (ICAC3’09), Bandra, Mumbai, India, 23-24 Jan. 2009, pp. 75-80.

[20]A. Dhawan, “Distributed Algorithms for Maximizing the Lifetime of Wireless Sensor Networks”, Doctor of Philosophy, Dissertation Under the direction of S. K. Prasad, December 2009, Georgia State University, Atlanta, Ga 30303.