GPSR

Karp, Brad; Kung, H. T.

doi:10.1145/345910.345953

Cited by 5,516 publications

(104 citation statements)

References 18 publications

Supporting

Mentioning

103

Contrasting

Unclassified

Order By: Relevance

“…GPSR [5]) utilise geographical information for each node in topology to make all routing decisions, thus, each node needs to announce its position, to do that, each node periodically broadcast small packets called beacons contain geographical information of the node. As with other routing protocols increased node velocity leads to inaccurate position information and highly dynamic topology leads to route disconnect, where the network is unable to forward packets, leading to loss.…”

Section: Background and Related Workmentioning

confidence: 99%

Drop-Burst Length Evaluation of Urban VANETs

Ali¹,

Phillips

Yang³

2017

IJATES

View full text Add to dashboard Cite

Abstract-Networks performance is traditionally evaluated using packet delivery ratio (PDR) and latency (delay). We propose an addition mechanism the drop-burst length (DBL). Many traffic classes display varying application-level performance according to the pattern of drops, even if the PDR is similar. In this paper we study a number of VANET scenarios and evaluate them with these three metrics.Vehicular Ad-hoc Networks (VANETs) are an emerging class of Mobile Ad-hoc Network (MANETs) where nodes include both moving vehicles and fixed infrastructure. VANETs aim to make transportation systems more intelligent by sharing information to improve safety and comfort. Efficient and adaptive routing protocols are essential for achieving reliable and scalable network performance. However, routing in VANETs is challenging due to the frequent, high-speed movement of vehicles, which results in frequent network topology changes.Our simulations are carried out using NS2 (for network traffic) and SUMO (for vehicular movement) simulators, with scenarios configured to reflect real-world conditions. The results show that OLSR is able to achieve a best DBL performance and demonstrates higher PDR performance comparing to AODV and GPSR under low network load. However, with GPSR, the network shows more stable PDR under medium and high network load. In term of delay OLSR is outperformed by GPSR.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

Drop-Burst Length Evaluation of Urban VANETs

Ali¹,

Phillips

Yang³

2017

IJATES

View full text Add to dashboard Cite

show abstract

“…It make source node more efficient to locate the path to destination in a large scale network. GPSR [17] is the most typical geographical routing protocol that it consists with 2 strategies. They are greedy forwarding and perimeter forwarding.…”

Section: Related Workmentioning

confidence: 99%

Trust-based Adaptive Routing for Smart Grid Systems

Xiang

Bai

Liu

2014

Journal of Information Processing

View full text Add to dashboard Cite

Smart Grid is the trend of next generation electrical power system which makes the power grid intelligent and energy efficient. It requires high level of network reliability to support the two-way communication among electrical services, electrical units such as smart meters, and applications. The wireless mesh network infrastructure can provide redundant routes for the Smart Grid communication network to ensure the network availability. Also due to its high level of flexibility and scalability features that make it become a promising solution for Smart Grid. However, similar with many other distributed ad-hoc networks, trust is a critical issue for wireless mesh networks. In this paper, we proposed a novel trust-based geographical routing protocol, named as Dynamic Trust Elective Geo Routing (DTEGR), which allows peers in a Smart Grid system to adjust their interaction behaviors based on the trustworthiness of others. The simulation studies have confirmed that DTEGR can achieve better routing performance in different network scenarios, and also to achieve high level of reliable data transmission in Smart Grid communication networks.

show abstract

“…The LocalDelaunayNeighborNodeList and NonLocalDelaunayNeighborNodeList are generated (3,4). The TriangulationNotificationMessage and DelegationMessage are generated and a transmitting request is removed from these two lists to the MessageManager (5,6,7,8).…”

Section: Implementation Guidelines Of Existing Delaunay Overlay Netwomentioning

confidence: 99%

“…Research has therefore focused on communication cost-cutting routing methods using network structuring and limited-destination communication based on an ID or node position. Karp et al [7] proposed greedy perimeter stateless routing (GPSR), a non-flooding method using greedy routing, and the right-hand rule on Gabriel graphs generated from unit disc graphs. Our proposed method, on the other hand, uses greedy routing and detour path routing, and is not premised on the existence of unit disc graphs.…”

Section: Related Workmentioning

confidence: 99%

Incremental Distributed Construction Method of Delaunay Overlay Network on Detour Overlay Paths

Ohnishi

Inoue

Harai

2013

Journal of Information Processing

View full text Add to dashboard Cite

Abstract:In wide-area disaster situations, wireless mesh networks lose data communication reachability among arbitrary pairs of base stations due to the loss of routing information propagation and synchronization. This paper uses a Delaunay overlay approach to propose a distributed networking method in which detour overlay paths are incrementally added to a wireless mesh network in wide-area disaster situations. For this purpose, the following functions are added to each base station for wireless multi-hop communication: obtaining the spatial location, exchanging spatial location messages between base stations, transferring data based on spatial locations of base stations. The proposed method always constructs a Delaunay overlay network with detour paths on the condition that a set of wireless links provides a connected graph even if it does not initially provide reachability among arbitrary base stations in the connected graph. This is different from the previous method that assumes a connected graph and reachability. This paper therefore also shows a new convergence principle and implementation guidelines that do not interfere with the existing convergence principle. A simulation is then used to evaluate the detour length and table size of the proposed method. It shows that the proposed method has scalability. This scalability provides adaptable low-link quality and increases the number of nodes in wide-area disaster situations.

show abstract

GPSR

Cited by 5,516 publications

References 18 publications

Drop-Burst Length Evaluation of Urban VANETs

Drop-Burst Length Evaluation of Urban VANETs

Trust-based Adaptive Routing for Smart Grid Systems

Incremental Distributed Construction Method of Delaunay Overlay Network on Detour Overlay Paths

Contact Info

Product

Resources

About