A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
A Survey of Energy Efficient Network Protocols for Wireless Networks
Wireless Networks
A probabilistic analysis for the range assignment problem in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Introduction to Algorithms
Power Consumption in Packet Radio Networks (Extended Abstract)
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication
IEEE Transactions on Parallel and Distributed Systems
Cooperative communication in wireless networks
IEEE Communications Magazine
Optimizing energy consumption of data flow in mobile ad hoc wireless networks
WSEAS Transactions on Computers
On the resilient overlay topology formation in multi-hop wireless networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Cooperative bridges: topology control in cooperative wireless ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Energy-efficient cooperative data aggregation for wireless sensor networks
Journal of Parallel and Distributed Computing
Energy-balanced cooperative routing in multihop wireless networks
Wireless Networks
Topology Control in Cooperative Ad Hoc Wireless Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.02 |
In this paper, we address the Topology control with Cooperative Communication (TCC) problem in ad hoc wireless networks. Cooperative communication is a novel model introduced recently that allows combining partial messages to decode a complete message. The objective of the TCC problem is to obtain a strongly-connected topology with minimum total energy consumption. We show that the TCC problem is NP-complete and design two distributed and localized algorithms to be used by the nodes to set up their communication ranges. Both algorithms can be applied on top of any symmetric, strongly-connected topology to reduce total power consumption. The first algorithm uses a distributed decision process at each node that makes use of only 2-hop neighborhood information. The second algorithm sets up the transmission ranges of nodes iteratively, over a maximum of six steps, using only 1-hop neighborhood information. We analyze the performance of our approaches through extensive simulation.