Increasing Information Shareability by Using NTBS Clustering Approach For VANET

IPASJ International Journal of Computer Science (IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm

A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 5, Issue 10, October 2017 ISSN 2321-5992
Increasing Information Shareability by Using

NTBS Clustering Approach for VANET
Venkatamangarao Nampally1, Dr. M. Raghavender Sharma2
1
Department of Computer Science, University College of Science, Osmania University, Hyderabad, Telangana, India
2
Head of Department, Department of Statistics, University College of Science, Saifabad, Osmania University, Hyderabad
Telangana, India
ABSTRACT
Research on VANETs has been receiving increasing interest in the last couple of years, both in the algorithmic aspects as well
as standardization efforts due to the high mobility and sparse distribution of the vehicles on the road. VANETs have come up
with new information along with promulgation technology. To delivery of a message to their destination is crucial task in
VANET system. This is addressed by clustering. Clustering algorithms have emerged as an alternative powerful learning tool
accurately analyses the massive volume of data generated by modern technology in order to delivery a message to its
destination. Clustering is using to improve routing scalability and reliability in VANET system, as it results in the distributed
formation of hierarchical network structures by grouping vehicles together based on correlated spatial distribution and relative
velocity. In this paper, we discuss design of a secure clustering method and how achieving communication among vehicular
nodes for VANET system by using transitive trust relationships when applied a clustering approach.
Keywords: VANETs, Clustering, Spatial Distribution, CM, CG, CH, Taxonomies, RSUs, V2V, V2R, CH, IVC and
NTBS clustering algorithm.
1. INTRODUCTION
A group of VANET nodes within a radio range can form a cluster environment. Clustering is a mechanism of grouping
of vehicles based upon some predefined metrics such as density, velocity, and geographical locations of the vehicles to
delivery of the efficient data in VANETs. VANET is a term used to describe the spontaneous ad hoc network formed
over vehicles moving on the roadside. In VANET system, vehicles have the capability to communicate directly with
each other vehicles in Peer-to- Peer (P2P) communication manner or indirectly using the existing infrastructure
alongside the roadside.
Figure 1 Communication system of VANET system
Volume 5, Issue 10, October 2017 Page 1

Vehicles and roadside infrastructure (RSU) need to be equipped with dedicated hardware for providing safety and
security to the passengers sitting in a node. In particular, clustering main goal is to categorize data into clusters such
that objects fall into groups in the same cluster. Each node in the cluster structure plays one of three roles: Cluster Head
(CH), Cluster Gateway (CG), and Cluster Member (CM). A CH is a leading node of a cluster is responsible to
coordinate all CMs in its cluster and is responsible for gathering data from any node of that cluster and sends them to
another cluster head. A CG is a border node of a cluster that can communicate nodes belonging to different clusters. A
CM does receive data from cluster coordinator CM. In general, two kinds of topology control are considered in VANET
system: cluster based topology control, and distributed topology control. In cluster-based topology control, maintaining
network connectivity is crucial. An implementation of the linked cluster architecture may consider the following tasks:
cluster formation, cluster connectivity and cluster reorganization.
Figure 2 Cluster-based Topology in VANET system
In cluster-based topology control, maintaining network connectivity is crucial. An implementation of the linked cluster
architecture may consider the following tasks: cluster formation, cluster connectivity and cluster reorganization. In
order to increase the performance of a VANET network, several heuristic clustering techniques proposed. In this paper
we concentrate only on cluster-based topology control for achieving effective topology management in a vehicle sensor
network by using NTBS (Number Theory Based Security) clustering algorithm approach. A typical scenario, which
implements data sharing in VANET system is IVC (Inter-Vehicle Communication). This mechanism allows a
passenger in a car to download information files from neighboring cars. Here, we use the cluster structure to facilitate
the finding, uploading, and downloading of files. Vehicles that are willing to share information will group into clusters.
Each node in the cluster structure plays one of three roles: Cluster Head (CH), Cluster Gateway (CG), and Cluster
Member (CM). In a cluster, CMs can upload their shared data and query interested data to the CH(s). And also CMs
download interested data from the CH(s). In a data sharing application, it is fairer for CMs that a CH is nearer the
center of a cluster. While creating a cluster, it should be ensure that the CG of any cluster is not frequently crossing the
cluster boundary. A vehicular ad-hoc network (VANET) is neither restricted geographical area, nor it can be
predictable due to its highly dynamic characteristics and requirements. So, the cluster structure determined by the
geographic position of the vehicle and the cluster-head (CH) is elected based on priorities associated with each vehicle.
In VANET system, common communication standards are IEEE 802.11p, IEEE1609 and vehicles divided into an LE,
a MV and a TV. Communication types in VANET system divided as: V2I, and V2V. Internet Engineering Task force
(IETF) defined MIPv4/v6 (Mobile Internet Protocol version4/6) and FMIPv6 (Fast) as mobility techniques.

2. RELATED WORK
Several algorithms have been proposed in order to obtain best communication. Clustering has been widely used to route
the message to their final destination. In recent years, the notion of cluster organization has been used for Mobile Ad
Hoc Networks (MANETs) in number of issues such as routing, security, Quality of Service (QoS) [1]. Salhi et al. [2]
proposed a new position based clustering algorithm (NEW-ALM) which is an improvement to the existing ALM
algorithm. Wang et al. [3] proposed another position based clustering algorithm. It is a cross layer algorithm based on
hierarchical and geographical data collection and dissemination mechanism. The cluster formation in this protocol is
based on the division of road segments. Fan et al. [4] proposed a clustering scheme where a utility based cluster
formation technique is used by extending the definition of spatial dependency which was initially proposed in [5]. In
VANET system the threshold value is computed based on the previously available traffic statistics. All the neighboring
vehicles periodically send a status message. After receiving this message, each vehicle chooses its CH based on the
results produced by the utility function. The node with the highest value is chosen as the CH. Maslekar et al. [6]
proposed a new cluster-head election policy for direction based clustering algorithm called as Modified Clustering
based on Direction in Vehicular Environment (MC-DRIVE) [7]. Wolny [8] optimized the existing DMAC algorithm
presented in [9] so that road traffic mobility is represented in an efficient manner. The main idea for modified DMAC
was to increase the cluster stability by avoiding re-clustering when groups of vehicles move in different directions.
Farhan et al. [14] proposed an algorithm for improving the accuracy of GPS devices called Location Improvement with
Cluster Analysis (LICA). Adaptable Mobility Aware Clustering Algorithm based on Destination (AMACAD) [15] is
based on final destination in vehicular networks to enhance the clustering stability. Region Group Mobility model pro-
posed in [16] was also modified to make it suitable for VANETs. In AMACAD, the authors evaluated how the
variation of the trans-mission range and speed affects the AMACAD performance. The algorithm works well when
average speed of vehicles is almost constant which is most effective in urban areas. M. S. Almalag [17] proposed
cluster formation using traffic flow in VANETs. Zhang et al. [18] proposed a multi-hop clustering scheme based on the
mobility metric for representing N-hop mobility. Dror et al. [19] proposed a distributed randomized two hop clustering
algorithm and named as Hierarchical Clustering Algorithm (HCA) that was influenced by the work presented in [20].
HCA forms TDMA like synchronized clusters. A Fast Broadcast protocol proposed in [21] and the static backbone such
as roadside infrastructure system whose nodes are placed at the maximum distance preserving the connectivity. B. Brik
et al. [22] proposed a new data collection protocol for vehicular environments called Clustered Data Gathering Protocol
(CDGP). In this paper, we discuss getting good communication when applying TTRs concept in a clustering
mechanism. Blum et al. [25] used a PKI with virtual infrastructure where a set of elected CHs are responsible for
disseminating messages after digitally signing them. This scheme is intended only for the attack called intelligent
collisions. However, PKI in VANETs must cope with different attacks. Raya et al. [26] proposed a distributed PKI for
VANETs man-aged by many certification authorities, each corresponding to a particular region. The different CAs has
to be cross-certified so that vehicles from different regions can authenticate each others CA. This requires that each
vehicle store the public keys of all CAs whose certificates are needed to be verified. Allocation-based approach to form
a cluster has been used where the area is divided into small zones or cells that form clusters. A vehicle automatically
knows to which group it belongs by comparing its GPS position to a preloaded dissection of the area map into cells.
The CH is dynamically determined as the vehicle closest to the center of the cell. The disadvantage of this proposal is
the non-availability of the CA in case of a break in the connectivity. Sivagurunathan et al. [27] proposed a self-
organized key management system based on clustering. In their model, the network is divided into number of clusters
based on the concept that any user can sign any other public key. The set of signatures forms the network of trusted
relationships. However, the drawback of this self-organized approach stems from the assumption that trust is transitive
and therefore the system becomes more vulnerable to the intrusion of malicious vehicles. Gazdar et al. [28] proposed an
efficient dynamic architecture of PKI for VANETs based on a trust model. Each elected vehicle will be the CA in its
cluster. The proposed clustering algorithm is based on a Trust Metric (Tm) which defines the trust level of a vehicle
and is a continuous value in the interval [01] and mobility metric which is the relative velocity of a vehicle related to
its vicinity. Cheng et al. [29] proposed an innovative car society clustered network based on an imaginative
classification scheme. The proposed scheme forms clusters by including vehicles that have the same interest and
operating in the same communication range. The aim of the proposed approach is to increase the lifetime of the interest
group, and to increase throughput in V2V environments.
Taxonomy of Clustering Protocols in VANET is given in below figure.

Figure 3 Taxonomy of clustering in VANET system
2.1 CLUSTERING APPROACHES
Clustering is a mechanism of grouping of vehicles based upon some predefined metrics such as density, velocity, and
geographical locations of the vehicles. Clustering in vehicular ad hoc networks (VANET) is one of the control
mechanisms for dynamic topology. The taxonomy of the clustering algorithms which are used in VANET system is
shown above.
2.1.1 Predicative Clustering
In predictive clustering, the cluster structure is determined by the current geographic position of vehicles and its future
behavior. This vehicle traffic information helps to associate priorities which then assist in cluster formation. The future
position and the intended destinations of vehicles have been used in the literature to form clusters in VANETs. In
addition, some of these protocols are classified as position based and destination based as follows:
Figure 4 Predicative clustering in VANET system
2.1.1.1 Position-based Clustering

Position based clustering is a technique of forming the clusters on the basis of geographic position of the vehicle and
cluster head. Since the above clustering protocols primarily rely on the vehicle position, the range of values for
vehicular density and vehicle speed exhibits a variation for every protocol. However the value of cluster convergence
rate is low even if vehicle density and cluster dynamics increase which points to better cluster stability for these
schemes.
2.1.1.2 Destination-based Clustering
Destination based clustering technique takes into account the current position, speed, relative and final destination of
vehicle for cluster formation. Using the navigation system the destination is known previously. In order to keep the
clustering process stable, the frequency of cluster changes is minimized because a vehicle only leaves a cluster when it
encounters a CH whose destination is more similar compared to destination of current CH. Thus exploiting the
vehicular behavior by taking into account the final destinations of vehicles enhances the cluster stability and improves
the transmission efficiency in message delivery.
2.1.1.3 Lane-based cclustering
Lane based clustering forms the cluster structure based estimation of vehicles lane with respect to certain parameters.
Lane based clustering algorithms use the availability of lane in formation to select stable clusters. It indicates that the
above two schemes have low number of CH changes that improves the cluster stability. The transmission overhead of
these schemes is also reasonable on account of small number of retransmissions of broadcast messages since clustering
is performed only at lane intersections.

2.1.2 Back bone-based clustering

Backbone based clustering technique is based on forming a backbone for cluster communication. The backbone then
performs the communication and assists in CH election among the members of the cluster.
Figure 5 Back-bone based clustering in VANET system
2.1.2.1 k-hop based clustering

In multi hop or k-hop clustering, cluster structure is controlled by the hop distance. Every cluster has one of the nodes
in the cluster as the CH. The distances between a CH and the members of the cluster are within a predetermined
maximum number of hops which can be one or more hops. To improve clustering efficiency, multi-hop clustering
algorithm uses pros of the k-hop algorithms. This clustering scheme has the benefits of better cluster stability as well as
low cluster dynamics and can be attributed to the reduced variation in CH and cluster member life time.
2.1.3 MAC based clustering
Several Medium Access Control (MAC) based clustering techniques have been proposed for cluster formation in
VANETs. These techniques use IEEE 802.11 MAC protocol to generate clusters. MAC based protocols have increased
percentage collisions and average message delivery delay that results in lower transmission efficiency and high
transmission overhead due to increased contention when number of vehicles or speed of the vehicle increases.
Figure 6 MAC-based clustering in VANET system
2.1.3.1 IEEE 802.11 MAC

MAC based protocols have increased percentage collisions and average message delivery delay that results in lower
transmission efficiency and high transmission overhead due to increased contention when number of vehicles or speed
of the vehicle increases. Liu et al. [29] identified message delivery distance and density of vehicles as two main factors
for such behavior based on a bidirectional vehicle traffic model. The consideration of bi-directional traffic also affects
cluster connect time and results in lower cluster convergence. However in these proto-cols the percentage collisions and
incurred overhead for delivering safety messages is decreased by reducing channel contentions for achieving timely and
reliable delivery of safety messages.
2.1.3.2 TDMA based clustering
The process of assigning time slots can be scheduled using TDMA technique in which slots are assigned for data
transmission. The access to the medium within a cluster is based on TDMA which is primarily used for optimizing
communication. These clustering protocols reduce intra cluster collisions as well as packet loss compared to traditional
clustering protocols and thus provide fairness in sharing the wireless medium for VANETs. It shows that TDMA
algorithms have relatively smaller delay of multi-hop safety messages as compared to other clustering schemes. Thus
they provide better transmission efficiency for cluster maintenance which improves the overall throughput of both inter-
cluster and intra-cluster communication. Although cluster connect time is comparatively reasonable, but high
clustering convergence due to TDMA time slot is a serious bottle-neck in implementing these protocols in VANTEs.

2.1.3.3 SDMA based clustering

In SDMA based protocols, the road is subdivided into fixed length segments, and a segment is again divided into a
fixed number of blocks. Each block is assigned a timeslot representing the al-lowed time for a vehicle to transmit data.
SDMA is known to have better performance in a dense network where practically all slots are used. But, the
performance decreases proportionally with the density. Hence, in sparse networks, SDMA gives poor performance. In
addition, SDMA based clustering divided into some protocols. This subdivision is shown in below figure.
Figure 7 SDMA based clustering in VANET system
Clustering Gathering Protocol

The protocol is designed to provide real time data (e.g. average speed of vehicle) related to speed of vehicle etc. to base
station.
Clustered data gathering Protocol

The use of a clustering technique in hybrid architecture, Dynamic SDMA in the data collection phase and
retransmission mechanism to deal with erroneous data is the major characteristics of CDGP.
Token Based Clustered Data Gathering Protocol

TCDGP inherits all the advantages presented by CDGP, with an additional feature that provides reliable and robust
data collection.
2.1.4 Traditional Clustering
Traditional clustering approaches are sub divided as active clustering and passive clustering as shown below figure.
Figure 8 Traditional based clustering in VANET system

2.1.4.1 Active Clustering

In case of active clustering protocols, there are continuous up-dates of the clustering information and routing table for
route discovery after a fixed interval of time. They generally initiate clustering process through flooding which
generates a sustained routing overhead. The various Active Clustering protocols are described as follows:
Beacon Based Clustering

In Beacon based clustering, clusters are formed based on some vehicular or network parameter detected by beacons of
hello messages by the receiving vehicle. Beacon based clustering protocols provide increased transmission overhead
especially due to increase in number of vehicles and hop counts. The periodic transmission of beacons helps in cluster
convergence but it also affects the throughput of vehicular network, especially at higher traffic density. The impact of
vehicle speed also needs to be improved for these protocols.
Mobility based clustering

Vehicles that move to the same direction or towards each other apply positive forces while vehicles moving away apply
negative forces. Mobility based clustering protocols minimize relative mobility as well as distance of each CH to its
cluster members, so they improve the cluster convergence and cluster dynamics. However vehicle density and vehicle
speed which the predominant factors are affecting the mobility need to be investigated in more detail for all these
protocol. It can also be concluded from Ta-ble9that the packet delivery ratio for the discussed protocols has a lower
value which indicates a decrease in transmission efficiency and increased transmission overhead.
Density based clustering

Density based clustering protocols allow strong connections between cluster members and low variation in number of
cluster head changes that results in improved cluster stability. The density information helps in improving the
awareness in each vehicle about the composition of its cluster and provides strong connections between cluster
members for creating a more reliable clustering topology that provides comparable cluster convergence. However
further study needs to be done for improving the transmission efficiency and transmission overheads. Dependence only
on density limits the cluster connect time and cluster dynamics.
Dynamic clustering
VANETs have relatively more dynamic nature as compared to MANETs resulting in fast changes in the network
topology. The design and implementation of an efficient and scalable algorithm for information dissemination in
VANETs is a major issue that should be tackled. Indeed, in this dynamic environment, an increasing number of
redundant broadcast messages will increase resource utilization, which would indirectly affect the network
performance. Dynamic clustering technique forms cluster structure based on node dynamics like mobility patterns,
velocity and density. The vehicle density also has a negative effect on cluster stability. Initially, the stability is relatively
high but it decreases with network load. The transmission efficiency has a comparable value with other clustering
techniques that can be attributed to moderate range of values of control overhead and percentage connectivity.
However, the impact of vehicle speed needs to be investigated for realistic vehicle scenario and impact of these
clustering protocols on cluster connect time also needs further analysis.
2.1.4.2 Passive clustering

Passive clustering is a clustering mechanism that passively constructs a cluster structure. At any time, a node in a
cluster possesses an external or internal state. In passive clustering each vehicle can lower the control overhead in
packet flooding by the use of on-going data packets instead of extra explicit control packets to construct and maintain
the clusters. When a node receives data packets, it may change its cluster state based on the state in-formation
piggybacked in on-going data packets. This reduces the number of explicit control packets. Thus Passive clustering
mechanism generates significantly less overhead for cluster maintenance than the traditional cluster based technique
because its nodes do not maintain cluster information all the time.
2.1.5 Hybrid clustering
Hybrid clustering techniques combine two or more existing techniques such as use of artificial intelligence, fuzzy logic
etc.

Figure 9 Hybrid clustering in VANET system
2.1.5.1 Intelligence based Clustering

CH is elected based on stability criteria which reflect the relative movement between adjacent vehicles. Since how they
estimate the inter distance and other factors are subjective, so triangular fuzzier is used to deal with this uncertainty
using the fuzzy logic inference system. However, the distributed processing overhead results in a decrease in message
transmission efficiency. Agents are able to learn from the environment in which they operate and perform the task of
CH selection. The direction of the mobility of the nodes is calculated by the agent in an interactive manner. Agents are
deployed at different road junctions for monitoring the activities of the vehicles. The density of the vehicles and average
speed are used for dividing the time into different zones. These zones are then used for collecting the information about
the vehicles used as input to the agents for clustering. Learning rate is also defined for the agents to take the adaptive
decisions. For each action performed by the agents, the corresponding action is rewarded or penalized, and value of the
learning parameter is incremented or decremented. This process continues until the maximum value is reached. The
value of these parameters also improves as the vehicle density increases. Since hybrid techniques or heuristics can be
used for cluster formation, the additional overhead results in high cluster dynamics. Thus, these protocols can be a good
alternative for use in future vehicular networks or for those networks that implement a specific application like security
and multimedia applications.
2.1.5.2 Distributed based clustering (cooperative)

Cooperative vehicular systems are currently being investigated to design innovative ITS solutions for road traffic
management and safety. Through various wireless technologies, cooperative systems can support novel decentralized
strategies for ubiquitous and cost effective traffic monitoring system. QuickSilver[61]is a light weight distributed
clustering protocol that integrates a traditional source routing protocol for intra cluster node centric communication and
the construction of a multichannel link for contention free inter cluster data centric communication. It is a system
architecture that provides efficient use of available resources to guarantee that no harmful competition takes place for
the channel bandwidth. Quick Silver employs lightweight-clustering where clusters form and behave in an
uncoordinated manner without requiring a cluster ID and there are no CHs. Quick Silver utilizes two radio interfaces
that allows vehicle to maintain their intra cluster connectivity and at the same time look for inter cluster contact
opportunities. Cluster formation and maintenance is done by building a cluster formation and management list of
neighbors at each node. It focuses on creation of stable links.Table14shows that these clustering protocols have low
cluster stability and average cluster connect time. This is due to the fact that average number of inter-cluster links that
are active when vehicles are in contact initially increases as the overlapping region for a vehicle increases and then it
has a decrease as vehicles move away from each other. Transmission efficiency also has comparable value for these
protocols. The effect of channel assignment on different node densities is represented in the form of number of links
that shows an increase with the number of channels. This indicates the effectiveness of the protocols for inter-cluster
communication as shown in Table14. However, high transmission overhead and lower vehicle density results in
reduced effectiveness for intra-cluster communication in decentralized clustering schemes considering realistic
vehicular speed conditions.

2.1.5.3 Driver behavior based clustering

Vehicles are nowadays provided with a variety of sensors capable of gathering information from their surroundings. In
near future, these vehicles will also be capable of sharing all the harvested information, with the surrounding
environment and among nearby vehicles over smart wireless links. They will also be able to generate alerts at regular
intervals for emergency services such as in case of accidents. Clustering Convergence and Cluster Connect Time also
need further investigations. Thus, although these protocols provide adequate stability in terms of lifetime of same
interest groups but they also need to be further analyzed on the basis of several other parameters for considering their
suitability in vehicular environments.
2.1.6 Secure based clustering
VANETs can support applications and services for safety and comfort for the passengers on the road and assist in
improving the efficiency of the road transportation network. However, several serious challenges remain to be solved
before efficient and secure VANET technology becomes available. One of these challenges is an efficient authentication
of messages using cryptographic techniques. Solutions for secure clustering in VANETs require efficient clustering
algorithms in terms of complexity, scalability, availability and reach ability. Several algorithms have been proposed in
the literature based on Public Key Infrastructure (PKI) for enabling communications security in vehicular
environments. These are based on a trusted third party called as Certification Authority (CA) which is responsible for
certifying the public keys of vehicles. Several research schemes have been proposed for distributing the responsibility of
the CAs among a set of nodes in the network, using mobility as metric to elect the vehicles that will assume the role of
CA.
3. METHODS
3.1 MODERN CLUSTERING ALGORITHMS CATEGORIZATION

It is a challenging task to route the messages to their final destinations in VANET. The task of clustering is subjective.
Clustering algorithms designed to make cluster process more efficient and secure. Every methodology follows some
specific algorithms for defining the similarity among data points. Moreover, for simplicity, clustering algorithms in
VANET system divided into two subgroups according to the nature of cluster formation.
Figure 10 Modern clustering approaches in VANET system
3.1.1 Static clustering

In this type, stable clusters are formed. Sometime these clusters also contain RSU. In this case cluster works within the
range of RSU. Static cluster moves in same direction with same speed. There is no need of reconfiguration of cluster in
static clustering. These clusters are not scalable. Cluster formation and maintenance is easy for static clustering. But
scalability and other factors decrease the performance of this network...

Figure 11 Static clustering in VANET system
3.1.2 Dynamic clustering

In this type, cluster formation done dynamically in minimum time. Due to the dynamic nature of the network cluster
reconfiguration is need .clusters heads are changed because of high mobility. Cluster reconfiguration and range of
cluster head depends on the density of the area. These clusters are easily scalable.
3.2 Collection area clustering

The collection area designed by the initiator is divided into several virtual segments. Collection area is divided into two
types of segments. Collection segments where vehicles communicate with each other and silence segments where no
communication is permitted.
Figure 12 Collection area in VANET system

3.3 Transitive Trust Relationships
In Vehicle-Vehicle communication networks, authentication is done by a LE. A LE authenticate nearby mistrustful
vehicle into a trustful vehicle. As the number of LEs is finite, an LE is not always near to the OBU. Even if the user is
well meaning, the Vehicle must still wait for the nearest LE and then perform the authentication procedure. Hence,
there is an urgent need for an efficient and a reliable communication mechanism. To overcome this process, we follow
transitive trust relationships. Let us consider that initially, there are three vehicles in a VANET system (A trustful
vehicle (LE) and two other MVs carrying OBUs).
Step 1) the state of the first mistrustful OBU becomes trustful and obtains the sufficient authorized authenticated
parameter to authenticate the other mistrustful OBUs when it authenticated successfully with a LE. Then, it plays the
temporary LE role and able to give the capacity of authentication to nearby mistrustful node.
Step 2) Then this OBU gives authentication to nearby vehicle and makes it into trustful vehicle i.e. temporary LE.
Step 3) Then that turning OBU can make change the mistrustful vehicle into trustful.
This mechanism continues to establish big size VANET. This mechanism is shown in the following figure.

Figure 13 Transitive trust relationships in VANET system
Thus, the other mistrustful OBU can be authenticated by any trustful OBU without necessarily finding an LE, and all
vehicles in a VANET can complete the authentication procedure quickly, In order to forming fast communication for
VANET system. This is the general procedure, to get nodes authenticated. If we introducing clustering algorithm by
forming vehicles into groups and small groups into big groups, then communication i.e. exchanging of messages
among clusters will be very fast. Thus, whole network will be change into trustful environment from mistrustful
environment. Here, notice that we can achieve TTRs by using different algorithms.

3.4 Data Collection

In a cluster each CH on a CS must collect data from all active vehicles members and inform them of retransmission if it
is deemed necessary. To do this, each elected CH executes various iterations. During the first iteration the reservation
of time slots is static, i.e. the CH assigns a time slot to each block of its CS. So, the CH generates a Token packet and
sends it to the first block of its CS. Then, it waits to receive a Data packet for a sixth time slot. If it does not receive
data during this time, it regenerates a new Token, it sends it to the next block, so on until the last block of the CS.
Along with this, it reserves both tables RSV and Ack. based on the Data packets received from MVs. Furthermore, the
New Arrivals from vehicles (NA) are allowed fixed number of slots equal to the number of lanes.
3.5 Data sending by the member Vehicle
To deal with the high mobility of vehicles and avoid the change of block by a MV during the transfer, and before
sending a data packet, each MV saves its current block number. When it receives a token packet, it checks the field
block number in the token whether it corresponds to its old block number or not before checking Ack. field.
3.6 NTBS Clustering Protocol
In VANET system, each cluster has a cluster head. Cluster head may be any one of the vehicles in a cluster with good
database storage and access capabilities. In order to increase the information sharing in system, each vehicle is
equipped with dedicated hardware. Then by using Number theory based secure clustering algorithm, we achieve good
sharing capability. Each cluster head has all the service descriptions, which are regularly updated, if a new service
enters into the network. All the Cluster heads are periodically synchronized to ensure that the cluster heads have latest
service description. Nodes of the clusters are managed by service requests and service updates. In the cluster based
VANET, the cluster area remains the same and predefined. But in MANET, clusters are created dynamically.
4. SIMULATION RESULTS
Following are used parameters in order to simulate these model based on TTRs in NS2 simulator.
Table 1: Simulation parameters

Parameters Values
Network Size 4000m x 4000m
Number of Vehicle Nodes 112
Packet_ Size 1000bytes
Simulation Time 10 sec.
MAC protocol IEEE 802_11
Number of Authentication Servers 1
Number of LEs 16
Number of OBUs 86
Figure 15 XWin server execution in VANET system

Figure 17 Communication flow VANET system
4.1 NTBS Cluster Performance Result
It is defined as ratio of performance vehicles taken into consideration and non-performance vehicles in a channel over
the simulation time. Mathematically it can be written as:
Performance of vs. Trust vs. Non-Trust = Trust Vehicles / Non-Trust Vehicles
Where N is the number of bits bought by all destinations.

Figure 18 Performance of trust vs. non-trust vehicles in VANET system

4.2 NTBS Cluster Throughput
It is defined as rate of successful message delivery over a channel or aggregate number of packets delivered over the
simulation time. Mathematically it can be written as:
Throughput=N/100
Where N is the number of bits bought by all destinations.
Figure 19 NTBS throughput in VANET system

4.3 NTBS Cluster end-to-end delay
It is defined as time taken for a packet to be transmitted successfully across a network from source to destination.
Mathematically it is defined as:

Where AED is average end to end delay ti(r) is the receiving time of packet I by the destination node, ti(s) is the
sending time of packet i by the source node and n pr is the total number of packets received.
Figure 20 NTBS end-to-end delay in VANET system
5. CONCLUSION
It concluded that fast communication in VANET system can achieved by NTBS (Number Theory Based Secure)
clustering algorithm and thus increase in the performance of Whole network. In this paper, we studied the TTR concept
for giving fast communication requirements to the VANET system to improve the performance. Vehicular Ad Hoc
Networks (VANETs) are used in wide areas of applications in recent times. Clustering of vehicles has been investigated
by the research community from different perspective in many of the applications used in VANETs. But, it has been a
challenging task to perform clustering due to the dynamic nature of nodes in VANETs. This paper provides a complete
taxonomy with challenges, constraints and solutions on clustering in VANETs based upon various parameters. Also, a
detailed discussion with comparative analysis is provided for each categorization of clustering which includes various
challenges, existing solutions and future directions. Each section is described with various clustering techniques and
their advantages/disadvantages over the others. The analysis provided for various existing proposals allow various users
working in this domain to select one of the proposals with respect to its merits over the others.
ACKNOWLEDGMENT
I will be thankful forever to the LORD BAJARANGBALI for his boundless blessings showered on me. I am very
grateful and express my heartfelt countless Namaste to most respectable and my M.Phil. guide and supervisor who
are Dr. S. Anathi madam ji, B.E.,M.Tech.(IISC),Ph.D., Associate Professor, Department of Network Systems
and Information Technology, University of Madras, Guindy Campus, Chennai for their constant support,
invaluable and inspiring guidance to the progress of my paper work. Without madam ji, and Sir K. Padmanabhan
inspiration, definitely this paper work would not have been possible. I would like to express my heartfelt special thanks
to most respectable, emeritus and senior Prof. (ret.) K.Padmanabhan, Former Head, CISL and Emeritus Professor
in AC Technology College, Anna University for their kind support to me for carrying out this paper work. I would
like to express special thanks to Prof. (ret.) Ramana Murthy M. V., Department of Mathematics & Computer
Science, University College of Science, Osmania University, Hyderabad, Telangana, Prof. (ret.) Shankar B.,
Department of Mathematics, University College of Science, Osmania University, Hyderabad, Telangana and
R.K.sir for clarifying my doubts On NS2 software to run on windows 7. And I take this opportunity to express my

heartfelt thanks to Dr. K.R.Balaji (Department of NS & IT, University of Madras, Guindy Campus, Chennai)
M.Sc., M.Phil., Ph.D., and Arun Ananthanarayanan, UGC research scholar, Department of NS & IT, University
of Madras, Guindy Campus, Chennai for giving their constant support and valuable help.
Finally, thank you very much Dept. of NS & IT Scholars!
REFERENCES
[1] IEEE 802.11 TGP. (2010). Wireless LAN medium access control (MAC) and physical layer (PHY) specifications
amendment 6: Wireless access in vehicular environments. IEEE 802.11p published standard.
[2] I. Salhi, M. Cherif, S. Senouci, Data collection in vehicular networks, in: Au-tonomous and Spontaneous Networks
Symposium, 2008, pp.2021.
[3] Z. Wang, L. Liu, M. Zhou, N. Ansari, A position based clustering technique for ad hoc intervehicle
communication, IEEE Trans. Syst. Man Cybern., Part C, Appl. Rev. 38(2) (2008) 201208.
[4] W. Fan, Y. Shi, S. Chen, L. Zou, A mobility metric based dynamic clustering algorithm (DCA) for VANETs, in:
International Conference on Communication Technology and Application, Beijing, 2011, pp.752756.
[5] F. Bai, N. Sadagopan, A. Helm, The IMPORTANT framework for analyzing the impact of mobility on the
performance of routing protocols for ad hoc net-works, Ad Hoc Networks (2003) 383403.
[6] N. Maslekar, J. Mouzna, H. Labiod, M. Devisetty, M. Pai, Modified C-DRIVE: clus-tering based on direction in
vehicular environment, in: IEEE Intelligent Vehicles Symposium, vol.4, 2011, pp.845850.
[7] N. Maslekar, M. Boussedjra, J. Mouzna, H. Labiod, A stable clustering algorithm for efficiency applications in
VANETs, in: 7th International Conference on Wire-less Communications and Mobile Computing, Istanbul, 2011,
pp.11881193.
[8] Amarpreet singh,Manverpreet Kaur, A Novel Clustering Scheme in Vehicular Ad hoc Network, Research
International Journal of Applied Information Systems (IJAIS), Volume 10, December 2015.
[9] M. S. Kakkasageri and S. S. Manvi, Connectivity and Mobility Aware Dynamic Clustering in VANETs,
International Journal of Future Computer and Communication, Vol. 3, 2014.
[10] Mr. Puneet Syal , Ms Talwinder Kaur, A Study of Routing Protocols for Vehicular Ad-Hoc Networks
,International Journal of Engineering Trends and Technology (IJETT) ,Volume 15,2014.
[11] Kamlesh Namdev, Prashant Singh, Clustering in Vehicular Ad Hoc Network for Efficient communication,
International Journal of Computer Applications, Volume 115, 2015.
[12] Zaydoun Y Rawashdeh and Syed Masud Mahmud, A novel algorithm to form stable clusters in vehicular ad hoc
networks on highways,
[13] EURASIP Journal on Wireless Communications and Networking ,2012
[14] F. Ahammed, J. Taheri, A. Zomaya, LICA: robust localization using cluster anal-ysis to improve GPS coordinates,
in: First ACM International Symposium on Design and Analysis of Intelligent Vehicular Networks and
Applications, New York, USA, 2011, pp.3946.
[15] M.M.C. Morales, C.S. Hong, Y. Bang, An adaptable mobility aware clustering al-gorithm in vehicular networks,
in: 13th AsiaPacific Network Operations and Management Symposium, Taipei, 2011, pp.16.
[16] Y. Zhang, J. Mee Ng, C. Ping Low, A distributed group mobility adaptive cluster-ing algorithm for mobile ad hoc
networks, J. Comput. Commun. 32(1) (2009) 189202.
[17] M.S. Almalag, M.C. Weigle, Using traffic flow for cluster formation in vehicu-lar ad-hoc networks, in: 35th IEEE
Conference on Local Computer Networks, Denver, CO, 2010, pp.631636.
[18] Z. Zhang, A. Boukerche, R.W. Pazzi, A novel multi-hop clustering scheme for vehicular ad-hoc networks, in:
MobiWac11, 9th ACM International Symposium on Mobility Management and Wireless Access, 2011, pp.1926.
[19] E. Dror, C. Avin, Z. Lotker, Fast randomized algorithm for hierarchical clustering in vehicular ad-hoc networks,
Ad Hoc Netw. 11(7) (2013) 20022015.
[20] P. Fan, J. Haran, J. Dillenburg, P. Nelson, Cluster based framework in vehicu-lar ad-hoc networks, in: Lecture
Notes in Computer Science, vol.3738, 2005, pp.3242.
[21] H. Su, X. Zhang, Clustering based multichannel MAC protocols for QoS pro-visions over vehicular ad hoc
networks, IEEE Trans. Veh. Technol. 56 (2007) 33093323
[22] B. Brik, N. Lagraa, M.B. Yagoubi, A. Lakas, An efficient and robust clustered data gathering protocol (CDGP) for
vehicular networks, in: Second ACM Inter-national Symposium on Design and Analysis of Intelligent Vehicular
Networks and Applications, NY, USA, 2012, pp.6574.
[23] Vanet Mobi Sim. [Online]. Available: http://vanet.eurecom.fr/.
[24] http://www.census.gov/geo/www/tiger.

[25] J. Blum, A. Eskandarian, The threat of intelligent collisions, IT Prof. 6 (2004) 2429.
[26] M. Raya, A. Aziz, J.P. Hubaux, Efficient secure aggregation in VANETs, in: Third International Workshop on
Vehicular Ad Hoc Networks, 2006, pp.6775.
[27] S. Sivagurunathan, P. Subathra, V. Mohan, N. Ramaraj, Authentic vehicular en-vironment using a cluster based
key management, Eur. J. Sci. Res. 36 (2009) 299307.
[28] T. Gazdar, A. Benslimane, Belghith, A secure clustering scheme based keys management in VANETs, in: 73rd
IEEE International Conference on Vehicular Technology, Yokohama, 2011, pp.15.
[29] Cheng, S.-T., G.-J. Horng, and C.-L. Chou, using cellular automata to form car society in vehicular ad hoc
networks. Intelligent Transportation Systems, IEEE Transactions On, 2011. 12(4): p. 1374-1384.
AUTHORS
Dr. M. Raghavender Sharma (drmrsstatou@gmail.com) pursed Bachelor of Science in

Mathematics, Master of Science in Statistics, and achieved Doctoral Degree in Statistics, all degrees
from Osmania University, Hyderabad, Telangana, India, and currently he is working as an Assistant
Professor and Head of Department, Department of Statistics at University College of Science,
Saifabad, Osmania University, Hyderabad, Telangana, India. He is supervising many Ph. D.s. He
has excellent teaching track record with 25 years teaching experience.
Mr. Venkatamangarao Nampally (n.venkat018@gmail.com) pursed Bachelor of Science in

Computer Science, Master of Science in Computer Science and Master of Technology in Computer
Science & Engineering, all degrees from Osmania University, Hyderabad, Telangana, India, and
pursed Master of Philosophy from University of madras, Chennai, Tamil Nadu, India. His main
research work focuses on VANET communication. He has 7 years of teaching experience and 2 year
of Research Experience.

Increasing Information Shareability by Using NTBS Clustering Approach For VANET

Încărcat de

Informații document

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Increasing Information Shareability by Using NTBS Clustering Approach For VANET

Încărcat de

Drepturi de autor:

Formate disponibile

IPASJ International Journal of Computer Science (IIJCS)

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm

Increasing Information Shareability by Using

Figure 1 Communication system of VANET system

Volume 5, Issue 10, October 2017 Page 1

Figure 2 Cluster-based Topology in VANET system

Volume 5, Issue 10, October 2017 Page 2

Taxonomy of Clustering Protocols in VANET is given in below figure.

Volume 5, Issue 10, October 2017 Page 3

Figure 3 Taxonomy of clustering in VANET system

2.1 CLUSTERING APPROACHES

Figure 4 Predicative clustering in VANET system

2.1.1.1 Position-based Clustering

Volume 5, Issue 10, October 2017 Page 4

2.1.2 Back bone-based clustering

Figure 5 Back-bone based clustering in VANET system

2.1.2.1 k-hop based clustering

Figure 6 MAC-based clustering in VANET system

2.1.3.1 IEEE 802.11 MAC

Volume 5, Issue 10, October 2017 Page 5

2.1.3.3 SDMA based clustering

Figure 7 SDMA based clustering in VANET system

Clustering Gathering Protocol

Clustered data gathering Protocol

Token Based Clustered Data Gathering Protocol

Figure 8 Traditional based clustering in VANET system

Volume 5, Issue 10, October 2017 Page 6

2.1.4.1 Active Clustering

Beacon Based Clustering

Mobility based clustering

Density based clustering

2.1.4.2 Passive clustering

Volume 5, Issue 10, October 2017 Page 7

Figure 9 Hybrid clustering in VANET system

2.1.5.1 Intelligence based Clustering

2.1.5.2 Distributed based clustering (cooperative)

Volume 5, Issue 10, October 2017 Page 8

2.1.5.3 Driver behavior based clustering

3.1 MODERN CLUSTERING ALGORITHMS CATEGORIZATION

Figure 10 Modern clustering approaches in VANET system

3.1.1 Static clustering

Volume 5, Issue 10, October 2017 Page 9

Figure 11 Static clustering in VANET system

3.1.2 Dynamic clustering

3.2 Collection area clustering

Figure 12 Collection area in VANET system

Volume 5, Issue 10, October 2017 Page 10

Figure 13 Transitive trust relationships in VANET system

Figure 14 Transitive trust relationships in VANET system

Volume 5, Issue 10, October 2017 Page 11

3.4 Data Collection

Table 1: Simulation parameters

Figure 15 XWin server execution in VANET system

Volume 5, Issue 10, October 2017 Page 12

Figure 16 Transitive trust relationships in VANET system

Figure 17 Communication flow VANET system

4.1 NTBS Cluster Performance Result

Volume 5, Issue 10, October 2017 Page 13

Figure 18 Performance of trust vs. non-trust vehicles in VANET system

Figure 19 NTBS throughput in VANET system

Volume 5, Issue 10, October 2017 Page 14

Figure 20 NTBS end-to-end delay in VANET system

Volume 5, Issue 10, October 2017 Page 15