scispace - formally typeset
Search or ask a question

Showing papers on "Wireless Routing Protocol published in 2020"


Journal ArticleDOI
TL;DR: A new algorithm for VANet class routing protocol that covers sparse and coarse region of vehicles is presented that takes the advantage of road layout to improve the performance of routing in VANETs.
Abstract: The main requirement to make safer journey in VANET environment is minimum delay with high packet delivery rate. This ensures that all data packets are received with minimal delay to prevent any accident. This paper presents a new algorithm for VANET class routing protocol that covers sparse and coarse region of vehicles. It takes the advantage of road layout to improve the performance of routing in VANETs. The proposed algorithm uses real-time GPS tracking system to obtain traffic information for creating road based paths from source node to destination node. The optimize forwarding is used to figure out the forwarding node along the road pattern that form the path to deliver the data packets. The results shows that proposed algorithm obtain better results considering the various simulation parameters.

10 citations


Journal ArticleDOI
K. Prabha1
01 Jan 2020
TL;DR: Simulation findings demonstrated that for definite differentials, WRP shows an enhanced performance than the other two protocols such as DSR and AODV.
Abstract: The research on mobile ad hoc networks is intensively attracted by the research community due to their good characteristic of multi-hop wireless connectivity and energetically altering network topology. It collects infra-structure less mobile nodes building a temporary network without any centralized administration. So far, numbers of ad hoc routing protocols were developed and executed. The simulation work has been performed to access the performance of ad hoc on-demand distance vector routing (AODV), dynamic source routing (DSR) and wireless routing protocol (WRP). Hence, GloMoSim simulator was used to perform the simulations. The author adopted two dissimilar scenarios, namely, 50 and 100 nodes, with rectangular area sizes of 1500 × 1000 and 2000 × 1500 m2, respectively, to estimate the impact of network size on the performances. Simulation findings demonstrated that for definite differentials, WRP shows an enhanced performance than the other two protocols such as DSR and AODV.

8 citations


23 Aug 2020
TL;DR: A fuzzy logic-based routing protocol that considers the battery level of nodes, hop count, and trust among the nodes is proposed and adaptively selects routes that use minimum hop count with the highest level of trust to enhance the reliability of route selection while maintaining the percentage of successfully delivered packets.
Abstract: Mobile ad-hoc networks (MANETs) have attracted much attention from researchers lately because MANETs are able to provide networks in areas with unavailable fixed network infrastructure. However, some mobile nodes may misbehave by dropping packets to conserve power usage because mobile ad-hoc networks nodes are usually battery operated. In this paper, a fuzzy logic-based routing protocol that considers the battery level of nodes, hop count, and trust among the nodes is proposed. The proposed routing protocol adaptively selects routes that use minimum hop count with the highest level of trust and a sufficient battery level to enhance the reliability of route selection while maintaining the percentage of successfully delivered packets. The result of the simulation shows that the proposed protocol can achieve a high ratio of successfully delivered packets, a lower average end-to-end delay, and a normalized routing load.

2 citations


Proceedings ArticleDOI
TL;DR: A survey of metaheuristic approach to improve routing process by enhancing the security and optimization among different nodes in mobile ad hoc networks is presented in this paper, where a lot of research has been carried out for secure routing process with meta-heuristic approaches.
Abstract: A Mobile Ad hoc Network can be said as a collection of mobile nodes, which builds a dynamic topology and a resource constrained network Due to dynamic nature routing is challenging in MANET In Mobile Ad hoc Networks different type of attack is possible By manipulation in routing and attacks against data are reasoned by malicious nodes MANETs are susceptible to various attacks from selfish nodes To defeat those problems security is demanded for preventing node from various attacks Metaheuristic techniques are used for addressing a problem found in ad hoc networks such as routing, security and optimization A lot of research has been carried out for secure routing process with metaheuristic approaches In this paper, we present survey of metaheuristic approach to improve routing process by enhancing the security and optimization among different nodes in mobile ad hoc networks

1 citations



Journal Article
TL;DR: This work proposed routing metric, load and a minimization criterion a path that involves nodes with less load burden on them that mitigated the unbiased load distribution on centrally located nodes by pushing traffic further to the peripheral nodes without compromising end delay for greater network longevity and performances.
Abstract: MANET Stands for "Mobile Network." A MANET ad-hoc network can able to change its locations, places and arrange itself based on the fly. Since MANET’s are movable &mobile, they utilize wireless based connections networks. be Wi-fi connection, or any another medium and a cellular or satellite transmission. Load balancing is necessity of any given multi-hop wireless network. A wireless routing protocol is utilized based on its ability to deliver &distribute efficient traffic over the network nodes. The routing protocol accomplishes this without presenting an unacceptable postponement. The preeminent evident advantage is showed in expanding the lifetime of a battery-worked hub which may inevitably build the life span of the en-tire network. Endeavor of identifying the shortest distance among any two network nodes to deliver data fast, nodes has been become the efficient picks. The centrally nominated nodes can able to access or connect more sub networks and respective gateways to some of the sub networks which can become distributed from the respective network node in absence. Thus, the network lifetime of given nodes has becomes a popular bottleneck for the reliable connectivity of a given sub network its distributed from its network. With out biasing the load can cause the network congestion which majorly impacts the final throughput, packet delivery ratio, and average end delay. In, this mitigated the unbiased load distribution on centrally located nodes by pushing traffic further to the peripheral nodes without compromising end delay for greater network longevity and performances. We proposed routing metric, load and a minimization criterion a path that involves nodes with less load burden on them. The simulations of the proposed mechanism run on NS-2.34for 16 and 75 nodes have revealed 2.46% reduction of load on the centre node with AOMDV.

1 citations