Kinetic graphs: a framework for capturing the dynamics of mobile structures in manet

In Mobile Ad Hoc Networks (MANET), structures are built in order to improve network resource for broadcast or routing. Inspired by graph theory, most of those structures are built using fixed criteria, such as degree or distance, yet based only on local information. However, mobility alters the optimality of these localized structures, as the criteria dynamically varies with time. Since those criteria do not change homogeneously, a periodic maintenance wastes network resource, as it inefficiently acquires new values in an disorganized way. In this paper, we introduce the concept of Kinetic Graphs as a method to capture the dynamics of mobile structures and accordingly develop an efficient maintenance. Unlike the static counterpart, kinetic graphs are assumed to be continuously changing and edges are represented by time-varying weights. Kinetic graphs are a natural extension of static graphs and provide solutions to similar problems, such as convex hulls, spanning trees or connected dominating sets, but for continuously mobile networks.

[1]  C. Gentile,et al.  Kinetic minimum-power routing and clustering in mobile ad-hoc networks , 2002, Proceedings IEEE 56th Vehicular Technology Conference.

[2]  John Hershberger.  Smooth kinetic maintenance of clusters , 2003, SCG '03.

[3]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[4]  Xiang-Yang Li,et al.  Geometric Spanners for Wireless Ad Hoc Networks , 2003, IEEE Trans. Parallel Distributed Syst..

[5]  R.J. Fontana,et al.  Ultra-wideband precision asset location system , 2002, 2002 IEEE Conference on Ultra Wideband Systems and Technologies (IEEE Cat. No.02EX580).

[6]  Ivan Stojmenovic,et al.  Geographic and Energy-Aware Routing in Sensor Networks , 2005, Handbook of Sensor Networks.

[7]  Xin Li,et al.  Localized delaunay triangulation with application in wireless ad hoc networks , 2002 .

[8]  Fethi Filali,et al.  The Challenges of Predicting Mobility August , .

[9]  Camillo Gentile,et al.  Robust location using system dynamics and motion constraints , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[10]  Ivan Stojmenovic,et al.  Broadcasting and Topology Control in Wireless Ad Hoc Networks , 2005, Handbook of Algorithms for Wireless Networking and Mobile Computing.

[11]  Christian Bonnet,et al.  DDR-distributed dynamic routing algorithm for mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[12]  Christian Bonnet,et al.  Trajectory knowledge for improving topology control in mobile ad-hoc networks , 2005, CoNEXT '05.

[13]  Jennifer C. Hou,et al.  BLMST: a scalable, power-efficient broadcast algorithm for wireless networks , 2004, First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks.

[14]  Jerome Haerri,et al.  MANET Position and Mobility Signaling: Problem Statement , 2008 .

[15]  Christian Bonnet,et al.  Rethinking the Overhead of Geo-Localization Information for Vehicular Communications , 2007, 2007 IEEE 66th Vehicular Technology Conference.

[16]  Christian Bonnet,et al.  On the Application of Mobility Predictions to Multipoint Relaying in MANETs: Kinetic Multipoint Relays , 2005, AINTEC.

[17]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

[18]  Leonidas J. Guibas,et al.  Kinetic data structures: a state of the art report , 1998 .

[19]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[20]  David G. Kirkpatrick,et al.  Mobile facility location , 2000 .

[21]  Leonidas J. Guibas,et al.  Data Structures for Mobile Data , 1997, J. Algorithms.