Mobile backbone networks --: construction and maintenance

  • Authors:

  • Anand Srinivas;Gil Zussman;Eytan Modiano

  • Affiliations:

  • Massachusetts Institute of Technology;Massachusetts Institute of Technology;Massachusetts Institute of Technology

  • Venue:
  • Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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 approac 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 problem.We show that it can be decomposed into the Geometric Disk Cover (GDC)problem and the Steiner Tree Problem wit Minimum Number of Steiner Points (STP-MSP). We prove that if these sub-problems are solved separately by γ- and δ- approximation algorithms, the approximation ratio of t e joint solution is γ + δ. 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 Connected Disk Cover 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 approac for the joint solution can significantly reduce the number of required Mobile Backbone Nodes.