NDLI: Analysis of Contention-based relay selection mechanisms in autonomous multi-hop networks

Content Provider	IEEE Xplore Digital Library
Author	de Lima, C.H.M. de Abreu, G.T.F.
Copyright Year	2009
Description	Author affiliation: Centre for Wireless Communications, University of Oulu, P. O. Box 4500FIN-90014, Finland (de Lima, C.H.M.; de Abreu, G.T.F.)
Abstract	A fundamental question of interest in multi-hop networks is whether routing should be done in a smaller number of longer hops, or larger number of shorter hops. However, underneath these aspects of the routing problem itself is the number of contending nodes involved in the relay selection taking place at each hop so as to realize whichever routing strategy adopted. A larger number of nodes increases the likelihood of finding an adequate relay, whereas increasing the selection overhead, and vice-versa. In this article we investigate both the expected cost (in time consumed) incurred by the relay selection strategy, and the effectiveness of the forwarding strategy (in spatial advancements) as a function of the number of the contending nodes, when using Contention-based Geographic Forwarding (CGF) strategies to relay packets in multi-hop scenarios. In particular, Probability Generating Functions (PGFs) are utilized to compute the distribution of Contention Resolution Intervals (CRIs) and quantify overhead, while stochastic geometry is utilized to model topological aspects of the network and quantify expected progress. Both a totally random and an auction-based Relay Selection Algorithms (RSAs) are studied and compared, with the advantages of the auction-based approach established analytically. From an overhead point of view, the selection of the furthest and the nearest relays are equivalent, but our results indicate that the long-hop routing approach is less sensitive to the number of contending nodes than the short-hop alternative.
Starting Page	186
Ending Page	190
File Size	242652
Page Count	5
File Format	PDF
ISBN	9781424445356
DOI	10.1109/ITWNIT.2009.5158568
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-06-12
Publisher Place	Greece
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Relays Spread spectrum communication Routing Cost function Computer networks Distributed computing Spatial resolution Stochastic processes Computational geometry Information geometry
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

Mobile-based relay selection schemes for multi-hop cellular networks

An adaptive cooperative protocol for multi-hop relay selection in wireless networks

An adaptive cooperative protocol for multi-hop wireless networks

Minimum outage routing in cooperative multi-hop networks

Path cost metrics for multi-hop network routing

Symmetric Path Selection in IEEE 802.16 Multi-Hop Relay Networks with Error Prone Links

Relay Selection in Two-Hop IEEE 802.16 Mobile Multi-Hop Relay Networks

Pricing, Competition, and Routing for Selfish and Strategic Nodes in Multi-Hop Relay Networks

Game-theoretical Relay Selection strategy for geographic routing in Multi-hop WSNs

Analysis of Contention-based relay selection mechanisms in autonomous multi-hop networks

Similar Documents

Mobile-based relay selection schemes for multi-hop cellular networks

An adaptive cooperative protocol for multi-hop relay selection in wireless networks

An adaptive cooperative protocol for multi-hop wireless networks

Minimum outage routing in cooperative multi-hop networks

Path cost metrics for multi-hop network routing

Symmetric Path Selection in IEEE 802.16 Multi-Hop Relay Networks with Error Prone Links

Relay Selection in Two-Hop IEEE 802.16 Mobile Multi-Hop Relay Networks

Pricing, Competition, and Routing for Selfish and Strategic Nodes in Multi-Hop Relay Networks

Game-theoretical Relay Selection strategy for geographic routing in Multi-hop WSNs

Analysis of Contention-based relay selection mechanisms in autonomous multi-hop networks