Abstract
A Mobile “Ad hoc” wireless NETwork (MANET) is a network established for a special, often extemporaneous service customized to applications. The ad hoc network is typically set up for a limited period of time, in an environment that may change from application to application. As a difference from the Internet where the TCP/IP protocol suite supports a vast range of applications, in the MANET the protocols are tuned to a specific customer and application (eg, send a video stream across the battlefield; find out if there is a fire in the forest; establish a videoconference among several teams engaged in a rescue effort, etc). The customers move and the environment may change dynamically and unpredictably. For the MANET to retain its efficiency, the ad hoc protocols at various layers may need to self-tune to adjust to environment, traffic and mission changes. From these properties emerges the vision of the MANET as an extremely flexible, malleable and yet robust and formidable network architecture. Indeed, an architecture that can be deployed to monitor the habits of birds in their natural habitat, and which, in other circumstances, can be organized to interconnect rescue crews after a Tsunami disaster, or yet can be structured to launch deadly attacks onto unsuspecting enemies.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kaplan, E.: Understanding the gps: Principles and applications (1996)
Rappaport, T.: Wireless communications: Principles and practice (1995)
Mills, D.: Internet time synchronization: the network time protocol. IEEE Transactions on Communications 39, 1482–1493 (1991)
Su, W.: Motion Prediction in MobileNireless Networks. PhD thesis, UCLA, Computer Science Department (1999)
Toh, C.: Associativity-based routing for ad-hoc mobile networks. Wireless Personal Communications 4, 103–139 (1997)
Liu, J., Singh, S.: Atcp: Tcp for mobile ad hoc networks. IEEE Journal on Selected Areas in Communications 19, 1300–1315 (2001)
Karp, B., Kung, H.T.: Greedy perimeter stateless routing for wireless networks. ACM MobiCom, 243–254 (2000)
Pei, G., Gerla, M., Chen, T.W.: Fisheye state routing in mobile ad hoc networks. In: ICDCS Workshop on Wireless Networks and Mobile Computing (2000)
Pei, G., Gerla, M., Chen, T.W.: Fisheye state routing: A routing scheme for ad hoc wireless networks. IEEE ICC (2000)
Kleinrock, L., Stevens, K.: Fisheye: A lenslike computer display transformation. Technical report, UCLA Computer Science Department (1971)
Perkins, C., Bhagwat, P.: Highly dynamic destionation-sequenced distance-vector routing (dsdv) for mobilie computers. ACM SIGCOMM (1994)
Xue, F., Kumar, P.R.: The number of neighbors needed for connectivity of wireless networks. Wireless Networks 10 (2004)
Li, N., Hou, J.C.: Improving connectivity of wireless ad-hoc networks. Technical Report UIUCDCS-R-2004-2485, UIUC DCS (2004)
Zhao, W., Ammar, M., Zegura, E.: A message ferrying approach for data delivery in sparse mobile ad hoc networks. ACM MobiHoc (2004)
DTNRG: Delay tolerant networking research group, http://www.dtnrg.org/
DTN: Disruption tolerant networking, http://www.darpa.mil/ato/solicit/DTN/
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. ACM SIGCOMM (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM (2001)
Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: A resilient global-scale overlay for service deployment. IEEE JSAC 22 (2004)
Pei, G., Gerla, M., Hong, X.: Lanmar: Landmark routing for large scale wireless ad hoc networks with group mobility. ACM MobiHoc (2000)
Tsuchiya, P.F.: The landmark hierarchy: a new hierarchy for routing in very large networks. ACM Computer Communication Review 18, 35–42 (1988)
Gerla, M., Hong, X., Pei, G.: Landmark routing for large ad hoc wireless networks. IEEE Globecom (2000)
Xu, K., Hong, X., Gerla, M.: Landmark routing in ad hoc networks with mobile backbones. Journal of Parallel and Distributed Computing (JPDC), Special Issues on Ad Hoc Networks, 110–123 (2003)
Banerjee, S., Khuller, S.: A clustering scheme for hierarchical control in multi-hop wireless networks. IEEE Infocom (2001)
Sinha, P., Sivakumar, R., Bharghavan, V.: Enhancing ad hoc routing with dynamic virtual infrastructures. IEEE Infocom (2001)
Perkins, C.E.: Ad hoc networking (2001)
Basagni, S., Chlamtac, I., Syrotiuk, V.R.: A distance routing effect algorithm for mobility (dream). ACM MobiCom (1998)
Grossglauser, M., Vetterli, M.: Locating nodes with ease: Last encounter routing in ad hoc networks through mobility diffusion. IEEE Infocom (2003)
Zhao, W., Ammar, M.: Proactive routing in highly-partitioned wireless ad hoc networks. In: 9th IEEE International Workshop on Future Trends of Distributed Computing Systems (2003)
Nandan, A., Das, S., Pau, G., Sanadidi, M.Y., Gerla, M.: Cooperative downloading in vehicular ad-hoc wireless networks. In: Wireless On-Demand Network and Services (2005)
Ferriere, H.D.: Nab (network in a box), http://nab.epfl.ch/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gerla, M. et al. (2005). Dealing with Node Mobility in Ad Hoc Wireless Network. In: Bernardo, M., Bogliolo, A. (eds) Formal Methods for Mobile Computing. SFM-Moby 2005. Lecture Notes in Computer Science, vol 3465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11419822_3
Download citation
DOI: https://doi.org/10.1007/11419822_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25697-7
Online ISBN: 978-3-540-32021-0
eBook Packages: Computer ScienceComputer Science (R0)