Energy-Efficient Broadcasts in Wireless Sensor Networks with Multiple Virtual Channels

Multichannel solutions are increasingly used to cope with the problem of low capacity in sensor networks resulting from high contention during wake-up periods of nodes. We can consider wake-up schedules as virtual channels, because nodes using different schedules cannot communicate with each other. In this paper, we show that multiple virtual channel solutions come at the cost of an increased energy consumption in broadcasts. We analyze the problem of broadcasting over multiple virtual channels under different classes of MAC methods and propose Clustered Virtual Channels (CVC), a new network structure that limits the number of frames needed for maintaining multiple virtual channels synchronized. Our simulation results show that CVC reduces the cost of maintaining synchronization and increases capacity while making all types of broadcasts possible.

[1]  Koen Langendoen,et al.  Crankshaft: An Energy-Efficient MAC-Protocol for Dense Wireless Sensor Networks , 2007, EWSN.

[2]  Anish Arora,et al.  O-MAC: A Receiver Centric Power Management Protocol , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[3]  Johannes H. Hattingh,et al.  On weakly connected domination in graphs , 1997, Discret. Math..

[4]  John S. Heidemann,et al.  Ultra-low duty cycle MAC with scheduled channel polling , 2006, SenSys '06.

[5]  Koen Langendoen,et al.  Energy-Efficient Medium Access Control , 2005, Embedded Systems Handbook.

[6]  Andrea Vitaletti,et al.  Localized Techniques for Broadcasting in Wireless Sensor Networks , 2007, Algorithmica.

[7]  Youngmin Kim,et al.  Y-MAC: An Energy-Efficient Multi-channel MAC Protocol for Dense Wireless Sensor Networks , 2008, 2008 International Conference on Information Processing in Sensor Networks (ipsn 2008).

[8]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[9]  W GrossmanJerrold,et al.  On weakly connected domination in graphs , 1997 .