ACM Home Page
Please provide us with feedback. Feedback
The geometry of mobility
Full text PdfPdf (150 KB)
Source
International Conference on Mobile Computing and Networking archive
Proceedings of the 13th annual ACM international conference on Mobile computing and networking table of contents
Montréal, Québec, Canada
Pages: 1 - 1  
Year of Publication: 2007
ISBN:978-1-59593-681-3
Author
Leonidas J. Guibas  Stanford University
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 101,   Citation Count: 0
Additional Information:

abstract   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1287853.1287854
What is a DOI?

ABSTRACT

Mobility in networks arises both as mobility of packets and mobility of nodes. In a wireless setting, packets move under network control to meet desiderata of low latency, high throughput, load-balancing, energy conservation, etc. Nodes, though, often move under the influence of forces unrelated to the network state, necessitating the continuous adaptation of supporting network structures. In order to understand how to best design such structures, it is important to study the stability of various network mechanisms under node motion, as well as under other kinds of variability in the network, such as wireless link volatility.

Since networks are embedded in the physical world (sometimes in order to monitor this very world, as in sensor networks) and node motion happens under physical laws, geometric and topological methods can be useful in understanding global structures that can affect network performance. In this talk we give a number of examples of such methods, such as the use of kinetic data structures in clustering mobile nodes and the use of topological complexes for capturing the global structure of a static network with the goal of designing efficient routing protocols.