Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Differentiation, QoS Guarantee, and Optimization for Real-Time Traffic over One-Hop Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
Localized Topology Control for Unicast and Broadcast in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Integrated location management and location-aided routing system for mobile ad hoc networks
Journal of Parallel and Distributed Computing
Local approximation schemes for topology control
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
Mobile Networks and Applications
Locating and bypassing holes in sensor networks
Mobile Networks and Applications
Local solutions for global problems in wireless networks
Journal of Discrete Algorithms
The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
A shortest-path-based topology control algorithm in wireless multihop networks
ACM SIGCOMM Computer Communication Review
Skipping technique in face routing for wireless ad hoc and sensor networks
International Journal of Sensor Networks
Computing Lightweight Spanners Locally
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Effect of Neighborhood on In-Network Processing in Sensor Networks
GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Constrained Delaunay triangulation for ad hoc networks
Journal of Computer Systems, Networks, and Communications
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs
Theoretical Computer Science
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
Information Processing Letters
Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
On Spanners of Geometric Graphs
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Secure and efficient data transmission in RFID sensor networks
International Journal of Security and Networks
Single-step creation of localized Delaunay triangulations
Wireless Networks
Local edge colouring of Yao-like subgraphs of unit disk graphs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Forwarding via checkpoints: Geographic routing on always-on sensors
Journal of Parallel and Distributed Computing
Localized spanner construction for ad hoc networks with variable transmission range
ACM Transactions on Sensor Networks (TOSN)
Energy-efficient k-coverage for wireless sensor networks with variable sensing radii
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
TAP: an adjustable planar structure for adaptive topology control in wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Energy-efficient restricted greedy routing for three dimensional random wireless networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
On the stretch factor of Delaunay triangulations of points in convex position
Computational Geometry: Theory and Applications
Defending against physical destruction attacks on wireless sensor networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Improved local algorithms for spanner construction
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Success guaranteed routing in almost Delaunay planar nets for wireless sensor communication
International Journal of Sensor Networks
On Spanners and Lightweight Spanners of Geometric Graphs
SIAM Journal on Computing
Improved upper bound on the stretch factor of delaunay triangulations
Proceedings of the twenty-seventh annual symposium on Computational geometry
Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Fault tolerant interference-aware topology control for ad hoc wireless networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Locally-Constructed trees for adhoc routing
PWC'06 Proceedings of the 11th IFIP TC6 international conference on Personal Wireless Communications
On the topologies of local minimum spanning trees
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Communication-efficient construction of the plane localized delaunay graph
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Topology control with limited geometric information
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
A localized link removal and addition based planarization algorithm
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Journal of Parallel and Distributed Computing
Fault-tolerant spanners for ad hoc networks
International Journal of Network Management
Theoretical Computer Science
Large scale simulation for human evacuation and rescue
Computers & Mathematics with Applications
Topology control based on optimally rigid graph in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch
IEEE/ACM Transactions on Networking (TON)
On certain geometric properties of the Yao---Yao graphs
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Several localized routing protocols guarantee the delivery of the packets when the underlying network topology is a planar graph. Typically, relative neighborhood graph (RING) or Gabriel graph (GG) is used as such planar structure. However, it is well-known that the spanning ratios of these two graphs are not bounded by any constant (even for uniform randomly distributed points). Bose et al. (1999) recently developed a localized routing protocol that guarantees that the distance traveled by the packets is within a constant factor of the minimum if Delaunay triangulation of all wireless nodes is used, in addition, to guarantee the delivery of the packets. However, it is expensive to construct the Delaunay triangulation in a distributed manner. Given a set of wireless nodes, we model the network as a unit-disk graph (UDG), in which a link uv exists only if the distance ||uv|| is at most the maximum transmission range. In this paper, we present a novel localized networking protocol that constructs a planar 2 5-spanner of UDG, called the localized Delaunay triangulation (LDEL), as network topology. It contains all edges that are both in the unit-disk graph and the Delaunay triangulation of all nodes. The total communication cost of our networking protocol is O(n log n) bits, which is within a constant factor of the optimum to construct any structure in a distributed manner. Our experiments show that the delivery rates of some of the existing localized routing protocols are increased when localized Delaunay triangulation is used instead of several previously proposed topologies. Our simulations also show that the traveled distance of the packets is significantly less when the FACE routing algorithm is applied on LDEL, rather than applied on GG.