Abstract
The influence of node mobility in Mobile Ad hoc NETworks (MANETs) has significant implications for system performance. A class of MANETs characterised by a sparse density of nodes coupled with a relatively short range of radio communication, results in a network topology that is disconnected most of the time.This wireless mobile ad hoc network is called an “opportunistic network” or “delay-tolerant” network. This paper presents some models in which the rate of information propagation within the opportunistic network is considered. Furthermore, a characterisation of the multicast time in the opportunistic network is developed.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Chaintreau, A., Hui, P., Crowcroft, J., Diot, R.G.C., Scott, J.: Pocket Switched Networks: Real-world Mobility and Its Consequences for Opportunistic Forwarding. Thech. Report, UCAM-CL-TR-617, Univ. of Cambridge, Computer Lab (February 2005)
Kathiravelu, T., Perars, A.: What and When: Distributing Content in Opportunistic Networks. In: Proc. of Mobile of the Int. Conf. on Wireless and Mobile Computing (ICWMC 2006), Buckarest, Romania (July 2006)
Su, J., Chin, A., Popivanova, A., Goel, A., de Lara, E.: User Mobility for Opportunistic Ad Hoc Networking. In: 6th IEEE Workshop on Mobile Computing Systems and Applications (WMCSA 2004) (2004)
Huang, C.-M., Lan, K.-C., Tsai, C.-Z.: A Survey of Opportunistic Networks. In: 22nd Int. Conf. on Advanced Information Networking and Applications, pp. 1672–1677 (2008)
Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L., Rubenstein, D.: Energy-efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with Zebranet. Computer Architecture News 30(5), 97–107 (2002)
Burleigh, S., Hooke, A., Torgerson, L., Fall, K., Cerf, V., Dungerst, B., Scott, K.: Delay-tolerant Networking: An Approach to Interplanetary Internet. IEEE Comm. Mag. 41 (2003)
Winfield, A.F.: Distributed Sensing and Data Collection via Broken Ad Hoc Wireless Connected Networks of Mobile Robots. Distributed Autonomous Robotic Systems, 273–282 (2000)
Wu, H., Fujimoto, R., Guensler, R., Hunter, M.: Mddv: Mobility-centric Data Dissemination Algorithm for Vehicular Networks. In: Proc. of ACM SIGCOMM Workshop on Vehicular Ad Hoc Networks (VANET 2004) (2004)
Broch, J., Moltz, D.A., Johnson, D.B., Hu, Y.-C., Jetcheva, J.: A Performance Comparison of Multi-hop Wireless Ad Hoc Network Routing Protocols. In: Mobile Computing and Networking (1998)
Bettsteter, C.: Mobility Modeling in Wireless Networks: Categorization, Smooth Movement, and Border Effects. ACM Mobile Computing and Communications Review (2001)
Shah, R.C., Roy, S., Jain, S., Brunnette, W.: Data Mules: Modeling and Analysis of a Three-tier Architecture for spare Sensor Networks. Elsevier Ad Hoc Networks Journal (2003)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Performance Analysis of Mobility-assisted Routing. In: MobiHoc 2006, Florence (2006)
Martyna, J.: Simulation Study of the Mobility Models for the Wireless Mobile Ad Hoc and Sensor Networks. In: Kwiecień, A., Gaj, P., Stera, P. (eds.) CN 2012. CCIS, vol. 291, pp. 324–333. Springer, Heidelberg (2012)
Groenevelt, R., Nain, P., Koole, G.: The Message Delay in Mobile Ad Hoc Networks. Performance Evaluation 62(1-4), 210–228 (2005)
Resta, G., Santi, P.: A Framework for Routing Performance Analysis in Delay Tolerant Networks with Application to Non Cooperative Networks. IEEE Trans. on Parallel and Distributed Systems 23(1), 2–10 (2012)
Zhang, X., Neglia, G., Kurose, J., Towsley, D.: Performance Modeling of Epidemic Routing. Computer Networks 51, 2867–2891 (2007)
Jacquet, P., Mans, B., Rodolakis, G.: Information Propagation Speed in Mobile and Delay Tolerant Networks. IEEE Trans. on Information Theory 56, 5001–5015 (2010)
Peres, Y., Sinclair, A., Sousi, P., Stauffer, A.: Mobile Geometric Graphs: Detection, Coverage and Percolation. In: Proc. 22nd ACM-SIAM SODA, pp. 412–428 (2011)
Pettarin, A., Pietracaprina, A., Puci, G., Upfal, E.: Tight Bounds on Information Dissemination in Sparse Mobile Networks. In: Proc. 30th ACM PODC, pp. 355–362. ACM (2011)
Clementi, A., Monti, A., Pasquale, F., Silvestri, R.: Information Spreading in Stationary Markovian Evolving Graphs. IEEE Trans. on Parallel and Distributed Systems 22(9), 1425–1432 (2011)
Becchetti, L., Clementi, A., Pasquale, F., Resta, G., Santi, P., Silvestri, R.: Flooding Time in Opportunistic Networks Under Power Law and Exponential Inter-Contact Times (2012) Internet Draft available at, http://arxiv.org/abs/1107.5241v3
Vahdat, A., Becker, D.: Epidemic Routing for Partially Connected Ad Hoc Networks. Tech. Rep. CS-200006, Duke Univ. (April 2000)
Grossglauser, M., Tse, D.N.C.: Mobility Increase the Capacity of Ad Hoc Wireless Networks. In: Proc. IEEE INFOCOM, pp. 1360–1369 (2001)
Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs, http://www.stat.berkeley.edu/verb/~aldous/RWG/
Becchetti, L., Clementi, A., Pasquale, F., Resta, G., Santi, P., Silvestri, R.: Information Spreading in Opportunistic Networks is Fast (2011) Internet Draft available at, http://arxiv.org/abs/1107.5241
Karagiannis, T., Le Boudec, J.Y., Vojnovic, M.: Power Law and Exponential Decay of Inter Contact Times Between Mobile Devices. In: Pin Proc. of ACM MobiCom, pp. 183–194 (2007)
Van Miehem, P., Janic, M.: Stability of a Multicast Tree. In: IEEE INFOCOM, vol. 2, pp. 1099–1108 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martyna, J. (2013). Performance Modeling of Opportunistic Networks. In: Kwiecień, A., Gaj, P., Stera, P. (eds) Computer Networks. CN 2013. Communications in Computer and Information Science, vol 370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38865-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-38865-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38864-4
Online ISBN: 978-3-642-38865-1
eBook Packages: Computer ScienceComputer Science (R0)