Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1298275.1298294acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
Article

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

Published: 22 October 2007 Publication History

Abstract

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.

References

[1]
J. B. et al. Data structures for mobile data. Journal of Algorithms, 31(1):1--28, 1999.
[2]
J. H. et al. Manet position and mobility signaling format, February 2007. Internet Draft, http://tools.ietf.org/id/ draft-haerri-manet-position-signaling-00.txt (work in progress).
[3]
C. Gentile, J. Härri, and R. E. V. Dyck. Kinetic minimum-power routing and clustering in mobile ad-hoc networks. In Proc. of the IEEE Vehicular Technology Conference (VTC'02 Fall)Conference, 2002.
[4]
L. Guibas. Kinetic data structures: A state of the art report. In Proc of the 3rd Workshop of Algorithmic Foundations of Robotics, 1998.
[5]
I. S. H. Frey. Geographic and energy aware routing in sensor networks. In I. StojmenoviĆ, editor, Handbook of Sensor Networks: Algorithms and Architectures, chapter 12, pages 381--415. Wiley, 2006.
[6]
J. Haerri, C. Bonnet, and F. Filali. Challenges of predicting mobility. Technical Report 06-171, Institut Eurécom, 2006.
[7]
J. Haerri, F. Filali, and C. Bonnet. Rethinking the overhead of geo-localization information for vehicular communications. In The 1st IEEE International Symposium on Wireless Vehicular Communications (WiVec'07), 2007.
[8]
J. Herschberger. Smooth kinetic maintenance of clusters. In Proc. of the 19th Annual Symposium on Computational Geometry, 2003.
[9]
N. Li, J. Hou, and L. Sha. Design and analysis of an mst-based topology control algorithm. In Proc. of the IEEE INFOCOM, 2003.
[10]
X. Li and I. StojmenoviĆ. Broadcasting and topology control in wireless ad hoc networks. In A. Boukerche and I. Chlamtac, editors, Handbook of Algorithms for Mobile and Wireless Networking and Computing, chapter 11, pages 239--264. CRC Press, 2006.

Cited By

View all
  • (2011)Vehicular Delay Tolerant NetworksHandbook of Research on Mobility and Computing10.4018/978-1-60960-042-6.ch023(356-367)Online publication date: 2011
  • (2009)On the structure and evolution of vehicular networks2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems10.1109/MASCOT.2009.5366230(1-10)Online publication date: Sep-2009

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PM2HW2N '07: Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
October 2007
144 pages
ISBN:9781595938053
DOI:10.1145/1298275
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 October 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. MANET
  2. broadcast
  3. design methodologies
  4. kinetic graph
  5. mobile structure
  6. mobility management
  7. time varying weights

Qualifiers

  • Article

Conference

MSWiM07
Sponsor:

Acceptance Rates

Overall Acceptance Rate 74 of 226 submissions, 33%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 21 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2011)Vehicular Delay Tolerant NetworksHandbook of Research on Mobility and Computing10.4018/978-1-60960-042-6.ch023(356-367)Online publication date: 2011
  • (2009)On the structure and evolution of vehicular networks2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems10.1109/MASCOT.2009.5366230(1-10)Online publication date: Sep-2009

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media