Performance evaluation of routing protocols in vehicular ad-hoc networks

Santos, Roberta Oliveira; Edwards, Arthur; Edwards, R.M.; Seed, N. L.

doi:10.1504/ijahuc.2005.008022

Cited by 99 publications

(42 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Most of the clustering algorithms are based on vehicle ID or mobility. However, some algorithms such as Clustering for Open IVC Networks (COIN) proposed by Blum et al (2003), which selects a cluster head based on vehicular dynamics and drivers' intentions and Location Routing Algorithm with Cluster-Based Flooding (LORA_CBF) proposed by Santos et al (2005) are different from them. Kuppusamy and Kalavathy (2012) proposed an Adaptive Push and Pull Algorithm for Clusters (APPC) and Cluster Based Data Consistency (CBDC) approach to address the consistency requirements and maintenance in mobile ad hoc network.…”

Section: Related Workmentioning

confidence: 99%

A Broadcast Based Routing Protocol for Inter-Cluster Data Dissemination in Vehicular Communication

Jesudoss¹

2014

Journal of Computer Science

View full text Add to dashboard Cite

Vehicular communication is one of the fast growing and promising technologies for a safe and comfortable driving environment. These technologies do not end up with economic and safety ramifications, but also extended with other informational and entertainment oriented services. Data are being propagated multi-hop between source and destination vehicles for many real-life applications. Clustering is one of the effective and scalable solutions for data dissemination in wireless ad hoc networks. Though many cluster-based methods have been proposed for multi-hop data delivery in vehicular ad hoc networks, most of them do not consider the real-time changes in the network topology or imposes large penalties in routing such as unstable clusters, broken links, updating route tables. In order to address these issues, we propose a broadcast based routing protocol for inter-cluster data dissemination in this study that works on real-time vehicle information. Unlike, most existing routing algorithms, it only uses hello messages to obtain routing information without many other control messages. In addition, it alleviates the storage of routing information in every node, which largely reduces the overheads in routing. We performed extensive simulation to demonstrate the effectiveness and efficiency of the proposed routing protocol. Results show that the proposed protocol outperforms other approaches in terms of average delay, average delivery ratio and average number of hops.

show abstract

Section: Related Workmentioning

confidence: 99%

A Broadcast Based Routing Protocol for Inter-Cluster Data Dissemination in Vehicular Communication

Jesudoss¹

2014

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…LORA-CBF [14] is same as greedy routing. The cluster-head is responsible for maintain information between nodes.…”

Section: Location Routing Algorithm With Cluster-based Flooding(lora-mentioning

confidence: 99%

Survey over VANET Routing Protocols for Vehicle to Vehicle Communication

Paul¹

2012

IOSRJCE

View full text Add to dashboard Cite

show abstract

“…Santos et.al. [15] have analyzed the performance parameter throughput, average end-to-end-delay and collision with respect to mobility for vehicular mechanism ad-hoc networks. Woon et.al.…”

Section: Security Protocolsmentioning

confidence: 99%

A Novel Algorithm HSHA to Secure Wireless Ad hoc Network

Patel¹,

Kumar²,

Kansara³

2012

IJAIS

View full text Add to dashboard Cite

Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. The military tactical and other security-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in design of these networks is their vulnerability to security attacks. Here we study the threats an ad hoc network faces and the security goals to be achieved. We identify the new challenges and opportunities posed by this new networking environment and explore new approaches to secure its communication. In particular, we take advantage of the inherent redundancy in ad hoc networks -multiple routes between nodes -to defend routing against denial of service attacks. We use replication and new cryptographic schemes, such as HSHA Key cryptography, to build a highly secure and highly available key management service, which forms the core of our security framework. It helps the network to let the intruder cannot access the packet without the proper authentication. Unauthorized user cannot access the packet. There are various consequences of this algorithm.

show abstract

Performance evaluation of routing protocols in vehicular ad-hoc networks

Cited by 99 publications

References 20 publications

A Broadcast Based Routing Protocol for Inter-Cluster Data Dissemination in Vehicular Communication

A Broadcast Based Routing Protocol for Inter-Cluster Data Dissemination in Vehicular Communication

Survey over VANET Routing Protocols for Vehicle to Vehicle Communication

A Novel Algorithm HSHA to Secure Wireless Ad hoc Network

Contact Info

Product

Resources

About