Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
Multicluster, mobile, multimedia radio network
Wireless Networks
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Selecting forwarding neighbors in wireless Ad Hoc networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
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
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
RNG and internal node based broadcasting algorithms for wireless one-to-one networks
ACM SIGMOBILE Mobile Computing and Communications Review
The Delauney Triangulation Closely Approximates the Complete Euclidean Graph
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
On the Spanning Ratio of Gabriel Graphs and beta-skeletons
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Load-Balancing Clusters in Wireless Ad Hoc Networks
ASSET '00 Proceedings of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology (ASSET'00)
Sparse Power Efficient Topology for Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Geometric Spanners for Wireless Ad Hoc Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Using Location Information to Improve Routing in Ad Hoc Networks
Using Location Information to Improve Routing in Ad Hoc Networks
Virtual backbones in wireless ad hoc networks
Virtual backbones in wireless ad hoc networks
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Minimum power configuration in wireless sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Finding the best shortcut in a geometric network
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Differentiation, QoS Guarantee, and Optimization for Real-Time Traffic over One-Hop Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Constant density spanners for wireless ad-hoc networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs
IEEE Transactions on Computers
Securing Weakly-Dominating Virtual Backbones in Mobile Ad Hoc Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Maintaining a quality of service routing tree for mobile ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Efficient Distributed Low-Cost Backbone Formation for Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication
IEEE Transactions on Parallel and Distributed Systems
Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges
IEEE Transactions on Mobile Computing
Geometric spanners with applications in wireless networks
Computational Geometry: Theory and Applications
Minimum power configuration for wireless communication in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Local solutions for global problems in wireless networks
Journal of Discrete Algorithms
Backbone construction in selfish wireless networks
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Multicast capacity for large scale wireless ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Sparse geometric graphs with small dilation
Computational Geometry: Theory and Applications
Energy-efficient topology control for three-dimensional sensor networks
International Journal of Sensor Networks
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Constrained Delaunay triangulation for ad hoc networks
Journal of Computer Systems, Networks, and Communications
Self-organization of unattended wireless acoustic sensor networks for ground target tracking
Pervasive and Mobile Computing
Self-organizing fault-tolerant topology control in large-scale three-dimensional wireless networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Experimental study of geometric t-spanners
Journal of Experimental Algorithmics (JEA)
Multicast capacity of wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Multi-hop scatternet formation and routing for large scale Bluetooth networks
International Journal of Ad Hoc and Ubiquitous Computing
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Multicast capacity for multi-hop multi-channel multi-radio wireless networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Low complexity stable link scheduling for maximizing throughput in wireless networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
DNIS'07 Proceedings of the 5th international conference on Databases in networked information systems
Journal of Discrete Algorithms
Efficient data collection for wireless networks: delay and energy tradeoffs
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Energy and mobility-aware topology control in heterogeneous mobile ad hoc networks
International Journal of Computational Science and Engineering
An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
Journal of Parallel and Distributed Computing
Planar hop spanners for unit disk graphs
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
Separability and topology control of quasi unit disk graphs
Wireless Networks
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Multi-sector multi-range control for self-organizing wireless networks
Journal of Network and Computer Applications
Locally-Constructed trees for adhoc routing
PWC'06 Proceedings of the 11th IFIP TC6 international conference on Personal Wireless Communications
I/O-Efficiently pruning dense spanners
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Sparse geometric graphs with small dilation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Spanners, weak spanners, and power spanners for wireless networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Compact and low delay routing labeling scheme for Unit Disk Graphs
Computational Geometry: Theory and Applications
Finding minimum weight connected dominating set in stochastic graph based on learning automata
Information Sciences: an International Journal
Constructing efficient rotating backbones in wireless sensor networks using graph coloring
Computer Communications
An adaptive backbone formation algorithm for wireless sensor networks
Computer Communications
Fault-tolerant spanners for ad hoc networks
International Journal of Network Management
Secure local algorithm for establishing a virtual backbone in 3D ad hoc network
International Journal of Networking and Virtual Organisations
An energy-efficient topology construction algorithm for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Mobility-Based Backbone Formation in Wireless Mobile Ad-hoc Networks
Wireless Personal Communications: An International Journal
On channel-discontinuity-constraint routing in wireless networks
Ad Hoc Networks
Constructing a MANET Based on Clusters
Wireless Personal Communications: An International Journal
Hi-index | 0.01 |
We propose a new geometric spanner for static wireless ad hoc networks, which can be constructed efficiently in a localized manner. It integrates the connected dominating set and the local Delaunay graph to form a backbone of the wireless network. Priori arts showed that both structures can be constructed locally with bounded communication costs. This new spanner has these following attractive properties: 1) the backbone is a planar graph, 2) the node degree of the backbone is bounded from above by a positive constant, 3) it is a spanner for both hops and length, 4) it can be constructed locally and is easy to maintain when the nodes move around, and 5) moreover, the communication cost of each node is bounded by a constant. Simulation results are also presented for studying its practical performance.