Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
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
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
Journal of the ACM (JACM)
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
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
Self Organized Terminode Routing
Cluster Computing
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Location-based localized alternate, disjoint and multi-path routing algorithms for wireless networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Poster abstract: on the effect of localization errors on geographic face routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
An Approach to Data Visualization and Interpretation for Sensor Networks
HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3
ACM SIGMOBILE Mobile Computing and Communications Review - Special issue on wireless pan & sensor networks
Position-based routing in ad hoc wireless networks
The handbook of ad hoc wireless networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Face Traversal Routing on Edge Dynamic Graphs
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Characterizing the Impact of Routing Holes on Geographic Routing
ICW '05 Proceedings of the 2005 Systems Communications
Graph Theory With Applications
Graph Theory With Applications
A Generalization of the Face Routing
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Theoretical aspects of connectivity-based multi-hop positioning
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
International Journal of Distributed Sensor Networks
International Journal of Distributed Sensor Networks - Selected Papers in Innovations and Real-Time Applications of Distributed Sensor Networks
Approximate MST for UDG locally
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Randomized AB-Face-AB routing algorithms in mobile ad hoc networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Half-space proximal: a new local test for extracting a bounded dilation spanner of a unit disk graph
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Local construction of planar spanners in unit disk graphs with irregular transmission ranges
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Position-based routing in ad hoc networks
IEEE Communications Magazine
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Network: The Magazine of Global Internetworking
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
Information Processing Letters
Proximal Labeling for Oblivious Routing in Wireless Ad Hoc Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Evolutionary design of oriented-tree networks using Cayley-type encodings
Information Sciences: an International Journal
Local 7-coloring for planar subgraphs of unit disk graphs
Theoretical Computer Science
Analysing local algorithms in location-aware quasi-unit-disk graphs
Discrete Applied Mathematics
Some problems in distributed computational geometry
Theoretical Computer Science
Approximating the edge length of 2-edge connected planar geometric graphs on a set of points
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is one in which any node of a network only has information on nodes at distance at most k from itself, for a constant k. For example, given a unit distance wireless network N, we want to obtain a planar subnetwork of N by means of an algorithm in which all nodes can communicate only with their neighbors in N, perform some operations, and then halt. We review algorithms for obtaining planar subnetworks, approximations to minimum weight spanning trees, Delaunay triangulations, and relative neighbor graphs. Given a unit distance wireless network N, we present new local algorithms to solve the following problems:1.Calculate small dominating sets (not necessarily connected) of N. 2.Extract a bounded degree planar subgraph H of N and obtain a proper edge coloring of H with at most 12 colors. The second of these algorithms can be used in the channel assignment problem.