Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A survey of routing techniques for mobile communications networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Sparse Power Efficient Topology for Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Load balanced routing protocols for ad hoc mobile wireless networks
IEEE Communications Magazine
DEAR: a device and energy aware routing protocol for heterogeneous ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
Improved approximation results for the minimum energy broadcasting problem
Proceedings of the 2004 joint workshop on Foundations of mobile computing
The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Improved schemes for power-efficient broadcast in ad hoc networks
International Journal of High Performance Computing and Networking
Minimal energy path planning for wireless robots
Proceedings of the 1st international conference on Robot communication and coordination
A two-level topology control strategy for energy efficiency in wireless sensor networks
International Journal of Wireless and Mobile Computing
Minimal Energy Path Planning for Wireless Robots
Mobile Networks and Applications
Clustering mesh-like wireless sensor networks with an energy-efficient scheme
International Journal of Sensor Networks
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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 ||uv||α + c for a constant 2 ≤ α ≤ 5 and c 0. 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 Ge, which is an approximation of Gm. The time complexity of each node u is O(min(dGt (u)dGe (u), dGt (u) log dGt (u))), where dG (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(dGt (u)). This improves the previous result that computes Gm in O(dGt (u)3) time using O(dGt (u)2) spaces. We also show that the average degree dGe (u) is usually a constant, which is at most 6. Our result is first developed for stationary network and then extended to mobile networks.