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
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Analysis on the redundancy of wireless sensor networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Throughput and energy efficiency in topology-controlled multi-hop wireless sensor networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Geometrically aware communication in random wireless networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Topology Control of Ad Hoc Wireless Networks for Energy Efficiency
IEEE Transactions on Computers
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Mobility-Sensitive Topology Control in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Joint power minimization in wireless relay channels
Proceedings of the 2006 international conference on Wireless communications and mobile computing
An energy-optimal algorithm for neighbor discovery in wireless sensor networks
Mobile Networks and Applications
Energy-aware routing in sensor networks: A large system approach
Ad Hoc Networks
The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Range assignment problem on the Steiner tree based topology in ad hoc wireless networks
Mobile Information Systems - Advances in Wireless Networks
An SPT-based topology control algorithm for wireless ad hoc networks
Computer Communications
Fault tolerant interference-aware topology control for ad hoc wireless networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Distributed energy-efficient hierarchical clustering for wireless sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Fault-tolerant power-aware topology control for ad-hoc wireless networks
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
Given a set of wireless network nodes N, 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| &agr; + c for a real constant 2 ≤ &gr;≤4 and c & 0. The minimum power topology Gm is the smallest subgraph of Gt that contains the shortest paths between all pairs of nodes. We described a distributed position-based networking protocol to construct the enclosure graph Ge, which is an approximation of Gm. The total communication complexity is O(n). Let dG(u) be the degree of node u in a graph G. The time complexity of each node u is O (dGt)). The space required at each node is O(dGt (u. This improves the previous result that approximates GmO(dGt(u)3) time using O(dGt(u2) 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 network.