Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Analytical Studies of Energy–Time Efficiency of Blocking Expanding Ring Search

Analytical Studies of Energy–Time Efficiency of Blocking Expanding Ring Search 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematics in Computer Science Springer Journals

Analytical Studies of Energy–Time Efficiency of Blocking Expanding Ring Search

Pu, Ida; Shen, Yuji
Mathematics in Computer Science , Volume 3 (4) – Apr 15, 2010
Download PDF
14 pages

Loading next page...
 
/lp/springer-journals/analytical-studies-of-energy-time-efficiency-of-blocking-expanding-8TQnn0ngVv

References (21)

Publisher
Springer Journals
Copyright
Copyright © 2010 by Birkhäuser / Springer Basel AG
Subject
Mathematics; Mathematics, general; Computer Science, general
ISSN
1661-8270
eISSN
1661-8289
DOI
10.1007/s11786-010-0038-1
Publisher site
See Article on Publisher Site

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.

Journal

Mathematics in Computer Science – Springer Journals

Published: Apr 15, 2010

There are no references for this article.