The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
Journal of the ACM (JACM)
Energy, congestion and dilation in radio networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
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
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Minimum Interference Planar Geometric Topology in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
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
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
Exact algorithms to minimize interference in wireless sensor networks
Theoretical Computer Science
Minimizing average interference through topology control
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Privacy analysis in mobile social networks: the influential factors for disclosure of personal data
International Journal of Wireless and Mobile Computing
An iterative algorithm for multi-user inference channel based on subspace projection
International Journal of Wireless and Mobile Computing
Hi-index | 0.00 |
In this paper, we study interference-efficient topology control for wireless sensor networks. A node is said to be interfered by communication link if it can receive a transmission transmissions which are not intended for it. We account for the number of communication links contributing interference to each node in the generated topology, and define such a number as the interference load of a node the maximum interference load among all node is then defined as the network interference load. The objective of the problem is find a connected topology which results in lower network interference load. We prove that this problem is NP hard and then. Our objective is to find a connected topology with lower interference load. We prove that finding a topology with minimum interference load is NP-hard and propose a heuristic algorithm, called Low Interference-Load Topology (LILT), to find a polynomial time solution to this problem. Simulation results show that LILT can significantly reduce the interference load in the resulting topology while not increasing the total interference load and the transmission range of each node.