VANETs simulation

As most vehicles remain parked 95% of its time, this suggests that leveraging the use of On-board Units (OBUs) in parked vehicles would provide communication and computation services to other mobile and fixed nodes for delivery of services such as multimedia streaming, data storage and data processing. The nearby vehicles can form an infrastructure using IEEE 802.11p communication interface, facilitating communication, computation and storage services to the end users. We refer to this as a Vehicular Fog Computing (VFC) infrastructure. In this study, using NS-2 simulator, we investigate how six routing protocols consisting of two proactive routing protocols, Destination Sequence Destination Vector (DSDV) and Fisheye State Routing (FSR); two reactive routing protocols, Ad Hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR); and two geographic routing protocols, Distance Routing Effect Algorithm for Mobility (DREAM) and Location Aided Routing (LAR) perform when forwa...

We present Greedy Perimeter Stateless Routing (GPSR), one of the best examples of position based routing. GPSR is a routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Ad Hoc On Demand Distance Vector Routing (AODV). Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.

We present Greedy Perimeter Stateless Routing (GPSR), one of the best examples of position based routing. GPSR is a routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router’s immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility’s frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Ad Hoc On Demand Distance Vector Routi...

Vehicular ad-hoc network is a sub class of mobile ad-hoc network (MANET) with a difference of having moving vehicles as nodes. Todays, it is growing very fast. ITS have two key components self-organized and key component for VANETs. In Vehicular ad hoc network (VANET) vehicles can share data and communicate without infrastructure with other vehicles and road side units (RSU). These networks are having highly dynamic topology with fast moving vehicles and frequent disconnection properties. It requires handover management and an efficient routing algorithm. This research paper contains a network which is the combination of vehicular nodes, road side unit (RSU), and WiMax. This paper also proposed an optimized routing algorithm for handover management in VANET. This algorithm is compared with RBRA. The paper results that the proposed algorithm has minimum transmission time and minimum request block rate.

ue to the highly dynamic nature of a mobile ad hoc network (MANET) and the node mobility, as well as the possibility of shortand long-term disconnections, the most important point is subscriber routing and information delivery in a short period of time. Therefore, in this study, we proposed the geographic zone routing (GZR) protocol which used the publish/subscribe system for receiving and sending information, a positioning system for determining the node location, and the zoning to structure a MANET in order to achieve the high packet delivery rates. The GZR can increase the rate of successful packet delivery and reduce the end-to-end delay and it performs well in large-scale dynamic networks.

Greedy routing in VANETs requires some geographical informations, such as the source location and the destination location. The first one could be obtained using some localization devices like GPS receiver. However, the second one is provided by a location service. This later has a high overhead especially if it is implemented over V2V (vehicle to vehicle) communications. Many location services are well known as HLS, RLS, GLS. This paper is interested in reducing this overhead by using some Road Side Units (RSU) already deployed along the roads. We propose here a location service called "improved Reactive Location Service (iRLS)", which is an extension of the RLS service. The major difference is that RLS assumes only V2V communications and iRLS takes profit of a wireless backbone based on RSUs to catch the destination's position. This allows to reduce the overhead instead of flooding requests and also makes the communication faster since we will not have to wait to the request to reach the destination before receiving the response and then starting sending data. In our proposal, the closest RSU will reply with the actual location. In order to show the contribution of our approach, we have conducted some simulations that prove that iRLS outperforms any geographic protocol by using the V2I communications in terms of end-to-end delay which is one of the most important parameter. We considered also the ratio of packet received correctly by the destination vehicle (PDR), our protocol improves significantly this second parameter, and ensures more than 20% of packets received correctly Index Terms-VANETs; Location-based Services; Geographic Routing Protocols, .

The aim of this project is to reduce number of wires in vehicle and alert the driver of blind zone collision. Because of the expanding number of sensors sent in current vehicles, intra-vehicular remote sensor systems (IVWSNs) have as of late gotten a great deal of consideration in the car industry, as they can diminish the measure of wiring tackle inside a vehicle. By evacuating the wires, auto producers can diminish the heaviness of a vehicle and enhance motor execution, mileage, and dependability. Notwithstanding these immediate advantages, an IVWSN is an adaptable stage that can bolster other vehicular applications too. An illustration application, known as a side visually impaired zone caution (SBZA) framework, which screens the visually impaired zone of the vehicle and cautions the driver in a convenient way to avoid impacts, is talked about in this paper. The execution of the IVWSN-based SBZA framework is assessed through genuine investigations led on two test vehicles. Our outcomes demonstrate that the proposed framework can accomplish roughly 95%-99% location rate with under 15% false alert rate. Contrasted and business frameworks utilizing radars or cameras, the primary advantage of the IVWSN-based SBZA is significantly lower cost.

This paper evaluates the performance of ETSI ITS Contention-Based Forwarding (CBF) and ETSI Simple GeoBroadcast forwarding while disseminating warning messages over a Geographical Area in highway and urban scenarios. Our experimental evaluation considers the complete ETSI ITS architecture including the Decentralized Congestion Control (DCC) mechanism. We propose an enhanced CBF mechanism, named S-FOT+, which combines several improvements to the ETSI CBF algorithm. S-FoT+ has a similar or better performance than the ETSI forwarding algorithms regarding both reliability and end-to-end delay while requiring much fewer transmissions. The improvements are equally effective and efficient in both urban and highway scenarios with large Destination Areas. Finally, we evaluate the trade-offs that stem from using multi-hop broadcast mechanisms in urban settings with smaller Destination Areas when compared to single-hop broadcast. Results show that multi-hop mechanisms significantly improve coverage at the cost of an increased number of transmissions.

Vehicular ad-hoc network (VANET) is an emerging paradigm for road transportation which minimizes traffic, accidents and improves fuel efficiency. VANET uses the position of the vehicle obtained from satellite system such as global positioning system (GPS), global navigation satellite system, Compass and Galileo as a location id in positionbased routing protocol. The position obtained from the satellite system is likely to have an error due to environmental and technical issues which effect the routing performance. Thus, this paper proposes a position-based routing protocol which uses Kalman filter based location prediction technique to improve routing performance by minimizing location error. The routing protocol performance is evaluated on NS-3.23 simulator with real time GPS traces and simulator generated mobility on Two-ray ground and Winner-II propagation model for 500 m transmission range. Further, performance is compared with other prediction-based routing protocol on the metrics of packet delivery ratio, average delay and throughput.

Background and Objectives: Vehicular Ad-Hoc Networks can enhance road safety and enable drivers to avoid different threats. Safety applications, mobile commerce, and other information services are among different available services that are affected by dynamic topology, vehicle's speed and node misbehaving. Dynamic topology makes the route unstable and unreliable. So, improving the throughput and performance of VANET through reliable and stable routes with low overhead are among the important goals in this context. Methods: Verifying all issues related to the reliable routing, different effective internal, external and environmental factors on route reliability are led to a new security framework in this paper. Black-hole attack and its effects, as the most well-known attack in wireless networks, along with presenting a secure routing protocol are other achievements of this paper. The proposed protocol uses a trust management system to detect and neutralize this type of attack. Results: Simulation results show that the presented trust-based framework can increase the reliability of the networks by decreasing the effect of the malicious nodes in the routing process. Conclusion: Our simulation results show that the proposed protocol can overcome the effects of black-hole attackers and it can increase throughput by 93% and packet received rate by 94.14% compared to the original AODV. Investigating the effect of the other attacks, simulating in an urban area with repetitive communications and considering the RSU in verifying the trustworthiness of entities are suggested for our future works.

The success of fundamental network tasks of traffic delivery from a source to a destination node is mainly dependent on the efficiency of the routing protocol. In mobile ad hoc networks, the effectiveness of routing protocols is additionally demanding due to the dynamic nature of network nodes. In this paper, we dealt with the exploitation of the routes generated using DSDV bellman-ford routing protocol. Through a total of 3960 network simulations with different topologies, network loads and mobility nodes, various parameters of the DSDV were considered. Our results show that there are a large number of unused routes, and techniques for improving the efficiency of routing and reducing routing overhead can be implemented. Index Terms-routing protocols, networking, network performances, simulations This work was supported by the ESF in Science without borders project, reg. nr. CZ.02.2.69/0.0/0.0/16 027/0008463 within the Operational Programme Research, Development and Education 1 In this paper, the paths and routes are used as synonyms, which denote the sequential series of nodes for connecting two distant nodes of the network.

Universitas Gadjah Mada (UGM) is aiming to be a university that leads dissemination of application of energy conservation principles with its Green Campus concept. One of Green Campus concepts is the green behaviour by giving information and inviting citizens to use energy, water and paper efficiently and giving education to citizens about environmental issues. One of the examples in energy efficiency practice is car-free streets. Energy consumption can be shown by number of vehicles and number of vehicles can be shown by sound level comparison or sound level mapping. Sound level mapping is a graphic representation of the sound level distribution existing in a given region, for a defined period. The higher sound level indicates more vehicle pass through an area. Number of vehicles and limited street capacities create traffic jam frequently. During a traffic jam, vehicle burn fuel but not moving and cause bad effect to environment. Sound level mapping is needed to know how big the ef...

Quickly identifying the severity of highway accidents, as well as the resources required to assist the people involved in those accidents, is a basic requirement for future intelligent transportation systems. In this context, vehicular communication technologies currently being standardized are able to provide novel solutions to address this problem. In this work we study the feasibility of combining vehicleto-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications to deliver a video stream from the place of the accident to the traffic authorities. Our approach relies on vehicles as data relays, thus having the additional advantage of providing drivers with a clear view about the accident, thereby helping to reduce stress and improving traffic flow. An experimental analysis comparing different traffic flooding mechanisms for wireless networks show that the proposed system is viable for highways with moderate/high amounts of traffic, although highlighting the need for more efficient mechanisms specifically addressing broadcast propagation in highway environments.

Quickly identifying the severity of highway accidents, as well as the resources required to assist the people involved in those accidents, is a basic requirement for future intelligent transportation systems. In this context, vehicular communication technologies currently being standardized are able to provide novel solutions to address this problem. In this work we study the feasibility of combining vehicleto-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications to deliver a video stream from the place of the accident to the traffic authorities. Our approach relies on vehicles as data relays, thus having the additional advantage of providing drivers with a clear view about the accident, thereby helping to reduce stress and improving traffic flow. An experimental analysis comparing different traffic flooding mechanisms for wireless networks show that the proposed system is viable for highways with moderate/high amounts of traffic, although highlighting the need for more efficient mechanisms specifically addressing broadcast propagation in highway environments.

This paper presents a method or technique that identifies physical intrusion detection in an indoor environment that is based on received signal strength indicator (RSSI) on radio frequency identification. The objective of this paper is two folds. Firstly, is to characterize the signal behavior in an indoor environment using statistical measures. Secondly, is to identify the existence of a human presence inside a contained environment (e.g., room). The objective is to use simple means like the recorded readings of the received signal strength indicator (RSSI). The characterization was observed during three distinctive time intervals, namely; empty room, with human presence, and transitional period during link crossings. The experiment was repeatedly conducted for 5 minutes to validate the averaged results. In order to emulate real-life environment, experiments were conducted using Zigbee-compliant iris mote XM2110 and MIB510 programming boards with transmitter and receiver antennas,...

Vehicular Ad-hoc Network (VANET) is an essential part of futuristic Intelligent Transportation Systems. VANET can improve the overall traffic control system and reduce road accident deaths by providing remote health monitoring in hazardous conditions to outdoor patients. Nowadays, vehicles have become so intelligent that they can sense patient health data and transmit it to a nearby ambulance or hospital in emergency or road accident situations. Health professionals can provide appropriate treatment without wasting critical time in further testing. Developing an efficient and reliable routing solution is a significant research problem for VANET based health monitoring applications because of time-sensitives. Routing approaches to reduce the transmission delay for critical applications are based on topological, geographical, clustering, and flooding techniques. This article has evaluated and compared widely used topological and geographical routing protocols for data-based VANETs health monitoring applications. A comprehensive analysis is performed on Ad hoc On-Demand Distance Vector (AODV), Destination-Sequenced Distance-Vector (DSDV), Optimized Link State Routing (OLSR), Greedy Perimeter Stateless Routing (GPSR), Greedy Perimeter Stateless Routing-Modified (GPSR-M), and Max duration-Minangle Greedy Perimeter Stateless Routing (MM-GPSR) protocols with different numbers of nodes, CBR connections, communication range and packet size on Network Simulator (NS-3.23) and Simulation of Urban Mobility (SUMO) platforms. Experimental results give useful knowledge in analyzing routing protocols for VANET's data-based smart health monitoring applications.

IoV is the latest application of VANET and is the alliance of Internet and IoT. With the rapid progress in technology, people are searching for a traffic environment where they would have maximum collaboration with their surroundings which comprise other vehicles. It has become a necessity to find such a traffic environment where we have less traffic congestion, minimum chances of a vehicular collision, minimum communication delay, fewer communication errors, and a greater message delivery ratio. For this purpose, a vehicular ad hoc network (VANET) was devised where vehicles were communicating with each other in an infrastructureless environment. In VANET, vehicles communicate in an ad hoc manner and communicate with each other to deliver messages, for infotainment purposes or for warning other vehicles about emergency scenarios. Unmanned aerial vehicle- (UAV-) assisted VANET is one of the emerging fields nowadays. For VANET’s routing efficiency, several routing protocols are being ...

Routing data in Vehicular Ad hoc Networks is still a challenging topic. The unpredictable mobility of nodes renders routing of data packets over optimal paths not always possible. Therefore, there is a need to enhance the routing service. Bus Rapid Transit systems, consisting of buses characterized by a regular mobility pattern, can be a good candidate for building a backbone to tackle the problem of uncontrolled mobility of nodes and to select appropriate routing paths for data delivery. For this purpose, we propose a new routing scheme called Busbased Routing Technique (BRT) which exploits the periodic and predictable movement of buses to learn the required time (the temporal distance) for each data transmission to RoadSide Units (RSUs) through a dedicated bus-based backbone. Indeed, BRT comprises two phases: (i) Learning process which should be carried out, basically, one time to allow buses to build routing tables entries and expect the delay for routing data packets over buses, (ii) Data delivery process which exploits the prelearned temporal distances to route data packets through the bus backbone towards an RSU (backbone mode). BRT uses other types of vehicles to boost the routing of data packets and also provides a maintenance procedure to deal with unexpected situations like a missing nexthop bus, which allows BRT to continue routing data packets. Simulation results show that BRT provides good performance results in terms of delivery ratio and end-to-end delay.

Routing data in Vehicular Ad hoc Networks is still a challenging topic. The unpredictable mobility of nodes renders routing of data packets over optimal paths not always possible. Therefore, there is a need to enhance the routing service. Bus Rapid Transit systems, consisting of buses characterized by a regular mobility pattern, can be a good candidate for building a backbone to tackle the problem of uncontrolled mobility of nodes and to select appropriate routing paths for data delivery. For this purpose, we propose a new routing scheme called Busbased Routing Technique (BRT) which exploits the periodic and predictable movement of buses to learn the required time (the temporal distance) for each data transmission to RoadSide Units (RSUs) through a dedicated bus-based backbone. Indeed, BRT comprises two phases: (i) Learning process which should be carried out, basically, one time to allow buses to build routing tables entries and expect the delay for routing data packets over buses, (ii) Data delivery process which exploits the prelearned temporal distances to route data packets through the bus backbone towards an RSU (backbone mode). BRT uses other types of vehicles to boost the routing of data packets and also provides a maintenance procedure to deal with unexpected situations like a missing nexthop bus, which allows BRT to continue routing data packets. Simulation results show that BRT provides good performance results in terms of delivery ratio and end-to-end delay.

IoV is the latest application of VANET and is the alliance of Internet and IoT. With the rapid progress in technology, people are searching for a traffic environment where they would have maximum collaboration with their surroundings which comprise other vehicles. It has become a necessity to find such a traffic environment where we have less traffic congestion, minimum chances of a vehicular collision, minimum communication delay, fewer communication errors, and a greater message delivery ratio. For this purpose, a vehicular ad hoc network (VANET) was devised where vehicles were communicating with each other in an infrastructureless environment. In VANET, vehicles communicate in an ad hoc manner and communicate with each other to deliver messages, for infotainment purposes or for warning other vehicles about emergency scenarios. Unmanned aerial vehicle- (UAV-) assisted VANET is one of the emerging fields nowadays. For VANET’s routing efficiency, several routing protocols are being ...

Vehicular communication is a cynosure in automotive industry these days. V2V communication is one of the types of vehicular communication which render lane change warning, emergency vehicle alert, intersection alert, congestion alert, payment at tolls etc. A simulation research on the utilization of vehicle to vehicle connectivity via different routing protocols in VANET, contemplating the instance of a city situation has been introduced in our paper in order to resolve the issue of traffic routing. A routing algorithm is proposed which firstly selects optimal path via carry and forward approach and then transmits information on that path and the proposed algorithm is then compared with contemporary routing protocols based on different QoS parameters like throughput, packet delivery ratio, delay which are measured using NETSIM simulator to evaluate the behaviour of dissimilar routing protocols. The proposed algorithm outperforms most of the simulation cases.

In a vehicular ad hoc network (VANET), vehicles always move in high-speed which may cause the network topology changes frequently. This is challenging for routing protocols of VANET. Greedy Perimeter Stateless Routing (GPSR) is a representative routing protocol of VANET. However, when constructs routing path, GPSR selects the next hop node which is very easily out of the communication range in greedy forwarding, and builds the path with redundancy in perimeter forwarding. To solve the above-mentioned problems, we proposed Maxduration-Minangle GPSR (MM-GPSR) routing protocol in this paper. In greedy forwarding of MM-GPSR, by defining cumulative communication duration to represent the stability of neighbor nodes, the neighbor node with the maximum cumulative communication duration will be selected as the next hop node. In perimeter forwarding of MM-GPSR when greedy forwarding fails, the concept of minimum angle is introduced as the criterion of the optimal next hop node. By taking the position of neighbor nodes into account and calculating angles formed between neighbors and the destination node, the neighbor node with minimum angle will be selected as the next hop node. By using NS-2 and VanetMobiSim, simulations demonstrate that compared with GPSR, MM-GPSR has obvious improvements in reducing the packet loss rate, decreasing the end-to-end delay and increasing the throughput, and is more suitable for VANET. INDEX TERMS Vehicular ad hoc network, routing protocols, GPSR, greedy forwarding, perimeter forwarding, NS-2.

Vehicular ad-hoc network (VANET) is a technology used to create a wireless adhoc network on demand basis using mobile vehicles. In VANET, mobile vehicles behave like a transmitter and they participate during data transmission on the network. In VANET, the nodes are highly movable in any direction. Due to this, links may be broken and the data delivery may fail. It may be recovered when other alternative links can be reestablished immediately. Thus, the network performance and reliability of the VANET depend upon the selection of next forwarder (N F) node in forward area (F A) of request zone. In this paper, we propose an Improved Directional LAR routing protocol that finds the best nexthop forwarder node in forward area and thus reduces unnecessary transmissions. Two algorithms have been proposed as one to select best next-hop forwarder node and other to forward data packets in the network. We have mathematically analyzed the nodes distribution in forward area direction. Furthermore, we have also evaluated the selection of next forwarder node, its expected distance, average numbers of hops and expected distance between source and destination nodes. The performance analysis has been done with existing D-LAR and LAR routing protocols.

In recent years, the general interest in routing for vehicular ad hoc networks (VANETs) has increased notably. Many proposals have been presented to improve the behavior of the routing decisions in these very changeable networks. In this paper, we propose a new routing protocol for VANETs that uses four different metrics. which are the distance to destination, the vehicles' density, the vehicles' trajectory and the available bandwidth, making use of the information retrieved by the sensors of the vehicle, in order to make forwarding decisions, minimizing packet losses and packet delay. Through simulation, we compare our proposal to other protocols, such as AODV (Ad hoc On-Demand Distance Vector), GPSR (Greedy Perimeter Stateless Routing), I-GPSR (Improvement GPSR) and to our previous proposal, GBSR-B (Greedy Buffer Stateless Routing Building-aware). Besides, we present a performance evaluation of the individual importance of each metric to make forwarding decisions. Experimental results show that our proposed forwarding decision outperforms existing solutions in terms of packet delivery.

This paper offers an empirical study of the impact of the way how the distance between two nodes is measured by a geographical routing protocol for VANETs in order to take its forwarding decision. The distance equations used in this work are obtained by setting the order parameter of the Minkowski distance function. Simulation results from the topology of a real city indicate that the use of dominant distance can improve some classical performance metrics like the packet delivery ratio, average number of hops or end-to-end packet delay.

Mobile ad-Hoc Network (MANET) is a group of mobile nodes interconnected and dynamic. A routing protocol is used to find the routes between the mobile nodes and facilitate the communication within the network. The aim of the protocols is to establish a correct and efficient route between a pair of mobile nodes, also it needs to be discovered and kept with a minimum consumption of bandwidth. This research work shows the performance assessment of six routing protocols: Destination Sequenced Distance-Vector (DSDV), Optimized Link State Routing (OLSR), Dynamic Source Routing Protocol (DSR), Ad Hoc On-Demand Distance Vector (AODV), Zone Routing Protocol (ZRP), Dynamic MANET On-Demand (DYMO). The evaluation was defined scenarios with 50, 90, 130, 170, 210 and 250 nodes and parameters such as: numbers of generated packages , broadcast packages, delay of node to node. The simulations and visualization from the results were executed in the network simulator NS2 version 2.34 and TraceGraph.

A new concept such as smart city was introduced in the last years where the Intelligent Transportation system (ITS) plays a critical role to provide road safety and manage Vehicular Ad Hoc Networks (VANETs) traffic. Nevertheless, VANETs have significant constraints like nodes high mobility, intermittent connectivity, variable network density and heterogeneity. However, the different types of traffic, the different Quality of Service requirements, the need to exchange mobile data, multi-services and data diversity leads mainly to load and time constraints in this specific and stringent type of networks. The main characteristic of this kind of networks is the very changing topology that poses supplementary constraints and makes achieving QoS constraints a very challenging task. In VANET network the vehicle generated traffic will be transferred to the data center from road side unit to the base station by using Long Term Evolution (LTE) in an urban area. Despite LTE has a larger system capacity and it provides a higher transmission speed, the network performance is affected by the implemented scheduling algorithm. In this context, we study the efficiency of LTE scheduler algorithms such as Proportional Fairness, Round Robin, Priority Set Scheduler, Maximum Throughput Scheduler and Throughput to Average Scheduler and Blind Equal Throughput mainly at the road side unit using Network Simulator 3(NS3) to determinate the most suitable scheduler for VANET traffic. Results demonstrate that the round robin algorithm is more effective for volumetric VANET traffic in terms of throughput, delay, packet loss rate and fairness.

Today, the problem of cities urban transportation is becoming something we have to face in our daily life. In Indonesia, traffic congestion is increasingly serious. Several economic and social motivations can be related to the need to minimize the time spent in vehicles for transportation and consequently their related pollution problems. Due to these motivations, the literature on traffic phenomena is already vast and characterized by contributions covering modeling aspects, statement of problems, qualitative analysis, and particularly developed simulation generated by applications. This paper will provides a several literature review of microscopic model based on their utilities, including the critical review about the modeling approaches. Furthermore, some practical issues such as potential for future model improvement using existing and emerging data collection technologies is identified based on Indonesian traffic characteristics and will be presented as a contribution from thi...

VANET is self-organizing network which is created among no of the vehicles. According to survey there is approximate ten million people are dying due to road accident. This is one social as well as industrial challenge to reduce the rate of accident in the world. This reduction is possible if the vehicles can predict the vehicles besides it or around it. Advanced information of the vehicle which is about to crossing a person or sometimes not seen with the eyes that can be collected with the signal coming by the other vehicles and it will be very beneficial for the reducing the rate of accidents. Here, VANET is one option for this scenario. More and more researches are going on this wireless domain to develop a new routing protocol for the VANET. It is very crucial to develop such type of protocol for VANET because of their continually changing speed and direction and the received signal [8].The implementation will be done using the CANU simulator. Recent research work in VANET empha...

A subclass of a Mobile Adhoc Network (MANET) is a Vehicular Adhoc Network (VANET). It consists of self-configuring moving vehicles which are called nodes. It is an inevitable ingredient of intelligent transportation systems. The vehicular network has some permanent devices called roadside units and moving devices called On Board Units (OBU). Every vehicle traveling on the network must possess the OBU. Safety and non-safety tidings are broadcasted in vehicular networks. Even vehicular network is derived from MANET and its characters are discriminated against the MANET. The various unique characteristics of VANETs are high mobility, changes in network topology, size of the network, long distance between the vehicles, frequently changing vehicle density, and limited time. Because of these special features, the traditional security and routing mechanisms are not suitable for VANETs. Also, the safety messages are modified or discarded by the attacker or any other node and it may lead to the loss of privacy, integrity, confidentiality, and authentication of the data.So to enhance the security of VANETs, it is very much essential to invent a secure communication protocol, to protect the infrastructure of the network and the confidentiality of the data. The simulation results reveal that the secure communication using certificate revocation approach, energy-efficient enhanced secure routing protocol, traffic-aware secure routing for VANETs using Hybrid Enhanced Glowworm Swarm Optimization (HEGSO), and trust model for secure communication in VANETs is ensuring the security in VANETs. When compared to peer existing routing protocols, the proposed scheme significantly reduces the packet failure ratio, response time, and throughput. When compared to ARIOR and I-AREOR, the proposed HEGSO technique diminished delays by 20% and 34%, respectively.

Quickly identifying the severity of highway accidents, as well as the resources required to assist the people involved in those accidents, is a basic requirement for future intelligent transportation systems. In this context, vehicular communication technologies currently being standardized are able to provide novel solutions to address this problem. In this work we study the feasibility of combining vehicleto-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications to deliver a video stream from the place of the accident to the traffic authorities. Our approach relies on vehicles as data relays, thus having the additional advantage of providing drivers with a clear view about the accident, thereby helping to reduce stress and improving traffic flow. An experimental analysis comparing different traffic flooding mechanisms for wireless networks show that the proposed system is viable for highways with moderate/high amounts of traffic, although highlighting the need for more efficient mechanisms specifically addressing broadcast propagation in highway environments.

This paper suggests a methodology based on the image processing technique able to automatically calculate the vehicle traffic and its components (light vehicles, heavy vehicles and motorcycles). The method also allows to evaluate instant vehicle speeds and, where necessary, to rebuild vehicle trajectories. Traffic data obtained through the procedure described below (capacities and speeds) can be also usefully applied to estimate pollutant emissions from vehicle traffic per year; therefore, the suggested method employs the algorithms defined with CORINAIR procedures, implemented in Copert 4 software. In order to evaluate how effective is the methodology, an experiment has been carried out in a suburban area, more precisely in a motorway section approaching the International airport “Falcone e Borsellino” of Palermo in Italy.

Currently, increase of CO 2 emissions in the city areas is due to industrial pollution, burning of fuels, deforestation, and excessive vehicle movement. For environmental safety, regular monitoring of CO 2 level is needed in the city areas. The main objective of this research is to localize the high CO 2 zones in the city areas using UVANETs. Vehicles in the city areas are used as the resources to collect and monitor the CO 2 levels. After the zone localization, the location (high CO 2 zone) information is sent to the information center using the proposed routing scheme through the vehicles to take possible actions in emergency. To the best of our knowledge no such work has been proposed to localize the high CO 2 zones in the city areas using UVANETs. For performance evaluation, this method is tested in a small UVANET prototype developed in indoor environment.

Vehicular ad-hoc network (VANET) is an emerging paradigm for road transportation which minimizes traffic, accidents and improves fuel efficiency. VANET uses the position of the vehicle obtained from satellite system such as global positioning system (GPS), global navigation satellite system, Compass and Galileo as a location id in positionbased routing protocol. The position obtained from the satellite system is likely to have an error due to environmental and technical issues which effect the routing performance. Thus, this paper proposes a position-based routing protocol which uses Kalman filter based location prediction technique to improve routing performance by minimizing location error. The routing protocol performance is evaluated on NS-3.23 simulator with real time GPS traces and simulator generated mobility on Two-ray ground and Winner-II propagation model for 500 m transmission range. Further, performance is compared with other prediction-based routing protocol on the metrics of packet delivery ratio, average delay and throughput.

One important application in Vehicular ad hoc networks, VANET, is applied for the cooperative collision avoidance (CCA) in the intelligent transportation system, ITS. In CCA, a driver could broadcast emergency messages to advice the vehicle behind accident through VANET. Thus how to design an efficient broadcasting method for forwarding the emergency messages is important in ITS. However, most of researches focused on avoiding broadcast storm by selecting only one forwarder for broadcasting. In this way, it caused that emergency messages could not be spread in other direction roads. Thus the cars in these directions of the crossroad cannot receive the emergency messages to prevent the traffic accident. To address this issue, we proposed an emergency messages broadcasting by multi-forwarder (EMBM) to select the appropriate forwarders for each brand at the intersection. Thus the emergency message could be forwarded through each brand when the messages were broadcasted across the intersection. The simulation results showed that the reachability in EMBM was 44.9 % and higher than that in binary partition assisted broadcast (BPAB), and 46.6 % higher than that in cell broadcast for streets, CBS. The average delay time of EMDM was 32.3 % lower than that in BPAB, and 69.1 % lower than that in CBS.

Position-based routing protocols forward packets in a greedy manner from source to destination without having to maintain routes through the network. Contention-based routing strategies improve upon position-based routing in that they do not even require to maintain neighbor tables at the nodes. This makes them very robust in highly mobile networks. However, neighbor tables are essential in the recovery mechanisms that are used when greedy routing fails. In this poster proposal we outline "Contention-Based Distance-Vector Routing (CBDV)", a recovery strategy for contention-based routing protocols that works when no neighbor tables are present. We describe the basic idea and give a simulative analysis of its performance.

Internet of vehicles focuses on globalization of vehicular networks by providing better communication means between vehicles and other infrastructures also between vehicles and human. The efficient data transfer between moving vehicles as well as between vehicles and roadside units is one of the current demands of vehicular network standards. Index coding has proven its significance in reducing number of transmissions in wireless networks. In this paper, we focus on satisfying demands of multiple clients with reduced number of transmissions at server. The proposed contention-based protocol uses index coding to reduce transmissions. Multiple files can be transmitted in a single file using index coding, which eventually reduce transmissions and also save transmission bandwidth. The effect of vehicle speed and available number of clients on the system throughput is presented in this paper. Simulation results show that our proposed design achieves higher throughput than IEEE 1609.4 and VEMMAC, and it also saves the transmission bandwidth at server, since multiple files are transmitted in a single transmission.

Vehicular ad-hoc network (VANET) is gaining the research interest lately due to its advantages in providing valid and fresh information for vehicles on the road. In VANET information exchanges between vehicles and a server in a multihop fashion. Multi-hop fashion implies an existence of multi route to a destination, and a routing protocol has the role of determining the best path among the exciting routes to a destination. Most of the current routing protocols use the traditional hop count as a metric to distinguish between routes. In this paper SNR is proposed as routing metric to determine the best path to a destination. Moreover, this paper focuses on development and implementation of routing protocol metric namely SNR for Dynamic MANET on-demand (DYMO) protocol in VANET. The new routing metric is implemented in the DYMO model in INET module under OMNET++ simulator. A simulations study has been carried out to analyze the performances of the improved DYMO with SNR. Moreover, a comparison between the DYMO and modified DYMO is conducted to study the effect of mobility, network road traffic condition and data traffic density. Network performances have been studied in terms of throughput, end-to-end delay and Protocol overhead. The obtained result show that the modified DYMO has better performances compare to the DYMO with the traditional hop-count metric.

Wireless sensor network is a collection of sensor nodes designed with different routing capabilities to operate on real-world applications. In extreme environments, real-time applications of wireless sensor network ensure exchange of data, a difficult one between the sensor nodes, when less resources are consumed. Therefore, researchers are developing a routing protocol including optimal routing procedures to increase the longevity of the networks. In this paper, an improved route extension architecture is developed in wireless sensor network environment. This Improved Greedy Perimeter Stateless Routing is proposed to offer an improved transmission coverage and reduced power consumption capability. It deploys a periodic broadcast of hello message (or control messages) including the positional information between the sensor nodes. The experimental result concludes that the Improved Greedy Perimeter Stateless Routing method achieves improved routing capabilities than the traditional h...

Mobile embedded systems increasingly use transactions for applications like mobile inventory, mobile commerce or commercial applications. Yet, many issues are challenging and need to be resolved before enabling mobile devices to take part in distributed computing. Mobile environment limitations make it harder to design appropriate and efficient commit protocols. There are a handful of protocols for transaction execution in distributed mobile environment, but almost all consider a limited number of communication models. In this paper, we evaluate the performance of a Connection Fault-Tolerant Model, comparing the results in several deferent scenarios, as well as its contribution to the overall mobile transaction commit rate. Our simulation-based performance analysis determines the impact of (i) ad-hoc communication between mobile hosts and (ii) the implementation of a decision algorithm, to the mobile transaction commit rate. We also determine the connection timeout values that contribute the most for a high ad-hoc communication impact on mobile transaction commit rate.

The increasing rate of road fatalities has demanded the attention of the researchers, scientists, Industry and government organizations and technologies. The impact of accidents is simulated by rear-end collision with parameters such as vehicle position, direction, speed, inter-vehicle distance, and relative speeds, etc. Open source simulators have to be adopted to study and analyze various collision scenarios in vehicular networks. Safety mechanism proposed to minimize the possibility of accidents and mitigate the effect of the escalating incident. The proposed mechanism estimates the point of intersection, time to collision, and time to avoid accidents. Using parameters, the proposed mechanism able to determine accidents with 92.6% accuracy. The remaining 7.4% cases enable the passive safety system to help the people to stay alive, minimize the damage in case an accident.

In WSNs, the existing routing and clustering schemes have demonstrated the effectiveness of traffic distribution to fulfill the quality of service requirements of applications. However, due to the non existence of intelligence in those routing and clustering algorithms might significantly affect the transmission performance, scalability, reliability, and security of WSNs. Thus, by considering the reliability, congestion control, and security for, it is desirable to design an intelligent routing scheme to provide efficient routing. This paper proposes an intelligent routing protocol (IRP) based on artificial neural network (ANN) for wireless sensor networks. IRP performs the cluster identification and cluster head (CH) election using ANN. This process causes less overhead and helps in achieving the real advantage of clustering in wireless sensor networks. Once the clustering is completed, the routing phase comes into action. In the routing phase, the table driven protocol is used to ...

Mobile ad hoc network (MANET) is a self-organised system comprised of mobile wireless nodes. All nodes act as both communicators and routers. Due to the absence of centralised administration in MANETs, communications between nodes are vulnerable to attacks by malicious nodes. In order to decrease the hazards from malicious nodes, recently researchers have given more importance to the concept of trust and recommendation in MANETs. In these models, the recommendations are prone to issues such as recommender’s bias, honest-elicitation, and free-riding. In this paper we have tried to build a simple collaborative trust model to minimize those issues. This model is used to evaluate the trust of a node based on the trust value given by the neighbours. Weights are given to the trust value based on the trust degree of neighbours. The data packets get forwarded towards destination through the path having greatest trust value. The effectiveness and efficiency of the algorithm is demonstrated t...

Vehicular Ad hoc Network involves the movement of vehicles and the communication between them for their security. VANETs have many application areas. One of main applications of VANETs is to improve the driving safety. In various safety related applications, vehicular nodes constantly communicate with roadside equipments. Road Side Units (RSUs) can sense the real time information about road conditions, animals straying and road blocks and passes all this hazardous related information to the vehicles approaching in its range. These alert messages enable the driver to take timely decisions in preventing from accidents or delays in information delivery. In this paper, Enhanced Direction based Hazard Routing Protocol and Ad Hoc On-demand Distance Vector protocols are used to avoid prevent vehicles from collision and to increase the coverage range of VANETs. These issues are resolved by bypass routing and a synchronized clock maintained with the RSUs respectively. To solve the issues and make the system more reliable we propose the roadside wireless sensor nodes along with vehicular nodes in the network. The RSUs are fixed at some distances and communicate with wireless sensors attached at vehicular nodes.

The study of knowledge transfer is becoming important in many areas such as small-medium enterprises, higher education, health management and disaster management. Our study focuses on the process of knowledge transfer in the flood management domain in Malaysia. Currently, there is a lack of standard practice in terms of transferring knowledge between entities in this domain. Thus, based on a review of the literature, we propose the conceptual model of a knowledge transfer process in the flood management domain. The proposed model is a preliminary work which will be evaluated in the next phase. INTRODUCTION Knowledge management systems (KMS) have been extensively used in many fields including business, IT outsourcing, higher learning institutions, health management, disaster management and many others. This is due to the ability of KMS to manage organisational knowledge effectively. According to (Alavi & Leidner 2001), a KMS is a system that can support the process of knowledge creat...

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way since the energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor network. In this paper, we introduce an adaptive clustering protocol for wireless sensor networks, which is called Adaptive Decentralized Re-Clustering Heterogeneous Protocol (ADRHP) for Wireless Sensor Networks. In ADRHP, the cluster heads and next heads are elected based on residual energy of each node and the average energy of each cluster. Clustering has been well received as an effective way to reduce the energy consumption of a wireless sensor network. Clustering is defined as the process of choosing a set of wireless sensor nodes to be cluster heads for a given wireless sensor network. Therefore, data t...

This paper suggests a methodology based on the image processing technique able to automatically calculate the vehicle traffic and its components (light vehicles, heavy vehicles and motorcycles). The method also allows to evaluate instant vehicle speeds and, where necessary, to rebuild vehicle trajectories. Traffic data obtained through the procedure described below (capacities and speeds) can be also usefully applied to estimate pollutant emissions from vehicle traffic per year; therefore, the suggested method employs the algorithms defined with CORINAIR procedures, implemented in Copert 4 software. In order to evaluate how effective is the methodology, an experiment has been carried out in a suburban area, more precisely in a motorway section approaching the International airport “Falcone e Borsellino” of Palermo in Italy.

In wireless sensor network, sensor nodes are deployed randomly depending on the application. The sensor node location is very much important to make a meaningful sense of the data gathered by the sensor network. The intelligence of the environment is assisted by wireless sensor network by using the location information of the sensor nodes. In this paper a novel algorithm named group search optimizer localization algorithm is proposed for sensor node location information detection. This algorithm is based on producer scrounger model of animal behavior. The location information detection is required to increase the performance and reliability of wireless sensor networks (WSN). It also increases the lifetime of the network by guiding the network without unwanted routing.

Chain code is used as representation for an image in form of sequence of directional codes along the border or structure line. Issue arises during its extraction when the line has branches and the sequence must be continuous; no restarting at any junction is allowed. This paper presents a chain codes extraction of Thinned Binary Image (TBI) from upper-case Centre of Excellent for Document Analysis and Recognition (CEDAR) dataset using Meta-heuristic techniques. There are six methods in Meta-heuristic techniques that called Differential Evolution (DE), Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Ant-Colony Optimization (ACO), Harmony Search Algorithm (HSA) and Simulated Annealing (SA). In the feature extraction, Freeman Chain Code (FCC) was used as data representation that uses 8neighbourhood directions. However, the FCC representation is dependent on the route length and branches of the characters’ node. These six methods are used to find the shortest route that co...