Title: EDARD: efficient data access based on rumour dissemination in wireless sensor networks

Authors: Kheroua Leila; Moussaoui Samira; Mansour Louiza

Addresses: Faculty of Electronic and Computing Science, Laboratory of Information System, USTHB, BP 32 Al Alia, B. Ezzouar, Algeria ' Faculty of Electronic and Computing Science, Laboratory of Information System, USTHB, BP 32 Al Alia, B. Ezzouar, Algeria ' Faculty of Electronic and Computing Science, Laboratory of Information System, USTHB, BP 32 Al Alia, B. Ezzouar, Algeria

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.

Keywords: data dissemination; data access time; rumour agents; forking agents; routing; wireless sensor networks; WSNs; rumour dissemination; wireless networks; data accessibility; query delivery rate; network traffic.

DOI: 10.1504/IJTMCC.2013.052526

International Journal of Trust Management in Computing and Communications, 2013 Vol.1 No.1, pp.73 - 84

Received: 02 Apr 2012
Accepted: 08 Jun 2012

Published online: 06 Mar 2013 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article