Search results

This paper is a review of a number routing protocols in the internet of vehicles (IoV). IoV emphasizes information interaction among humans, vehicles and a roadside unit (RSU), within which routing is one of the most important steps in IoV network.

In this paper, the authors have summarized different research data on routing protocols in the IoV. Several routing protocols for IoV have been proposed in the literature. Their classification is made according to some criteria such as topology-based, position-based, transmission strategy and network structure. This paper focuses on the transmission strategy criteria. There exist three types of protocols that are based on this strategy: unicast protocol, broadcast protocols and multicast protocols. This later type is classified into two subclasses: geocast and cluster-based protocols. The taxonomy of the transmission strategy is presented in this study. We discuss the advantages and disadvantages of each type with a general comparison between the five types.

The authors can deduce that many challenges are encountered when designing routing protocols for IoV.

A simple and well-explained presentation of the functioning of the IoV is provided with a comparison among each categories of protocols is well presented along with the advantages and disadvantages of each type. The authors examined the main problems encountered during the design of IoV routing protocol, such as the quick change of topology, the frequent disconnection, the big volume of data to be processed and stored in the IoV, and the problem of network fragmentation. This work explores, compares existing routing protocols in IoV and provides a critical analysis. For that, the authors extract the challenges and propose future perspectives for each categories of protocols.

In particular, this paper aims to systematically analyze a few prominent wireless sensor network (WSN) clustering routing protocols and compare these different approaches according to the taxonomy and several significant metrics.

In this paper, the authors have summarized recent research results on data routing in sensor networks and classified the approaches into four main categories, namely, data-centric, hierarchical, location-based and quality of service (QoS)-aware, and the authors have discussed the effect of node placement strategies on the operation and performance of WSNs.

Performance-controlled planned networks, where placement and routing must be intertwined and everything from delays to throughput to energy requirements is well-defined and relevant, is an interesting subject of current and future research. Real-time, deadline guarantees and their relationship with routing, mac-layer, duty-cycles and other protocol stack issues are interesting issues that would benefit from further research.

Load balancing is an effective enhancement to the proposed routing protocol, and the basic idea is to share traffic load among cluster members to reduce the dropping probability due to queue overflow at some nodes. This paper aims to propose a novel hierarchical approach called distributed energy efficient adaptive clustering protocol (DEACP) with data gathering, load-balancing and self-adaptation for wireless sensor network (WSN). The authors have proposed DEACP approach to reach the following objectives: reduce the overall network energy consumption, balance the energy consumption among the sensors and extend the lifetime of the network, the clustering must be completely distributed, the clustering should be efficient in complexity of message and time, the cluster-heads should be well-distributed across the network, the load balancing should be done well and the clustered WSN should be fully connected. Simulations show that DEACP clusters have good performance characteristics.

A WSN consists of large number of wireless capable sensor devices working collaboratively to achieve a common objective. One or more sinks [or base stations (BS)] which collect data from all sensor devices. These sinks are the interface through which the WSN interacts with the outside world. Challenges in WSN arise in implementation of several services, and there are so many controllable and uncontrollable parameters (Chirihane, 2015) by which the implementation of WSN is affected, e.g. energy conservation. Clustering is an efficient way to reduce energy consumption and extend the life time of the network, by performing data aggregation and fusion to reduce the number of transmitted messages to the BS (Chirihane, 2015). Nodes of the network are organized into the clusters to process and forwarding the information, while lower energy nodes can be used to sense the target, and DEACP makes no assumptions on the size and the density of the network. The number of levels depends on the cluster range and the minimum energy path to the head. The proposed protocol reduces the number of dead nodes and the energy consumption, to extend the network lifetime. The rest of the paper is organized as follows: An overview of related work is given in Section 2. In Section 3, the authors propose an energy efficient level-based clustering routing protocol (DEACP). Simulations and results of experiments are discussed in Section 4. In Section 5, the authors conclude the work presented in this paper and the scope of further extension of this work.

The authors have proposed the DEACP approach to reach the following objectives: reduce the overall network energy consumption, balance the energy consumption among the sensors and extend the lifetime of the network, the clustering must be completely distributed, the clustering should be efficient in complexity of message and time, the cluster-heads should be well-distributed across the network, the load balancing should be done well, the clustered WSN should be fully connected. Simulations show that DEACP clusters have good performance characteristics.

The purpose of this paper is to design a hierarchical routing protocol. Wireless sensor network (WSN) consists of a set of miniature sensor nodes powered by a low-capacity energy battery. This limitation requires that energy is used in an efficient way and kept as long as possible to allow the WSN to accomplish its mission. Thus, energy conservation is a very important problem facing researchers in this context. Because sending and receiving messages is the activity that consumes the most energy in a WSN, so when designing routing protocols, this problem is targeted specifically. The aim of this paper is to propose a solution to this problem by designing a hierarchical routing protocol.

The authors started by designing a protocol called efficient energy-aware distributed clustering (EEADC). Simulation result showed EEADC might generate clusters with very small or very large size. To solve this problem, the authors designed a new algorithm called fixed efficient energy-aware distributed clustering (FEEADC). They concluded from the simulation result that cluster-heads (CHs) far away from the base station die faster than the ones closer to it. To remedy this problem, they propose multi-hop fixed efficient energy-aware distributed clustering (M-FEEADC). It is based on a new fixed clustering mechanism, which aims to create a balanced distribution of CHs. It uses data aggregation and sleep/wakeup techniques.

The simulation results show a significant improvement in terms of energy consumption and network lifetime over the well-known low-energy adaptive clustering hierarchy and threshold-sensitive energy-efficient protocols.

The authors propose M-FEEADC. It is based on a new fixed clustering mechanism, which aims to create a balanced distribution of CHs. It uses data aggregation and sleep/wakeup techniques.