Analysis of Minimum-energy Path-preserving Graphs for Ad-hoc Wireless Networks *

Authors:
Ashikur Rahman;Mahmuda Ahmed;Shobnom Zerin
Affiliations:
Department of Computer Science and Engineering, BangladeshUniversity of Engineering and Technology, Dhaka-1000, Bangladesh;Department of Computer Science and Engineering, BangladeshUniversity of Engineering and Technology, Dhaka-1000, Bangladesh;Department of Computer Science and Engineering, BangladeshUniversity of Engineering and Technology, Dhaka-1000, Bangladesh
Venue:
Simulation
Year:
2009

Citing 6
Cited 0

Power-aware routing in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
MAC-assisted topology control for ad hoc wireless networks: Research Articles

International Journal of Communication Systems
Minimum energy mobile wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider ad-hoc wireless networks and the topology control problem defined as minimizing the amount of power needed to maintain connectivity. The issue boils down to selecting the optimum transmission power level at each node based on the position information of reachable nodes. Local decisions regarding the transmission power level induce a subgraph of the maximum powered graph Gmax in which edges represent direct reachability at maximum power. In this paper we propose an analysis for constructing minimum-energy path-preserving subgraphs of Gmax, i.e. subgraphs minimizing the energy consumption between node pairs. We also propose an algorithm for constructing subgraph of Gmax based on one-hop neighbor information. By presenting experimental results we show the effectiveness of our proposed algorithm.