EDAP: An Efficient Data-Gathering Protocol for Wireless Sensor Networks
by Arash Nasiri Eghbali, Nastooh Taheri Javan, Mehdi Dehghan
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 7, No. 1, 2011

Abstract: Directed Diffusion (DD) uses data aggregation to suppress data overhead however there is no guarantee that paths from nearby sources join after a few hops. In this paper, an efficient data-gathering protocol (EDAP) is proposed to address this problem by using a Virtual Sink (VS) node nearby the sources, which plays the role of sink node and broadcasts local interest messages and routes gathered data toward destination. Also, multiple paths are constructed between VS and the sink node, which leads to load-balancing, and increase in the lifetime of the network. Simulation results show that in EDAP a significant amount of energy can be saved and the network lifetime will be increased considerably.

Online publication date: Fri, 31-Dec-2010

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