This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Throughput Optimization in Mobile Backbone Networks
April 2011 (vol. 10 no. 4)
pp. 560-572
ASCII Text
x 
 
Emily M. Craparo, Jonathan P. How, Eytan Modiano, "Throughput Optimization in Mobile Backbone Networks," IEEE Transactions on Mobile Computing, vol. 10, no. 4, pp. 560-572, April, 2011.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2010.187,
author = {Emily M. Craparo and Jonathan P. How and Eytan Modiano},
title = {Throughput Optimization in Mobile Backbone Networks},
journal ={IEEE Transactions on Mobile Computing},
volume = {10},
number = {4},
issn = {1536-1233},
year = {2011},
pages = {560-572},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2010.187},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Throughput Optimization in Mobile Backbone Networks
IS - 4
SN - 1536-1233
SP560
EP572
EPD - 560-572
A1 - Emily M. Craparo,
A1 - Jonathan P. How,
A1 - Eytan Modiano,
PY - 2011
KW - Wireless sensor networks
KW - mobile communication systems.
VL - 10
JA - IEEE Transactions on Mobile Computing
ER -
 
Emily M. Craparo, Massachusetts Institute of Technology, Cambridge
Jonathan P. How, Massachusetts Institute of Technology, Cambridge
Eytan Modiano, Massachusetts Institute of Technology, Cambridge
This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which have superior mobility and communication capability, with regular nodes, which are constrained in mobility and communication capability. An important quantity of interest in mobile backbone networks is the number of regular nodes that can be successfully assigned to mobile backbone nodes at a given throughput level. This paper develops a novel technique for maximizing this quantity in networks of fixed regular nodes using mixed-integer linear programming (MILP). The MILP-based algorithm provides a significant reduction in computation time compared to existing methods and is computationally tractable for problems of moderate size. An approximation algorithm is also developed that is appropriate for large-scale problems. This paper presents a theoretical performance guarantee for the approximation algorithm and also demonstrates its empirical performance. Finally, the mobile backbone network problem is extended to include mobile regular nodes, and exact and approximate solution algorithms are presented for this extension.

[1] W. Burgardt, M. Moorstt, D. Fox, R. Simmons, and S. Thrun, "Collaborative Multi-Robot Exploration," Proc. IEEE Int'l Conf. Robotics and Automation, Apr. 2000.
[2] R. Balasubramanian, S. Ramasubramanian, and A. Efrat, "Coverage Time Characteristics in Sensor Networks," Proc. IEEE Int'l Conf. Mobile Adhoc and Sensor Systems (MASS '06), Oct. 2006.
[3] A. Srinivas and E. Modiano, "Joint Node Placement and Assignment for Throughput Optimization in Mobile Backbone Networks," Proc. IEEE INFOCOM, Apr. 2008.
[4] I. Rubin, A. Behzadm, R. Zhang, H. Luo, and E. Caballero, "TBONE: A Mobile-Backbone Protocol for Ad Hoc Wireless Networks," Proc. IEEE Aerospace Conf., vol. 6, 2002.
[5] K. Xu, X. Hong, and M. Gerla, "Landmark Routing in Ad Hoc Networks with Mobile Backbones," J. Parallel and Distributed Computing, vol. 63, no. 2, pp. 110-122, 2003.
[6] A. Srinivas, G. Zussmanm, and E. Modiano, "Construction and Maintenance of Wireless Mobile Backbone Networks," IEEE/ACM Trans. Networking, vol. 17, no. 1, pp. 239-252, Feb. 2009.
[7] B. Steckler, B. Bradford, and S. Urrea, "Hastily Formed Networks for Complex Humanitarian Disasters—After Action Report and Lessons Learned from the Naval Postgraduate School's Response to Hurricane Katrina," http://faculty.nps.edu/dl/HFN/ documents NPS_Katrina_AAR-LL_04-MAY-06.pdf, Sept. 2005.
[8] D. Jea, A.A. Somasundara, and M.B. Srivastava, "Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks," Proc. IEEE/ACM Int'l Conf. Distributed Computing in Sensor Systems (DCOSS '05), June 2008.
[9] R. Shah, S. Roy, S. Jain, and W. Brunette, "Data MULEs: Modeling a Three-Tier Architecture for Sparse Sensor Networks," Proc. IEEE Int'l Workshop Sensor Network Protocols and Applications (SNPA '03), May 2003.
[10] M.M. Bin Tariq, M. Ammar, and E. Zegura, "Message Ferry Route Design for Sparse Ad Hoc Networks with Mobile Nodes," Proc. ACM MobiHoc, May 2006.
[11] W. Zhao, M. Ammar, and E. Zegura, "A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks," Proc. ACM MobiHoc, May 2004.
[12] S.V. Hanly, "An Algorithm for Combined Cell-Site Selection and Power Control to Maximize Cellular Spread Spectrum Capacity," IEEE J. Selected Areas in Comm., vol. 13, no. 7, pp. 1332-1340, Sept. 1995.
[13] G.J. Foschini and Z. Milzanic, "A Simple Distributed Autonomous Power Control Algorithm and Its Convergence," IEEE Trans. Vehicular Technology, vol. 42, no. 4, pp. 641-646, Nov. 1993.
[14] R. Yates and C.Y. Huang, "Integrated Power Control and Base Station Assignment," IEEE Trans. Vehicular Technology, vol. 44, no. 3, pp. 638-644, Aug. 1995.
[15] R. Mathar and T. Niessen, "Optimum Positioning of Base Stations for Cellular Radio Networks," Wireless Networks, vol. 6, no. 6, pp. 421-428, Dec. 2000.
[16] C. Glaßer, S. Reith, and H. Vollmer, "The Complexity of Base Station Positioning in Cellular Networks," Discrete Applied Mathematics, vol. 148, no. 1, pp. 1-12, 2005.
[17] E. Amaldi, A. Capone, and F. Malucelli, "Radio Planning and Coverage Optimization of 3G Cellular Networks," Wireless Networks, vol. 14, pp. 435-447, 2008.
[18] E. Craparo, J. How, and E. Modiano, "Optimization of Mobile Backbone Networks: Improved Algorithms and Approximation," Proc. Am. Control Conf., June 2008.
[19] F. Preparta and M. Shamos, Computational Geometry: An Introduction. Springer-Verlag, 1985.
[20] P. Agarwal and M. Sharir, "Efficient Algorithms for Geometric Optimization," ACM Computing Surveys, vol. 30, pp. 412-458, 1998.
[21] R. Ahuja, T. Magnanti, and J. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
[22] G. Cornuèjols, "Valid Inequalities for Mixed Integer Linear Programs," Math. Programming, vol. 112, no. 1, pp. 3-44, 2006.
[23] E. Craparo, "Cooperative Exploration under Communication Constraints," doctoral thesis, Massachusetts Inst. of Tech nology, Sept. 2008.
[24] D. Bertsimas and R. Weismantel, Optimization over Integers, p. 88. Dynamic Ideas, 2005.
[25] G. Nemhauser and L. Wolsey, "Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms," Studies on Graphs and Discrete Programming, P. Hansen, ed., pp. 279-301, North-Holland, 1981.
[26] A.S. Asratian, T.M.J. Denley, and R. Häggkvist, Bipartite Graphs and Their Applications. Cambridge Univ. Press, 1998.

Index Terms:
Wireless sensor networks, mobile communication systems.
Citation:
Emily M. Craparo, Jonathan P. How, Eytan Modiano, "Throughput Optimization in Mobile Backbone Networks," IEEE Transactions on Mobile Computing, vol. 10, no. 4, pp. 560-572, April 2011, doi:10.1109/TMC.2010.187
Usage of this product signifies your acceptance of the Terms of Use.