Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
A Robust Interference Model for Wireless Ad-Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Reducing interference in ad hoc networks through topology control
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Minimizing interference in ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
On constructing low interference topology in multihop wireless sensor networks
International Journal of Sensor Networks
Constructing minimum-interference networks
Computational Geometry: Theory and Applications
Algorithmic models of interference in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Data structures for range minimum queries in multidimensional arrays
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Minimum edge interference in wireless sensor networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Minimizing interference for the highway model in wireless ad-hoc and sensor networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Minimizing interference of a wireless ad-hoc network in a plane
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
The capacity of wireless networks
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Reducing interference is one of the main challenges in wireless communication. To minimize interference through topology control in wireless sensor networks is a well-known open algorithmic problem. In this paper, we answer the question of how to minimize the average interference when a node is receiving a message. We assume the receiver-centric interference model where the interference on a node is equal to the number of the other nodes whose transmission ranges cover the node. For one-dimensional (1D) networks, we propose a fast polynomial exact algorithm that can minimize the average interference. For two-dimensional (2D) networks, we give a proof that the maximum interference can be bounded while minimizing the average interference. The bound is only related to the distances between nodes but not the network size. Based on the bound, we propose the first exact algorithm to compute the minimum average interference in 2D networks. Optimal topologies with the minimum average interference can be constructed through traceback in both 1D and 2D networks.