Disadvantages And Differences: Characteristics Of VANET

With the availability of free Wi-Fi connection and GPS, they can drive around and obtain a very huge amount of information over a very short period of time. This is obtained in a vehicle with a mobile device and a special type of software to view all the different access points around an access point. With this information, the attacker comes up with a very large database of information and can gain access to a wireless signal.

Figure 1.3: Location disclosure Attack As shown in figure 1.3 node M1 collect all topology information & either discloses it to other malicious node M2 or itself uses for attack on any other node for example M1 would send fake Message to S. Introduction to MANET P a g e | 20 Flooding: In this type of attack, attacker (malicious) node(s) broadcast false packets or ghost packets which have wrong routing information & drain valuable resources like battery, processing power, and bandwidth. It leads to increased traffic in network, keeping nodes busy and reduced network performance. Denial of Service (DoS) attack: This type of attack has similarity with Flooding type of attacks.

The Two-Tier Data Dissemination (TTDD) assumes that the sensor nodes are stationary and location aware and sinks are allowed to change their location dynamically [9]. When any change is sensed by sensors the source node will generate the reports. Then the source node chooses itself as a start crossing point and sends data to its adjacent crossing points. This is also used in which nodes are stationery for multiple mobile sinks.

All vehicles transmit a 200-byte safety message at 10Hz with data rate of 6 Mbps. All vehicles attempt to continuously route 64-byte packets at an application rate of 2.048 Kbps to one of 10 other vehicles, selected as sink vehicles. The antenna height AHk of each vehicle is 1.5m. Transmit power is set to 10 dBm and the transmission range for safety message packet delivery is 145 m. For each experiment PCAP trace file per node is enabled. The routing statistics are gathered and compared for each experiment, i-e, with NS2 mobility trace file and with PySNS3. The simulation parameters for performance evaluation of PySNS3 are shown in Table III. In order to calculate packet delivery ratio (PDR), we must count; i) the packets that are actually received, and ii) the transmitted packets that are expected to be received. Both are relative to a specified (circular) coverage area shown in Fig. 6. Let's assume that the transmission range of vehicle A, is in meters, such that TRA > dAB. Where, dAB is distance between A and B, and dBC is the distance between B and

Being proactive, AODV doesn’t need all its nodes in a network to maintain the routes to destinations rather request a route only when needed i.e., only the nodes which are communicating would require to maintain the route. Also AODV uses sequence numbers to avoid routing loops like in DSDV. Whenever a node needs to communicate with another node, a route has to be found and for that purpose Route Request (RREQ) message is broadcasted to all its neighbors till it reaches the destination node or route to destination. A temporary route table entry in initiated by the RREQ messages throughout the network. Once the destination or a route is found, Route Reply (RREP) message is sent back to source by unicasting along the temporary reverse path of the received RREQ message. RREP message initiates in creating a routing table entries for the destination in intermediate nodes on its way back to source. After certain amount of time these routing table entries expire. Neighbors are detected by periodic HELLO messages (a special RREP message). If a node A does not receive HELLO messages from a neighbor B through which it sends traffic, it assumes that a link is broken and the failure indication is forwarded to its active neighbors. When this message reaches the sources, then either they request a new route by sending new RREQ messages or stop sending data. HELLO messages and the

We have simulated another network having 30 numbers of nodes. The simulation is made using the same platform used for network 1. This simulation is done taking node 1 as a source and node 28 as destination. The optimal path obtained in this simulation is 1-23-13-28, in which data rate is 0.47 kbps. The second optimal path is 1-17-28, in which data rate is 0.35 kbps. The simulated results are summarized here in

A group of wireless sensor nodes (devices) dynamically constructs a temporary network without the exercise of any pre-existing network infrastructure or centralized administration. The main goal of ad-hoc networking is multihop broadcasting in which packets are transferred from source node to destination node through the intermediate nodes (hops). The main function of multi hop WSN is to enable communication between two terminal devices through a bit of middle nodes, which are transferring information from one level to another level. On the foundation of network connectivity, it dynamically gets to determine that which nodes should get included in routing, each node involved in routing transmit the data to further

A node with the best behavior is assigned with the highest trust value e.i. 2, the nodes detected with the malicious behavior is assigned with the trust value < 0.5. The road side units (RSUs) are updated with the calculated trust values. Here, attacks related to the Link layer and physical layer are not considered. Instead, we have route trust values of the nodes and total number of nodes. Main advantage of the system is that malicious nodes are isolated from taking part in the network communication as we consider only most trustworthy node in the network.

Unfortunately, it is a big overhead to maintain routing tables in the mobile ad hoc network

Cables making up the core networks need to go very long distances across many states within the country. They typically follow well-defined routes such as highways and railways.

The more modern life, the higher traveling. One country cannot develop without traveling. Thus, governments should give more money, and policies to improve the quality of streets, roads, highways and besides, governments have to increase more public transportation such as buses, trains, subways.. to service the needs of traveling.

Most of the car companies are even worried about tracking about their vehicles. So, they want it to get installed such devices in their vehicles too.

The concept of internet of vehicle is shown in Fig.10. The converging technologies of IoV are related to electric vehicle, autonomous vehicle etc. The IoV can also deals with the vehicle to vehicle (V2V), vehicle to device (V2D), vehicle to infrastructure (V2I) and vehicle to grid (V2G) communication.

Abstract: Because of high speed of vehicles, short contact durations and rapid changes in topology occurs in Vehicular Delay Tolerant Network (VDTN). This will generates few transmission opportunities and high and unpredictable delay. This problem can be solved by different routing protocol of VDTN. The VDTN protocol can be divided as single copy and multi copy. In single copy protocol the node is allowed to generate the unique copy of message and forward it on a unique path. The multi copy protocols generate and transmit the multiple copies of each message and forward it along various paths. If more number of copies spread in network there are more chances for successful transmission. The objective of paper is to improve performance of VDTN by modifying existing Spray and Wait protocol. In this paper we provide proposed algorithm for modify spray and wait protocol for improving delivery probability with different number of message copy. The modifications based on stored number of message copies at source/rely nodes and encountered nodes ratio.

As quoted by Rodrigue, J-P (2013), “the most important transport problems are often related to urban areas and take place where transport systems fails to satisfy the various requirements of urban mobility because of several reasons. Productivity of any urban area is highly dependent on its transport system and also its efficiency to regulate goods, workers and consumers between multiple origins and destinations”.