Data networks
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
A cone-based distributed topology-control algorithm for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Fault tolerant deployment and topology control in wireless ad hoc networks: Research Articles
Wireless Communications & Mobile Computing - Performance Evaluation of Wireless Networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Antenna interconnection strategies for personal communication systems
IEEE Journal on Selected Areas in Communications
Deploying sensor networks with guaranteed fault tolerance
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Many topology control algorithms aim to minimize energy consumption, interference, etc. while maintaining connectivity among the nodes. Links are realized between nodes by proper adjustment of transmission power in each node. However, a link is not useful if its bandwidth is lower than what is required by the applications it supports. Therefore, topology control algorithms should also consider the minimum realizable link bandwidth when generating topologies. As the realizable bandwidth of a link depends on the amount of interference received, interference analysis must be carried out. We study the minimum realizable link bandwidth of a given network under a TDMA/TDD channel sharing mechanism. We carried out the interference analysis assuming the general multi-sectored antenna configuration, since an omni-directional antenna can be visualized as a special configuration of a sectorized antenna (i.e. with 1 sector). We then proceed to derive the transmission power to be used in each sector of all nodes in the network to maximize average channel utilization. However, a brute-force method that runs through all possible topologies takes exponential time. We thus propose an algorithm, iMST, that attempts to maximize average channel utilization by reducing interference. The iMST algorithm not only generates k-edge-connected networks, but also guarantees minimum link bandwidth. Although iMST requires global knowledge of the locations of nodes, by using a distributed MST generation method, iMST can be run in a distributed manner. The iMST scheme is evaluated and compared against a modified Fault-tolerant Cone-Based Topology Control (FCBTC) scheme, referred to as s-FCBTC, that works with sectorized antennas, on a few performance metrics: average channel utilization, network diameter, minimum link bandwidth and edge-connectedness, where edge-connectedness is a new metric defined in this paper. The iMST scheme is shown to exhibit good performance in many of these performance metrics.