Optimal Path Selection in Ad Hoc Networks Based on Multiple Metrics: Bandwidth and Delay

Author(s):  
Souaad Boussoufa Lahlah ◽  
Fouzi Semchedine ◽  
Louiza Bouallouche Medjkoune ◽  
Nadir Farhi

Author(s):  
Nadir Farhi ◽  
Louiza Bouallouche Medjkoune ◽  
Souaad Boussoufa Lahlah ◽  
Fouzi Semchedine

Author(s):  
Pallavi Sharma, Anil Sagar, Mohit Marwaha

Vehicular Ad-hoc Networks (VANETs) is an emerging network technology derived from ad-hoc networks. This paper provides the state-of-the-art of VANETs and provides optimum proposal by improving Quality of Service (QoS.) Today, wireless systems are preferred over wired systems and these are gaining popularity as it provides wireless connectivity to the users irrespective of their geographic position, VANET is one of them. VANETs are installed to minimize the risk of road accidents and to improve passenger comfort by permitting the vehicles to exchange various types of data. In this paper, the Signal Strength based Optimum Path Selection (SSOPS) based solution on how to mitigate the QoS issues that exists while using the existing methods are discussed. Moreover, the solution has been tested using NS2 software using various parameters.


Sensors ◽  
2020 ◽  
Vol 20 (23) ◽  
pp. 6743
Author(s):  
Fan Zhang ◽  
Gangqiang Yang

High-speed mobility and heavy-load traffic in mobile Ad hoc networks (MANET) may result in frequent topology changes and packet loss. To guarantee packet delivery, a novel stable backup routing (SBR) scheme is put forward in this paper, which consists of the establishment of backup routes and route maintenance. In SBR, backup routes are set up by overhearing MAC signals, and the bit error rate is considered in path selection for improving stability. To repair broken links effectively and reasonably, qualified backup routes are classified into three categories with different priorities, based on which the relevant nodes decide how to reconstruct the forwarding path. Extensive simulations demonstrate that our proposed method outperforms other comparable backup routing mechanisms in terms of packet delivery ratio, average delay and control overhead.


Author(s):  
S. S. MANVI ◽  
M. M. KODABAGI ◽  
BHANU PRASAD

Ad-hoc wireless networks are power constrained as the nodes operate with limited battery energy. To maximize the lifetime of these networks, transactions through each mobile node must be controlled in such a way that the power dissipation rates for the nodes are almost the same. At the same time, providing QoS for ad-hoc networks is a complex task due to the ever-changing network topology. This paper addresses the problem of power and bandwidth aware routing. We propose a power and bandwidth aware source initiated routing model for mobile ad-hoc networks. The model uses both the static and mobile intelligent agents. The agents together find an optimal path among the available routes. The model is simulated to test its operational effectiveness in various network scenarios. We observed that the agents provide more flexible and adaptable routing services and also support component based software engineering features such as software reuse, maintainability, customization, and encapsulation.


2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
YongQiang Li ◽  
Zhong Wang ◽  
QingWen Wang ◽  
QingGang Fan ◽  
BaiSong Chen

For the problem of poor link reliability caused by high-speed dynamic changes and congestion owing to low network bandwidth in ad hoc networks, an ant colony routing algorithm, based on reliable path under dual-channel condition (DSAR), is proposed. First, dual-channel communication mode is used to improve network bandwidth, and a hierarchical network model is proposed to optimize the dual-layer network. Thus, we reduce network congestion and communication delay. Second, a comprehensive reliable path selection strategy is designed, and the reliable path is selected ahead of time to reduce the probability of routing restart. Finally, the ant colony algorithm is used to improve the adaptability of the routing algorithm to changes of network topology. Simulation results show that DSAR improves the reliability of routing, packet delivery, and throughput.


2021 ◽  
Vol 12 (1) ◽  
pp. 36-48
Author(s):  
Arjun Jadhaw ◽  
◽  
Vikrant Sharma

Routing is a process of forwarding the data from a known source to the destination. In this procedure, the data might travel during some in-between paths, and there exist a required to select the best probable best possible nodes to forward the data. This best selection of nodes will permit to achieve a high presentation in the network. Big amount of worked has been carried out to find the best pathway in the network routing to progress its effectiveness and to eliminate overcrowding problems. A good routing algorithm should be able to find an optimal path and it must be simple. It also must have low overhead, and be robust and stable, converging rapidly, and must remain flexible. Routing in MANET by means of the direct pathway metric is not a sufficient situation to construct high quality pathway, since minimum hop count routing frequently chooses routes that have considerably less capacity than the best pathway that live in the network. In this article, we suggest a mechanism to prefer the routing protocol based on manifold measure like Throughput, PDR, energy expenditure etc. These paths are quite resourceful. Network presentation will be raise by using these paths. The efficiency of our mechanism is illustrated by simulations conducted using network simulator ns-2.


Sign in / Sign up

Export Citation Format

Share Document