Constructing minimum energy mobile wireless networks
ACM SIGMOBILE Mobile Computing and Communications Review
Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Dominating Set Based Bluetooth Scatternet Formation with Localized Maintenance
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Exposing resource tradeoffs in region-based communication abstractions for sensor networks
ACM SIGCOMM Computer Communication Review
Localized algorithms for energy efficient topology in wireless ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
SPT-based topology algorithm for constructing power efficient wireless ad hoc networks
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Constant density spanners for wireless ad-hoc networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Localized Topology Control for Unicast and Broadcast in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Multibeam Antenna-Based Topology Control with Directional Power Intensity for Ad Hoc Networks
IEEE Transactions on Mobile Computing
Localized topology control for heterogeneous wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
Mobile Networks and Applications
Localized algorithms for energy efficient topology in wireless ad hoc networks
Mobile Networks and Applications
Using logical neighborhoods to enable scoping in wireless sensor networks
Proceedings of the 3rd international Middleware doctoral symposium
ATPC: adaptive transmission power control for wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Geometric spanners with applications in wireless networks
Computational Geometry: Theory and Applications
Handling asymmetry in power heterogeneous ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Programming sensor networks using abstract regions
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Scalable multicasting with network-aware geometric overlay
Computer Communications
Energy-efficient topology control for three-dimensional sensor networks
International Journal of Sensor Networks
Self-organizing fault-tolerant topology control in large-scale three-dimensional wireless networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Brief announcement: minimum spanning trees and cone-based topology control
Proceedings of the 28th ACM symposium on Principles of distributed computing
Bluetooth scatternet formation: A survey
Ad Hoc Networks
An SPT-based topology control algorithm for wireless ad hoc networks
Computer Communications
Approximate MST for UDG locally
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
DNIS'07 Proceedings of the 5th international conference on Databases in networked information systems
Energy and mobility-aware topology control in heterogeneous mobile ad hoc networks
International Journal of Computational Science and Engineering
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Programming wireless sensor networks: Fundamental concepts and state of the art
ACM Computing Surveys (CSUR)
Undirected connectivity of sparse Yao graphs
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Sensor networks: distributed algorithms reloaded – or revolutions?
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Infrastructure-establishment from scratch in wireless sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Spanners, weak spanners, and power spanners for wireless networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Half-space proximal: a new local test for extracting a bounded dilation spanner of a unit disk graph
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Efficient topology control scheme for wireless ad-hoc networks
International Journal of Computational Intelligence Studies
| Hi-index | 0.00 |
Due to the nodes' limited resource in the wireless ad hoc networks, the scalability is crucial for network operations. One effective approach is to maintain only a linear number of links. However, this sparseness should not compromise too much on the power consumptions on communications such as unicasting, or multicasting. For any topology $G$, its unicasting power stretch factor is defined as the maximum ratio of the minimum power needed to support any link in $G$ to the least necessary. We consider a wireless ad hoc network consisting of a set of nodes $V$ distributed in a two-dimensional plane modeled by the unit disk graph. We consider several well-known proximity graphs including relative neighborhood graph, Gabriel graph and Yao graph and their combinations for constructing the wireless network topology. These graphs are sparse and can be constructed locally in an efficient way. Notice that all of these graphs do not have constant degrees. We present some new algorithms to construct a sparse and power efficient topology. We conduct experiments to show that the unicasting power stretch factor is also very small practically. We also show how to combine the Yao graph structure, the Gabriel graph structure to increase the sparseness of the topology without affecting the power efficiency of the constructed network.