Construction and Maintenance of Wireless Mobile Backbone Networks

  title={Construction and Maintenance of Wireless Mobile Backbone Networks},
  author={Anand Srinivas and Gil Zussman and Eytan Modiano},
  journal={IEEE/ACM Transactions on Networking},
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… CONTINUE READING
Highly Cited
This paper has 54 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 30 extracted citations

Placement Optimization of UAV-Mounted Mobile Base Stations

IEEE Communications Letters • 2017
View 4 Excerpts
Highly Influenced

Beyond Empirical Models: Pattern Formation Driven Placement of UAV Base Stations

IEEE Transactions on Wireless Communications • 2018
View 1 Excerpt

Efficient data retrieval in faulty sensor networks using a mobile mule

2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) • 2017

54 Citations

Citations per Year
Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-9 of 9 references

Smooth kinetic maintenance of clusters

Symposium on Computational Geometry • 2003
View 10 Excerpts
Highly Influenced

Covering a Set of Points in Multidimensional Space

Inf. Process. Lett. • 1991
View 8 Excerpts
Highly Influenced

Convexity and the Steiner tree problem

Networks • 1988
View 5 Excerpts
Highly Influenced

Relay node placement in large scale wireless sensor networks

Computer Communications • 2006
View 3 Excerpts
Highly Influenced

A Geometric Theorem for Approximate Disk Covering Algorithms

M. Franceschetti, M. Cook, J. Bruck
Caltech, Technical Report ETR035, 2001. • 2001
View 3 Excerpts
Highly Influenced

Approximations for Steiner Trees with Minimum Number of Steiner Points

J. Global Optimization • 2000
View 13 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…