Proceedings of the 2nd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks 2005
DOI: 10.1145/1089803.1089974
|View full text |Cite
|
Sign up to set email alerts
|

Pheromone-aided robust multipath and multipriority routing in wireless MANETs

Abstract: In this paper, we present an ant-based multipath routing protocol that considers both energy and latency. Energy efficiency is an important issue in mobile ad hoc networks (MANETs) since node energy supplies are stored in batteries. In order to increase the network lifetime it is important to maximize the minimum node energy along the path. As the network topology changes, failures may occur on active routes, resulting in the need for new route discoveries if only single routes per flow are maintained. Frequen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2006
2006
2016
2016

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(8 citation statements)
references
References 22 publications
0
7
0
Order By: Relevance
“…In [7] important multipath protocols are covered. In [8][9][10] [11] multipath is established explicitly for QoS support. Some of these also make a point of combining DiffServ and multipath routing.…”
Section: Related Workmentioning
confidence: 99%
“…In [7] important multipath protocols are covered. In [8][9][10] [11] multipath is established explicitly for QoS support. Some of these also make a point of combining DiffServ and multipath routing.…”
Section: Related Workmentioning
confidence: 99%
“…Actually, if a border has not been chosen by any ant, the pheromone value on it will take on exponential decline trend with iterative times as index [6]. After volatilization, pheromone will be left on borders passed by ants, the value of which is shown in (4).…”
Section: Colony Routing Strategymentioning
confidence: 99%
“…k on position i takes j as the next hop according to pseudorandom proportional rule, which is given out in (6). Here q is a random variable which obeys uniform distribution in [0,1], and q 0 (0 q 0 1) is a parameter.…”
Section: Routing Constructionmentioning
confidence: 99%
“…The choice of allocation granularity is important in traffic allocation. The allocation [7] granularity specifies the smallest unit of information allocated to each path. For instance, a per-connection granularity would allocate all traffic for one connection to a single path.…”
Section: Traffic Allocationmentioning
confidence: 99%