This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Energy Maps for Mobile Wireless Networks: Coherence Time versus Spreading Period
June 2009 (vol. 8 no. 6)
pp. 778-791
ASCII Text
x 
 
Min Kyoung Park, Volkan Rodoplu, "Energy Maps for Mobile Wireless Networks: Coherence Time versus Spreading Period," IEEE Transactions on Mobile Computing, vol. 8, no. 6, pp. 778-791, June, 2009.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2009.32,
author = {Min Kyoung Park and Volkan Rodoplu},
title = {Energy Maps for Mobile Wireless Networks: Coherence Time versus Spreading Period},
journal ={IEEE Transactions on Mobile Computing},
volume = {8},
number = {6},
issn = {1536-1233},
year = {2009},
pages = {778-791},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2009.32},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Energy Maps for Mobile Wireless Networks: Coherence Time versus Spreading Period
IS - 6
SN - 1536-1233
SP778
EP791
EPD - 778-791
A1 - Min Kyoung Park,
A1 - Volkan Rodoplu,
PY - 2009
KW - Wireless
KW - mobile
KW - network
KW - QoS
KW - energy.
VL - 8
JA - IEEE Transactions on Mobile Computing
ER -
 
Min Kyoung Park, Samsung Advanced Institute of Technology, Yongin-si
Volkan Rodoplu, University of California, Santa Barbara, Santa Barbara
We show that even though mobile networks are highly unpredictable when viewed at the individual node scale, the end-to-end quality-of-service (QoS) metrics can be stationary when the mobile network is viewed in the aggregate. We define the coherence time as the maximum duration for which the end-to-end QoS metric remains roughly constant, and the spreading period as the minimum duration required to spread QoS information to all the nodes. We show that if the coherence time is greater than the spreading period, the end-to-end QoS metric can be tracked. We focus on the energy consumption as the end-to-end QoS metric, and describe a novel method by which an energy map can be constructed and refined in the joint memory of the mobile nodes. Finally, we show how energy maps can be utilized by an application that aims to minimize a node's total energy consumption over its near-future trajectory.

[1] D. Niculescu and B. Nath, “Trajectory Based Forwarding and Its Applications,” Proc. ACM MobiCom, 2003.
[2] M.K. Park and V. Rodoplu, “Energy Maps for Large-Scale, Mobile Wireless Networks,” Proc. Int'l Comm. Conf. (ICC '07), pp.3136-3141, June 2007.
[3] S. Chakrabarti and A. Mishra, “QoS Issues in Ad Hoc Wireless Networks,” IEEE Comm. Magazine, pp.142-148, Feb. 2001.
[4] A. Iwata, C.-C. Chian, G. Pei, M. Gerla, and T.-W. Chen, “Scalable Routing Strategies for Ad Hoc Wireless Networks,” IEEE Trans. J. Selected Areas in Comm., vol. 17, no. 8, pp.1369-1379, Aug. 1999.
[5] C. Zhu and M.S. Corson, “QoS Routing for Mobile Ad Hoc Networks,” Proc. IEEE INFOCOM, pp.1488-1505, Aug. 2002.
[6] S. Chen and K. Nahstedt, “Distributed Quality-of-Service Routing in Ad Hoc Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp.1488-1505, Aug. 1999.
[7] B. Liang and Z.J. Haas, “Predictive Distance-Based Mobility Management for Multidimensional PCS Networks,” IEEE/ACM Trans. Networking, vol. 11, no. 5, pp.718-732, Oct. 2003.
[8] G.S. Malkin and M.E. Steenstrup, Distance-Vector Routing. Prentice Hall, 1995.
[9] J. Moy, Link-State Routing. Prentice Hall, 1995.
[10] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM, vol. 24, no. 4, pp.234-244, Oct. 1994.
[11] T. Clausen, P. Jacquet, A. Laouiti, P. Muhlethaler, A. Qayyum, and L. Viennot, “Optimized Link State Routing Protocol,” Proc. IEEE Int'l Multitopic Conf. (INMIC '01), Dec. 2001.
[12] B. Bellur, R.G. Ogier, and F.L. Templin, “Topology Broadcast Based on Reverse-Path Forwarding (TBRPF),” IETF Internet Draft, Mar. 2001.
[13] C.E. Perkins and E.M. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. IEEE Workshop Mobile Computing Systems and Applications, pp.90-100, Feb. 1999.
[14] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, pp.153-181, 1996.
[15] R. Castaneda and S.R. Das, “Query Localization Techniques for On-Demand Routing Protocols in Ad Hoc Networks,” Proc. ACM MobiCom, pp.186-194, Aug. 1999.
[16] C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, “Directed Diffusion for Wireless Sensor Networking,” IEEE/ACM Trans. Networking, vol. 11, pp.2-16, Feb. 2003.
[17] Q. Fang, J. Gao, L. Guibas, V. de Silva, and L. Zhang, “GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks,” Proc. IEEE INFOCOM, vol. 1, pp.339-350, Mar. 2005.
[18] S. Subramanian and S. Shakkottai, “Geographic Routing with Limited Information in Sensor Networks,” Proc. Fourth Int'l Conf. Information Processing in Sensor Networks, Apr. 2005.
[19] A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica, “Geographic Routing without Location Information,” Proc. ACM MobiCom, pp.96-108, Sept. 2003.
[20] Y. Yu, R. Govindan, and D. Estrin, “Geographical and Energy Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks,” technical report, Dept. of Computer Science, Univ. of California, Los Angeles, May 2001.
[21] H. Luo, F. Ye, J. Cheng, S. Lu, and L. Zhang, “TTDD: Two-Tier Data Dissemination in Large-Scale Wireless Sensor Networks,” Wireless Networks, vol. 11, pp.161-175, 2005.
[22] H.S. Kim, T.F. Abdelzaher, and W.H. Kwon, “Minimum-Energy Asynchronous Dissemination to Mobile Sinks in Wireless Sensor Networks,” Proc. ACM Conf. Embedded Networked Sensor Systems (SenSys '03), pp.193-204, Nov. 2003.
[23] C. Bettstetter, G. Resta, and P. Santi, “The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 2, no. 3, pp.257-269, July-Sept. 2003.
[24] W. Navidi and T. Camp, “Stationary Distributions for the Random Waypoint Model,” IEEE Trans. Mobile Computing, vol. 3, no. 1, pp.99-108, Jan.-Mar. 2004.
[25] C. Bettstetter, H. Hartenstein, and X. Perez-Costa, “Stochastic Properties of the Random Waypoint Mobility Model: Epoch Length, Direction Distribution, and Cell Change rate,” Proc. ACM Int'l Workshop Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM '02), pp.7-14, Sept. 2002.
[26] C. Bettstetter, H. Hartenstein, and X. Perez-Costa, “Stochastic Properties of the Random Waypoint Mobility Model,” Wireless Networks, vol. 10, pp.555-567, 2004.
[27] M. McGuire, “Stationary Distributions of Random Walk Mobility Models for Wireless Ad Hoc Networks,” Proc. ACM MobiHoc, pp.90-98, May 2005.
[28] D.M. Blough, G. Resta, and P. Santi, “A Statistical Analysis of the Long-Run Node Spatial Distribution in Mobile Ad Hoc Networks,” Wireless Networks, vol. 10, pp.543-554, 2004.
[29] D.R. Basgeet, P. Dugenie, A. Munro, D. Kaleshi, and J. Irvine, “SMM: Mathematical Framework for a Scalable Mobility Model,” Proc. ACM Int'l Workshop Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM '03), pp.74-81, Sept. 2003.
[30] Y. Lu, H. Lin, Y. Gu, and A. Helmy, “Towards Mobility-Rich Analysis in Ad Hoc Networks: Using Contraction, Expansion and Hybrid Models,” Proc. IEEE Comm. Soc., pp.4346-4351, 2004.
[31] K. Maeda, K. Sato, K. Konishi, A. Yamaski, A. Uchiyama, H. Yamaguchi, K. Yasumoto, and T. Higashino, “Getting Urban Pedestrian Flow from Simple Observation: Realistic Mobility Generation in Wireless Network Simulation,” Proc. ACM Int'l Workshop Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM '05), pp.151-158, Oct. 2005.
[32] W. Su, S.-J. Lee, and M. Gerla, “Mobility Prediction and Routing in Ad Hoc Wireless Networks,” Int'l J. Network Management, vol. 11, pp.3-30, 2001.
[33] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Comm. and Mobile Computing, vol. 2, no. 5, pp.483-502, Aug. 2002.
[34] W.-T. Chen and P.-Y. Chen, “Group Mobility Management in Wireless Ad Hoc Networks,” Proc. Vehicular Technology Conf., pp.2202-2206, Oct. 2003.
[35] M. Gerla and X. Hong, “Exploiting Mobility in Large Scale Ad Hoc Wireless Networks,” Proc. Computer Comm., pp.34-39, Oct. 2003.
[36] S. Thajchayapong and J.M. Peha, “Mobility Patterns in Microcellular Wireless Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 1, pp.52-63, Jan. 2006.
[37] H. Kobayashi, S.-Z. Yu, and B.L. Mark, “An Integrated Mobility and Traffic Model for Resource Allocation in Wireless Networks,” Proc. ACM Int'l Workshop Wireless Mobile Multimedia (WOWMOM '00), pp.39-47, 2000.
[38] W. Zhao, M. Ammar, and E. Zegura, “A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks,” Proc. Fifth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp.187-198, 2004.

Index Terms:
Wireless, mobile, network, QoS, energy.
Citation:
Min Kyoung Park, Volkan Rodoplu, "Energy Maps for Mobile Wireless Networks: Coherence Time versus Spreading Period," IEEE Transactions on Mobile Computing, vol. 8, no. 6, pp. 778-791, June 2009, doi:10.1109/TMC.2009.32
Usage of this product signifies your acceptance of the Terms of Use.