Requirement analysis for building practical accident warning systems based on vehicular ad-hoc networks

An Accident Warning System (AWS) is a safety application that provides collision avoidance notifications for next generation vehicles whilst Vehicular Ad-hoc Networks (VANETs) provide the communication functionality to exchange these notifi- cations. Despite much previous research, there is little agreement on the requirements for accident warning systems. In order to build a practical warning system, it is important to ascertain the system requirements, information to be exchanged, and protocols needed for communication between vehicles. This paper presents a practical model of an accident warning system by stipulating the requirements in a realistic manner and thoroughly reviewing previous proposals with a view to identify gaps in this area

The Dynamics of Vehicular Networks in Urban Environments

Vehicular Ad hoc NETworks (VANETs) have emerged as a platform to support intelligent inter-vehicle communication and improve traffic safety and performance. The road-constrained, high mobility of vehicles, their unbounded power source, and the emergence of roadside wireless infrastructures make VANETs a challenging research topic. A key to the development of protocols for inter-vehicle communication and services lies in the knowledge of the topological characteristics of the VANET communication graph. This paper explores the dynamics of VANETs in urban environments and investigates the impact of these findings in the design of VANET routing protocols. Using both real and realistic mobility traces, we study the networking shape of VANETs under different transmission and market penetration ranges. Given that a number of RSUs have to be deployed for disseminating information to vehicles in an urban area, we also study their impact on vehicular connectivity. Through extensive simulations we investigate the performance of VANET routing protocols by exploiting the knowledge of VANET graphs analysis.Comment: Revised our testbed with even more realistic mobility traces. Used the location of real Wi-Fi hotspots to simulate RSUs in our study. Used a larger, real mobility trace set, from taxis in Shanghai. Examine the implications of our findings in the design of VANET routing protocols by implementing in ns-3 two routing protocols (GPCR & VADD). Updated the bibliography section with new research work

Network parameters impact on dynamic transmission power control in vehicular ad hoc networks

International audienceIn vehicular ad hoc networks, the dynamic change in transmission power is very effective to increase the throughput of the wireless vehicular network and decrease the delay of the message communication between vehicular nodes on the highway. Whenever an event occurs on the highway, the reliability of the communication in the vehicular network becomes so vital so that event created messages should reach to all the moving network nodes. It becomes necessary that there should be no interference from outside of the network and all the neighbor nodes should lie in the transmission range of the reference vehicular node. Transmission range is directly proportional to the transmission power the moving node. If the transmission power will be high, the interference increases that can cause higher delay in message reception at receiver end, hence the performance of the network decreased. In this paper, it is analyzed that how transmission power can be controlled by considering other different parameter of the network such as; density, distance between moving nodes, different types of messages dissemination with their priority, selection of an antenna also affects the transmission power. The dynamic control of transmission power in VANET serves also for the optimization of the resources where it needs, can be decreased and increased depending on the circumstances of the network. Different applications and events of different types also cause changes in transmission power to enhance the reachability. The analysis in this paper is comprised of density, distance with single hop and multi hop message broadcasting based dynamic transmission power control as well as antenna selection and applications based. Some summarized tables are produced according to the respective parameters of the vehicular network. At the end some valuable observations are made and discussed in detail

Vehicular ad hoc routing protocol with link expiration time (VARP-LET) information

This thesis presents a vehicular ad hoc routing protocol that uses link expiration time (LET) information in selection of routes. The proposed protocol is named as VARP-LET, which uses LET information to increase reliability and stability of the routes. LET information is used selectively in the route discovery mechanism to reduce the routing control overhead. In addition to LET a Route Break Indicator (RBI) message is introduced. RBI is generated when a link breakage is about to occur. A source node on receiving the RBI signal preemptively stops sending data packets through a route before it breaks. This provision decreases the packet loss. The effectiveness of LET and RBI is tested via network simulations with NS-2. These simulations show that VARP-LET protocol increases packet delivery ratio by 20.7% in street section mobility model and by 30% in highway mobility scenario compared to regular AODV protocol. It is also shown that the protocol significantly reduces frequent route failure and routing overhead

Routing schemes in FANETs: a survey

Flying ad hoc network (FANET) is a self-organizing wireless network that enables inexpensive, flexible, and easy-to-deploy flying nodes, such as unmanned aerial vehicles (UAVs), to communicate among themselves in the absence of fixed network infrastructure. FANET is one of the emerging networks that has an extensive range of next-generation applications. Hence, FANET plays a significant role in achieving application-based goals. Routing enables the flying nodes to collaborate and coordinate among themselves and to establish routes to radio access infrastructure, particularly FANET base station (BS). With a longer route lifetime, the effects of link disconnections and network partitions reduce. Routing must cater to two main characteristics of FANETs that reduce the route lifetime. Firstly, the collaboration nature requires the flying nodes to exchange messages and to coordinate among themselves, causing high energy consumption. Secondly, the mobility pattern of the flying nodes is highly dynamic in a three-dimensional space and they may be spaced far apart, causing link disconnection. In this paper, we present a comprehensive survey of the limited research work of routing schemes in FANETs. Different aspects, including objectives, challenges, routing metrics, characteristics, and performance measures, are covered. Furthermore, we present open issues

Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks

This book presents collective works published in the recent Special Issue (SI) entitled "Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks”. These works expose the readership to the latest solutions and techniques for MANETs and VANETs. They cover interesting topics such as power-aware optimization solutions for MANETs, data dissemination in VANETs, adaptive multi-hop broadcast schemes for VANETs, multi-metric routing protocols for VANETs, and incentive mechanisms to encourage the distribution of information in VANETs. The book demonstrates pioneering work in these fields, investigates novel solutions and methods, and discusses future trends in these field

Social Evolving Graph-Based Connectivity Model for Vehicular Social Networks

Over the last two decades, social networking over the Internet has attracted the attention of millions of users and becomes a new factor that drives business intelligence and economic growth worldwide. People have strong social instincts and they tend to socialise and communicate with each other in every possible scenario thus, social networks have been extended to different types and forms beyond the Internet. Mobile Social Networks (MSN) represent a new form of social networks that take advantage of the close proximity and the unique features offered by mobile devices to establish social links among mobile users. More recently, Vehicular Social Networks (VSN), a special type of MSNs, have emerged as a new communication paradigm for social networking on the roads. VSNs are decentralised opportunistic communication networks formed among vehicles (Vegni and Loscri 2015), where the communication takes place in three dimensions: human to human, human to machine, and machine to machine communications. The flourish of vehicular networks development over the last decade has made the social interaction on the roads possible promising more enjoyable experience for vehicular travellers. Prior to discussing VSNs and their connectivity patterns, it is important to develop an understating of vehicular networks on one hand and the human social behaviour in VSNs from a social theory viewpoint on the other hand. Vehicular networks are characterised with high mobility and frequent network topology changes, which make the connectivity between vehicles tends to be vulnerable. On the other side, in addition to being within the communication range of each other, sharing the same social interests and/or characteristics is a prerequisite for any two vehicles to socially interact in VSNs. This chapter is intended to present a novel social connectivity model for VSNs by utilising the evolving graph theory. First, the properties of VSNs are briefly introduced in the context of vehicular networks. The social metrics of the communicating vehicles are then reviewed using the concepts of social theory along with the conventional connectivity metrics in vehicular networks. Thereafter, a novel social evolving graph-based connectivity model that considers both social and conventional metrics of the communicating vehicles is developed using an extended version of the evolving graph. Moreover, the proposed connectivity model suggests new social links with vehicles that enter the communication area of other vehicles with similar social interests. Finally, the developed connectivity model is investigated in a highway scenario to demonstrate its abilities in capturing the evolving characteristics of social interactions among vehicles and selecting the best paths to forward data. Data forwarding decisions are made based on a combination of social and communication metrics of the communicating vehicles. Simulation results showed that the proposed connectivity model facilitates the social interactions among vehicles and is able to establish reliable social paths among the communicating vehicles

A RELIABILITY-BASED ROUTING PROTOCOL FOR VEHICULAR AD-HOC NETWORKS

Vehicular Ad hoc NETworks (VANETs), an emerging technology, would allow vehicles to form a self-organized network without the aid of a permanent infrastructure. As a prerequisite to communication in VANETs, an efficient route between communicating nodes in the network must be established, and the routing protocol must adapt to the rapidly changing topology of vehicles in motion. This is one of the goals of VANET routing protocols. In this thesis, we present an efficient routing protocol for VANETs, called the Reliable Inter-VEhicular Routing (RIVER) protocol. RIVER utilizes an undirected graph that represents the surrounding street layout where the vertices of the graph are points at which streets curve or intersect, and the graph edges represent the street segments between those vertices. Unlike existing protocols, RIVER performs real-time, active traffic monitoring and uses this data and other data gathered through passive mechanisms to assign a reliability rating to each street edge. The protocol then uses these reliability ratings to select the most reliable route. Control messages are used to identify a node’s neighbors, determine the reliability of street edges, and to share street edge reliability information with other nodes

Secure multi-constrained QoS reliable routing algorithm for vehicular ad hoc networks (VANETs)

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University LondonVehicular Ad hoc Networks (VANETs) are a particular form of wireless network made by vehicles communicating among themselves and with roadside base stations. A wide range of services has been developed for VANETs ranging from safety to infotainment applications. A key requirement for such services is that they are offered with Quality of Service (QoS) guarantees in terms of service reliability and availability. Furthermore, due to the openness of VANET’s wireless channels to both internal and external attacks, the application of security mechanisms is mandatory to protect the offered QoS guarantees. QoS routing plays an essential role in identifying routes that meet the QoS requirements of the offered service over VANETs. However, searching for feasible routes subject to multiple QoS constraints is in general an NP-hard problem. Moreover, routing reliability needs to be given special attention as communication links frequently break in VANETs. To date, most existing QoS routing algorithms are designed for stable networks without considering the security of the routing process. Therefore, they are not suitable for applications in VANETs. In this thesis, the above issues are addressed firstly by developing a link reliability model based on the topological and mathematical properties of vehicular movements and velocities. Evolving graph theory is then utilised to model the VANET communication graph and integrate the developed link reliability model into it. Based on the resulting extended evolving graph model, the most reliable route in the network is picked. Secondly, the situational awareness model is applied to the developed reliable routing process because picking the most reliable route does not guarantee reliable transmission. Therefore, a situation-aware reliable multipath routing algorithm for VANETs is proposed. Thirdly, the Ant Colony Optimisation (ACO) technique is employed to propose an Ant-based multi-constrained QoS (AMCQ) routing algorithm for VANETs. AMCQ is designed to give significant advantages to the implementation of security mechanisms that are intended to protect the QoS routing process. Finally, a novel set of security procedures is proposed to defend the routing process against external and internal threats. Simulation results demonstrate that high levels of QoS can be still guaranteed by AMCQ even when the security procedures are applied