Construction and Maintenance of Wireless Mobile Backbone Networks
Name
Srinivas-2009-Construction and Maintenance of Wireless Mobile Backbone Networks.pdf
Size
1.16 MB
Format
Adobe PDF
Checksum (MD5)
c3fe3be74558768acb9a5e4f1e662ca2
Author(s)
Srinivas, Anand
Zussman, Gil
Modiano, Eytan H.
Date Issued
February 2009
Journal
IEEE/ACM transactions on networking
Publisher
Institute of Electrical and Electronics Engineers / Association for Computing Machinery
Citation
Srinivas, A., G. Zussman, and E. Modiano. “Construction and Maintenance of Wireless Mobile Backbone Networks.” Networking, IEEE/ACM Transactions on 17.1 (2009): 239-252. © 2009, IEEE
Version
Final published version
Abstract
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as mobile backbone nodes and provide a backbone over which end-to-end communication can take place. Our approach consists of controlling the mobility of the backbone nodes in order to maintain connectivity. We formulate the problem of minimizing the number of backbone nodes and refer to it as the Connected Disk Cover (CDC) problem. We show that it can be decomposed into the Geometric Disk Cover (GDC) problem and the Steiner Tree Problem with Minimum Number of Steiner Points (STP-MSP). We prove that if these subproblems are solved separately by gamma- and delta-approximation algorithms, the approximation ratio of the joint solution is gamma + delta. Then, we focus on the two subproblems and present a number of distributed approximation algorithms that maintain a solution to the GDC problem under mobility. A new approach to the solution of the STP-MSP is also described. We show that this approach can be extended in order to obtain a joint approximate solution to the CDC problem. Finally, we evaluate the performance of the algorithms via simulation and show that the proposed GDC algorithms perform very well under mobility and that the new approach for the joint solution can significantly reduce the number of mobile backbone nodes.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tnet.2009.2012474
