Wireless information networks
Channel access scheduling in Ad Hoc networks with unidirectional links
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
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
Routing performance in the presence of unidirectional links in multihop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
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
Interference temperature: a metric for dynamic spectrum utilization
International Journal of Network Management
Decentralised topology control algorithms for connectivity of distributed wireless sensor networks
International Journal of Sensor Networks
A Prototyping Environment for Wireless Multihop Networks
AINTEC '07 Proceedings of the 3rd Asian conference on Internet Engineering: Sustainable Internet
Robust topology control for indoor wireless sensor networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
Analysis of k-Neigh topology control protocol for mobile wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Further work on network interference in wireless ad hoc networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
On the giant component in wireless multi-hop networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
A fully distributed node allocation scheme for partition protection in MANET
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Rayleigh fading networks: a cross-layer way
IEEE Transactions on Communications
K-connected-based WSN topology-control algorithm: K-connected-based topology algorithm LKETA
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
k+ Neigh: an energy efficient topology control for wireless sensor networks
SAMOS'07 Proceedings of the 7th international conference on Embedded computer systems: architectures, modeling, and simulation
Fast low degree connectivity of ad-hoc networks via percolation
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Hierarchical multicast routing scheme for mobile ad hoc network
HiPC'07 Proceedings of the 14th international conference on High performance computing
The price of ignorance: distributed topology control in cognitive networks
IEEE Transactions on Wireless Communications
A fully distributed node allocation scheme with partition protection for Mobile Ad Hoc Networks
Computer Communications
Self organization and self maintenance of mobile ad hoc networks through dynamic topology control
Architecting dependable systems VII
Interference minimum network topologies for ad hoc networks
Wireless Communications & Mobile Computing
| Hi-index | 0.00 |
Topology control, wherein nodes adjust their transmission ranges to conserve energy and reduce interference, is an important feature in wireless ad hoc networks. Contrary to most of the literature on topology control which focuses on reducing energy consumption, in this paper we tackle the topology control problem with the goal of limiting interference as much as possible, while keeping the communication graph connected with high probability. Our approach is based on the principle of maintaining the number of physical neighbors of every node equal to or slightly below a specific value k. As we will discuss in this paper, having a nontrivially bounded physical node degree allows a network topology with bounded interference to be generated. The proposed approach enforces symmetry on the resulting communication graph, thereby easing the operation of higher layer protocols. To evaluate the performance of our approach, we estimate the value of k that guarantees connectivity of the communication graph with high probability both theoretically and through simulation. We then define k-Neigh, a fully distributed, asynchronous, and localized protocol that uses distance estimation. k-Neigh guarantees logarithmically bounded physical degree at every node, is the most efficient known protocol (requiring 2n messages in total, where n is the number of nodes in the network), and relies on simpler assumptions than existing protocols. Furthermore, we verify through simulation that the network topologies produced by k-Neigh show good performance in terms of node energy consumption and expected interference.