Constrained node placement and assignment in mobile backbone networks

This paper describes new algorithms for mobile backbone network optimization. In this hierarchical communication framework, mobile backbone nodes (MBNs) are deployed to provide communication support for regular nodes (RNs). While previous work has assumed that MBNs are unconstrained in position, this work models constraints in MBN location. This paper develops an exact technique for maximizing the number of RNs that achieve a threshold throughput level, as well as a polynomial-time approximation algorithm for this problem. The approximation algorithm carries a performance guarantee of 1 over 2 and we demonstrate that this guarantee is tight in some problem instances.

[1]  Heribert Vollmer,et al.  The complexity of base station positioning in cellular networks , 2005, Discret. Appl. Math..

[2]  G. Nemhauser,et al.  Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms* , 1981 .

[3]  Brian Steckler,et al.  Hastily formed networks for complex humanitarian disasters: after action report and lessons learned from the Naval Postgraduate School's response to Hurricane Katrina , 2005 .

[4]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[5]  Mani B. Srivastava,et al.  Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks , 2005, DCOSS.

[6]  Izhak Rubin,et al.  TBONE: A mobile-backbone protocol for ad hoc wireless networks , 2002, Proceedings, IEEE Aerospace Conference.

[7]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[8]  Hadas Shachnai,et al.  Maximizing submodular set functions subject to multiple linear constraints , 2009, SODA.

[9]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[10]  Ellen W. Zegura,et al.  Message ferry route design for sparse ad hoc networks with mobile nodes , 2006, MobiHoc '06.

[11]  Eytan Modiano,et al.  Throughput Optimization in Mobile Backbone Networks , 2011, IEEE Transactions on Mobile Computing.

[12]  T. Ibaraki,et al.  The Computational Complexity of the m -Center Problems on the Plane , 1981 .

[13]  Eytan Modiano,et al.  Construction and Maintenance of Wireless Mobile Backbone Networks , 2009, IEEE/ACM Transactions on Networking.

[14]  Dimitris Bertsimas,et al.  Optimization over integers , 2005 .

[15]  Rudolf Mathar,et al.  Optimum positioning of base stations for cellular radio networks , 2000, Wirel. Networks.

[16]  Maxim Sviridenko,et al.  A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..

[17]  Stephen V. Hanly,et al.  An Algorithm for Combined Cell-Site Selection and Power Control to Maximize Cellular Spread Spectrum Capacity (Invited Paper) , 1995, IEEE J. Sel. Areas Commun..

[18]  Jan Vondrák,et al.  Submodular Maximization over Multiple Matroids via Generalized Exchange Properties , 2009, Math. Oper. Res..

[19]  Xiaoyan Hong,et al.  Landmark routing in ad hoc networks with mobile backbones , 2003, J. Parallel Distributed Comput..

[20]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[21]  Eytan Modiano,et al.  Joint Node Placement and Assignment for Throughput Optimization in Mobile Backbone Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[22]  Edoardo Amaldi,et al.  Radio planning and coverage optimization of 3G cellular networks , 2008, Wirel. Networks.

[23]  Gerard J. Foschini,et al.  A simple distributed autonomous power control algorithm and its convergence , 1993 .

[24]  Roy D. Yates,et al.  Integrated power control and base station assignment , 1995 .