The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2009 vol.8)
pp: 246-260
Mirco Musolesi , Dartmouth College, Hanover
Cecilia Mascolo , University of Cambridge, Cambridge
ABSTRACT
Most of the existing research work in mobile ad hoc networking is based on the assumption that a path exists between the sender and the receiver. On the other hand, applications of decentralised mobile systems are often characterised by network partitions. As a consequence delay tolerant networking research has received considerable attention in the recent years as a means to obviate to the gap between ad hoc network research and real applications. In this paper we present the design, implementation and evaluation of the Context-aware Adaptive Routing (CAR) protocol for delay tolerant unicast communication in intermittently connected mobile ad hoc networks. The protocol is based on the idea of exploiting nodes as carriers of messages among network partitions to achieve delivery. The choice of the best carrier is made using Kalman filter based prediction techniques and utility theory. We discuss the implementation of CAR over an opportunistic networking framework, outlining possible applications of the general principles at the basis of the proposed approach. The large scale performance of the CAR protocol are evaluated using simulations based on a social network founded mobility model, a purely random one and real traces from Dartmouth College.
INDEX TERMS
Wireless communication, Routing protocols
CITATION
Mirco Musolesi, Cecilia Mascolo, "CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks", IEEE Transactions on Mobile Computing, vol.8, no. 2, pp. 246-260, February 2009, doi:10.1109/TMC.2008.107
REFERENCES
[1] C.E. Perkins, Ad Hoc Networking. Addison-Wesley, 2001.
[2] K. Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,” Proc. ACM SIGCOMM '03, Aug. 2003.
[3] A. Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc Networks,” Technical Report CS-2000-06, Dept. Computer Science, Duke Univ., 2000.
[4] S. Jain, K. Fall, and R. Patra, “Routing in a Delay Tolerant Network,” Proc. ACM SIGCOMM '04, Aug. 2004.
[5] V. Zhao, M. Ammar, and E. Zegura, “A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks,” Proc. ACM MobiHoc '04, May 2004.
[6] M.P.N. Sarafijanovic-Djukic and M. Grossglauser, “Island Hopping: Efficient Mobility Assisted Forwarding in Partitioned Networks,” Proc. Third Ann. IEEE Conf. Sensor and Ad Hoc Comm. and Networks (SECON '06), Sept. 2006.
[7] A. Lindgren, A. Doria, and O. Schelen, “Probabilistic Routing in Intermittently Connected Networks,” Mobile Computing and Comm. Rev., vol. 7, no. 3, July 2003.
[8] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, “Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks,” Proc. Workshop Delay Tolerant Networking and Related Networks (WDTN '05), pp. 252-259, 2005.
[9] R.L. Keeney and H. Raiffa, “Decisions with Multiple Objectives: Preference and Value Tradeoffs,” Wiley Series in Probability and Mathematical Statistics. John Wiley & Sons, 1976.
[10] M. Musolesi, S. Hailes, and C. Mascolo, “Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks,” Proc. Int'l Conf. World of Wireless, Mobile, and Multimedia Networks (WoWMoM '05), June 2005.
[11] M. Musolesi and C. Mascolo, “Designing Mobility Models Based on Social Network Theory,” ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 11, no. 3, 2007.
[12] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM '94, Aug. 1994.
[13] H.A. Taha, Operations Research: An Introduction. Prentice Hall, 1996.
[14] R.E. Kalman, “A New Approach to Linear Filtering and Prediction Problems,” Trans. ASME J. Basic Eng., Mar. 1960.
[15] B. Pasztor, M. Musolesi, and C. Mascolo, “Opportunistic Mobile Sensor Data Collection with SCAR,” Proc. Fourth IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS '07), Oct. 2007.
[16] D.F. Bantz, C. Bisdikian, D. Challener, J.P. Karidis, S. Mastrianni, A. Mohindra, D.G. Shea, and M. Vanover, “Autonomic Personal Computing,” IBM Systems J., vol. 42, no. 1, 2003.
[17] C. Chatfield, The Analysis of Time Series: An Introduction. Chapman and Hall/CRC, 2004.
[18] G. Malkin, RFC2453—RIP Version 2, 1999.
[19] P.J. Brockwell and R.A. Davis, Introduction to Time Series and Forecasting. Springer, 1996.
[20] M. Musolesi and C. Mascolo, CAR: Context-Aware Adaptive Routing for Delay Tolerant Mobile Networks—Additional Material, http://doi.ieeecomputersociety.org/10.1109 TMC.2008.107, May 2007.
[21] M. Musolesi and C. Mascolo, “Evaluating Context Information Predictability for Autonomic Communication,” Proc. IEEE Workshop Autonomic Comm. and Computing (ACC '06), June 2006.
[22] A. Varga, “The OMNeT++ Discrete Event Simulation System,” Proc. 15th European Simulation Multiconference (ESM '01), June 2001.
[23] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in AdHoc Wireless Network,” Mobile Computing, T. Imielinski and H. Korth, eds., chapter 5, Kluwer Academic Publishers, pp. 153-181, 1996.
[24] M. Musolesi and C. Mascolo, “A Community Based Mobility Model for Ad Hoc Network Research,” Proc. Second Int'l Workshop Multi-Hop Ad Hoc Networks: From Theory to Reality (REALMAN '06), May 2006.
[25] D.J. Watts, “Small Worlds: The Dynamics of Networks between Order and Randomness,” Princeton Studies on Complexity. Princeton Univ. Press, 1999.
[26] J. Durbin and S.J. Koopman, Time Series Analysis by State Space Methods. Oxford Univ. Press, 2001.
[27] J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau, CRAWDAD Data Set Cambridge/Haggle (v. 2006-01-31), http://crawdad.cs.dartmouth.edu/cambridge haggle, Jan. 2006.
[28] D. Kotz, T. Henderson, and I. Abyzov, CRAWDAD Trace Set Dartmouth/Campus/Movement (v. 2005-03-08), http://crawdad.cs. dartmouth.edu/dartmouth/ campusmovement, Mar. 2005.
[29] Q. Li and D. Rus, “Sending Messages to Mobile Users in Disconnected Ad-Hoc Wireless Networks,” Proc. ACM MobiCom '00, pp. 44-55, 2000.
[30] Z. Zhang, “Routing in Intermittently Connected Mobile Ad Hoc Networks and Delay Tolerant Networks: Overview and Challenges,” IEEE Comm. Surveys and Tutorials, vol. 8, no. 1, Jan. 2006.
[31] A. Balasubramanian, B.N. Levine, and A. Venkataramani, “DTN Routing as a Resource Allocation Problem,” Proc. ACM SIGCOMM '07, pp. 373-384, Aug. 2007.
[32] J. Leguay, T. Friedman, and V. Conan, “Evaluating Mobility Pattern Space Routing for DTNs,” Proc. IEEE INFOCOM '06, Apr. 2006.
[33] J. Ghosh, S.J. Philip, and C. Qiao, “Sociological Orbit Aware Location Approximation and Routing (SOLAR) in MANET,” Elsevier Ad Hoc Networks J., vol. 5, no. 2, pp. 189-209, Mar. 2007.
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool