2009 IEEE Symposium on Intelligent Agents 2009
DOI: 10.1109/ia.2009.4927501
|View full text |Cite
|
Sign up to set email alerts
|

Agent Based Multipath Routing in wireless sensor networks

Abstract: Abstract-recently, mobile agents have been used to solve many problems in wireless sensor networks. Agents are usually transferred from a node to another to aggregate the sensed data and simplify the complexity of the routing algorithms. Intelligent agents can reduce the communication cost over a very low bandwidth links among the sensors. However, agents are still new to sensor networks. Small numbers of the research papers have been published in such area. In this paper, we propose an Agent Based Multipath R… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 18 publications
(5 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…This section deals with the second solution developed for the deployment problem, the ACO technique. In ACO [22][23][24], to find a solution to the deployment problem, ants build solutions incrementally by walking randomly through a connected graph G(P,E), where P denotes the set of the deployment points and E represents a set of all undirected links connecting the deployment points and the sink node. To construct a solution to the deployment problem, each ant k starts its tour at each mobile node location and then consecutively builds the connected covers through transitioning among the deployment points in the construction graph.…”
Section: Ant Colony Optimization Based Solutionmentioning
confidence: 99%
“…This section deals with the second solution developed for the deployment problem, the ACO technique. In ACO [22][23][24], to find a solution to the deployment problem, ants build solutions incrementally by walking randomly through a connected graph G(P,E), where P denotes the set of the deployment points and E represents a set of all undirected links connecting the deployment points and the sink node. To construct a solution to the deployment problem, each ant k starts its tour at each mobile node location and then consecutively builds the connected covers through transitioning among the deployment points in the construction graph.…”
Section: Ant Colony Optimization Based Solutionmentioning
confidence: 99%
“…Multi-path-based data aggregation techniques (Vidhyapriya & Vanathi, 2007;Ramadan, 2009) build multiple paths among sensor nodes for data transmission and data aggregation. In these techniques, one node sends its data to multiple neighbors instead of one neighbor.…”
Section: Multi-path-based Data Aggregation Techniquesmentioning
confidence: 99%
“…This protocol provides reliability and low energy consumption. Agent based multipath routing presented in [33] which describe the use of agents to reduce the complexity in routing technique. The agents also reduce the communication cost.…”
Section: Related Workmentioning
confidence: 99%
“…The proposed scheme is compared with an existing basic DV-hop localization scheme and agent based multipath routing scheme [33]. In this section we describe the simulation model, performance parameters and result analysis.…”
Section: Simulationmentioning
confidence: 99%