This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Cost of Knowledge of Mobility in Dynamic Networks: An Information-Theoretic Approach
June 2012 (vol. 11 no. 6)
pp. 995-1006
ASCII Text
x 
 
Di Wang, Alhussein A. Abouzeid, "On the Cost of Knowledge of Mobility in Dynamic Networks: An Information-Theoretic Approach," IEEE Transactions on Mobile Computing, vol. 11, no. 6, pp. 995-1006, June, 2012.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2011.117,
author = {Di Wang and Alhussein A. Abouzeid},
title = {On the Cost of Knowledge of Mobility in Dynamic Networks: An Information-Theoretic Approach},
journal ={IEEE Transactions on Mobile Computing},
volume = {11},
number = {6},
issn = {1536-1233},
year = {2012},
pages = {995-1006},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2011.117},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - On the Cost of Knowledge of Mobility in Dynamic Networks: An Information-Theoretic Approach
IS - 6
SN - 1536-1233
SP995
EP1006
EPD - 995-1006
A1 - Di Wang,
A1 - Alhussein A. Abouzeid,
PY - 2012
KW - Routing protocols
KW - network management
KW - network monitoring
KW - mobile environments.
VL - 11
JA - IEEE Transactions on Mobile Computing
ER -
 
Di Wang, Juniper Networks Inc., Sunnyvale
Alhussein A. Abouzeid, Rensselaer Polytechnic Institute, Troy
In this paper, we extend an information-theoretic approach for characterizing the minimum cost of tracking the motion state information, such as locations and velocities, of nodes in dynamic networks. A rate-distortion formulation is proposed to solve this minimum-cost motion-tracking problem, where the minimum cost is the minimum information rate required to identify the network state at a sequence of tracking time instants within a certain distortion bound. The formulation is applicable to various mobility models, distortion criteria, and stochastic sequences of tracking time instants and hence is general. Under Brownian motion and Gauss-Markov mobility models, we evaluate lower bounds on the information rate of tracking the motion state information of nodes, where the motion state of a node is 1) the node's locations only, or 2) both its locations and velocities. We apply the obtained results to analyze the geographic routing overhead in mobile ad hoc networks. We present the minimum overhead incurred by maintaining the geographic information of nodes in terms of node mobility, packet arrival process, and distortion bounds. This leads to precise characterizations of the observation that given certain state-distortion allowance, protocols aimed at tracking motion state information may not scale beyond a certain level of node mobility.

[1] D. Wang and A.A. Abouzeid, “On the Cost of Knowledge of Mobility in Dynamic Networks,” Proc. IEEE INFOCOM, 2010.
[2] K.-T. Feng, C.-H. Hsu, and T.-E. Lu, “Velocity-Assisted Predictive Mobility and Location-Aware Routing Protocols for Mobile Ad Hoc Networks,” IEEE Trans. Vehicular Technology, vol. 57, no. 1, pp. 448-464, Jan. 2008.
[3] B. Liang and Z.J. Haas, “Predictive Distance-Based Mobility Management for Multidimensional PCS Networks,” IEEE Trans. Networking, vol. 11, no. 5, pp. 718-732, Oct. 2003.
[4] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
[5] M. Grossglauser and D. Tse, “Mobility Increases the Capacity of Ad Hoc Wireless Networks,” IEEE/ACM Trans. Networking, vol. 10, no. 4, pp. 477-486, Aug. 2002.
[6] A. Ephremides and B. Hajek, “Information Theory and Communication Networks: An Unconsummated Union,” IEEE Trans. Information Theory, vol. 44, no. 6, pp. 2416-2434, Oct. 1998.
[7] R.G. Gallager, “Basic Limits on Protocol Information in Data Communication Networks,” IEEE Trans. Information Theory, vol. 22, no. 4, pp. 385-398, July 1976.
[8] C. Rose and R. Yates, “Location Uncertainty in Mobile Networks: A Theoretical Framework,” IEEE Comm. Magazine, vol. 35, no. 2, pp. 94-101, Feb. 1997.
[9] A. Bhattacharya and S.K. Das, “LeZi-Update: An Information-Theoretic Approach to Track Mobile Users in PCS Networks,” Proc. ACM MobiCom, 1999.
[10] Q.M. Tran, A. Dadej, and S. Parreau, “Characterizing Mobility in Ad Hoc Networks: A Generalized Approach,” Proc. Workshop Applications and Services in Wireless Networks (ASWN '05), 2005.
[11] G. Cheng and N. Ansari, “Rate-Distortion Based Link State Update,” Computer Networks, vol. 50, pp. 3300-3314, 2006.
[12] H. Hong, “Distributed Information Discovery in Networks from the Perspective of Information Theory,” http://ccr.sigcomm.org/online/filesdistr_info.pdf , 2007.
[13] J. Hong and V.O.K. Li, “Impact of Information on Network Performance¨CAn Information-Theoretic Perspective,” Proc. GlobeCom, 2009.
[14] N. Zhou and A.A. Abouzeid, “Routing in Ad Hoc Networks: A Theoretical Framework with Practical Implications,” Proc. IEEE INFOCOM, 2005.
[15] D. Wang and A.A. Abouzeid, “Link State Routing Overhead in Mobile Ad Hoc Networks: A Rate-Distortion Formulation,” Proc. IEEE INFOCOM, 2008.
[16] N. Bisnik and A.A. Abouzeid, “Capacity Deficit in Mobile Wireless Ad Hoc Networks Due to Geographic Routing Overheads,” Proc. IEEE INFOCOM, 2007.
[17] A. Papoulis and U.S. Pillai, Probability, Random Variables and Stochastic Processes. McGraw-Hill Science/Engineering/Math, 2001.
[18] D.T. Gillespie, “Exact Numerical Simulation of the Ornstein-Uhlenbeck Process and Its Integral,” Physical Rev. E, vol. 54, pp. 2084-2091, 1996.
[19] T. Linder and R. Zamir, “On the Asymptotic Tightness of the Shannon Lower Bound,” IEEE Trans. Information Theory, vol. 40, no. 6, pp. 2026-2031, Nov. 1994.
[20] M. Mauve, J. Widmer, and H. Hartenstein, “A Survey on Position-Based Routing in Mobile Ad-Hoc Networks,” IEEE Network Magazine, vol. 15, no. 6, pp. 30-39, Nov./Dec. 2001.
[21] E. Kaplan, Understanding GPS: Principles and Applications. Artech House, 1996.
[22] S. Capkun, M. Hamdi, and J. Hubaux, “GPS-Free Positioning in Mobile Ad-Hoc Networks,” Proc. 34th Ann. Hawaii Int'l Conf. System Sciences (HICSS '01), 2001.
[23] S. Das, H. Pucha, and Y. Hu, “Performance Comparison of Scalable Location Services for Geographic Ad Hoc Routing,” Proc. IEEE INFOCOM, 2005.
[24] Z. Ye and A.A. Abouzeid, “A Unified Model for Joint Throughput-Overhead Analysis of Mobile Ad Hoc Networks,” Proc. Int'l Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM '08), 2008.
[25] D. Bertsekas and R. Gallager, Data Networks. Prentice Hall, 1992.
[26] P. Jacquet et al., “Optimized Link State Routing Protocol,” IETF MANET Working Group Internet draft, draft-ietf-manetolsr-05.txt, 2000.
[27] C. Perkins, E. Royer, and S.R. Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing,” IETF Mobile Ad Hoc Networking Working Group Internet draft, draft-ietf-manet-aodv-13.txt, 2003.
[28] D.B. Johnson, D.A. Maltz, and J. Broch, “DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks,” Ad Hoc Networking, Pearson Education, 2001.
[29] R.C. Shah, A. Wolisz, and J.M. Rabaey, “On the Performance of Geographical Routing in the Presence of Localization Errors,” Proc. IEEE Int'l Conf. Comm. (ICC '05), 2005.
[30] D. Son, A. Helmy, and B. Krishnamachari, “The Effect of Mobility-Induced Location Errors on Geographic Routing in Mobile Ad Hoc and Sensor Networks: Analysis and Improvement Using Mobility Prediction,” IEEE Trans. Mobile Computing, vol. 3, no. 3, pp. 233-245, July/Aug. 2004.
[31] J. Sanchez, P. Ruiz, and R. Marin-Perez, “Beacon-Less Geographic Routing Made Practical: Challenges, Design Guidelines, and Protocols,” IEEE Comm. Magazine, vol. 47, no. 8, pp. 85-91, Aug. 2009.
[32] H. Zhang and H. Shen, “Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 21, no. 6, pp. 881-896, June 2010.

Index Terms:
Routing protocols, network management, network monitoring, mobile environments.
Citation:
Di Wang, Alhussein A. Abouzeid, "On the Cost of Knowledge of Mobility in Dynamic Networks: An Information-Theoretic Approach," IEEE Transactions on Mobile Computing, vol. 11, no. 6, pp. 995-1006, June 2012, doi:10.1109/TMC.2011.117
Usage of this product signifies your acceptance of the Terms of Use.