Spine routing in ad hoc networks

Authors:
Raghupathy Sivakumar;Bevan Das;Vaduvur Bharghavan
Affiliations:
Coordinated Sciences Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA;Coordinated Sciences Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA;Coordinated Sciences Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA
Venue:
Cluster Computing
Year:
1998

Citing 10
Cited 35

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Fast distributed construction of k-dominating sets and applications

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Optimal distributed algorithm for minimum spanning trees revisited

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Multicluster, mobile, multimedia radio network

Wireless Networks
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation Algorithms for Connected Dominating Sets

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Routing in Ad Hoc Networks Using a Spine

IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks

Fair scheduling in wireless packet networks

IEEE/ACM Transactions on Networking (TON)
Minimizing broadcast latency and redundancy in ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A differentiated distributed coordination function MAC protocol for cluster-based wireless ad hoc networks

PE-WASUN '04 Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
A Practical Approach to QoS Routing for Wireless Networks

WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A Distributed Coverage- and Connectivity-Centric Technique for Selecting Active Nodes in Wireless Sensor Networks

IEEE Transactions on Computers
A Mobility-Resistant Efficient Clustering Approach for ad hoc and sensor networks

ACM SIGMOBILE Mobile Computing and Communications Review
Design and performance evaluation of cross layered MAC and clustering solutions for wireless ad hoc networks

Performance Evaluation - Performance modelling and evaluation of wireless ad hoc and sensor networks
Balancing Push and Pull for Efficient Information Discovery in Large-Scale Sensor Networks

IEEE Transactions on Mobile Computing
Distributed algorithms for connected domination in wireless networks

Journal of Parallel and Distributed Computing
Intelligent broadcasting inmobile ad hoc networks: three classes of adaptive protocols

EURASIP Journal on Wireless Communications and Networking
Fast distributed dominating set based routing in large scale MANETs

Computer Communications
Performance evaluation of routing protocols in vehicular ad-hoc networks

International Journal of Ad Hoc and Ubiquitous Computing
A scalable key management and clustering scheme for wireless ad hoc and sensor networks

Future Generation Computer Systems
Minimizing broadcast latency and redundancy in ad hoc networks

IEEE/ACM Transactions on Networking (TON)
Fast track article: EEDTC: Energy-efficient dominating tree construction in multi-hop wireless networks

Pervasive and Mobile Computing
RBR: refinement-based route maintenance protocol in wireless ad hoc networks

Computer Communications
Efficient Power Utilization in Multi-radio Wireless Ad Hoc Networks

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Bandwidth-satisfied multicast trees in large-scale ad-hoc networks

Wireless Networks
Message ferries as generalized dominating sets in intermittently connected mobile networks

MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Connectivity and coverage maintenance in wireless sensor networks

The Journal of Supercomputing
Energy-efficient dominating tree construction in wireless ad hoc and sensor networks

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Probabilistic routing using contact sequencing in delay tolerant networks

COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Brief announcement: deterministic dominating set construction in networks with bounded degree

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A cross-layer communications framework for tactical environments

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Interference-aware, fully-distributed virtual backbone construction and its application in multi-hop wireless networks

IEEE Transactions on Communications
Deterministic dominating set construction in networks with bounded degree

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Fast track article: Message ferries as generalized dominating sets in intermittently connected mobile networks

Pervasive and Mobile Computing
Low-Latency broadcast scheduling in ad hoc networks

WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
A distributed efficient clustering approach for ad hoc and sensor networks

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Mobility-Aware on-demand global hosts for ad-hoc multicast

ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Multi-path routing using local virtual infrastructure for large-scale mobile ad-hoc networks: stochastic optimization approach

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Distributed algorithms for coloring and domination in wireless ad hoc networks

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
A two-tier framework for transmission-cost minimization of high-performance communication applications

Concurrency and Computation: Practice & Experience
Bandwidth-satisfied multicast services in large-scale MANETs

IWSOS'07 Proceedings of the Second international conference on Self-Organizing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

An ad hoc network is a multihop wireless network in which mobile hosts communicate without the support of a wired backbone for routing messages. We introduce a self organizing network structure called a spine and propose a spine-based routing infrastructure for routing in ad hoc networks. We propose two spine routing algorithms: (a) Optimal Spine Routing (OSR), which uses full and up-to-date knowledge of the network topology, and (b) Partial-knowledge Spine Routing (PSR), which uses partial knowledge of the network topology. We analyze the two algorithms and identify the optimality-overhead trade-offs involved in these algorithms.