The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Search and replication in unstructured peer-to-peer networks
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Routing in ad hoc mobile networks: on-demand and hierarchical strategies
Routing in ad hoc mobile networks: on-demand and hierarchical strategies
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Energy and delay-constrained routing in mobile ad hoc networks: an initial approach
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
New energy saving mechanisms for mobile ad-hoc networks using OLSR
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Routing in Ad Hoc Networks of Mobile Hosts
WMCSA '94 Proceedings of the 1994 First Workshop on Mobile Computing Systems and Applications
Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks
Journal of Discrete Algorithms
Hi-index | 0.00 |
This paper introduces two new metrics for assessment of mobile ad hoc network performance in terms of energy-time efficiency. The combined effect of both energy and time consumption is considered and represented in mathematical terms. The measures have demonstrated a number of advantages over the conventional ones in which the energy and time were often considered separately. The proposed new metrics are simple, generic and flexible. As an application, we have compared the energy-time efficiency of Blocking Expanding Ring Search (BERS) and Expanding Ring Search (ERS), two similar Time to Live (TTL)-based expanding ring search algorithms using our new metrics. The results show that the new metrics can be applied efficiently in assessment of different protocols.