NDLI: Routing in ad-hoc networks using minimum connected dominating sets

Content Provider	IEEE Xplore Digital Library
Author	Das, B. Bharghavan, V.
Copyright Year	1997
Description	Author affiliation: Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA (Das, B.)
Abstract	We impose a virtual backbone structure on the ad-hoc network, in order to support unicast, multicast, and fault-tolerant routing within the ad-hoc network. This virtual backbone differs from the wired backbone of cellular networks in two key ways: (a) it may change as nodes move, and (b) it is not used primarily for routing packets or flows, but only for computing and updating routes. The primary routes for packets and flows are still computed by a shortest-paths computation; the virtual backbone can, if necessary provide backup routes to handle interim failures. Because of the dynamic nature of the virtual backbone, our approach splits the routing problem into two levels: (a) find and update the virtual backbone, and (b) then find and update routes. The key contribution of this paper is to describe several alternatives for the first part of finding and updating the virtual backbone. To keep the virtual backbone as small as possible we use an approximation to the minimum connected dominating set (MCDS) of the ad-hoc network topology as the virtual backbone. The hosts in the MCDS maintain local copies of the global topology of the network, along with shortest paths between all pairs of nodes.
Starting Page	376
Ending Page	380
File Size	590621
Page Count	5
File Format	PDF
ISBN	0780339258
DOI	10.1109/ICC.1997.605303
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1997-06-12
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Routing Intelligent networks Ad hoc networks Spine Network topology Unicast Land mobile radio cellular systems Fault tolerance Wireless networks Multicast algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Distributed construction of connected dominating set in wireless ad hoc networks

Lifetime-aware multicast routing in wireless ad hoc networks

Algorithmic Aspects for Independent and Dominating Sets in Mobile Ad Hoc Networks

A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set

Evaluation of mobile ad-hoc network techniques in a cellular network

Distributed algorithm for power aware minimum connected dominating set for routing in wireless ad hoc network

Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networks

Multicasting in energy-limited ad-hoc wireless networks

Route failure tolerant multicast in Mobile Ad Hoc Networks using disjoint minimum spanning trees

Routing in ad-hoc networks using minimum connected dominating sets

Similar Documents

Distributed construction of connected dominating set in wireless ad hoc networks

Lifetime-aware multicast routing in wireless ad hoc networks

Algorithmic Aspects for Independent and Dominating Sets in Mobile Ad Hoc Networks

A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set

Evaluation of mobile ad-hoc network techniques in a cellular network

Distributed algorithm for power aware minimum connected dominating set for routing in wireless ad hoc network

Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networks

Multicasting in energy-limited ad-hoc wireless networks

Route failure tolerant multicast in Mobile Ad Hoc Networks using disjoint minimum spanning trees

Routing in ad-hoc networks using minimum connected dominating sets