A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Chandrasekar, C.
- Divisive Clustering Based Data Forwarding Approach in Vehicular Ad hoc Networks
Authors
1 Department of Computer Application,K. S. Rangasamy College of Technology, Tamilnadu,, IN
2 Periyar University, Salem, Tamilnadu, IN
Source
Wireless Communication, Vol 4, No 1 (2012), Pagination: 5-12Abstract
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. In VANET, the possible occurrence of link breakage event is unknown and unpredictable. In a packet forwarding event, one node could select a next forwarder from its neighbors. The neighbor node that was in the transmission range at the moment, but at the edge, could already have left this range and, choosing this neighbor as next forwarder will lead to low packet delivery, increased packet delay, and increased routing overhead. In this paper, we propose HCBGR (Hierarchical Clustering Based Greedy Routing), a greedy position based routing approach which uses weighted score based strategy for reliable and efficient packet forwarding. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. The simulation results using ns 2.33 show that routing overhead is reduced considerably compared to Greedy Perimeter Stateless Routing Protocol (GPSRP) and Predictive Directional Greedy Routing Protocol (PDGRP) of VANET. The simulation results show that HCBGR had overcome the limitations of PDGRP and GPSRP in VANET environment.Keywords
Vehicular Ad Hoc Networks, Greedy Position Based Routing, Clustering, HCBGR.- Queue Batch Multicast Group Key Agreement Protocol with Communication Security
Authors
1 Department of MCA in K.S.R.College of Engineering, Tiruchengode, IN
2 Department of Computer Science in Periyar University, Salem, IN
Source
Wireless Communication, Vol 3, No 1 (2011), Pagination: 45-50Abstract
With the emergence of many group-oriented distributed applications such as tele / video-conferencing and multiplayer games, there is a need for providing group-oriented communication privacy and data integrity. For this members of the group can establish a common secret key for encrypting group communication data. Traditional secure group communication problems differ from the distributed group key agreement on the characteristics such as distributed, collaborative and dynamic nature. Instead of performing individual rekeying operations, an interval-based approach of rekeying is adopted i.e., Rebuild algorithm, Batch algorithm and the Queue-batch algorithm. The interval-based approach provides rekeying efficiency for dynamic peer groups while preserving both distributed and contributory properties.
The work presented in this paper, concentrated on authenticated group key agreement protocol incorporated into the interval-based algorithms and evaluate the performance to prove its security properties. The Secure Communication Library implemented realizes the interval-based algorithms with a programming interface for the development of secure group-based applications. Performance of these three interval-based algorithms under different settings, such as different join and leave probabilities, is analyzed. The simulation conducted on NS-2 show that the interval-based algorithms significantly outperform the individual rekeying approach. The Queue-batch algorithm performs the best among the three interval-based algorithms. The Queue-batch algorithm can substantially reduce the computation and communication workload in a highly dynamic environment.