An Efficient Agent Based Rumor Propagation for Wireless Sensor Networks

An Efficient Agent Based Rumor Propagation for Wireless Sensor Networks

Leila Kheroua (Université des Sciences et de la Technologie Houari Boumediene (USTHB), Algeria), Samira Moussaoui (Université des Sciences et de la Technologie Houari Boumediene (USTHB), Algeria) and Louiza Mansour (Université des Sciences et de la Technologie Houari Boumediene (USTHB), Algeria)
DOI: 10.4018/ijmtie.2011040105
OnDemand PDF Download:
No Current Special Offers


In the context of Wireless Sensor Networks (WSNs), in this paper, the authors present a new agent based routing protocol named Fast Rumor Agents protocol (FRA). The FRA protocol optimizes the agent (respectively the query) propagation through the network preventing backward paths. With FRA, a rumor must have a straight trajectory, reducing the total overhead of the network. Performances comparisons of ZRR and FRA protocols show that the main contributions of FRA protocol are the reduction of time of path establishment, the overhead caused in the network, and consequently, the energy consumption.
Article Preview

1. Introduction

A wireless sensor network is a collection of sensor nodes (small sensing devices) and a sink node connected through wireless channels. These small devices can be used for building distributed systems for data collection and processing (Wang, Cao, Li, & Dasi, 2008). Nodes in wireless sensor networks have restricted storage, computational and energy capacity. The network as a hole is characterized by a limited life time due to the energy constraint. Generally, the sensor nodes detect events, performed desired measurements, process the measured data and transmit it to the sink node (Chalak, Sivaraman, Aydin, & Turgut, 2006). However, nodes may also generate queries to find events or locate data and services they are interested in within the network (Banka, Tandon, & Jayasumana, 2005; Zhang, Yu, Zhou, Lin, & Li, 2009). Sensor networks are suitable for data collection within regions that human beings are unable or hard to reach, for example, battle fields reconnaissance, disaster (such as earthquake, fire, etc), and areas monitoring (Yu, Chen, Wu, & Jin, 2008). Other examples applications include health monitoring, intelligent building, etc. (Wang, Cao, Li, & Dasi, 2008).

Routing protocols in wireless sensor networks have to ensure good performances in terms of energy consumption, scalability and increasing network life time. Different routing and dissemination protocols were proposed for wireless sensor networks. Flooding was one of the earliest mechanisms used in routing and dissemination protocols. In Intanagonwiwat, Govindan, and Estrin (2000) flooding events and queries is used to find the shortest path, but more power consuming and bandwidth was generated as a result of broadcasting storm.

To preserve energy consumption, routing algorithms with mobile agents seems to be more suitable for wireless sensor networks (Braginsky & Estrin, 2002; Banka, Tandon, & Jayasumana, 2005). Instead of flooding technique, agents may be used to spread environmental and request information. They can cooperate to build optimal paths leading to events and queries. The problem with the agent based routing protocols, especially in environments with no geographical localisation systems, is the spiral like routing paths and the non uniform distribution of agents in the network. The proposed Fast Rumor Agent protocol is designed to fix the spiral like routing path problem. In FRA protocol, a new agent propagation approach is introduced, allowing a fast agent transfer between nodes in the network.

Our propagation approach allows agents finding new zones and avoids coming back to the neighborhood visited zones which saves energy and time during path establishment.

The rest of this paper is organized as follows: Section 2 discusses related researches on agent propagation for routing in wireless sensor networks. The proposed FRA protocol is introduced in Section 3. Section 4 presents comparison and scalability results of the proposed FRA protocol, while Section 5 concludes the paper.

Complete Article List

Search this Journal:
Open Access Articles
Volume 7: 2 Issues (2018)
Volume 6: 2 Issues (2017)
Volume 5: 2 Issues (2015)
Volume 4: 2 Issues (2014)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing