Energy Efficient Expanding Ring Search

Authors:
Incheon Park;Ida Pu
Affiliations:
University of London, UK;University of London, UK
Venue:
AMS '07 Proceedings of the First Asia International Conference on Modelling & Simulation
Year:
2007

Citing 0
Cited 5

A Control Packet Minimized Routing Protocol for Ad-Hoc Wireless Networks

ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
An AIAD-Based Adaptive Routing Protocol in Ad-Hoc Wireless Networks

NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
Optimized ant based routing protocol for MANET

Proceedings of the 2011 International Conference on Communication, Computing & Security
Low-energy automated scheduling of computing resources

Proceedings of the 1st ACM/IEEE workshop on Autonomic computing in economics
Broadcast cancellation in search mechanisms

Proceedings of the 28th Annual ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Energy consumption is a major issue in designing protocols for Ad Hoc Wireless Networks due to battery constrains. This paper identifies the inefficient elements of expanding ring search protocol and proposes the new blocking expanding ring search approach which demonstrates substantial energy savings without an increase in route discovery latency.