scholarly journals Context aware Routing to Assist Routing Decisions for Quality Improvement in Multi Hop Ad hoc Networks

2021 ◽  
Vol 71 (1) ◽  
pp. 46-54
Author(s):  
Trilok Kumar Saini ◽  
Subhash C. Sharma

The context information is an intriguing aspect of decision making. The context-awareness can be useful in the ad hoc networks in which nodes are mobile, and the conditions are dynamic. In ad hoc networks, routing protocols are intended to discover the route over multi-hop wireless links under varying conditions. The context-awareness can assist the routing protocols in determining the appropriate path. This paper investigates into choosing the appropriate route by applying the context information and presents the approach to improve the decision making and the quality of the route. We consider nodes, connecting links, and different layers as the context. The paper introduces the scalability and flexibility in the set of parameters that govern the eminence of the node inter-connection that, in turn, influences the overall quality of the route. We propose the context-aware dynamic routing protocol (CADR) and present the approach, algorithm, and analysis. We simulate the protocol by taking the flexible combination of the context attributes and the values, also compares the performance with AODV. The simulation results show that the protocol chooses the appropriate route as per the considered attributes and weight, and provide the enhanced performance

This article analyzes and compares the service quality metrics in reactive routing protocols AODV and DSR in VANET. Through the revision of the recorded information we study the characteristics, classification, applications and different traffic models. All these parameters are taken into account in the modelling of vehicular traffic in the downtown of Loja City. In order to get the corresponding results, three different scenarios each with a different node density have been created. According to the collected data, it is possible to verify which routing protocol is the most suitable for the Ad-Hoc networks proposed in this study.


Author(s):  
Ahemd M. Alotaibi ◽  
Salman A. AlQahtani

Routing is an important issue in cognitive radio ad hoc networks (CRAHNs) owing to the stochastic activity of primary users (PUs). In particular, route stability remains an important issue in the CRAHN protocols. In this paper, the authors propose a stability-weighted cumulative expected transmission time (SWCETT) routing protocol. The SWCETT routing protocol aims towards providing the most optimal route based on both quality of service (QoS) metrics, such as delay and throughput, and stability of the route in the CRAHN. The performance of the SWCETT routing protocol is determined through simulations and compared with other routing protocols. The proposed routing protocol is capable of providing better delay and throughput than other routing protocols. The results prove the importance of the route stability metric in raising the performance of CRAHNs.


Author(s):  
Priyanka Bharadwaj ◽  
Surjeet Balhara

Background & Objective: There are some challenging issues such as providing Quality of Service (QoS), restricted usage of channels and shared bandwidth pertaining to ad-hoc networks in a dynamic topology. Hence, there is a requirement to support QoS for the application environment and multimedia services in ad-hoc networks with the fast growing and emerging development of information technology. Eventually, bandwidth is one of the key elements to be considered. Methods: Energy aware QoS routing protocol in an ad-hoc network is presented in this article. Results and Conclusion: The simulation results indicate that the improved protocol outperforms Adhoc On-Demand Distance Vector (AODV) routing protocol in terms of QoS metric such as throughput, packet delivery ratio, loss rate and average delay.


2015 ◽  
Vol 764-765 ◽  
pp. 817-821
Author(s):  
Ing Chau Chang ◽  
Yuan Fen Wang ◽  
Chien Hsun Li ◽  
Cheng Fu Chou

This paper adopts a two-mode intersection graph-based routing protocol to support efficient packet forwarding for both dense and sparse vehicular ad hoc networks (VANET). We first create an intersection graph (IG) consisting of all connected road segments, which densities are high enough. Hence, the source vehicle leverages the proposed IG/IG bypass mode to greedily forward unicast packets to the boundary intersection via the least cost path of current IG. We then perform the IG-Ferry mode to spray a limited number of packet copies via relay vehicles to reach the boundary intersection of another IG where the destination vehicle resides. NS2 simulations are conducted to show that the two-mode IG/IG-Ferry outperforms well-known VANET routing protocols, in terms of average packet delivery ratios and end-to-end transmission delays.


2011 ◽  
Vol 204-210 ◽  
pp. 395-399 ◽  
Author(s):  
Li Cui Zhang ◽  
Zhi Gang Wang ◽  
Tao Wang ◽  
Yong Shi Sun ◽  
Xiao Fei Xu

DATA flooding attack is a serious menace for the security of on-demand routing protocol in Ad Hoc networks. In the paper, on the basis of three typical on-demand routing protocols AODV, DSR and TORA, we present a special security scheme against data flooding attack. Then we simulate the scheme on NS2 platform and compare two performance parameters before and after using the scheme: average delay and packet delivery rate. The results indicate that this project is comparatively effective to resist the DATA flooding attack.


Sign in / Sign up

Export Citation Format

Share Document