Journal articles on the topic 'RREQs (Route-Request) packets and RREP (Route-Reply) packets'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'RREQs (Route-Request) packets and RREP (Route-Reply) packets.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Ismail, Roswan, Che Zalina Zulkifli, and Khairulanuar Samsudin. "Reducing Broadcasting Route Request Packet through LF-AODC." Journal Of ICT In Education 4 (November 30, 2017): 100–117. http://dx.doi.org/10.37134/jictie.vol4.10.2017.

Full text
Abstract:
Ad hoc on-demand distance vector (AODV) is one of the commonly used reactive routing protocols in mobile ad hoc network (MANET) as it can achieve relatively better communication performance. However, AODV can lead to heavy routing overhead and additional delay due to the flooding broadcast of route request (RREQ) packets during the route discovery cycle. Additionally, the multiple route reply (RREP) packets in response to a single RREQ can also contribute to overhead and additional delay. Thus, a new algorithm called Less Flooding-AODV (LF-AODV) was proposed to reduce the broadcasted RREQ and the transmitted RREP during the route discovery cycle by decreasing the number of nodes involved in the route establishment phase. A simulation test was carried out to compare the difference in performance between LF-AODV and AODV algorithms. The simulation test revealed that the steps of the route discovery process in LF-AODV were significantly reduced, thus improving its performance in terms of packet delivery fraction, end-to-end delay and routing overhead compared to the traditional algorithm. Clearly, these results reinforce the theoretical principles used in formulating the new algorithm of LF-AODV.
APA, Harvard, Vancouver, ISO, and other styles
2

Ahamed, Afsana, and Hamid Vakilzadian. "Impact of Direction Parameter in Performance of Modified AODV in VANET." Journal of Sensor and Actuator Networks 9, no. 3 (2020): 40. http://dx.doi.org/10.3390/jsan9030040.

Full text
Abstract:
A vehicular ad hoc network (VANET) is a technology in which moving cars are used as routers (nodes) to establish a reliable mobile communication network among the vehicles. Some of the drawbacks of the routing protocol, Ad hoc On-Demand Distance Vector (AODV), associated with VANETs are the end-to-end delay and packet loss. We modified the AODV routing protocols to reduce the number of route request (RREQ) and route reply (RREP) messages by adding direction parameters and two-step filtering. The two-step filtering process reduces the number of RREQ and RREP packets, reduces the packet overhead, and helps to select the stable route. In this study, we show the impact of the direction parameter in reducing the end-to-end delay and the packet loss in AODV. The simulation results show a 1.4% reduction in packet loss, an 11% reduction in the end-to-end delay, and an increase in throughput.
APA, Harvard, Vancouver, ISO, and other styles
3

Manish, S. Kimmatkar, and M. Asutkar S. "Performance Improvement in WSN by Using Hybrid Protocol." Journal of Analog and Digital Communications 4, no. 3 (2019): 21–24. https://doi.org/10.5281/zenodo.3525830.

Full text
Abstract:
<em>Efficiency of energy is an important factor in wireless network where nodes depends upon on limited power and computational energy resource. Ad hoc on demand distance vector routing protocol has been specially designed for mobile ad hoc networks by reducing the overhead. So, as it can control the network wide broadcast of the RREQs (routing request) the source node uses some kind of important technique. For increasing the lifetime of the nodes uses in given wireless network n number of energy efficient protocols have been design such as AODV, DSR and DSDV. We are going to propose an energy efficient route discovery method for AODV HPR (High Power Route) Protocol using NS2. Our aim is to saves energy of the nodes by avoiding the redundant rebroadcasting of the route request packets. The relaying status of the node is decided based on the broadcasting of its RREQ packets by its neighbor and it helps in reducing routing overhead incurred during the route discovery process.</em>
APA, Harvard, Vancouver, ISO, and other styles
4

Sharma, Divya, and Dr Sanjay Jain. "Optimized LOADng Routing Protocol Parameters Using Black Widow Optimization Algorithm for IoT." Webology 19, no. 1 (2022): 535–50. http://dx.doi.org/10.14704/web/v19i1/web19038.

Full text
Abstract:
With the dawn of Internet of Things (IoT), interconnected things and smart applications have significantly reduced human intervention in accomplishing tasks. Yet, due to its openness, heterogeneity, limited resources and extensiveness, it suffers from several issues such as lesser capacity links, energy consumption, resource optimization etc. Routing of packets in such constrained environment is yet challenging. Lightweight On-demand Ad hoc Distance-vector Routing Protocol—Next Generation (LOADng) protocol is an extended version of AODV protocol. Unlike AODV, LOADng is lighter version which forbids the intermediate nodes on the route to send a route reply (RREP) for the route request (RREQ) which is originated from the source. A resource constrained IoT network demands minimal routing control overhead with no packet loss. The optimal selection of routing protocol parameters can improve quality of service (QoS) of such constrained environments. So, in this paper we present optimization of the parameters of LOAD grouting protocol using black widow optimization (BWO) algorithm for IoT. Simulation results depict that the LOADng-BWO outperforms the conventional LOADng protocol in terms of delay, overhead and delivery ratio.
APA, Harvard, Vancouver, ISO, and other styles
5

ul Hassan, Mahmood, Amin A. Al-Awady, Abid Ali, et al. "ANN-Based Intelligent Secure Routing Protocol in Vehicular Ad Hoc Networks (VANETs) Using Enhanced AODV." Sensors 24, no. 3 (2024): 818. http://dx.doi.org/10.3390/s24030818.

Full text
Abstract:
A vehicular ad hoc network (VANET) is a sophisticated wireless communication infrastructure incorporating centralized and decentralized control mechanisms, orchestrating seamless data exchange among vehicles. This intricate communication system relies on the advanced capabilities of 5G connectivity, employing specialized topological arrangements to enhance data packet transmission. These vehicles communicate amongst themselves and establish connections with roadside units (RSUs). In the dynamic landscape of vehicular communication, disruptions, especially in scenarios involving high-speed vehicles, pose challenges. A notable concern is the emergence of black hole attacks, where a vehicle acts maliciously, obstructing the forwarding of data packets to subsequent vehicles, thereby compromising the secure dissemination of content within the VANET. We present an intelligent cluster-based routing protocol to mitigate these challenges in VANET routing. The system operates through two pivotal phases: first, utilizing an artificial neural network (ANN) model to detect malicious nodes, and second, establishing clusters via enhanced clustering algorithms with appointed cluster heads (CH) for each cluster. Subsequently, an optimal path for data transmission is predicted, aiming to minimize packet transmission delays. Our approach integrates a modified ad hoc on-demand distance vector (AODV) protocol for on-demand route discovery and optimal path selection, enhancing request and reply (RREQ and RREP) protocols. Evaluation of routing performance involves the BHT dataset, leveraging the ANN classifier to compute accuracy, precision, recall, F1 score, and loss. The NS-2.33 simulator facilitates the assessment of end-to-end delay, network throughput, and hop count during the path prediction phase. Remarkably, our methodology achieves 98.97% accuracy in detecting black hole attacks through the ANN classification model, outperforming existing techniques across various network routing parameters.
APA, Harvard, Vancouver, ISO, and other styles
6

Manhar, Advin, and Deepak Dembla. "Routing Optimizing Decisions in MANET: The Enhanced Hybrid Routing Protocol (EHRP) with Adaptive Routing based on Network Situation." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 10s (2023): 136–43. http://dx.doi.org/10.17762/ijritcc.v11i10s.7606.

Full text
Abstract:
Mobile ad hoc networks (MANETs) are wireless networks that operate without a fixed infrastructure or base station. In MANETs, each node acts as a data source and a router, establishing connections with its neighboring nodes to facilitate communication. This research has introduced the Enhanced Hybrid Routing Protocol (EHRP), which combines the OLSR, AOMDV, and AODV routing protocols while considering the network situation for improved performance. The EHRP protocol begins by broadcasting a RREP (Route Reply) packet to discover a route. The selection of routing options is based on the current network situation. To determine the distance between the source and destination nodes, the proposed EHRP initiates a RREQ (Route Request) packet. In situations where network mobility exceeds the capabilities of the AODV protocol, the EHRP protocol can utilize the OLSR routing protocol for route selection and data transmission, provided that at least 70% of the network nodes remain stable. Additionally, the EHRP protocol effectively handles network load and congestion control through the utilization of the AOMDV routing protocol. Compared to the hybrid routing protocol, the enhanced hybrid routing protocol (EHRP) demonstrates superior performance. Its incorporation of the OLSR, AOMDV, and AODV protocols, along with its adaptive routing adaptation based on network conditions, allows for efficient network management and improved overall network performance.&#x0D; The analysis of packet delivery ratio for EHRP and ZRP reveals that EHRP achieves a packet delivery ratio of 98.01%, while ZRP achieves a packet delivery ratio of 89.99%. These results indicate that the enhanced hybrid routing protocol (EHRP) outperforms the hybrid routing protocol (ZRP) in terms of packet delivery ratio. EHRP demonstrates a higher level of success in delivering packets to their intended destinations compared to ZRP.&#x0D; The analysis of normal routing load for EHRP and ZRP reveals that EHRP exhibits a normal routing load of 0.13%, while ZRP exhibits a higher normal routing load of 0.50%. Based on these results, it can be concluded that the performance of the Enhanced Hybrid Routing Protocol (EHRP) is significantly better than that of the Hybrid Routing Protocol (ZRP) when considering the normal routing load. EHRP demonstrates a lower level of routing overhead and more efficient resource utilization compared to ZRP in scenarios with normal routing load.&#x0D; When comparing the average end-to-end delay between the Enhanced Hybrid Routing Protocol (EHRP) and ZRP, the analysis reveals that EHRP achieves an average delay of 0.06, while ZRP exhibits a higher average delay of 0.23. These findings indicate that the Enhanced Hybrid Routing Protocol (EHRP) performs better than ZRP in terms of average end-to-end delay. EHRP exhibits lower delay, resulting in faster and more efficient transmission of data packets from source to destination compared to ZRP.&#x0D; After considering the overall parameter matrix, which includes factors such as normal routing load, data send and receive throughput, packet delivery ratio, and average end-to-end delay, it becomes evident that the performance of the Enhanced Hybrid Routing Protocol (EHRP) surpasses that of the current hybrid routing protocol (ZRP). Across these metrics, EHRP consistently outperforms ZRP, demonstrating superior performance and efficiency. The Enhanced Hybrid Routing Protocol (EHRP) exhibits better results in terms of normal routing load, higher throughput for data transmission and reception, improved packet delivery ratio, and lower average end-to-end delay. Overall, EHRP offers enhanced performance and effectiveness compared to the existing hybrid routing protocol (ZRP).
APA, Harvard, Vancouver, ISO, and other styles
7

Manhar, Advin, and Dr Deepak Dembla. "Improved Hybrid Routing Protocol (IHRP) in MANETs Based on Situation Based Adaptive Routing." International Journal of Electrical and Electronics Research 11, no. 1 (2023): 15–24. http://dx.doi.org/10.37391/ijeer.110103.

Full text
Abstract:
Without the need of a fixed foundation or base station, the Mobile Ad hoc Network creates its own wireless network. One of the most troublesome aspects of Mobile Ad hoc Network (MANET) is the occurrence of unexpected loss of network connectivity. As a result of this problem, packets continue to drop, and we must restore the connection by sending Route Request (RREQ) and Route Reply (RREP). As a result, network performance will suffer yet another setback. We used the scenario routing technique to combine the Dream Multipath Routing (DMR), Ad hoc on-demand multipath distance vector (AOMDV), Optimized link-state routing (OLSR), and Ad-hoc on Demand Vector (AODV) routing protocols to build the IHRP routing protocol in this work. According to previous studies, (AODV) is more suited when node motion is high. The purpose of DREAM Multipath Routing (DMR) is to maintain node mobility and location information coordinated. Route packet flooding is prevented by computing the expected chance of node relocation. The number of mobile nodes in the wireless network fluctuates, and the DMR operates on each one individually. In the network, each node maintains a list of nearby nodes and their current locations. Using the AOMDV routing protocol is effective for load balancing and preventing congestion on the network. OLSR is a good fit for networks that priorities link reliability above other considerations when routing traffic. When using the aforementioned (DMR, AODV, AOMDV, and OLSR) protocols to create the IHRP routing protocol, we are capable of better regulation of network behavior and perform. In the case of 100 nodes, data is sent for analysis for The Improved Hybrid Routing Protocol (IHRP), Zone Routing Protocol (ZRP), AOMDV, AODV, and OLSR routing protocols. For data send, the performance of IHRP, ZRP, AOMDV, AODV, and OLSR is 11513, 10240, 10225, 10558, and 9184, respectively, and for 50 nodes, the performance of IHRP, ZRP, AOMDV, AODV, and OLSR is 11151, 9807, 9636, 9586, and 7470, respectively. Thus, with 100 and 50 nodes, the Improved Hybrid Routing Protocol (IHRP) outperforms the AOMDV, ZRP, AODV, and OLSR routing protocols. In the case of 100 nodes and 50 nodes, the data receive analysis for IHRP, ZRP, AOMDV, AODV, and OLSR routing protocols is 11513, 10240, 10225, 10558, and 9184, respectively, and 9367, 8714, 8370, 6730, and 7298, respectively, So IHRP also receives data faster than ZRP, AOMDV, AODV, and OLSR routing protocols. The IHRP outperforms AOMDV, AODV, ZRP, and OLSR routing protocols in terms of data transmit, receive, data drop, PDR, throughput, E-E latency, and NRL.
APA, Harvard, Vancouver, ISO, and other styles
8

Luong, Ngoc T., Tu T. Vo, and Doan Hoang. "FAPRP: A Machine Learning Approach to Flooding Attacks Prevention Routing Protocol in Mobile Ad Hoc Networks." Wireless Communications and Mobile Computing 2019 (January 10, 2019): 1–17. http://dx.doi.org/10.1155/2019/6869307.

Full text
Abstract:
Request route flooding attack is one of the main challenges in the security of Mobile Ad Hoc Networks (MANETs) as it is easy to initiate and difficult to prevent. A malicious node can launch an attack simply by sending an excessively high number of route request (RREQ) packets or useless data packets to nonexistent destinations. As a result, the network is rendered useless as all its resources are used up to serve this storm of RREQ packets and hence unable to perform its normal routing duty. Most existing research efforts on detecting such a flooding attack use the number of RREQs originated by a node per unit time as the threshold to classify an attacker. These algorithms work to some extent; however, they suffer high misdetection rate and reduce network performance. This paper proposes a new flooding attacks detection algorithm (FADA) for MANETs based on a machine learning approach. The algorithm relies on the route discovery history information of each node to capture similar characteristics and behaviors of nodes belonging to the same class to decide if a node is malicious. The paper also proposes a new flooding attacks prevention routing protocol (FAPRP) by extending the original AODV protocol and integrating FADA algorithm. The performance of the proposed solution is evaluated in terms of successful attack detection ratio, packet delivery ratio, and routing load both in normal and under RREQ attack scenarios using NS2 simulation. The simulation results show that the proposed FAPRP can detect over 99% of RREQ flooding attacks for all scenarios using route discovery frequency vector of sizes larger than 35 and performs better in terms of packet delivery ratio and routing load compared to existing solutions for RREQ flooding attacks.
APA, Harvard, Vancouver, ISO, and other styles
9

Vivek Sharma. "Impact of RREQ Packet Flooding Attack on Wireless Sensor Networks: A Simulation-Based Study." Communications on Applied Nonlinear Analysis 31, no. 2s (2024): 277–86. http://dx.doi.org/10.52783/cana.v31.645.

Full text
Abstract:
This paper analyzes the impact of RREQ packet flooding on WSNs through simulations. WSNs are vital for applications like surveillance, healthcare, and environmental monitoring. However, they are susceptible to DoS attacks, such as RREQ packet flooding, which disrupts normal operations by overwhelming the network with excessive route requests. The study evaluates the effect of RREQ flooding on WSN performance metrics, including throughput, end-to-end delay, packet delivery ratio, energy consumption, and routing load. It also reviews relevant literature to provide background information and identify gaps in current knowledge. Introduction: WSNs consist of distributed sensor nodes that collect and transmit data to a central base station for processing. WSNs face significant challenges, including malicious activities like DoS attacks, which aim to disrupt normal operations. RREQ packet flooding is a severe form of DoS attack that overwhelms the network with excessive Route REQuest packets, leading to communication channel saturation and congestion, thus hindering legitimate data transmission and compromising network performance. Objectives: The objective of this paper is to conduct an in-depth analysis of the effects of RREQ packet flooding on various performance metrics of WSNs through extensive simulations. The study aims to understand the repercussions of this attack on throughput, end-to-end delay, packet delivery ratio, energy consumption, and routing load. Additionally, the paper seeks to identify existing gaps in the understanding of the impact of RREQ packet flooding and provide insights that can inform the development of effective countermeasures to safeguard WSNs. Methods: The paper employs simulation-based methods to assess the impact of RREQ packet flooding on WSN performance. Various performance metrics such as throughput, end-to-end delay, packet delivery ratio, energy consumption, and routing load are evaluated. A thorough literature review is also conducted to contextualize the analysis and identify knowledge gaps. The simulations are designed to mimic real-world scenarios to provide accurate and relevant results. Results: The simulations reveal that RREQ packet flooding significantly affects WSN performance. Key findings include a decrease in throughput, an increase in end-to-end delay, a reduction in packet delivery ratio, higher energy consumption, and increased routing load. These results highlight the detrimental impact of RREQ packet flooding on the overall functionality and efficiency of WSNs. Conclusions: The paper concludes that RREQ packet flooding poses a substantial threat to the performance of WSNs. The findings underscore the importance of developing robust defense mechanisms to protect WSNs from such attacks. The insights gained from this study can inform the creation of more resilient and reliable WSNs, capable of withstanding RREQ packet flooding and similar threats.
APA, Harvard, Vancouver, ISO, and other styles
10

DJENOURI, DJAMEL, OTHMANE MAHMOUDI, and MOHAMED BOUAMAMA. "TOWARDS IMMUNIZING MANET'S SOURCE ROUTING PROTOCOLS AGAINST PACKET DROPPERS." Journal of Interconnection Networks 10, no. 01n02 (2009): 59–91. http://dx.doi.org/10.1142/s0219265909002443.

Full text
Abstract:
This paper deals with security of routing protocols of Mobile Ad hoc Networks (MANETs), and proposes a solution to immunize such protocols against packet dropping misbehavior. Most of the current secure protocols are vulnerable to packet dropping misbehavior, which can be exploited by selfish nodes and malicious ones as well. For example, simply by dropping RREQ (Route Request) packets a selfish node can exclude itself from routes and thereby avoid receiving data packets to forward. On the other hand, a malicious node can drop RERR (Route Error) packets to keep the use of failed routes, possibly resulting in a denial of service. To mitigate this vulnerability we propose a hybrid solution that secures routing protocols against the dropping of both directed and broadcast control packets, in which a different approach is adapted for each kind of packets. Dealing with control packets represents the main contribution in this manuscript, as all the current proposals in the context of selfish nodes only consider data packets. Our solution can be integrated with any source routing protocol. In this work it was implemented with one of the most secure protocols, namely ENDAIR. The resulting new extended secure protocol was assessed and analyzed through an extensive simulation study.
APA, Harvard, Vancouver, ISO, and other styles
11

N., Prathviraj, and Santosh L. Deshpande. "Rough set based QoS enabled multipath source routing in MANET." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 2 (2020): 1915. http://dx.doi.org/10.11591/ijece.v10i2.pp1915-1923.

Full text
Abstract:
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multi-layer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
APA, Harvard, Vancouver, ISO, and other styles
12

Prathviraj, N., and Deshpande L. "Rough set based QoS enabled multipath source routing in MANET." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 2 (2020): 1915–23. https://doi.org/10.11591/ijece.v10i2.pp1915-1923.

Full text
Abstract:
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
APA, Harvard, Vancouver, ISO, and other styles
13

Gizachew Yirga, Hailu, Gizatie Desalegn Taye, and Henock Mulugeta Melaku. "An Optimized and Energy-Efficient Ad-Hoc On-Demand Distance Vector Routing Protocol Based on Dynamic Forwarding Probability (AODVI)." Journal of Computer Networks and Communications 2022 (November 8, 2022): 1–13. http://dx.doi.org/10.1155/2022/5750767.

Full text
Abstract:
MANET (mobile ad-hoc network) is a wireless ad-hoc network made up of mobile devices that use peer-to-peer routing to provide network access instead of using a preexisting network infrastructure. Despite the network infrastructure’s simplicity, it faces issues such as changeable connection capacity, dynamic topology, node battery power exhaustion, and inadequate physical security. Broadcasting is a standard MANET approach for sending messages from a source node to all other nodes in the network. Flooding is a frequent method for broadcasting route request (RREQ) packets, which is susceptible to broadcast storms. The high retransmission rate is caused by the standard flooding technique, which causes media congestion and packet collisions, which can drastically reduce throughput and network performance. In a mobile ad-hoc network, efficient broadcasting focuses on selecting a compact forward node set while assuring broadcast coverage. The goal is to find a limited number of forward nodes that will provide complete coverage. In this paper, we propose an optimized and energy-efficient routing protocol for MANET (mobile ad-hoc network) based on dynamic forwarding probability in general and AODV (ad hoc on-demand distance vector) in particular, in which the route request packets are randomly controlled to increase the network lifetime and reduce packet loss in the flooding algorithm. We tested and assessed the results of our proposed solution using various network performance factors after implementing and integrating it into NS-2. According to simulation findings, our proposed technique effectively reduced route request propagation messages (RREQ). The suggested technique is more efficient, has a longer network lifetime, and uniformly utilizes node residual energy, enhancing network throughput and minimizing routing overhead when compared to regular and modified AODV protocols.
APA, Harvard, Vancouver, ISO, and other styles
14

Daljeet Singh, Rahul Nawkhare,. "PSO-Controlled WSN Environment to Mitigate Flooding and Improve Network Lifetime." Journal of Electrical Systems 20, no. 3s (2024): 1424–36. http://dx.doi.org/10.52783/jes.1519.

Full text
Abstract:
The Restricted Flooding-based Route Discovery (RFBRD) – Particle Swarm Optimization (PSO) routing scheme introduced for Wireless Sensor Networks (WSNs) in this article not only reduces the energy loss due to unwanted RREQ (Route Request) flooding but also improves the lifetime of the network. Excessive flooding depletes energy and affects the lifetime of the network. Nodes in scarce regions are allowed to forward first and subsequent RREQ packets freely in the network and are relocated using PSO to improve their neighborhood for better neighbor connectivity and coverage. Whereas, nodes in the populated region or dense region are governed by energy ratios and are allowed to forward first RREQ packets only when they satisfy the energy conditions. This scheme is efficient in maintaining a proper balance of QoS (Quality of Service) parameters works well for high-density networks for more than 50 nodes and can restructure network topology obtaining better connectivity. Experimental analysis showed that the performance of AODV is superior in the case of a low-density network (N=40 nodes) while RFBRD-PSO outperforms in all other configurations (60, 80, and 100 nodes). The Packet delivery ratio was increased by 0.08% and the throughput was higher by 11 kbps in the case of RFBRD-PSO. The routing overhead is low by approximately 40% and the average end-to-end delay is found low by 0.04 as compared to the AODV routing. The energy residue in the case of RFBRD-PSO is less than the value of AODV is the cost paid for a higher packet delivery ratio. The neighborhood connectivity is improved by approximately 32%.
APA, Harvard, Vancouver, ISO, and other styles
15

Yu, Chih Min, Yih Bin Yu, and Chun Chih Chu. "P-AODV: Energy-Aware Routing for Wireless Mesh Networks." Applied Mechanics and Materials 764-765 (May 2015): 946–49. http://dx.doi.org/10.4028/www.scientific.net/amm.764-765.946.

Full text
Abstract:
This paper proposed an energy-aware routing method, P-AODV. Based on the AODV routing protocol, this study designed a passive power control (PPC) algorithm to enhance energy efficiency. The proposed method includes signal detection and power setting phases. During the signal detection phase, the source node broadcasts the route request packets (RREQ) and the downstream intermediate node calculates the optimum power level at the upstream intermediate node according to the received signal strength indicator (RSSI) after receiving the RREQ. During the power set phase, the destination node returns the RREQ packet to notify the power level of the upstream nodes to the source node. After that, all nodes from the source node to the destination node engaged in transmission will transmit data in a coordinated power level. As indicated by the computer simulation results, P-AODV could have 30% higher energy efficiency than traditional AODV. This PPC algorithm could also be used in wireless mesh networks (WMNs).
APA, Harvard, Vancouver, ISO, and other styles
16

Meghanathan, Natarajan, and Meena Sugumar. "A Beaconless Minimum Interference Based Routing Protocol to Minimize End-to-End Delay per Packet for Mobile Ad hoc Networks." International Journal of Interdisciplinary Telecommunications and Networking 2, no. 1 (2010): 12–26. http://dx.doi.org/10.4018/jitn.2010010102.

Full text
Abstract:
The authors propose a beaconless, on-demand, mobile ad hoc network routing protocol called minimum interference based routing protocol (MIF) that minimizes the end-to-end delay per data packet. During route discovery, each node inserts its identification and location information before broadcasting the Route-Request (RREQ) message in its neighborhood. The weight of a link, called the interference index, is the number of interfering links surrounding it. Two links are said to interfere with each other, if the distance between the mid points of the two links is within the interference range. The interference index of a path is the sum of the interference index values of the constituent links. The destination selects the path with the minimum interference index value and notifies the source through the Route-Reply packet. Simulation results demonstrate that MIF incurs a significant reduction in the end-to-end delay per data packet vis-à-vis the interference-aware load balancing routing protocol.
APA, Harvard, Vancouver, ISO, and other styles
17

Raman, Preet*1 Dr. Shaveta Rani 2. Dr. Paramjeet Singh 3. "SIMULATION BASED PERFORMANCE ANALYSIS OF MOBILE AD HOC NETWORK UNDER THE INFLUENCE OF ROUTE REQUEST FLOODING ATTACK." INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY 6, no. 11 (2017): 535–43. https://doi.org/10.5281/zenodo.1066234.

Full text
Abstract:
In this paper, we investigate the impact of Route REQuest (RREQ) flooding attack on mobile ad hoc network (MANET). RREQ flooding is performed by nodes that intend to degrade the network performance and are generally called malicious nodes. Malicious nodes behave like legitimate nodes present in the network, only with a single difference that they perform route discoveries very frequently as compared to legitimate nodes. Using simulations, we show that the basic route discovery mechanism used by popular reactive protocols such as Ad Hoc On-demand Distance Vector (AODV) and Distance Source Routing (DSR) can be exploited by such malicious nodes to bring down the network performance drastically. The major objective of this `simulation based study is to figure out the reactive protocol that performs better under RREQ flooding attack so that, it could further be improved to detect and isolate malicious node(s) to ensure security in MANET. Extensive simulations are performed using network simulator NS-2 and performance of network is measured using parameters such as Packet Delivery Ratio (PDR), Average End-To-End Delay, Throughput and Jitter.
APA, Harvard, Vancouver, ISO, and other styles
18

Shanmugam, Kannan, Karthik Subburathinam, and Arunachalam Velayuthampalayam Palanisamy. "A Dynamic Probabilistic Based Broadcasting Scheme for MANETs." Scientific World Journal 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/1832026.

Full text
Abstract:
MANET is commonly known as Mobile Ad Hoc Network in which cluster of mobile nodes can communicate with each other without having any basic infrastructure. The basic characteristic of MANET is dynamic topology. Due to the dynamic behavior nature, the topology of the network changes very frequently, and this will lead to the failure of the valid route repeatedly. Thus, the process of finding the valid route leads to notable drop in the throughput of the network. To identify a new valid path to the targeted mobile node, available proactive routing protocols use simple broadcasting method known as simple flooding. The simple flooding method broadcasts the RREQ packet from the source to the rest of the nodes in mobile network. But the problem with this method is disproportionate repetitive retransmission of RREQ packet which could result in high contention on the available channel and packet collision due to extreme traffic in the network. A reasonable number of routing algorithms have been suggested for reducing the lethal impact of flooding the RREQ packets. However, most of the algorithms have resulted in considerable amount of complexity and deduce the throughput by depending on special hardware components and maintaining complex information which will be less frequently used. By considering routing complexity with the goal of increasing the throughput of the network, in this paper, we have introduced a new approach called Dynamic Probabilistic Route (DPR) discovery. The Node’s Forwarding Probability (NFP) is dynamically calculated by the DPR mobile nodes using Probability Function (PF) which depends on density of local neighbor nodes and the cumulative number of its broadcast covered neighbors.
APA, Harvard, Vancouver, ISO, and other styles
19

Krisna Parwata, I. Putu Gede, Andy Hidayat Jatmika, and Ariyan Zubaidi. "Meningkatkan Kinerja Protokol Routing Aomdv Dalam Memilih Node Tetangga Berdasarkan Bandwidth, Round Trip Time, Dan Packet Loss Ratio Untuk Menemukan Rute Terbaik." Journal of Computer Science and Informatics Engineering (J-Cosine) 6, no. 2 (2022): 91–98. http://dx.doi.org/10.29303/jcosine.v6i2.433.

Full text
Abstract:
Mobile ad hoc network or in short MANET is a group of node that exchange the information from source node to destination node on wireless network. The main problem in MANET is on the network structure that change continously that is cause by node mobility that made route disconnected. If route disconnect there will be another route discovery processes that will take much time. AOMDV (Ad hoc On-demand Multipath Distance Vector) routing protocol works by doing broadcast Route Request Packet (RREQ) from source node to neighbor node (intermediate node) and then it will continously until it arrives to destination node. AOMDV didnt choose the best neighbor node while broadcast RREQ packet so the route constructed have high possibility to disconnected and must re-broadcast until it find stable route and it will be a long time and not effective. To solve this problem it proposed to add a modification with AOMDV routing protocol with calculation of bandwidth, round trip time, and packet loss ratio to choose neighbor node to find the best route. Routing protocol performance will tested using test parameter throughput, delay, and packet delivery ratio to choose the best neighbor node. Based on test result, the proposed modification can improve the preformance of AOMDV routing protocol. After modification, average throughput has improved 43.26 %, Packet Delivery Ratio (PDR) improved 3.15 % and average end-to-end delay reduce 31.26%.
APA, Harvard, Vancouver, ISO, and other styles
20

Gao, X. M., and J. H. Xia. "Mobility Prediction-Based Link Stability Routing Protocol for MANET." Applied Mechanics and Materials 556-562 (May 2014): 5926–30. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.5926.

Full text
Abstract:
In mobile ad hoc networks, node mobility causes frequent link failures, thus invalidating the routes containing those links. Once a link is detected broken, an alternate route has to be discovered. That will impose significant affect on the route stability and the overall performance of the network. We suggest discovering contained stable links routes based on fuzzy control. When mobile node S wishes to send a packet to a destination mobile node D, node S transmits a ROUTE REQUEST (RREQ) message which contains its velocity and direction as a single local broadcast packet. When one mobile node i (it is not D) receiving RREQ, it first gets the velocity and direction of previous node, then estimates the link stability between two nodes based on fuzzy logic. When the link stability come up to a certain standard, node i adds its address to RREQ and forward it, otherwise, discard it. Simulations show that the proposed PLSR (Mobility Prediction-based Link Stability Routing Protocol) outperforms DVMP (Distance Vector protocol with Mobility Prediction that uses GPS) [8].
APA, Harvard, Vancouver, ISO, and other styles
21

Shete, Prasanna, and Raval N. Awale. "Connectivity Investigation of Channel Quality-Based Adaptive Gossip Flooding Mechanism for AODV." International Journal of Engineering and Technology Innovation 10, no. 1 (2020): 25–40. http://dx.doi.org/10.46604/ijeti.2020.3812.

Full text
Abstract:
To address the “broadcast storm” problem associated with flooding-based route discovery mechanism of reactive routing protocols, probabilistic approaches are suggested in the literature. In the earlier work, Gossip flooding mechanism of Haas et.al. was extended with signal quality, to propose channel quality based adaptive gossip flooding mechanism for AODV (CQAG-AODV). Following the cross-layer design principle, CQAG-AODV algorithm tried to discover robust routes, as well as address the “broadcast storm” problem by controlling the rebroadcast probability of Route request (RREQ) packets on the basis of signal strength experienced at the physical layer. This paper investigates the connectivity of CQAG-AODV through theoretical and simulation analysis. Results show that, by accounting the signal strength in the route discovery process, not only does the proposed algorithm floods a lesser number of route requests and controls the broadcast storm, but also maintains a higher level of connectivity to offer high packet delivery ratio; independent of network density and node mobility. Moreover, due to controlled routing overhead and robust route discovery, channel quality based adaptive flooding mechanism offers fringe benefit of energy efficiency as well. CQAG-AODV thus proves its suitability in a variety of use cases of multi-hop ad hoc networks including WSNs and VANETs.
APA, Harvard, Vancouver, ISO, and other styles
22

Malik, Abdul, Muhammad Zahid Khan, Mohammad Faisal, Faheem Khan, and Jung-Taek Seo. "An Efficient Dynamic Solution for the Detection and Prevention of Black Hole Attack in VANETs." Sensors 22, no. 5 (2022): 1897. http://dx.doi.org/10.3390/s22051897.

Full text
Abstract:
Rapid and tremendous advances in wireless technology, miniaturization, and Internet of things (IoT) technology have brought significant development to vehicular ad hoc networks (VANETs). VANETs and IoT together play a vital role in the current intelligent transport system (ITS). However, a VANET is highly vulnerable to various security attacks due to its highly dynamic, decentralized, open-access medium, and protocol-design-related concerns. Regarding security concerns, a black hole attack (BHA) is one such threat in which the control or data packets are dropped by the malicious vehicle, converting a safe path/link into a compromised one. Dropping data packets has a severe impact on a VANET’s performance and security and may cause road fatalities, accidents, and traffic jams. In this study, a novel solution called detection and prevention of a BHA (DPBHA) is proposed to secure and improve the overall security and performance of the VANETs by detecting BHA at an early stage of the route discovery process. The proposed solution is based on calculating a dynamic threshold value and generating a forged route request (RREQ) packet. The solution is implemented and evaluated in the NS-2 simulator and its performance and efficacy are compared with the benchmark schemes. The results showed that the proposed DPBHA outperformed the benchmark schemes in terms of increasing the packet delivery ratio (PDR) by 3.0%, increasing throughput by 6.15%, reducing the routing overhead by 3.69%, decreasing the end-to-end delay by 6.13%, and achieving a maximum detection rate of 94.66%.
APA, Harvard, Vancouver, ISO, and other styles
23

Naif, Saad Sulaiman, Barzan Abdulazeez Idrees, Ali Jalil Ibrahim, and Naji A. Majedkan. "A Technique of NLAODV algorithm to get Routes of Nodes-List in Mobile Ad-hoc Network (MANET)." Science Journal of University of Zakho 10, no. 3 (2022): 147–52. http://dx.doi.org/10.25271/sjuoz.2022.10.3.909.

Full text
Abstract:
A Mobile Ad-hoc Network (MANET) is a group of nodes that connect to each other wirelessly without the use of a central server or a traditional network structure. In MANETs, data packets are sent through wireless channels to keep communication going. Ad-hoc On-Demand Distance Vector Routing is a MANET-related reactive routing technology that generates a path of nodes to a destination by broadcasting packets of route request across the network. In this kind of Routing protocol, a connection loss causes the source to send control (RREQ) on the network, causing network congestion and performance deterioration. This study offers a Node List (NLAODV) Node List Ad-hoc On-Demand Distance Vector routing method that includes links and path-nodes to identify if any node on the network is involved in the route discovery process for sending control packets from wireless source node to the wireless destination node. Simulation findings reveal that the proposed NLAODV algorithm minimizes flood Packets and get best network as it’s not necessary for all nodes to be present in route discovery.
APA, Harvard, Vancouver, ISO, and other styles
24

Hidayat, Muhammad Arief, Aghus Sofwan, and Agung Budi Prasetijo. "Gaussian Prediction Method to Enhance Energy Efficient in Energy Aware AODV." E3S Web of Conferences 125 (2019): 23005. http://dx.doi.org/10.1051/e3sconf/201912523005.

Full text
Abstract:
One of the concerns in the development routing protocol in Mobile Ad Hoc Network is energy consumption which is very influential on package delivery. Energy Delay Aware Ad hoc Demand on Distance Vector (EA-AODV) is one of the routing protocols for the development of Ad hoc Demand on Vector (AODV) that considers energy when receiving packets stored in the routing table. The routing protocol applies the Dijkstra algorithm to determine the shortest route by considering the sequence number and hop count. In the development carried out on EA-AODV is a modification of the Dijkstra algorithm by adding a gaussian prediction method in consideration of the energy level that is expected to be more efficient in terms of energy consumption. Gaussian prediction method was executed in receive request (RREQ) when the packet saved in the routing table. The Application of the network protocol was conducted by comparing the performance of AODV with EA-AODV. The consumption energy of EA-AODV is more efficient at 12.07% compared to AODV.
APA, Harvard, Vancouver, ISO, and other styles
25

Srinivasan, Venkatasubramanian. "Detection of Black Hole Attack Using Honeypot Agent-Based Scheme with Deep Learning Technique on MANET." Ingénierie des systèmes d information 26, no. 6 (2021): 549–57. http://dx.doi.org/10.18280/isi.260605.

Full text
Abstract:
Mobile Ad-Hoc Networks (MANETs) due to their reconfigurable nature are being integrated into new and futuristic knowledge such as Internet of Things (IoT), cloud, reconfigurable networks, etc. To attain such credibility of integration, the routing protocols associated with these mobile nodes have to connect, perform and facilitate routing that offers a high level of security and resistance to all possible threats and security issues that may emanate in the network. One of the solutions used to maintain network security is intrusion detection systems (IDSs). This article primarily emphasis on the network's susceptibility to a suction assault known as a black hole attack. The investigations about the employment of intelligent agents called Honeypot Agent-based detection scheme (HPAS) with Long-Short Term Memory (LSTM) in identifying such assaults. Hence, the proposed method is named HPAS-LSTM, where honeypots are roaming virtual software managers that create Route Request (RREQ) packets to attract and entrap black hole attackers. Extensive model results utilizing the ns-2 simulator are used to demonstrate the presence of the suggested detection technique. The simulation outcomes demonstrate that the suggested technique outperforms current black hole detection methods in terms of throughput (TH), packet loss rate (PLR), packet delivery ratio (PDR), and total network delay (TND).
APA, Harvard, Vancouver, ISO, and other styles
26

Chekhar, M., K. Zine-Dine, M. Bakhouya, A. Aaroud, and J. Gaber. "An efficient broadcasting routing protocol WAODV in mobile ad hoc networks." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 6 (2021): 5189. http://dx.doi.org/10.11591/ijece.v11i6.pp5189-5196.

Full text
Abstract:
Information broadcasting in wireless network is a necessary building block for cooperative operations. However, the broadcasting causes increases the routing overhead. This paper brings together an array of tools of our adaptive protocol for information broadcasting in MANETs. The proposed protocol in this paper named WAODV (WAIT-AODV). This new adaptive routing discovery protocol for MANETs, lets in nodes to pick out a fantastic motion: both to retransmit receiving request route request (RREQ) messages, to discard, or to wait earlier than making any decision, which dynamically confgures the routing discovery feature to decide a gorgeous motion through the usage of neighbors’ knowledge. Simulations have been conducted to show the effectiveness of the using of techniques adaptive protocol for information broadcasting RREQ packet when integrated into ad hoc on-demand distance vector (AODV) routing protocols for MANET (which is based on simple flooding).
APA, Harvard, Vancouver, ISO, and other styles
27

M., Chekhar, Zine-Dine K., Bakhouya M., Aaroud A., and Gaber J. "An efficient broadcasting routing protocol WAODV in mobile ad hoc networks." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 6 (2021): 5189–96. https://doi.org/10.11591/ijece.v11i6.pp5189-5196.

Full text
Abstract:
Information broadcasting in wireless network is a necessary building block for cooperative operations. However, the broadcasting causes increases the routing overhead. This paper brings together an array of tools of our adaptive protocol for information broadcasting in MANETs. The proposed protocol in this paper named WAODV (WAIT-AODV). This new adaptive routing discovery protocol for MANETs, lets in nodes to pick out a fantastic motion: both to retransmit receiving request route request (RREQ) messages, to discard, or to wait earlier than making any decision, which dynamically confgures the routing discovery feature to decide a gorgeous motion through the usage of neighbors&rsquo; knowledge. Simulations have been conducted to show the effectiveness of the using of techniques adaptive protocol for information broadcasting RREQ packet when integrated into ad hoc ondemand distance vector (AODV) routing protocols for MANET (which is based on simple flooding).
APA, Harvard, Vancouver, ISO, and other styles
28

S.Vasudevi and Maryponrani. "Improving Packet Delivery Ratio With Enhanced Confidentiality in Manet." International Journal on Computational Science & Applications (IJCSA) 5, October (2015): 10. https://doi.org/10.5281/zenodo.3257098.

Full text
Abstract:
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet. The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e., combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is ensured in MANET.
APA, Harvard, Vancouver, ISO, and other styles
29

Atri, Swati, and Sanjay Tyagi. "Energy Based Route Prioritization for Optimum Multi-path Selection." International Journal of Computer Network and Information Security 15, no. 6 (2023): 89–102. http://dx.doi.org/10.5815/ijcnis.2023.06.08.

Full text
Abstract:
Energy–aware routing in wireless ad hoc networks is one of the demanding fields of research. Nodes of the network are battery operated that are difficult to recharge and replace, that's why while developing a routing protocol energy consumption metric should always be at high priority. Nodes of mobile ad hoc networks are distributed in different directions forming arbitrary topology instantly. To propose an energy-efficient routing protocol for such a dynamic, self-organized, self-configured, and self-controlled network is certainly a challenge and an open research problem. Energy constraints and mobility leading to link breakage are the motivating factors behind the development of the proposed Optimized Priority-based Ad Hoc on Demand Multi-path Distance Vector Energy Efficient Routing Protocol (OPAOMDV-EE). The routing protocol added three fields (CE, MAX_E, MIN_E) to the traditional AOMDV RREQ and RREP packets, which are further used for calculating total priority field value. This value is used by the source node for selecting an optimal prioritized energy-efficient route. The proposed OPAOMDV-EE protocol has been simulated on Network Simulator-2 (NS-2) for two different scenarios that prove the effectiveness of OPAOMDV-EE in terms of various performance metrics with reduced energy consumption.
APA, Harvard, Vancouver, ISO, and other styles
30

FU, Hua Sen. "Practical Enhanced Topology Discovery Algorithm for MANET." Advanced Materials Research 760-762 (September 2013): 599–606. http://dx.doi.org/10.4028/www.scientific.net/amr.760-762.599.

Full text
Abstract:
In order to effectively manage the communication nodes in Mobile Ad Hoc Network (MANET), it is important to know the topology of such networks. Traditional Ad-hoc On-demand Distance Vector (AODV) protocol can not get the MANET topology due to the lack of the topology discovery mechanism. Aiming at this problem, an enhanced topology discovery algorithm based on AODV (AODV-TD) is proposed. AODV-TD can not only obtain the topology of dynamic network by topology discovery request, but also realize route discovery among nodes. Finally, the proposed algorithm is implemented on a hardware platform using CC1100, and the experiment results show that, even the network changes dynamically, AODV-TD can still discover the network topology rapidly and accurately, so that contribute to reducing the route discovery time and the RREQ forwarding packets.
APA, Harvard, Vancouver, ISO, and other styles
31

Vivek Sharma. "Secure and Energy Efficient Routing Approach for Wireless Sensor Networks to Counter Flooding Attack." Journal of Information Systems Engineering and Management 10, no. 4s (2025): 558–66. https://doi.org/10.52783/jisem.v10i4s.566.

Full text
Abstract:
Wireless Sensor Networks (WSNs) are used in many applications owing to their scalability and economic efficiency, but their adhoc characteristics makes them vulnerable to security attacks such as RREQ flooding attacks. RREQ flooding attack overload the network with excessive RREQ messages resulting in network congestion and power exhaustion and interruption of standard operations. This paper presents a secure and energy-efficient routing approach that focuses on effectively mitigating the effects of flooding attacks. The proposed approach combines sophisticated algorithms into the Ad hoc On-Demand Distance Vector (AODV) routing protocol to detect and isolate malicious nodes by analyzing route request (RREQ) frequency. Nodes demonstrating abnormal behavior are identified and removed from network, significantly minimizing the effects of attacks. An energy-aware clustering technique is also included for improving energy efficiency throughout the network. This approach dynamically identifies cluster heads depending on remaining energy and distance, hence minimizing energy expenditure and extending the network's lifespan. Results from the simulation demonstrate the effectiveness of the suggested method in enhancing packet delivery ratio, decreasing energy consumption, and prolonging network lifespan, thereby attaining an optimal equilibrium between security and efficiency.
APA, Harvard, Vancouver, ISO, and other styles
32

Andy Hidayat Jatmika, Susilo Pandu Waskito, and Ariyan Zubaidi. "Implementasi Algoritma Pemilihan Node Tetangga Terbaik Pada Protokol Routing DSR di Jaringan MANET." Journal of Computer Science and Informatics Engineering (J-Cosine) 6, no. 1 (2022): 64–72. http://dx.doi.org/10.29303/jcosine.v6i1.435.

Full text
Abstract:
Mobile Ad Hoc Network (MANET) is a wireless telecommunications technology that consists of a collection of dynamic nodes. Due to these properties resulted in the mobility of nodes in MANET. So that every relationship between nodes will always change and cause the process of finding a vulnerable route to take a long time. Each node also has a role as a host or router in exchanging information. In MANET delivery assurance and the ability to deal with path changes on an ad hoc basis are critical. So that in sending data packets from the source node to the destination node, a Routing protocol is needed. The routing protocol Dynamic Source Routing (DSR) in the route search process broadcasts RREQ to all neighboring nodes (intermediate nodes) without knowing whether the node is the best node or not. So that the possibility of the route being interrupted because it is not composed of the best nodes can occur. A modification of the DSR routing protocol is proposed by finding the best intermediate node based on parameters, namely bandwidth, RTT, packet loss ratio. Then the neighboring nodes (intermediate nodes) that have been selected will arrange the delivery route from the source node to the destination node. The performance of the modified DSR and DSR routing protocols will then be measured using test parameters, namely throughput, packet delivery ratio (PDR) and average end to end delay. Based on the results of research trials, the application of the modified DSR method can improve the performance of the DSR protocol. Which after the application of the method, the average throughput increased by 25%, Packet Delivery Ratio (PDR) was 1.11% and the average end-to-end delay decreased by 17.64 %.
APA, Harvard, Vancouver, ISO, and other styles
33

Shibasaki, Yuma, Keiichi Iwamura, and Koya Sato. "A Communication-Efficient Secure Routing Protocol for IoT Networks." Sensors 22, no. 19 (2022): 7503. http://dx.doi.org/10.3390/s22197503.

Full text
Abstract:
This paper proposes a secure routing protocol based on an ad hoc on-demand distance vector to simultaneously achieve communication efficiency and security. Many studies have discussed secure protocols. However, conventional protocols tend to exhibit low communication efficiencies owing to the long packets required by digital signatures, specifically in large-scale networks. Hence, our proposed method aims to allow the intermediate node to initiate a route reply (RREP), which is prohibited in conventional protocols because of digital signature restrictions. Based on an ID-based signature, the proposed protocol allows each intermediate node to hold a packet received from a specific node in the past. Each node then appends it to the route request of another node and generates its own signed RREP. This procedure guarantees that a third party holds the route to the destination. Theoretical evaluations demonstrate that the proposed method outperforms the communication efficiency of conventional secure protocols. We measured the time required for routing (i.e., the sum of communication and cryptographic calculation times) using a Raspberry Pi with C language. We show that the proposed protocol can improve the average routing time by more than 3× compared with conventional methods when 30 relay nodes are randomly distributed in a 300-square meter area.
APA, Harvard, Vancouver, ISO, and other styles
34

Fahad, Taqwa O., and Abduladhem A. Ali. "Multiobjective Optimized Routing Protocol for VANETs." Advances in Fuzzy Systems 2018 (December 11, 2018): 1–10. http://dx.doi.org/10.1155/2018/7210253.

Full text
Abstract:
Vehicular ad hoc network (VANET) routing protocols have been attracting a considerable attention of both research and industrial communities, due to their significant role in intelligent transportation system applications. The present paper adopts an optimized integrated multicast, multicriteria, adaptive route lifetime as a routing protocol for VANETs. Whereby only an optimal subset of neighbor vehicles is chosen to relay route request (RREQ) messages based on distance, direction, speed, and future direction information in a combined sender-receiver manner. Among those selected optimal paths for route discovery, the best route with lowest cost will be chosen for forwarding data packets for a specified duration assigned depending on the obtained cost and number of intermediate vehicles of that route. Fuzzy controllers were employed to assess routes’ costs and their lifetimes. Furthermore, artificial bee colony (ABC) algorithm was used to concurrently optimize all used fuzzy systems and obtain the optimal highest rank of links’ cost values within which the neighbors could be selected as relay nodes in route discovery process. Simulation results prove that the proposed routing scheme significantly improves the network performance in both urban and highway scenarios, under different situations of vehicle density.
APA, Harvard, Vancouver, ISO, and other styles
35

Ganpat Joshi, Gurpreet Singh,. "A Novel Statistical Adhoc On-Demand Distance Vector Routing Protocol Technique is using for Preventing the Mobile Adhoc Network from Flooding Attack." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 6 (2021): 1753–65. http://dx.doi.org/10.17762/turcomat.v12i6.3779.

Full text
Abstract:
The Mobile Adhoc Networks are more vulnerable because in the (MANET) Mobile Adhoc Network all node works as data sink, transmitter, router. There is no centralized system in the Mobile Adhoc network, so the chances of the vulnerabilities are very high in the network. There are various security issues in the Mobile Adhoc Network. From the various attacks the flooding attacks are most difficult attacks that extremely affect in Mobile Adhoc Network. In this paper, a new statistical based technique is planned, which is used to discover the flooding attack in an positive approach than other approaches. In the planned of Statistical Ad-Hoc on Demand Distance Vector (SAODV) approach is used to detect malicious nodes in the Mobile Adhoc Network. In this technique, statistical threshold value is obtained from mean and variance. In this approach the value is utilize to locate the (RREQ) Route Request flooding attacker nodes in the Mobile Adhoc Network. The proposed method is capable because threshold values are calculated on the source of RREQs prepared by every node in the Mobile Addhoc Network. The simulation results clearly depict that the proposed approach has significant performance in the terms of throughput, delay, packet delivery ratio, and overhead.
APA, Harvard, Vancouver, ISO, and other styles
36

Poonam, Landge *., and Atul Nigavekar Prof. "MODIFIED AODV PROTOCOL FOR ENERGY EFFICIENT ROUTING IN MANET." INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY 5, no. 3 (2016): 523–29. https://doi.org/10.5281/zenodo.47639.

Full text
Abstract:
Mobile ad Hoc network is a collection of wireless mobile nodes that works without any fixed infrastructure. Mobile nodes in MANET are featured with limited battery power &amp; performance of routing protocol degrades if battery power of nodes gets exhausted. This issue not only affect lifetime of node but also its ability to forward packets. So in MANET routing protocol should provide energy efficient multi-hop route between source &amp; destination pair. AODV routing protocol prefers shortest path for route establishment. But this may lead to repeated selection of certain nodes which in turn exhaust battery power of such nodes faster than others.&nbsp; This will result in partitioning of network &amp; will degrade performance of network. Thus routing protocol should consider residual energy of the nodes for route establishment. In modified AODV protocol first source node will determine threshold value of energy i.e. the amount of energy required to complete the communication event without any link break. The packet structure of RREQ is modified &amp; threshold value is inserted in it.&nbsp; Then we propose modified AODV algorithm which aims to maximum utilization of battery power of nodes based on residual energy of nodes.&nbsp; Simulations are performed to study the performance of energy efficient modified AODV protocol using network simulator NS2. The simulation results show better performance in terms of throughput &amp; average energy consumption as compared to existing AODV.
APA, Harvard, Vancouver, ISO, and other styles
37

Natoureah, Hutaf Salah Al-Deen, Huda Abd El-Raheem Karajeh, and Alaa' Abd El-Aziz Abu Serhan. "ASDSR: An Adaptive Stable DSR Routing Protocol for Mobile Ad-hoc Networks." International Journal of Interactive Mobile Technologies (iJIM) 14, no. 08 (2020): 164. http://dx.doi.org/10.3991/ijim.v14i08.11692.

Full text
Abstract:
&lt;p class="Abstract"&gt;Abstract—The process of finding a route between the transmitter and the receiver node in the Mobile Adhoc Networks (MANets) is a renewed issue that is becoming more and more interesting to the researchers as this type of networks grow and expand. The dynamic nature of MANET and the limited capabilities of wireless nodes in terms of memory size and battery charge are the most important obstacles to the routing (path-finding) process between nodes. In this research, we introduced a new protocol based on the well-known DSR protocol to add a mechanism that controls the RREQ Flooding process, which aims to reach more stable (life-long) routes while reducing the overhead of routing process caused by link breakage between nodes and reduce the overhead of network flooding with RREQ messages with each attempt to find a path. In this proposed mechanism, a specific group is selected from within the devices adjacent to the transmitter to be sent RREQ so that these devices are selected based on the stability evaluation criterion. The stability criterion is calculated based on three weighted factors: the speed of the node, the out-degree value (the number of adjacent nodes), and the number of tracks stored in the device memory. The proportion of devices selected is automatically changed adaptively to ensure that the expected throughput of this network is achieved. The proposed protocol was tested using simulation where results showed that ASDSR proved an enhancement in route stability about (0.13), and a decrease in the number of deleted routes by (9%), while maintaining the expected packet delivery ratio of the original DSR by about (0.86).&lt;/p&gt;
APA, Harvard, Vancouver, ISO, and other styles
38

Yamazaki, Satoshi, Yu Abiko, and Hideki Mizuno. "A Simple and Energy-Efficient Flooding Scheme for Wireless Routing." Wireless Communications and Mobile Computing 2020 (August 20, 2020): 1–9. http://dx.doi.org/10.1155/2020/8832602.

Full text
Abstract:
In many wireless networks, such as ad hoc, sensor, and delay-tolerant networks, the destination node is determined from the source node by the flooding process. Flooding efficiency is important for nodes, because they are driven by limited batteries. In this paper, we propose a simple flooding scheme to transmit a route request (RREQ) message based on the remaining power of its own node without using control packets and complex calculations. We applied the proposed scheme to ad hoc on-demand distance vector (AODV) routing protocol as an example and carried out computer simulations (ns3). The results showed that the proposed scheme was superior to conventional schemes in static and mobile scenarios. First, we showed the limit of node density that causes the decrease of throughput in the proposed scheme and that the proposed scheme was superior in terms of energy efficiency (bits/J), including throughput and energy consumption. Next, as the number of flooding times is made uniform in the proposed scheme, all nodes will have almost the same battery replacement time. As a result, when the nodes are static, the lifetime in the proposed scheme is longer than that in the conventional scheme.
APA, Harvard, Vancouver, ISO, and other styles
39

Dr. Deepak Dembla, Advin Manhar,. "Design an Improved Hybrid Routing Protocol Strategy to Minimize Delay & Overhead for MANET." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 6 (2021): 2407–19. http://dx.doi.org/10.17762/turcomat.v12i6.5685.

Full text
Abstract:
Mobile adhoc networks (MANET) are a self-coordinated wireless network that is worked without perpetual foundation and base station endorsement. In MANETs (Mobile Ad Hoc Networks) every single node activity goes about as the information source and communicator router. It notices its useful neighbours by making themselves by passing the nodes that got terminated of that correspondence range. In this paper, we designed the IHRP routing protocol with the help of combining the AODV, AOMDV and OLSR routing protocol with the network situation based routing adaptation. In the previous analysis, we identify AODV is more compatible for dynamic environment (where node motion is higher).The AOMDV routing protocol is useful for network load balancing and congestion control. OLSR is compatible for stable network which use as maximum link stability base routing. While we are designing the IHRP routing protocol through of the above (AODV, AOMDV and OLSR) protocol .We handle the network behaviour with better performance in any situation. Initially the RREP are broadcasted to find out the route. The poll of routing, select based on the network situation. The proposed IHRP start with a RREQ packet is to search the distance from its origin to its objective node. The network motion is higher than AODV protocol handle the particular situation but in any situation, while the 70% network node are stable then the route selection and transferring of data with the help of an OLSR routing protocol. The propose IHRP routing protocol also handle the network load and control the network congestion through the AOMDV routing protocol. Our proposed protocol IHRP also works in a hybrid manner while the source and destination belong in longer range such as different cluster. At that time situation based routing was followed between the clusters. We saw in the result part the comparison of IHRP and ZRP routing protocol. Execution of the improved hybrid routing protocol (IHRP) is much better than hybrid routing protocol (ZRP). In case of Packet Delivery Ratio analysis for IHRP and ZRP, we clearly show that The Packet Delivery Ratio is 97.99% by IHRP and 79.49% by ZRP, so we can say that the performance of packet delivery ratio in Improved hybrid routing protocol (IHRP) is much better than ZRP, where Improved hybrid routing protocol (IHRP) and hybrid routing protocol (ZRP) both performed the conjunction of proactive and reactive routing protocol features therefore we can say that Packet Delivery Ratio is better in improved hybrid routing protocol (IHRP) as compare to hybrid routing protocol (ZRP).&#x0D; We clearly show that the Normal Routing Load analysis for IHRP and ZRP where Normal Routing Load is 0.11% by IHRP and 4.72 % by ZRP, so we can say that performance of Improved Hybrid Routing Protocol (IHRP) in case of a Normal Routing Load is much less than the Hybrid Routing Protocol (ZRP).&#x0D; In case of overall parameter matrix (Normal Routing Load, Throughput, Packet Delivery Ratio and Average End To End Delay) the performance of Improved Hybrid Routing Protocol (IHRP) is much better than existing Hybrid routing protocol (ZRP).
APA, Harvard, Vancouver, ISO, and other styles
40

Allahham, Alaa Azmi, Muamer Mohammed, and Nassir Sallom Kadhim. "Multipath Routing Protocol Based On Cross-Layer Approach for MANET." International Journal of Interactive Mobile Technologies (iJIM) 11, no. 1 (2017): 71. http://dx.doi.org/10.3991/ijim.v11i1.6175.

Full text
Abstract:
&lt;p class="Abstract"&gt;Mobile Ad-hoc Networks (MANETs) involved in many applications, whether smart or traditional and for both civilian and military uses, and that because of their special features, where it does not depend on any infrastructure during its working, as well as the nodes in MANETs have a freedom of movement with the ability to self-configure, in addition, to working as a router or client at the same time. Moreover, MANETs considered as an infrastructure less network, so the cost of this type of networks is less in comparison to other traditional networks. On the other hand, the routing considered one of most important challenges in MANETs due to the perpetual motion and randomness of the nodes that can causing a continuous change of the network topology and thus to all paths between nodes, where finding valid paths between the nodes is the core task of routing protocols. Recently, it has been argued that the traditional layered architecture is ineffective to deal with receiving signal strength related problems. In an effort to improve the performance of MANETs, there has been increased in protocols that rely on cross-layer interaction between different layers. In this paper, a Cross-layer design among Network, MAC and Physical layers based on Threshold Multipath Routing Protocol (CTMRP) is proposed. The CTMRP is designed for decision maker based on threshold value of average paths signal for efficient transmission of the Text, image, audio and video as well as sending the data via multiple paths, which mitigate the negatives effects causes from forcing the nodes to send the data via single. The Route Discovery Delay, Number of RREQ Messages, Number of RREP Messages, End-to-End Delay, Packet Delivery Ratio (PDR), and Throughput were selected as the main performance evaluation metrics. The results show that the proposed algorithm has better performance and lead to increase stability of transmission link.&lt;/p&gt;
APA, Harvard, Vancouver, ISO, and other styles
41

B, Iswarya, and Radha B. "Reliable path identifying protocol in VANET." Indian Journal of Science and Technology 14, no. 14 (2021): 2410–19. https://doi.org/10.17485/IJST/v14i29.438.

Full text
Abstract:
Abstract <strong>Objective:</strong>&nbsp;The objective of this work is to enhance Adhoc On-demand Distance Vector (AODV) routing protocol for better communication through reliable routing scheme.<strong>&nbsp;Methods:</strong>&nbsp;In this paper, a reliable path selection algorithm is proposed to find the Most Reliable Path (MRP) between the source and destination vehicles. Reliable Path Ad-hoc On demand Distance Vector (RPAODV) is proposed for efficient route discovery in Vehicular Ad-hoc Network (VANET). The algorithm divide network into manageable group and it maintains Cluster Member (CM) updates handling, Cluster Head (CH) re-selection, Cluster merging. The efficient routing decisions would lead to better communication in VANET. It is made by assigning dynamic and static information appropriately to the variables in process. The dataset used is both static and dynamic which is efficient in when compared with existing protocols.&nbsp;<strong>Findings:</strong>&nbsp;The finding of most reliable path in the network of VANET is carried out by the proposed reliable path selection algorithm. The algorithm divides the network as various parts that comprise the information of clustering. The clustering is the mechanism of grouping of nodes into clusters. Clusters possess members and head. The cluster head would be the point of initiation of communication and any node can be re-selected as cluster head. The members of clusters would be updated as per changes in clustering mechanism. The uniqueness of the proposed algorithm revealed through easy identification of vehicles to form a cluster, cluster members maintenance, and fast data communication over the network. The proposed RPAODV adds the extra fields for RouteREQuest (RREQ) and RouteREPly (RREP) messages (CH and CM information). It also works out for static and dynamic topology in good manner by the implementation of modified AODV algorithm. The scalability is also taken care by enhancing topology variant. The performance of the algorithm is measured and analyzed with the existing protocols and posted in graphs.&nbsp;<strong>Novelty:</strong>&nbsp;The simulation results show that the proposed work outperforms 60% than the existing schemes works Cluster-based VANET-oriented Evolving Graph( CVoEG), Leapfrog-Anti-Colony Optimization(LP-ACO) in terms of route reliability (0.11s high), packet delivery ratio (20% high), end to end delay (0.5 saverage), and throughput (10 kbps high). <strong>Keywords:</strong> VANET; Routing Protocol; RPAODV; Clustering; Reliable Routing; and Cluster message
APA, Harvard, Vancouver, ISO, and other styles
42

"Cooperative Residual Battery (CORB) Resource Optimization in AODV Routing Protocol." International Journal of Recent Technology and Engineering 8, no. 6 (2020): 5560–67. http://dx.doi.org/10.35940/ijrte.f9773.038620.

Full text
Abstract:
In Ad-hoc network minimizing the energy utilization is one of the core issues in transmission of data with entail quality of service. Cooperative communication networks have been recently being studied as an alternative to MIMO wireless networks where cooperation between source destination and relay are considered. In this paper, Cooperative Residual Battery (CORB) Resource Optimization routing protocol is proposed in which the route formation in cooperative network from source to destination is established by selecting the minimum battery consuming node as relay. Packet reception ratio is considered for efficiently switching between the direct communication and cooperative communication depending on the type of scenario’s that occur in real time. The proposed work is based on the modification done on AODV protocol. The relay selection in cooperative communication is established based on least hop count and residual battery life of a node. The protocol is mainly based on selecting a helper node from a list of intermediate nodes that are consuming less energy to forward the data on to the destination. Considerable modification in Route request and Route reply packet is done in order to carry the Residual battery information of nodes that are handling the Control packets (RREQ &amp; RREP), along with the control packets, routing table is modified for managing the routing information. Simulation is carried out to assess the essence of the protocol proposed.
APA, Harvard, Vancouver, ISO, and other styles
43

Dr., Bhanu Pratap. "WIRELESS REACTIVE ROUTING PROTOCOL ISPLAY ROLES FOR THE ROUTE DISCOVERY AND MAINTENANCE IN NETWORKS." March 25, 2018. https://doi.org/10.5281/zenodo.6941463.

Full text
Abstract:
<em>In this journal paper, we are investigating experimental study of routing overhead for the reactive routing protocols as a Wireless Multi-hop facing in Networks. In this investigation we are choosing the AODV (Ad-Hoc on Demand Distance Vector), and dynamic MA-NETs. We could enhance generalized network models by adding route (links) monitoring overhead in the network. So that we will take different framework and parameters of routing protocols for the variations of route performance in network.In this journal paper my experimental study on above routing protocols with the help of simulation tools (NS-2),which is simulate to the routing protocol as well as give a brief comparison and discussion for routing protocol as a better performance in networks. The AODVs routing protocols are optimizations route to prevent flooding of network during route discovery as well as control TTL (Time 2 Live) of RREQs to search incrementally larger areas of the network. The advantage of this excremental topic is less overhead, when successful and repair links with less overhead delay and packet loss.The disadvantage is longer delay if route not found immediately and longer delay and also it will greater packet loss when unsuccessful in networks environment.</em> &nbsp;
APA, Harvard, Vancouver, ISO, and other styles
44

Bharanidharan, C., S. Malathi, and Hariprasath Manoharan. "Detection of black hole attacks in vehicle-to-vehicle communications using ad hoc networks and on demand protocols." International Journal of Intelligent Unmanned Systems, April 30, 2024. http://dx.doi.org/10.1108/ijius-02-2023-0016.

Full text
Abstract:
PurposeThe potential of vehicle ad hoc networks (VANETs) to improve driver and passenger safety and security has made them a hot topic in the field of intelligent transportation systems (ITSs). VANETs have different characteristics and system architectures from mobile ad hoc networks (MANETs), with a primary focus on vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. But protecting VANETs from malicious assaults is crucial because they can undermine network security and safety.Design/methodology/approachThe black hole attack is a well-known danger to VANETs. It occurs when a hostile node introduces phony routing tables into the network, potentially damaging it and interfering with communication. A safe ad hoc on-demand distance vector (AODV) routing protocol has been created in response to this issue. By adding cryptographic features for source and target node verification to the route request (RREQ) and route reply (RREP) packets, this protocol improves upon the original AODV routing system.FindingsThrough the use of cryptographic-based encryption and decryption techniques, the suggested method fortifies the VANET connection. In addition, other network metrics are taken into account to assess the effectiveness of the secure AODV routing protocol under black hole attacks, including packet loss, end-to-end latency, packet delivery ratio (PDR) and routing request overhead. Results from simulations using an NS-2.33 simulator show how well the suggested fix works to enhance system performance and lessen the effects of black hole assaults on VANETs.Originality/valueAll things considered, the safe AODV routing protocol provides a strong method for improving security and dependability in VANET systems, protecting against malevolent attacks and guaranteeing smooth communication between cars and infrastructure.
APA, Harvard, Vancouver, ISO, and other styles
45

Ahmad, Zulfekar, and Akhilesh Bansiya. "Reduction of Malicious Nodes using RRT and Clustering in Mobile Ad hoc Network." International Journal of Scientific Research in Computer Science, Engineering and Information Technology, November 16, 2018, 133–42. http://dx.doi.org/10.32628/cseit183839.

Full text
Abstract:
Mobile Ad-hoc Network is a collection of wireless mobile node, consists of each wireless transmitters and receivers, which dynamically forming a temporary network and communication between transmitter and receiver is by using bi-directional link. Either directly, if nodes in MANET are within communication range or indirectly means transmitter node rely on intermediate node, for forwarding data to destination node. IDS can be well-defined as the protector system which self-detects malicious activities within a network, and thus generates an alarm to alert the security device at a locality if intrusions are considered to be illegal on that network or host. There me many approach to classify IDS. In the existing work, they used fuzzy logic which decides the rules for the trust evaluation of the nodes. Rules should be defined previously which is difficult to manage for the unknown variables. This method is not suitable for the dynamic nature of the network. So we applied better technique which generates the more trustful network. In our proposed work, trust is calculated by sending the Route Request (RREQ) packets to the network then the destination node send Route Reply (RREP) packet. Calculate RTT for distance between the sender and destination nodes. We select the path by taking the shortest RTT and then form clusters. Calculate the energy of each node in cluster and select cluster head of maximum energy. Cluster head forward the data from source to destination. This method removes the chance of malicious node from the network.
APA, Harvard, Vancouver, ISO, and other styles
46

Prasad P, Rajendra, and Shiva Shankar. "Securing Energy Routing Protocol against Black Hole Attacks in Mobile Ad-Hoc Network." Recent Advances in Computer Science and Communications 13 (August 14, 2020). http://dx.doi.org/10.2174/2666255813666200814171401.

Full text
Abstract:
Introduction: The aim of the securing energy routing protocol, is to provide the countermeasures to the attacks par-ticularly to the black hole in mobile ad-hoc network, and enhancing the network performance metric throughput al-so reducing the end-to-end delay between the nodes in the network.To build the protocol that enhances the perfor-mance of the network by modifying the existing DSR protocol by introducing new route discovery mechanism in the proposed protocol. Method: The proposed protocol implementation has two phases, route request/reply phase and route confirm phas-es. During the route discovery process, the route discovery from the source to destination process are described by sending the RREQ packet from the source hub as shown in Fig. 1(a), when it does not have one accessible and crav-ings a route to a destination. The source node transmits the RREQ to its associate nodes and the destination node re-ply with RREP. When the source receives reply message, the source node respond with reverse path with a confirm RCON message and providing security to the nodes in the network. Results: To verify the performance of the proposed protocol against the existing DSR protocol are compared with respect to various network metrics like end-to-end delay and packet delivery ratio and validated the result by com-paring both routing algorithm using Network Simulator 2. Conclusion: The results of the proposed SERP strongly safeguard against the attacks in the network and the packet delivery ratio is increased compared with the DSR also the end-to-end delay is reduced in the proposed protocol. Discussion: Mobile ad-hoc networks are being dynamic in nature, it associates with issues relating to secure routing, energy and are generally vulnerable to several types of attacks. The DSR is one of the widely used reactive proto-cols available for the mobile ad-hoc network and the proposed work enhancing the security of the network in the existing pro
APA, Harvard, Vancouver, ISO, and other styles
47

JAIN, MANJHARI, AKHILESH WAOO, and P. S. Patheja. "SIMULATION AND PERFORMANCE ANALYSIS EVALUATION FOR MULTIPATH EXTENSION OF AODV TO IMPROVE END TO END DELAY, ROUTE ERROR SENT, ROUTING LOAD AND PACKET DROP RATIO." International Journal of Computer and Communication Technology, April 2015, 89–94. http://dx.doi.org/10.47893/ijcct.2015.1281.

Full text
Abstract:
This paper describes improvement in standard routing protocol AODV for mobile ad-hoc networks. Our mechanism setups multiple optimal paths based on bandwidth and delay. It allows to store multiple optimal paths based on Bandwidth and delay. At time of link failure, it will switch to next available path. To set up multiple paths, we have used the information that we get in the RREQ packet and also send RREP packet to more than one path. It reduces overhead of local route discovery at the time of link failure and because of this End to End Delay and Drop Ratio decreases. The main feature of our mechanism is that it is simple, efficient. We evaluate through simulations the performance of the AODV routing protocol including our scheme and we compare it with HLSMPRA (hot link split multi-path routing algorithm) Algorithm. Indeed, our scheme reduces routing load, End to End Delay, route error sent, and Packet drop ratio. The simulations have been performed using network simulator OPNET-14.0. The network simulator OPNET is discrete event simulation software for network simulations which means it simulates events such as sending, receiving, forwarding and dropping packets.
APA, Harvard, Vancouver, ISO, and other styles
48

"Design and Performance Analysis of a New Framework of Multipath Load Balancing Routing in Ad-Hoc Network." International Journal of Recent Technology and Engineering 8, no. 4 (2019): 12773–78. http://dx.doi.org/10.35940/ijrte.c5049.118419.

Full text
Abstract:
In the communication networks, one of the major problems in the quality of service is congestion. Indeed, the phenomenon of congestion is due to the fact that many packets emitted follow the same paths. As a result, the increase the bandwidth offered can solve the problem only in the short term. In order to solve this problem, several solutions have been proposed, such as multipath routing algorithms, which distribute traffic between a source and a destination on several different paths, while taking into account the level of saturation of the intermediaries nodes, composing the different paths with a objective to avoid cluttered paths. Its purpose is to shed the excessive burden save a knot on its neighbors to improve performance and to exploit efficiently. In this paper we have analysis the load balancing in Multipath routing to achieve better network performance. We have study and reviewed the different load balancing algorithm in multipath network and based on review we have proposed a new load balancing algorithm in the multipath network. We have modified the packet of RREP and RREQ packet to transmit and receive the route information to compute the load of every path and we added a new field in RREP packet Buffer size to store the current node and their neighbor information to find the alternate route if network load in increase we have compare the performance of proposed protocol with the LB-AOMDV, SMR &amp; AOMDV multipath routing protocols. NS2 is used for simulation
APA, Harvard, Vancouver, ISO, and other styles
49

Hamim, Saiful. "EFISIENSI RUTE PADA ROUTING AODV MENGGUNAKAN ALGORITMA PATH AWARE SHORT." Indexia 1, no. 2 (2021). http://dx.doi.org/10.30587/indexia.v1i2.2540.

Full text
Abstract:
Node-node pada MANET dapat berhubungan satu sama lain apabila mereka berada pada jangkauan transmisinya. Apabila bergerak menjauh diluar jangkauan transmisi maka link antara dua buah node dapat terputus pada saat proses pengiriman route request (RREQ). Dengan terputusnya suatu link, maka akan menyebabkan terputusnya sebuah rute yang ada dan juga dengan terputusnya link tertentu menyebabkan proses route discovery perlu dilakukan kembali sehingga mobilitas pada node merupakan masalah yang perlu untuk diperhatikan apabila ingin membentuk jaringan yang stabil. Efisiensi rute pada routing AODV menggunakan algoritma path aware short dengan parameter average End-to-end delay, energy, dan packet delivery ratio (PDR). efisiensi rute menggunakan path aware short mengalami keberhasilan dengan parameter average end to end delay untuk 100 node dengan network area 500 m2 x 500 m2 yaitu 5,1087 m/s. Karena selang waktu yang dibutuhkan lebih pendek dan tidak membebani link (kemungkinan kecil terputus). Dampak yang didapat dari efisiensi delay mengakibatkan semakin banyak paket RREQ yang dikirim, mengakibatkan peluang tabrakan antar paket semakin besar, menyebabkan hilangnya paket data yang drop, dikarenakan node pengirim akan lebih banyak melakukan broadcast paket routing pada proses route discovery (RREQ dan RREP) untuk mendapatkan rute yang baru. Dapat dilihat pada parameter packet delivery ratio nilai terbaik pada routing AODV dengan 50 node area 500x500, 100 node area 500x500, 50 node area 1000x1000 dengan nilai 100%. Sedangkan Untuk parameter energy yang sedikit dalam konsumsi energy yaitu pada protokol routing AODV dengan 100 node area 1000x1500 dengan nilai 10,7794 joule.
APA, Harvard, Vancouver, ISO, and other styles
50

M, Sangeetha, Parvathy S, Deiwakumari K, Veena T, and Badrinarayan D. "Enhanced Energy efficient routing protocol for OnDemand distance vector routing to improve communication in border area Military communication." International Journal of Computational and Experimental Science and Engineering 10, no. 4 (2024). http://dx.doi.org/10.22399/ijcesen.492.

Full text
Abstract:
Soldiers get rescue services through static wireless node heliports and medical ambulance to provide special service, in a battle field. The Mobile Ad hoc Network environment takes wireless communication across border communication to connects the source of multiple serves in military applications. The mobile node acts as mobile equipment to rescue the soldier. Due to increasing delay tolerance and latency overhead the performance eon network is degraded, to resolve this problem , this paper concentrates on Region and Mobility based Route Request Processing in AODV (RMRRP) is proposed in controlling Route Request Processing mechanism based on node mobility for reducing the routing overhead in AODV. The routing algorithm which guarantees services to the soldier in a shortest time also evaluate the energy efficiency of RMRRP with the existing AODV, DSDV, DSR routing algorithms. Efficiently reduce the overall overhead to a considerable level and significantly improve the overall performance by finding a rectangular region as a forwarding zone and only the nodes within the rectangular region are allowed to forward the RREQ message from source to the destination, hence the overhead in establishment of a stable shortest path gets reduced very much. Network region is minimized. Routing request packets generated is less and route request is reduced. Region width is limited to 150m and within that covered area only route discovery and route maintenance is carried out. Control packets are reduced within the limited rectangular region and data packets are able to send more. Avoiding link breaks to send and receive more data packets with a limited number of control packets hence consumes considerable energy. Simulation result reveals that with nodes 50 the Packet delivery Fraction is 90.60 , Routing overhead is 11376, Normalized Routing Load is 3.61 , Throughput is 261.94Kbps, MAC Load is 39.17 , Energy consumption is 4.64 Joules.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!