Search results

The purpose of this paper is to design an efficient on-demand routing protocol for mobile ad hoc networks (MANETs) which combines greedy forwarding and backtracking.

It uses a hybrid approach. It uses greedy approach to determine a route from source to the destination. If the greedy approach fails, then it uses a backtracking approach. Combining greedy and backtracking approaches results in a more efficient protocol.

A new routing algorithm for MANETs which performs better than some of the existing algorithms.

A major limitation of this work is that the authors did not implement the protocol on a test bed and evaluated the performance. They neither had the infrastructure nor the resources to actually implement the protocol. Instead, like most of the researchers, they evaluated the performance of their protocol based on extensive simulation. The mobility model, the area of deployment and the density of nodes chosen to simulate the protocol are consistent with what many of the other researchers have done. Intuitively, the authors’ protocol, as the performance evaluation indicates, is likely to perform well in small networks.

The authors did not implement the protocol on a test bed to evaluate the performance of the protocol. The authors used simulation to study the performance of their protocol. Their simulation model is similar to many of the research works published in the literature.

To the authors’ knowledge, no other paper has combined the greedy and backtracking approach to design a routing protocols for MANETs.

Nodes in sensor networks do not have enough topology information to make efficient routing decisions. To relay messages through intermediate sensors, geographic routing has been proposed as such a solution. Its greedy nature, however, makes routing inefficient especially in the presence of topology voids or holes. In this paper we present GRAViTy (Geographic Routing Around Voids In any TopologY of sensor networks), a simple greedy forwarding algorithm that combines compass routing along with a mechanism that allows packets to explore the area around voids and bypass them without significant communication overhead. Using extended simulation results we show that our mechanism outperforms the right‐hand rule for bypassing voids and that the resulting paths found well approximate the corresponding shortest paths. GRAViTy uses a cross‐layered approach to improve routing paths for subsequent packets based on experience gained by former routing decisions. Furthermore, our protocol responds to topology changes, i.e. failure of nodes, and efficiently adjusts routing paths towards the destination.

The vehicular ad hoc network (VANET) is an emerging area for smart cities as observed in last few decades. However, some hurdles for VANET exist that need to be resolved before its full implementation in smart cities. Routing is one of the main factors for having effective communication between smart vehicles that urgently needs to be addressed. One factor that affects communication between the vehicles is the intersection points that obstruct the communication. The paper aims to discuss these issues.

The conventional routing schemes fail to address the intersection problems that occur during the two points of communication. Therefore, this paper analyses the performance of existing position-based routing protocol for inter-vehicle ad hoc networks, considering the impact of a number of intersections. This simulation evaluates different position-based routing protocols such as Intersection-based Distance and Traffic-Aware Routing (IDTAR), Greedy Traffic-Aware Routing, Anchor-based Street and Traffic-Aware Routing and Geographic Source Routing, based on road topology and the number of intersections.

As a result, the protocol IDTAR has a lower end-to-end delay and high packet delivery ratio in terms of the number of intersections as a case study of smart cities. This concludes that IDTAR can be adaptive to smart cities communication, although some questions need to be considered in terms of its security, compatibility, reliability and robustness.

The role of VANET has been highlighted in smart cities due to its implications in day-to-day life. The vehicles in VANET are equipped with wireless communication nodes to provide network connectivity. Such types of network operate without the legacy infrastructure, as well as legacy client/servers.

Additionally, the study contributes to smart cities by measuring the performance of position-based routing protocols for VANETs.

The purpose of this paper is to give an insight in to the routing protocols in Vehicular ad hoc Network (VANET). In this direction, for the efficient data dissemination in VANETs, a street-based forwarding protocol (SBFP) has been proposed.

The interferences among different street segments are considered and a unique street-based forwarding concept is introduced to reduce the local maximum problem. In this protocol, the greedy forwarding concept along with the broadcasting mechanism and suppression technique is implemented to minimize the overhead created in the regular beacons forwarding processes. QualNet simulator is used to implement and simulate SBFP. SUMO and MOVE tools are used to create the vehicle’s movement pattern and network topology.

The simulated results demonstrated improved packet delivery ratio (PDR) with a minimum average number of broadcast by each individual vehicle in the proposed SBFP than in its peer protocols.

This paper will be discussing a unique street-based forwarding technique exploring the advantages of global positioning system to obtain the location of vehicles and streets. This technique results in higher PDR and reduced network overhead.

The internet of vehicles (IoV) communication has recently become a popular research topic in the automotive industry. The growth in the automotive sector has resulted in significant standards and guidelines that have engaged various researchers and companies. In IoV, routing protocols play a significant role in enhancing communication safety for the transportation system. The high mobility of nodes in IoV and inconsistent network coverage in different areas make routing challenging. This paper aims to provide a lane-based advanced forwarding protocol for internet of vehicles (LAFP-IoV) for efficient data distribution in IoV. The proposed protocol’s main feature is that it can identify the destination zone by using position coordinates and broadcasting the packets toward the direction of destination. The novel suppression technique is used in the broadcast method to reduce the network routing overhead.

The proposed protocol considers the interferences between different road segments, and a novel lane-based forwarding model is presented. The greedy forwarding notion, the broadcasting mechanism, and the suppression approach are used in this protocol to reduce the overhead generated by standard beacon forwarding procedures. The SUMO tool and NS-2 simulator are used for the vehicle's movement pattern and to simulate LAFP-IoV.

The simulation results show that the proposed LAFP-IoV protocol performs better than its peer protocols. It uses a greedy method for forwarding data packets and a carry-and-forward strategy to recover from the local maximum stage. This protocol's low latency and good PDR make it ideal for congested networks.

The proposed paper provides a unique lane-based forwarding for IoV. The proposed work achieves a higher delivery ratio than its peer protocols. The proposed protocol considers the lanes while forwarding the data packets applicable to the highly dense scenarios.

Routing in ad hoc networks faces significant challenges due to node mobility and dynamic network topology. In this work we propose the use of mobility prediction to reduce the search space required for route discovery. A method of mobility prediction making use of a sectorized cluster structure is described with the proposal of the Prediction based Location Aided Routing (P‐LAR) protocol. Simulation study and analytical results of P‐LAR find it to offer considerable saving in the amount of routing traffic generated during the route discovery phase.

This paper aims to present a comprehensive review in major research areas of unmanned air vehicles (UAVs) navigation, i.e. three degree-of-freedom (3D) path planning, routing algorithm and routing protocols. The paper is further aimed to provide a meaningful comparison among these algorithms and methods and also intend to find the best ones for a particular application.

The major UAV navigation research areas are further classified into different categories based on methods and models. Each category is discussed in detail with updated research work done in that very domain. Performance evaluation criteria are defined separately for each category. Based on these criteria and research challenges, research questions are also proposed in this work and answered in discussion according to the presented literature review.

The research has found that conventional and node-based algorithms are a popular choice for path planning. Similarly, the graph-based methods are preferred for route planning and hybrid routing protocols are proved better in providing performance. The research has also found promising areas for future research directions, i.e. critical link method for UAV path planning and queuing theory as a routing algorithm for large UAV networks.

The proposed work is a first attempt to provide a comprehensive study on all research aspects of UAV navigation. In addition, a comparison of these methods, algorithms and techniques based on standard performance criteria is also presented the very first time.

Wireless Multimedia Sensor Network (WMSN) is expected to be a key technology for future network. The multimodal information along with very low-cost availability of the camera sensor nodes is promoting the extensive use of audio, image and video in various real-time implementations. The purpose of this paper is to study various routing issues and the effect of mobility on existing solutions for the applications in future internet.

This paper conducts a survey of the various methodologies for routing and the vital issues in the design of routing protocols for WMSN, and it also discusses about the effect of mobility on various routing methodologies of WMSN. WMSN ubiquitously performs data acquisition, processing and routing for scalar and multimedia data in a mobile environment. The routing protocols should be adaptive in nature and should have a dynamic approach to service effectively for future network. Many authors proposed the mobility of sink to improve lifetime of the network. This paper discusses some effective approaches for the network where not only the sink node but also some of the sensor nodes are mobile.

During the survey, the performance and lifetime of the network are discussed, other parameters like delay, packet loss, energy consumption and simulators used for implementation are also discussed.

The techniques in this paper represent a considerable solution for mobility issues in future internet applications.

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.

The purpose of this paper is to propose a distributed protocol to build a logical coordinate system based on the hop counts of each node to four selected landmarks, and the real location information is not needed.

The designed protocol uses the sink node as one of the landmarks and then selects three other sensor nodes near the corners of the sensor network as landmarks.

The simulation results show that the proposed protocol has the superior performance in packet delivery ratio, average hop counts among nodes, and communication overhead to previous works.

This paper presents a distributed protocol to build a logical coordinate system based on hop counts to landmarks.