NDLI: Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks

Please wait, while we are loading the content...

Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks

Content Provider	Springer Nature Link
Author	Datta, Susanta Stojmevic, Ivan Wu, Jie
Copyright Year	2002
Abstract	Several localized position based routing algorithms for wireless networks were described recently. In greedy routing algorithm (that has close performance to the shortest path algorithm, if successful), sender or node S currently holding the message m forwards m to one of its neighbors that is the closest to destination. The algorithm fails if S does not have any neighbor that is closer to destination than S. FACE algorithm guarantees the delivery of m if the network, modeled by unit graph, is connected. GFG algorithm combines greedy and FACE algorithms. Greedy algorithm is applied as long as possible, until delivery or a failure. In case of failure, the algorithm switches to FACE algorithm until a node closer to destination than last failure node is found, at which point greedy algorithm is applied again. Past traffic does not need to be memorized at nodes. In this paper we further improve the performance of GFG algorithm, by reducing its average hop count. First we improve the FACE algorithm by adding a sooner-back procedure for earlier escape from FACE mode. Then we perform a shortcut procedure at each forwarding node S. Node S uses the local information available to calculate as many hops as possible and forwards the packet to the last known hop directly instead of forwarding it to the next hop. The second improvement is based on the concept of dominating sets. Each node in the network is classified as internal or not, based on geographic position of its neighboring nodes. The network of internal nodes defines a connected dominating set, i.e., and each node must be either internal or directly connected to an internal node. In addition, internal nodes are connected. We apply several existing definitions of internal nodes, namely the concepts of intermediate, inter-gateway and gateway nodes. We propose to run GFG routing, enhanced by shortcut procedure, on the dominating set, except possibly the first and last hops. The performance of proposed algorithms is measured by comparing its average hop count with hop count of the basic GFG algorithm and the benchmark shortest path algorithm, and very significant improvements were obtained for low degree graphs. More precisely, we obtained localized routing algorithm that guarantees delivery and has very low excess in terms of hop count compared to the shortest path algorithm. The experimental data show that the length of additional path (in excess of shortest path length) can be reduced to about half of that of existing GFG algorithm.
Starting Page	169
Ending Page	178
Page Count	10
File Format	PDF
ISSN	13867857
Journal	Cluster Computing
Volume Number	5
Issue Number	2
e-ISSN	15737543
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	2002-01-01
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Processor Architectures Computer Communication Networks Operating Systems
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Software

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

A Cluster-Based Web System Providing Differentiated and Guaranteed Services

Self Organized Terminode Routing

Spine routing in ad hoc networks

Connection re–routing method for QoS guarantee in the ATM–based wired/wireless integrated network

Cost-effective multicast routings in wireless mesh networks with multiple gateways

Energy and QoS Aware Routing in Wireless Sensor Networks

A Heuristic-Based Wormhole Routing Algorithm for Hypercube Multicomputer Networks

Traffic-aware routing protocol for wireless sensor networks

Self-adapting maximum flow routing for autonomous wireless sensor networks

Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks

Similar Documents

A Cluster-Based Web System Providing Differentiated and Guaranteed Services

Self Organized Terminode Routing

Spine routing in ad hoc networks

Connection re–routing method for QoS guarantee in the ATM–based wired/wireless integrated network

Cost-effective multicast routings in wireless mesh networks with multiple gateways

Energy and QoS Aware Routing in Wireless Sensor Networks

A Heuristic-Based Wormhole Routing Algorithm for Hypercube Multicomputer Networks

Traffic-aware routing protocol for wireless sensor networks

Self-adapting maximum flow routing for autonomous wireless sensor networks

Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks