Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
Introduction to Algorithms
Approximations for Steiner Trees with Minimum Number of Steiner Points
Journal of Global Optimization
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Virtual backbone construction in multihop ad hoc wireless networks: Research Articles
Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
Relay Node Placement in Wireless Sensor Networks
IEEE Transactions on Computers
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
The benefits of network coding over a wireless backbone
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Mitigating the impact of node mobility using mobile backbone for heterogeneous MANETs
Computer Communications
Hi-index | 0.00 |
In this paper, we propose a backbone construction scheme over heterogeneous ad hoc networks, where the network nodes have different characteristics such as communication capacity, processing power and energy resource. Most of the wireless backbone construction techniques focus on minimizing the number of backbone nodes. In our proposed scheme, we not only minimize the backbone size, but also take the characteristics of nodes into account when building a backbone. In the scheme, the more capable nodes have higher probability to serve as backbone nodes and provide a wireless highway over which end-to-end communication can take place. The proposed scheme includes two major steps, which can be solved by formulating as a Dominating Set (DS) problem and a Steiner Tree Problem with Minimum Number of Steiner Points (STP-MSP) respectively. We focus on the two subproblems and present a number of polynomial time approximation algorithms. Simulation results show that the proposed scheme achieves higher average backbone node performance, while has approximately the same backbone size comparing with other schemes.