Name
Abstract | ||
|---|---|---|
This paper investigates the energy–time efficiency of the Blocking Expanding Ring Search algorithms (BERS) using an extended
graph model. BERS is an energy efficient alternative that was developed recently based on the Expanding Ring Search (ERS).
ERS is widely applied in reactive routing protocols for mobile ad hoc networks. Most studies in this area focus on minimising
either energy consumption or search latency, but few look into the strong correlation between the energy saving and the increased
latency incurred. We analyse, in this study, the concurrency mechanism of BERS and have developed BERS*, an enhanced scheme
based on BERS. Our results show that, among the three schemes (BERS*, BERS and ERS), BERS* incurs the least latency when the
hop number of the route nodes is greater than 3, and has achieved the best performance in terms of energy–time efficiency
when the hop number of the route nodes is greater than 7. We have also discovered the conditions that allow collective optimisation
of BERS* and ERS. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s11786-010-0038-1 | Mathematics in Computer Science |
Keywords | Field | DocType |
energy efficient,routing protocol,mobile ad hoc network | Mobile ad hoc network,Search algorithm,Efficient energy use,Concurrency,Latency (engineering),Computer network,Hop (networking),Energy consumption,Mathematics,Routing protocol,Distributed computing | Journal |
Volume | Issue | ISSN |
3 | 4 | 1661-8270 |
Citations | PageRank | References |
5 | 0.45 | 9 |
Authors | ||
2 | ||