NDLI: Valuable detours: least-cost anypath routing

Content Provider	ACM Digital Library
Author	Dubois-ferrière, Henri Grossglauser, Matthias Vetterli, Martin
Copyright Year	2011
Abstract	In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. This observation was previously exploited by opportunistic routing protocols by using single-path routing metrics to assign to each node a group of candidate relays for a particular destination. This paper addresses the least-cost anypath routing (LCAR) problem: how to assign a set of candidate relays at each node for a given destination such that the expected cost of forwarding a packet to the destination is minimized. The key is the following tradeoff: On one hand, increasing the number of candidate relays decreases the forwarding cost, but on the other, it increases the likelihood of "veering" away from the shortest-path route. Prior proposals based on single-path routing metrics or geographic coordinates do not explicitly consider this tradeoff and, as a result, do not always make optimal choices. The LCAR algorithm and its framework are general and can be applied to a variety of networks and cost models. We show how LCAR can incorporate different aspects of underlying coordination protocols, for example a link-layer protocol that randomly selects which receiving node will forward a packet, or the possibility that multiple nodes mistakenly forward a packet. In either case, the LCAR algorithm finds the optimal choice of candidate relays that takes into account these properties of the link layer. Finally, we apply LCAR to low-power, low-rate wireless communication and introduce a new wireless link-layer technique to decrease energy transmission costs in conjunction with anypath routing. Simulations show significant reductions in transmission cost to opportunistic routing using single-path metrics. Furthermore, LCAR routes are more robust and stable than those based on single-path distances due to the integrative nature of the LCAR's route cost metric.
Starting Page	333
Ending Page	346
Page Count	14
File Format	PDF
ISSN	10636692
DOI	10.1109/TNET.2010.2070844
Volume Number	19
Issue Number	2
Journal	IEEE/ACM Transactions on Networking (TON)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2011-04-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Cross-layer design Routing protocols Wireless mesh networks
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering Computer Networks and Communications Software Computer Science Applications

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

Valuable Detours: Least-Cost Anypath Routing

Cross-Layer Design in Wireless Mesh Networks

Polynomial-time algorithms for multirate anypath routing in wireless multihop networks

Valuable detours: least-cost anypath routing.

MAP: Multiconstrained Anypath Routing in Wireless Mesh Networks

Polynomial-Time Algorithms for Multirate Anypath Routing in Wireless Multihop Networks

Valuable detours: least-cost anypath routing (2010).

Cross-Layer Metrics for Reliable Routing in Wireless Mesh Networks

Cross-layer metrics for reliable routing in wireless mesh networks

Valuable detours: least-cost anypath routing

Similar Documents

Valuable Detours: Least-Cost Anypath Routing

Cross-Layer Design in Wireless Mesh Networks

Polynomial-time algorithms for multirate anypath routing in wireless multihop networks

Valuable detours: least-cost anypath routing.

MAP: Multiconstrained Anypath Routing in Wireless Mesh Networks

Polynomial-Time Algorithms for Multirate Anypath Routing in Wireless Multihop Networks

Valuable detours: least-cost anypath routing (2010).

Cross-Layer Metrics for Reliable Routing in Wireless Mesh Networks

Cross-layer metrics for reliable routing in wireless mesh networks

Valuable detours: least-cost anypath routing