EDARD: efficient data access based on rumour dissemination in wireless sensor networks
by Kheroua Leila; Moussaoui Samira; Mansour Louiza
International Journal of Trust Management in Computing and Communications (IJTMCC), Vol. 1, No. 1, 2013

Abstract: In this paper, we present a rumour dissemination protocol named: efficient data access based on rumour dissemination (EDARD). EDARD ensures an information uniform distribution to enhance data accessibility in wireless sensor networks. In EDARD, rumours (event occurrences) and queries (requests of information) are disseminated through trajectories as straight as possible preventing backward paths. The straitening trajectory - based on a selective next hop choice and the forking procedure introduced in EDARD protocol - has the objective to find data and establish paths to the source event in short delays with fewer transmissions. Simulation and comparison results show that EDARD protocol achieves improvements in terms of query delivery rate, data access time and network traffic.

Online publication date: Sat, 12-Jul-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 Trust Management in Computing and Communications (IJTMCC):
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