Omprakash Kaiwartya

Internet of Vehicles: Motivation, Layered Architecture, Network Model, Challenges, and Future Aspects

Internet of Things is smartly changing various existing research areas into new themes, including smart health, smart home, smart industry, and smart transport. Relying on the basis of “smart transport,” Internet of Vehicles (IoV) is evolving as a new theme of research and development from vehicular ad hoc networks (VANETs). This paper presents a comprehensive framework of IoV with emphasis on layered architecture, protocol stack, network model, challenges, and future aspects. Specifically, following the background on the evolution of VANETs and motivation on IoV an overview of IoV is presented as the heterogeneous vehicular networks. The IoV includes five types of vehicular communications, namely, vehicle-to-vehicle, vehicle-to-roadside, vehicle-to-infrastructure of cellular networks, vehicle-to-personal devices, and vehicle-to-sensors. A five layered architecture of IoV is proposed considering functionalities and representations of each layer. A protocol stack for the layered architecture is structured considering management, operational, and security planes. A network model of IoV is proposed based on the three network elements, including cloud, connection, and client. The benefits of the design and development of IoV are highlighted by performing a qualitative comparison between IoV and VANETs. Finally, the challenges ahead for realizing IoV are discussed and future aspects of IoV are envisioned.

Performance Improvement in Geographic Routing for Vehicular Ad Hoc Networks

Geographic routing is one of the most investigated themes by researchers for reliable and efficient dissemination of information in Vehicular Ad Hoc Networks (VANETs). Recently, different Geographic Distance Routing (GEDIR) protocols have been suggested in the literature. These protocols focus on reducing the forwarding region towards destination to select the Next Hop Vehicles (NHV). Most of these protocols suffer from the problem of elevated one-hop link disconnection, high end-to-end delay and low throughput even at normal vehicle speed in high vehicle density environment. This paper proposes a Geographic Distance Routing protocol based on Segment vehicle, Link quality and Degree of connectivity (SLD-GEDIR). The protocol selects a reliable NHV using the criteria segment vehicles, one-hop link quality and degree of connectivity. The proposed protocol has been simulated in NS-2 and its performance has been compared with the state-of-the-art protocols: P-GEDIR, J-GEDIR and V-GEDIR. The empirical results clearly reveal that SLD-GEDIR has lower link disconnection and end-to-end delay, and higher throughput as compared to the state-of-the-art protocols. It should be noted that the performance of the proposed protocol is preserved irrespective of vehicle density and speed.

Multiobjective Dynamic Vehicle Routing Problem and Time Seed Based Solution Using Particle Swarm Optimization

A multiobjective dynamic vehicle routing problem (M-DVRP) has been identified and a time seed based solution using particle swarm optimization (TS-PSO) for M-DVRP has been proposed. M-DVRP considers five objectives, namely, geographical ranking of the request, customer ranking, service time, expected reachability time, and satisfaction level of the customers. The multiobjective function of M-DVRP has four components, namely, number of vehicles, expected reachability time, and profit and satisfaction level. Three constraints of the objective function are vehicle, capacity, and reachability. In TS-PSO, first of all, the problem is partitioned into smaller size DVRPs. Secondly, the time horizon of each smaller size DVRP is divided into time seeds and the problem is solved in each time seed using particle swarm optimization. The proposed solution has been simulated in ns-2 considering real road network of New Delhi, India, and results are compared with those obtained from genetic algorithm (GA) simulations. The comparison confirms that TS-PSO optimizes the multiobjective function of the identified problem better than what is offered by GA solution.

Geocast routing: Recent advances and future challenges in vehicular adhoc networks

Recently, geocast routing (GR) has been extensively investigated for reliable and efficient dissemination of information due to increasing number of intelligent transport system (ITS) applications favoring geocasting. In this paper, a qualitative survey of recent protocols of GR and some precise future research issues have been provided. A functional and qualitative description of each considered protocols have been presented. All the considered protocols have been comparatively characterized. This comparative study leads us towards some future research challenges in GR.

T-MQM: Testbed-Based Multi-Metric Quality Measurement of Sensor Deployment for Precision Agriculture—A Case Study

Efficient sensor deployment is one of the primary requirements of the precision agriculture use case of wireless sensor networks (WSNs) to provide qualitative and optimal coverage and connectivity. The application-based performance variations of the geometrical-model-based sensor deployment patterns restrict the generalization of a specific deployment pattern for all applications. Furthermore, single or double metrics-based evaluation of the deployment patterns focusing on theoretical or simulation aspects can be attributed to the difference in performance of real applications and the reported performance in the literature. In this context, this paper proposes a testbed-based multi-metric quality measurement of sensor deployment for the precision agriculture use case of WSNs. Specifically, seven metrics are derived for the qualitative measurement of sensor deployment patterns for precision agriculture. The seven metrics are quantified for four sensor deployment patterns to measure the quality of coverage and connectivity. Analytical- and simulation-based evaluations of the measurements are validated through testbed experiment-based evaluations which are carried out in “INDRIYA” WSNs testbed. Toward realistic research impact, the investigative evaluation of the geometrical-model-based deployment patterns presented in this paper could be useful for practitioners and researchers in developing performance guaranteed applications for precision agriculture and novel coverage and connectivity models for deployment patterns.

Traffic light based time stable geocast (T-TSG) routing for urban VANETs

Vehicular Ad Hoc Networks is a self-organizing, distributed communication network formed by highly Mobile Vehicles. This type of networks is developed as part of Intelligent Transportation Systems (ITS) to bring significant improvement to the transportation systems. One of the main goal of ITS, is to increase safety on road and reduce traffic congestion. Safety application requires messages to be sent to all nodes which belong to a particular geographical region. This message must be available to all the vehicles which enter the Geographical Region within a certain Time Period. Also, there are wide varieties of scenarios in VANETs to communicate. In urban environment, there are many streets, intersections, avenues etc. Hence, Driver has many options to reach his destination. In Highway environment, vehicles stay in the same road as there are only few entrances and exits. From a routing perspective, there are different options to forward information in an urban environment depending upon the behavior of traffic lights whereas in highway, most of the same set of vehicles may be used to forward information. In this paper, we have proposed a novel time stable geocast routing protocol nameed as traffic light based time stable geocast (T-TSG) routing protocol for informing vehicles after an accident in urban vehicular environment. T-TSG is a three phase routing approach based on traffic light behavior. It has better message delivery rate, negligible network load for life time management and lower end-to-end delay performance under simulated urban environment.

Guaranteed Geocast Routing Protocol for Vehicular Adhoc Networks in Highway Traffic Environment

Geocast routing is one of the most investigated choices for reliable and efficient dissemination of information because of group of vehicles sharing geographic region on the road. Most of geocast routing protocols for intermittently connected Vehicular Adhoc Networks, suffer from low packet delivery, high end-to-end delay and elevated packet loss in intermittently connected networks and low throughput, high hop-to-hop disconnection, larger hop-count in fully connected networks. In this paper, guaranteed geocast routing (GGR) protocol for intermittently connected highway traffic environment has been proposed. GGR utilizes caching and heuristic function for reliable next hop vehicle selection. It also uses FAST (group of neighboring vehicles moving at higher speed than current forwarder) in packet delivery and SLOW (group of neighboring vehicles moving at lower speed than current forwarder) in hop-to-hop failure recovery. One-hop delivery has been guaranteed through acknowledgement. The proposed protocol has been simulated using NS-2 and its performance has been compared with that of adoptive carry-store forward, spray & wait and epidemic routing protocols. Results reveal that the performance of GGR is better in terms of number of routing matrices considered for both intermittently and fully connected networks.

Geocasting in vehicular adhoc networks using particle swarm optimization

Recently, geocast routing has been intensively investigated for reliable and efficient dissemination of information. This can be attributed to the fact that in Vehicular Adhoc Networks (VANETs), group of vehicles moving on road always shares geographical region and most of the Intelligent Transport Systems (ITS) applications require sending information to all vehicles belonging to a given geographical region. Various techniques have been used for geocasting such as peripheral node based Next Hop Vehicle (NHV) selection, voronoi diagram based NHV selection, cache agent based NHV selection etc. These techniques have shown limited performance due dynamic characteristics of VANETs. In this paper, we have proposed Geocasting through Particle Swarm Optimization (GeoPSO) protocol. GeoPSO selects NHV by using Particle Swarm Optimization (PSO) technique. The empirical results show that GeoPSO outperforms tradition techniques in terms of packet deliver and network load.

Enhanced Caching for Geocast Routing in Vehicular Ad Hoc Network

In vehicular ad hoc network (VANET), the major challenge for routing protocol is to find a route from the sender to the destination without any preconfigured information under constantly varying link circumstances. Topology-based routing is strictly avoided because of frequent changes in the topology. The approach of position-based routing relies only on geographical position information to deal with the problem of dynamic topology changes. Also, in most of the intelligent transport system (ITS) applications such as collision warning, advertising, alerts message, information needs to be disseminated in a predefined geographical region. That is why, position-based geocast routing is a suitable candidate for VANETs since position information is already available from navigation systems. In this paper, we have proposed a novel geocast routing protocol named “Enhanced Caching for Geocast routing (ECGR)” that takes the advantage of “Geocast in Vehicular Environments: Caching and Transmission Range Control for Improved Efficiency (CTRC)” and can be used in various ITS applications. The main contribution of our work is to introduce a novel coverage determination algorithm. This algorithm improves the caching methodology of CTRC and almost eliminates the packet loss due to high-speed movement of vehicles. Our new protocol also improves the throughput of the system by eliminating the range-forwarding approach of CTRC and using full radio transmission range of the vehicles to forward packets.

An EV Charging Management System Concerning Drivers’ Trip Duration and Mobility Uncertainty

With continually increased attention on electric vehicles (EVs) due to environment impact, public charging stations (CSs) for EVs will become common. However, due to the limited electricity of battery, EV drivers may experience discomfort for long charging waiting time during their journeys. This often happens when a large number of (on-the-move) EVs are planning to charge at the same CS, but it has been heavily overloaded. With this concern, in an EV charging management system, we focus on CS-selection decision making and propose a scheme to manage EVs’ charging plans, to minimize drivers’ trip duration through intermediate charging at CSs. The proposed scheme jointly considers EVs’ anticipated charging reservations (including arrival time and expected charging time) and parking duration at CSs. Furthermore, by tackling mobility uncertainty that EVs may not reach their planned CSs on time (due to traffic jams on the road), a periodical reservation updating mechanism is designed to adjust their charging plans. Results under the Helsinki city scenario with realistic EV and CS characteristics show the advantage of our proposal, in terms of minimized drivers’ trip duration, as well as charging performance at the EV and CS sides.