NDLI: An efficient geographic surface routing algorithm in 3D ad hoc networks

Content Provider	IEEE Xplore Digital Library
Author	Han Su Yun Wang Dingyi Fang
Copyright Year	2010
Description	Author affiliation: School of Computer Science and Engineering, Key Lab of CNII, MOE Southeast University, Nanjing, 210096, China (Han Su; Yun Wang) \|\| School of Information Science and Technology, Northwest University, Xian, 710075, China (Dingyi Fang)
Abstract	For geographic routing in 2D ad hoc networks, greedy algorithm is efficient if no holes exist. However, greedy forwarding fails when a message reaches a local-minimum. Thus, face routing is used to solve the problem of local-minimums. Unfortunately, few research results can be applied to geographic routing in 3D environments. This paper proposes an algorithm GSG (Greedy Surface routing Greedy), for geographic routing in 3D environments. GSG firstly partitions whole network with 3D Restricted Delau-nay Triangulation. When a local-minimum is encountered because of a hole, a message is transferred on a surface with triangles in order to jump out of a local-minimum area. Triangles and isolated edges are defined as 3D components on Surface. By means of identifying intersecting triangles and edges, efficient routes are constructed on surfaces by bypassing local-minimums. For sparsely deployed networks, an algorithm DFS based on 3D RNG is provided. Simulation results show that GSG outperforms the algorithms such as GRG and GHG.
Starting Page	138
Ending Page	144
File Size	242961
Page Count	7
File Format	PDF
ISBN	9781424491445
e-ISBN	9781424491438
DOI	10.1109/ICPCA.2010.5704088
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-12-01
Publisher Place	Slovenia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Greedy algorithms 3D Geographic Routing 3D RDT 3D RRNG Routing Three dimensional displays Ad hoc networks Partitioning algorithms Face Surface treatment Routing Holes
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

Greedy cylinder routing algorithm for mobile network devices

Routing protocol for complex three-dimensional Vehicular Ad Hoc Networks

The Performance of Greedy Geographic Forwarding in Unmanned Aeronautical Ad-Hoc Networks

EFFICIENT GREEDY-FACE-GREEDY GEOGRAPHIC ROUTING PROTOCOLS IN MOBILE AD HOC AND SENSOR NETWORKS (2012)

On greedy geographic routing algorithms in sensing-covered networks

Scalable geographic routing algorithms for wireless ad-hoc networks.

HAGR: Hole Aware Greedy Routing for Geometric Ad Hoc Networks

A New Recursive Partitioning Multicast Routing Algorithm for 3D Network-on-Chip

Greedy Least Interference Forwarding algorithm using directional antennas for cellular ad-hoc networks

An efficient geographic surface routing algorithm in 3D ad hoc networks

Similar Documents

Greedy cylinder routing algorithm for mobile network devices

Routing protocol for complex three-dimensional Vehicular Ad Hoc Networks

The Performance of Greedy Geographic Forwarding in Unmanned Aeronautical Ad-Hoc Networks

EFFICIENT GREEDY-FACE-GREEDY GEOGRAPHIC ROUTING PROTOCOLS IN MOBILE AD HOC AND SENSOR NETWORKS (2012)

On greedy geographic routing algorithms in sensing-covered networks

Scalable geographic routing algorithms for wireless ad-hoc networks.

HAGR: Hole Aware Greedy Routing for Geometric Ad Hoc Networks

A New Recursive Partitioning Multicast Routing Algorithm for 3D Network-on-Chip

Greedy Least Interference Forwarding algorithm using directional antennas for cellular ad-hoc networks

An efficient geographic surface routing algorithm in 3D ad hoc networks