Sociological orbit aware location approximation and routing in MANET

In this paper, we introduce a novel concept of integrating ''macro-mobility" information obtained from the sociological movement pattern of mobile MANET users into routing. The extraction of this mobility information is based on our observation that the movement of a mobile user exhibits a partially repetitive "orbital" pattern involving a set of "hubs" in practice. This partially deterministic movement pattern is both practical and useful in locating nodes and routing packets to them without the need for constant tracking or flooding. Leveraging on this hub-based orbital pattern, we propose a sociological orbit aware location approximation and routing (SOLAR) protocol. Through extensive performance analysis we show that SOLAR significantly outperforms conventional routing protocols like dynamic source routing (DSR) and location aided routing (LAR) in terms of higher data throughput, lower control overhead, and lower end-to-end delay.

[1]  Xiaoyan Hong,et al.  A Mobility Framework for Ad Hoc Wireless Networks , 2001, Mobile Data Management.

[2]  Kevin C. Almeroth,et al.  Towards realistic mobility models for mobile ad hoc networks , 2003, MobiCom '03.

[3]  Sajal K. Das,et al.  Mobility-adaptive protocols for managing large ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[4]  Jennifer Widom,et al.  Teletraffic modeling for personal communications services , 1997 .

[5]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[6]  Cecilia Mascolo,et al.  Adaptive routing for intermittently connected mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[7]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[8]  Guevara Noubir,et al.  Mobility models for ad hoc network simulation , 2004, IEEE INFOCOM 2004.

[9]  E. McCluskey.  Minimization of Boolean functions , 1956 .

[10]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  Ian F. Akyildiz,et al.  On the estimation of user mobility pattern for location tracking in wireless networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[12]  Ahmed Helmy,et al.  IMPORTANT: a framework to systematically analyze the Impact of Mobility on Performance of Routing Protocols for Adhoc Networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[14]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Per Enge,et al.  Special Issue on Global Positioning System , 1999, Proc. IEEE.

[16]  Desney S. Tan,et al.  Design and Evaluation of an Individually Simulated Mobility Model in Wireless Ad Hoc Networks , 2001 .

[17]  Tong Liu,et al.  Mobility modeling, location tracking, and trajectory prediction in wireless ATM networks , 1998, IEEE J. Sel. Areas Commun..

[18]  Chunming Qiao,et al.  Acquaintance based soft location management (ABSLM) in MANET , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[19]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[20]  Martin T. Pietrucha,et al.  FIELD STUDIES OF PEDESTRIAN WALKING SPEED AND START-UP TIME , 1996 .

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Mario Gerla,et al.  GloMoSim: a library for parallel simulation of large-scale wireless networks , 1998 .

[23]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[24]  Xiaoyan Hong,et al.  A group mobility model for ad hoc wireless networks , 1999, MSWiM '99.

[25]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

[26]  Peter Slavík.  A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.

[27]  Sung-Ju Lee,et al.  Mobility prediction and routing in ad hoc wireless networks , 2001, Int. J. Netw. Manag..

[28]  Panos M. Pardalos,et al.  On the Construction of Virtual Backbone for Ad Hoc Wireless Network , 2003 .

[29]  George L. Lyberopoulos,et al.  Mobility modeling in third-generation mobile telecommunications systems , 1997, IEEE Wirel. Commun..

[30]  Panos K. Chrysanthis,et al.  Peer Support in a Mobile World , 2001 .

[31]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[32]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[33]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[34]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[35]  Savyasachi Samal,et al.  Mobility Pattern Aware Routing in Mobile Ad Hoc Networks , 2003 .