Concurrent online tracking of mobile users
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
GeoCast—geographic addressing and routing
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Unit disk graph recognition is NP-hard
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Unidirectional links prove costly in wireless ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Energy, congestion and dilation in radio networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Analysis of link reversal routing algorithms for mobile ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
On local algorithms for topology control and routing in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A Scalable Location Management Scheme in Mobile Ad-Hoc Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Poster abstract: BTnodes -- a distributed platform for sensor nodes
Proceedings of the 1st international conference on Embedded networked sensor systems
Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning
PERCOM '04 Proceedings of the Second IEEE International Conference on Pervasive Computing and Communications (PerCom'04)
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Virtual coordinates for ad hoc and sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Proceedings of the 2004 joint workshop on Foundations of mobile computing
LLS: a locality aware location service for mobile ad hoc networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Algorithms for ad hoc and sensor networks
Computer Communications
| Hi-index | 0.00 |
Wireless and mobile networks are an excellent playground for graph theoreticians. Many research challenges turn out to be variants of classic graph theory problems. In particular the rapidly growing areas of ad-hoc and sensor networks demand new solutions for timeless graph theory problems, because i) wireless devices have lower bandwidth and ii) wireless devices are mobile and therefore the topology of the network changes rather frequently. As a consequence, algorithms for wireless and mobile networks should have i) as little communication as possible and should ii) run as fast as possible. Both goals can only be achieved by developing algorithms requiring a small number of communication rounds only (so-called local algorithms). In this work we present a few connections between graph theory and wireless networking, such as topology control, clustering, and geo-routing. Each section is supplemented with an open problem.