Efficient Forwarding With Power Saving and Load Balancing In Wireless Sensor Networks

Efficient Forwarding With Power Saving and Load Balancing In Wireless Sensor Networks

Hanen Idoudi (National School of Computer Science, University of Manouba, Manouba, Tunisia)
DOI: 10.4018/jbdcn.2013040104
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Energy efficiency is still a challenging issue in wireless sensor networks (WSNs). Balancing nodes’ activities and duty cycling are efficient ways that could enhance WSN’s performances. In this paper the authors introduce a new asynchronous power saving mechanism that provides an adaptive duty cycle and a minimum overhead to achieve load balancing and energy saving. This mechanism relies on two basic functions: an asynchronous duty cycling for activity balancing and a lightweight geographic routing. Extensive simulations showed the effectiveness of the proposed approach in terms of residual energy, energy consumption balancing and packet delivery ratio.
Article Preview

WSN MAC protocols must utilize the hardware resources on a sensor node thoughtfully to save energy and prolong the network lifetime. Many researches have been carried out at this end. As mentioned earlier and illustrated in Figure 1, two general classes for sensor network MAC protocols exist: synchronous protocols and asynchronous or random protocols.

Figure 1.

Taxonomy of WSN MAC protocols

Scheduled MAC protocols attempt to organize sensor nodes so their communications occur in a predefined order (Akyildiz et al., 2002), while unscheduled protocols attempt to conserve energy by allowing sensor nodes to operate independently with a minimum of complexity.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 13: 2 Issues (2017)
Volume 12: 2 Issues (2016)
Volume 11: 2 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing