Distributed Adaptive Sleep Scheduling Algorithm for Enhancing Energy Efficiency in Wireless Sensor Networks based on L-PEDAP Protocol

Anand Nayyar


The research work presented in this paper introduces distributed adaptive sleep scheduling algorithm to increase performance on high density wireless sensor networks. It also re-computes routing tree spanning only with active nodes. The proposed works on top the existing work of Localized Power Efficient Data Aggregation Protocols (L-PEDAP), which is self organizing, robust and energy efficient data aggregation tree approach. The topologies adopted for the simulation environment are LMST and RNG. Both LMST and RNG work on approximate minimum spanning tree and efficiently compute energy metrics using only position or distance information of one-hop neighbors. The actual routing tree is constructed over these topologies. Different parent selection strategies are evaluated with the proposed scheme of sleep scheduler modes, while constructing a routing tree. Then compare each topology and parent selection strategy and conclude that the best among them is shortest path strategy over LMST structure. The proposed solution also involves route maintenance procedures that will be executed when a sensor node fails or a new node is added to the network. The proposed solution is also adapted to consider the remaining power levels of nodes in order to increase the network lifetime.


Wireless Sensor Networks; Data Aggregation; Power; Sleeping Schedule; L-PEDAP; Energy Efficiency;

Full Text:



J. Wu and I. Stojmenovic, “Ad hoc networks,” IEEE Computer, vol. 37, p. 29–31, 2004.

H. O¨ . Tan and I. Korpeoglu, “Power efficient data gathering and aggregation in wireless sensor networks.” SIGMOD Record, vol. 32, no. 4, pp. 66–71, 2003.

R. Prim, “Shortest Connecting Networks and Some Generalizations,” Bell Syst. Tech. J.,vol. 36, pp. 1389–1401, 1957.

N. Li, J. C. Hou, and L. Sha, “Design and analysis of an mst-based topology control algorithm.” in INFOCOM, 2003.

G. Toussaint, “The relative neighborhood graph of a finite planar set,” Pattern Recognition, vol. 12, pp. 231–268, 1980.

H. O. Tan, I. Korpeoglu, and I. Stojmenovic, “A dis-tributed and dynamic data gathering protocol for sensor networks,” in AINA ’07: Proceedings of the 21st Interna-tional Conference on Advanced Networking and Applications. Niagara Falls, CA: IEEE Computer Society, 2007, pp. 220–227.

J. Bachrach and C. Taylor, “Localization in sensor networks,” in Stojmenovic I, editor. Handbook of sensor networks: algorithms and architectures. Wiley, 2005, pp. 277–310.

J. Hightower and G. Borriello, “Location systems for ubiquitous computing,” Computer, vol. 34, no. 8, pp. 57–66, 2001.

W. R. Heinzelman, A. Chandrakasan, and H. Bala-krishnan, “Energy- Efficient communication protocol for wireless microsensor networks,” in 33rd Annual Hawaii International Conference on System Sciences,2000, pp. 3005 – 3014.

V. Rodoplu and T. Meng, “Minimum energy mobile wireless networks,” IEEE J. Select. Areas Commun., vol. 17, no. 8, pp. 1333 – 1344, Aug. 1999.

S. Singh, M. Woo, and C. S. Raghavendra, “Power-aware routing in mobile ad hoc networks,” in Mobile Computing and Networking, 1998, pp. 181–190.

I. Stojmenovic and X. Lin., “Power-aware localized routing in wireless networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122–1133, 2001.

J.-H. Chang and L. Tassiulas, “Energy conserving routing in wireless ad-hoc networks,” in IEEE INFOCOM 2000, March 2000, pp. 22–31.

J. Chang and L. Tassiulas, “Maximum lifetime rout-ing in wireless sensor networks,” in Proceedings of Ad-vanced Telecommunications and Information Distribu-tion Research Program, College Park, MD, 2000.

C. E. Perkins and E. M. Royer, “Ad-hoc on-demand distance vector routing,” Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applica-tions, p. 90, 1999.

C. Intanagonwiwat, R. Govindan, and D. Estrin, “Directed diffusion: a scalable and robust communication paradigm for sensor networks,” in Mobile Computing and Networking, 2000, pp. 56–67.

K. Kalpakis, K. Dasgupta, and P. Namjoshi, “Maxi-mum lifetime data gathering and aggregation in wireless sensor networks,” in Proceedings of the 2002 IEEE International Conference on Networking (ICN’02), August 2002, pp. 685–696.

S. Lindsey and C. S. Raghavendra, “Pegasis: Power-efficient gathering in sensor information systems,” in IEEE Aerospace Conference, March 2002.

C. Hua and T.-S. P. Yum, “Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks,” IEEE/ACM Trans. Netw., vol. 16, no. 4, pp. 892–903, 2008.

S. Upadhyayula and S. K. S. Gupta, “Spanning tree based algorithms for low latency and energy efficient data aggregation enhanced convergecast (dac) in wireless sensor networks,” Ad Hoc Netw., vol. 5, no. 5, pp. 626–648, 2007.


  • There are currently no refbacks.