NDLI: On average and maximum load of greedy routing in wireless ad hoc networks

Content Provider	IEEE Xplore Digital Library
Author	Hesari, M.E. Narayanan, L. Opatrny, J.
Copyright Year	2010
Description	Author affiliation: CSE Department, Concordia University, Montreal, Quebec, Canada (Hesari, M.E.; Narayanan, L.; Opatrny, J.)
Abstract	One common model that has been used to analyze routing algorithms in ad hoc networks considers networks that are so dense that a node exists close enough to any point in the network. Continuous techniques were used to calculate the average and maximum loads of the routing algorithms. In this paper we explain some limitations of such techniques in predicting the load of routing algorithms in discrete network models such as unit disk graphs even at high node densities. We present a new approach to find estimates of the average and maximum load induced by greedy routing in discrete network models. Our model takes into consideration parameters such as the transmission radius and the average degree of nodes, and is suitable for networks that are not necessarily very dense. Our model is validated by simulation results that closely match the theoretical predictions.
Starting Page	113
Ending Page	120
File Size	501142
Page Count	8
File Format	PDF
ISBN	9781424460595
e-ISBN	9781424460618
DOI	10.1109/WONS.2010.5437122
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-02-03
Publisher Place	Slovenia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Wireless communication Spread spectrum communication Predictive models Routing Approximation algorithms Ad hoc networks Joining processes Mobile ad hoc networks
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

An analysis of a basic routing algorithm for ad-hoc networks

Curve-Based Planar Graph Routing in Multihop Wireless Networks

Predictive Directional Greedy Routing in Vehicular Ad hoc Networks

Fully distributed cluster based routing architecture for mobile ad hoc networks

MIPMANET-mobile IP for mobile ad hoc networks

Hybrid greedy/face routing for ad-hoc sensor network

A trust propagation scheme in VANETs

Reliable routing in mobile ad hoc networks based on mobility prediction

A Distributed Algorithm for Connecting Dominating Sets in Wireless Ad Hoc Networks

On average and maximum load of greedy routing in wireless ad hoc networks

Similar Documents

An analysis of a basic routing algorithm for ad-hoc networks

Curve-Based Planar Graph Routing in Multihop Wireless Networks

Predictive Directional Greedy Routing in Vehicular Ad hoc Networks

Fully distributed cluster based routing architecture for mobile ad hoc networks

MIPMANET-mobile IP for mobile ad hoc networks

Hybrid greedy/face routing for ad-hoc sensor network

A trust propagation scheme in VANETs

Reliable routing in mobile ad hoc networks based on mobility prediction

A Distributed Algorithm for Connecting Dominating Sets in Wireless Ad Hoc Networks

On average and maximum load of greedy routing in wireless ad hoc networks