A load balancing data aggregation scheme for grid-based wireless sensor networks
by Neng-Chung Wang; Shih-Chien Chang
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 14, No. 4, 2013

Abstract: Wireless sensor networks (WSNs) consist of a large number of sensor nodes that are randomly deployed in a region of interest. In WSNs, sink mobility brings new challenges to large-scale sensor networks. Almost all of the energy-aware routing protocols that have been proposed for WSNs aim at optimising network performance while relaying data to a stationary sink. However, through such contemporary protocols, mobility of the sink can make established routes unstable. In this paper, a dual-tree-based data aggregation (DTDA) scheme for grid-based WSNs is proposed. The goal is to establish dual trees (a dual-tree) that have an approximate number of nodes for data aggregation. Simulation results show that the proposed DTDA minimises energy consumption and evenly distributes load to prolong network lifetime.

Online publication date: Wed, 01-Jan-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com