The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
Journal of the ACM (JACM)
Introduction to algorithms
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Localized topology control algorithms for heterogeneous wireless networks
IEEE/ACM Transactions on Networking (TON)
On the Longest Edge of Gabriel Graphs in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
A survey on wireless multimedia sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
Delay-constraint topology control in wireless sensor networks format
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Topology control for delay-constraint data collection in wireless sensor networks
Computer Communications
A Locally-Adjustable Planar Structure for Adaptive Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Adaptive Topology Control for Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
Convergence rate control for distributed multi-hop wireless mesh networks
Computers and Electrical Engineering
| Hi-index | 0.00 |
Topology Control (TC) is one of the most important techniques used in wireless networks to obtain the desired network property. Most existing works with regard to TC focus on reducing energy consumption. Even though there are some works to consider delay in their resulting topologies, they do not consider the effect of radio interference on delay. Aiming at wireless sensor networks, we model a link delay as a function of the signal to interference noise ratio of the receiving node in this link and its packet forwarding time, and take a weight sum of delay and energy consumption as weight of edge (or link). The minimum weight sum of any edge can be solved by using the Get_min-cost_of_edge_(i,j) algorithm proposed in this paper. An Optimal Edge-cost Topology Control (OETC) algorithm is proposed to ensure that all approximate minimum-edge-cost paths exist in final topology. We also propose a Distributed Symmetric Link Maintenance (DSLM) algorithm to ensure that all links are symmetric in final topology if all links in original topology are symmetric. We prove that the communication complexity and computational complexity in OETC+DLSM are O(N"u) and O(N"e*N"u^2) respectively, where N"u denotes the number of any node u's neighbors and N"e denotes the times of executing the Get_min-cost_of_edge_(i,j) algorithm. Furthermore, we verify through simulation that the network topologies produced by OETC+DLSM show good performance in terms of expected average link delay and node hop-count while keeping average energy consumption at an acceptable level.