DMCA
Minimum energy mobile wireless networks revisited (2001)
Cached
Download Links
| Venue: | In IEEE International Conference on Communications (ICC |
| Citations: | 170 - 6 self |
BibTeX
@INPROCEEDINGS{Li01minimumenergy,
author = {Xiang-yang Li and Peng-jun Wan},
title = {Minimum energy mobile wireless networks revisited},
booktitle = {In IEEE International Conference on Communications (ICC},
year = {2001}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Energy conservation is a critical issue in designing wireless ad hoc networks, as the nodes are powered by batteries only. Given a set of wireless network nodes, the directed weighted transmission graph Gt has an edge uv if and only if node v is in the transmission range of node u and the weight of uv is typically defined as II,,vll + c for a constant 2 <_ t ~ < 5 and c> O. The minimum power topology Gm is the smallest subgraph of Gt that contains the shortest paths between all pairs of nodes, i.e., the union of all shortest paths. In this paper, we described a distributed position-based networking protocol to construct an enclosure graph G~, which is an approximation of Gin. The time complexity of each node u is O(min(dG ~ (u)dG ~ (u), dG ~ (u) log dG ~ (u))), where dc(u) is the degree of node u in a graph G. The space required at each node to compute the minimum power topology is O(dG ~ (u)). This improves the previous result that computes Gm in O(dG, (u) a) time using O(dGt(U) 2) spaces. We also show that the average degree dG,(u) is usually a constant, which is at most 6. Our result is first developed for stationary network and then extended to mobile networks. I.
Keyphrases
minimum energy mobile wireless network critical issue transmission range wireless network node energy conservation minimum power topology gm enclosure graph wireless ad hoc network distributed position-based networking protocol weighted transmission graph gt log dg minimum power topology time complexity average degree dg previous result stationary network edge uv
