SERENA: an energy-efficient strategy to schedule nodes activity in wireless ad hoc and sensor networks

In wireless ad hoc and sensor networks, an analysis of the node energy consumption distribution shows that the largest part is due to the time spent in the idle state. This result is at the origin of SERENA, an algorithm to SchEdule RoutEr Nodes Activity. SERENA allows router nodes to sleep, while ensuring end-to-end communication in the wireless network. It is a localized and decentralized algorithm assigning time slots to nodes. Any node stays awake only during its slots and the slots assigned to its neighbors, it sleeps the remaining time. SERENA is based on distributed and localized two-hop coloring. The node's color is then mapped in time slot. Thus, each node is ensured to get at least one time slot, it also gets additional time slots proportionally to its traffic rate. Such a solution adapts to varying traffic rates and supports late node arrivals. A performance evaluation allows us to compare SERENA coloring algorithm with existing ones such as DLF, both in terms of number of colors and complexity. Simulation results show that SERENA enables us to maximize network lifetime while increasing the number of user messages delivered. We quantify the slot reuse and evaluate the impact of the frame size on network performance. We then study how to dimension buffers at the router nodes. Finally, we show how SERENA improves the node energy consumption distribution and maximizes the energy efficiency of wireless ad hoc and sensor networks.

[1]  Marek Kubale,et al.  A better practical algorithm for distributed graph coloring , 2002, Proceedings. International Conference on Parallel Computing in Electrical Engineering.

[2]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[3]  Natalija Vlajic,et al.  Near-Optimal Node Clustering in Wireless sensor Networks for Environment Monitoring , 2006, 21st International Conference on Advanced Information Networking and Applications (AINA '07).

[4]  David Simplot-Ryl,et al.  Energy-efficient area monitoring for sensor networks , 2004, Computer.

[5]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

[6]  Wendi B. Heinzelman,et al.  Adaptive protocols for information dissemination in wireless sensor networks , 1999, MobiCom.

[7]  Fikret Sivrikaya,et al.  Contention-Free MAC Protocols for Wireless Sensor Networks , 2004, DISC.

[8]  Guy Pujolle,et al.  Energy efficient routing in wireless ad hoc networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[9]  Jianliang Xu,et al.  Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[10]  Pascale Minet,et al.  A comparative study of energy efficient routing strategies based on OLSR , 2007 .

[11]  J. J. Garcia-Luna-Aceves,et al.  A new approach to channel access scheduling for Ad Hoc networks , 2001, MobiCom '01.

[12]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[13]  Adam Nadolski,et al.  Distributed Largest-First Algorithm for Graph Coloring , 2004, Euro-Par.

[14]  Jie Wu,et al.  Topology control in ad hoc wireless networks with hitch-hiking , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[15]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  Sébastien Tixeuil,et al.  A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks , 2004, ALGOSENSORS.

[17]  Alessandro Panconesi,et al.  An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms , 2002, SODA '02.

[18]  Adrian Kosowski,et al.  On Greedy Graph Coloring in the Distributed Model , 2006, Euro-Par.

[19]  Pascale Minet,et al.  Scalability of the OLSR Protocol with the Fish Eye Extension , 2007, Sixth International Conference on Networking (ICN'07).

[20]  Konstantinos Kalpakis,et al.  MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS , 2002 .

[21]  Ness B. Shroff,et al.  Energy-Efficient Interference-Based Routing for Multi-Hop Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[22]  Eytan Modiano,et al.  Minimum energy disjoint path routing in wireless ad-hoc networks , 2003, MobiCom '03.

[23]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[24]  Pascale Minet,et al.  Evaluation of the Energy Consumption in MANET , 2006, ADHOC-NOW.

[25]  Jürgen Peemöller,et al.  A correction to Brelaz's modification of Brown's coloring algorithm , 1983, CACM.

[26]  Jing Luo,et al.  Reliable Energy Aware Routing In Wireless Sensor Networks , 2006, Second IEEE Workshop on Dependability and Security in Sensor Networks and Systems.

[27]  Katia Obraczka,et al.  Energy-efficient, application-aware medium access for sensor networks , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[28]  Martin Nilsson,et al.  Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[29]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[30]  Katia Obraczka,et al.  Energy-efficient collision-free medium access control for wireless sensor networks , 2003, SenSys '03.

[31]  Roger Wattenhofer,et al.  On the complexity of distributed graph coloring , 2006, PODC '06.

[32]  Öjvind Johansson.  Simple Distributed Delta+1-coloring of Graphs , 1999, Inf. Process. Lett..

[33]  Jan M. Rabaey,et al.  Energy aware routing for low energy ad hoc sensor networks , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[34]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .