TY - GEN
T1 - WCDS-induced routing for data-aggregation in wireless sensor networks
AU - Chakchouk, Nesrine
AU - Hamdaoui, Bechir
AU - Frikha, Mounir
PY - 2009
Y1 - 2009
N2 - Wireless sensor networks (WSNs) are often deployed in harsh environments with little human control, thereby necessitating self organizing and maintenance mechanisms for medium sharing and data routing. Moreover, since sensor nodes operate on energy-limited batteries, designing energy-efficient routing techniques that extend the network lifetime is of a paramount importance. In this paper, we propose WCDS-DCR, a fully distributed, data-centric, routing technique that makes use of an underlying clustering structure induced by the construction of WCDS (Weakly Connected Dominating Set) to prolong network lifetime. WCDSDCR aims at extending network lifetime through the use of data aggregation (based on the elimination of redundant data packets) by some particular nodes. It also utilizes both the energy availability information and the distances (in number of hops) from sensors to the sink in order to make hop-by-hop, energy-aware, routing decisions. Simulation results show that our solution is scalable, and outperforms existing schemes in terms of network lifetime.
AB - Wireless sensor networks (WSNs) are often deployed in harsh environments with little human control, thereby necessitating self organizing and maintenance mechanisms for medium sharing and data routing. Moreover, since sensor nodes operate on energy-limited batteries, designing energy-efficient routing techniques that extend the network lifetime is of a paramount importance. In this paper, we propose WCDS-DCR, a fully distributed, data-centric, routing technique that makes use of an underlying clustering structure induced by the construction of WCDS (Weakly Connected Dominating Set) to prolong network lifetime. WCDSDCR aims at extending network lifetime through the use of data aggregation (based on the elimination of redundant data packets) by some particular nodes. It also utilizes both the energy availability information and the distances (in number of hops) from sensors to the sink in order to make hop-by-hop, energy-aware, routing decisions. Simulation results show that our solution is scalable, and outperforms existing schemes in terms of network lifetime.
KW - Clustering
KW - Data aggregation
KW - Energy-aware routing
KW - Sensor networks
UR - http://www.scopus.com/inward/record.url?scp=77949393827&partnerID=8YFLogxK
U2 - 10.1109/COMNET.2009.5373558
DO - 10.1109/COMNET.2009.5373558
M3 - Conference contribution
AN - SCOPUS:77949393827
SN - 9781424451340
T3 - 2009 1st International Conference on Communications and Networking, ComNet 2009
BT - 2009 1st International Conference on Communications and Networking, ComNet 2009
T2 - 2009 1st International Conference on Communications and Networking, ComNet 2009
Y2 - 3 November 2009 through 6 November 2009
ER -