CGGC: Cached Greedy Geocast

Maihöfer, Christian; Eberhardt, Reinhold; Schoch, Elmar

doi:10.1007/978-3-540-24643-5_2

Cited by 30 publications

(22 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We assume that the nodes in the VANET use a location-based routing protocol like the one described in Reference [9]. This implies that every node is able to determine its current position, for example, by using a (D)GPS receiver.…”

Section: Fig 2 Position Verification Sensors Overviewmentioning

confidence: 99%

“…In case that no suitable next hop is available when a packet has to be forwarded, the recovery strategy is based on caching, that is, packets are stored locally until either a suitable neighbor is reachable or until the node is forced to drop the packet due to packet queue overflow. Details of this geographic routing approach have been studied in Reference [9].…”

Section: Geographic Routingmentioning

confidence: 99%

“…Cached Greedy it Geocast (CGGC) specifically addresses these two cases respecting the special needs of VANETs [9]. In CGGC, the first case as mentioned above is addressed using the neighbor with the minimum Euclidean distance to the target.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Decentralized position verification in geographic ad hoc routing

Leinmüller

Schoch

Kargl

et al. 2008

Security Comm Networks

Self Cite

View full text Add to dashboard Cite

SummaryInter-vehicle communication is regarded as one of the major applications of mobile ad hoc networks (MANETs). Compared to MANETs or wireless sensor networks (WSNs), these so-called vehicular ad hoc networks (VANETs) have unique requirements on network protocols. The requirements result mainly from node mobility and the demands of position-dependent applications. On the routing layer, those requirements are well met by geographic routing protocols. Functional research on geographic routing has already reached a considerable level, whereas security aspects have only been recently taken into account. Position information dissemination has been identified as being crucial for geographic routing since forged position information has severe impact regarding both performance and security.In this work, we first summarize the problems that arise from falsified position data. We then propose a framework that contains different detection mechanisms in order to mitigate or lessen these problems. Our developed mechanisms are capable of recognizing nodes cheating about their position in beacons (periodic position dissemination in most single-path geographic routing protocols, e.g., GPSR). Unlike other proposals described in the literature, our detection system does not rely on additional hardware or special nodes, which would contradict the ad hoc approach. Instead, we use a number of different independent sensors to quickly give an estimation of the trustworthiness of other nodes' position claims. The different sensors run either autonomously on every single node, or they require cooperation between neighboring nodes.The simulation evaluation proves that the combination of autonomous and cooperative position verification mechanisms successfully discloses most nodes disseminating false position information, and thereby widely prevents attacks using position cheating.

show abstract

Section: Fig 2 Position Verification Sensors Overviewmentioning

confidence: 99%

Section: Geographic Routingmentioning

confidence: 99%

See 1 more Smart Citation

Decentralized position verification in geographic ad hoc routing

Leinmüller

Schoch

Kargl

et al. 2008

Security Comm Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…We have based our analysis on the Cached Greedy Geocast (CGGC) routing protocol [12] which has been developed as part of the Fleetnet project. With CGGC, nodes periodically announce their identifier and current location using beacon messages.…”

Section: Effects Of Pseudonym Changes On Geographic Routing a Romentioning

confidence: 99%

Security and Privacy in Ad-Hoc and Sensor Networks

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract-Vehicle communication is regarded as one of the major applications of mobile ad hoc networks (MANETs). In these so called vehicular ad hoc networks (VANETs) security and privacy are crucial factors for successful deployment. For example, if each vehicle had a unique identifier and utilized it during its communication, eavesdroppers could easily accumulate location profiles. One approach in the literature proposes to use changing pseudonyms as temporary vehicle identifiers. The basic idea is that the more frequently a vehicle changes its pseudonym, the shorter the period over which it can be tracked will be. However, the impact of such an approach on the system performance has been largely overlooked. Exactly this is our contribution in this paper: we find that changing identifiers has detrimental effects on routing efficiency and increases packet loss. Our investigation provides a set of basic findings that can guide system designers, to achieve both the sought level of protection and performance as well as the right trade-off between the two objectives.I. INTRODUCTION Vehicular ad hoc networks (VANETs) are one of the most promising application scenarios for mobile adhoc networks. With the advent of car-to-car communication, both passenger safety and driving comfort can be improved significantly. A car detecting an icy road could inform follow-up vehicles and thereby prevent accidents. If an accident occurs anyway, inter-vehicle communication could support emergency relief units to reach the accident site faster by warning drivers blocking the road ahead or preemption of traffic lights. Regarding driving comfort, inter-vehicle communication could serve to exchange traffic flow information for improved navigation or intelligent adaptive cruise control.Several research initiatives (e.g. projects like Fleetnet [1]), both in Europe and the U.S., have already produced results in the investigation of vehicular ad hoc networks. For instance, geographic routing has been selected as routing scheme due to its compliance with application needs and its good performance under extremely dynamic network conditions [2].

show abstract

“…The deployed recovery strategy is based on a caching approach, i.e. packets are stored locally until either a suitable neighbor is reachable or until the node decides to drop the packet (see [10]). Besides ordinary routing, we also have to integrate a model of maliciously acting nodes.…”

Section: Simulation Environmentmentioning

confidence: 99%

Influence of Falsified Position Data on Geographic Ad-Hoc Routing

Leinmüller

Schoch

Kargl

et al. 2005

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. There has been a lot of effort in the research on routing in mobile ad hoc networks in the last years. Promising applications of MANETs, e.g. in the automotive domain, are the drive for the design of inter-vehicle networks. So far, several projects in this field have chosen geographic routing approaches because of their outstanding performance and the possibility to support location-based applications like traffic warning functions. Having reached a reasonable functional level, a next step will be a deeper study of safety and security issues. With this paper, we dive into that area by assuming defective or malicious nodes that disseminate wrong position data. First, we have a look at the local problems that may arise from falsified position data, then we show the global effects on the routing performance by simulating malicious nodes. Simulation results show that the overall ratio of successfully delivered messages decreases, depending on the number of maliciously acting nodes, even up to approximately 30%. We conclude from this result that future work should take these threats into account in order to design more robust routing protocols.

show abstract

CGGC: Cached Greedy Geocast

Cited by 30 publications

References 7 publications

Decentralized position verification in geographic ad hoc routing

Decentralized position verification in geographic ad hoc routing

Security and Privacy in Ad-Hoc and Sensor Networks

Influence of Falsified Position Data on Geographic Ad-Hoc Routing

Contact Info

Product

Resources

About