scholarly journals Congestion aware overlay network

2021 ◽  
Author(s):  
Md. Moinuddin Bhuiyan
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Fundamental Problem ◽  
Mobility Model ◽  
Packet Losses ◽  
Key Characteristics ◽  
Wireless Medium ◽  
Mobile Ad Hoc ◽  
The Impact

Advances in wireless technology and mobile computing have provided a major impetus towards development of P2P network over MANET. Both peer-to-peer overlays and mobile ad-hoc network share the key characteristics of self-organizing and decentralization; both need to solve same fundamental problem, that is, how to route queries or packets efficiently. Congestion affecting the performance of P2P overlay on wireless ad-hoc network occurs not only due to buffer overflow but also due to error prone nature of the wireless medium used and the mobility of users. When paths of multiple downloading sessions intersect with each other, they mutually cause congestion for each other that result in packet drops. We identified that P2P MANET suffers query performance primarily due to significant congestion during download session. The unawareness of congestion in P2P MANET system may lead to the longer user response time, high overhead and many packet losses. In order to alleviate the congestion problem, we propose a modification to RAON, CANON, which includes congestion awareness for improving the RAON performance. We evaluated our system through simulation, which shows that CAON improves the performance of query success rate, query delay, packet losses significantly. We also evaluated the impact of mobility model on our system by simulating under both Random way point mobility model and Manhattan mobility model.

scholarly journals Congestion aware overlay network

2021 ◽  
Author(s):  
Md. Moinuddin Bhuiyan
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Fundamental Problem ◽  
Mobility Model ◽  
Packet Losses ◽  
Key Characteristics ◽  
Wireless Medium ◽  
Mobile Ad Hoc ◽  
The Impact

Advances in wireless technology and mobile computing have provided a major impetus towards development of P2P network over MANET. Both peer-to-peer overlays and mobile ad-hoc network share the key characteristics of self-organizing and decentralization; both need to solve same fundamental problem, that is, how to route queries or packets efficiently. Congestion affecting the performance of P2P overlay on wireless ad-hoc network occurs not only due to buffer overflow but also due to error prone nature of the wireless medium used and the mobility of users. When paths of multiple downloading sessions intersect with each other, they mutually cause congestion for each other that result in packet drops. We identified that P2P MANET suffers query performance primarily due to significant congestion during download session. The unawareness of congestion in P2P MANET system may lead to the longer user response time, high overhead and many packet losses. In order to alleviate the congestion problem, we propose a modification to RAON, CANON, which includes congestion awareness for improving the RAON performance. We evaluated our system through simulation, which shows that CAON improves the performance of query success rate, query delay, packet losses significantly. We also evaluated the impact of mobility model on our system by simulating under both Random way point mobility model and Manhattan mobility model.

scholarly journals Impact of Energy and Mobility on MANETs Routing Protocols: AODV and DSR

2019 ◽  
Vol 8 (10) ◽  
pp. 2346-2352
Keyword(s):  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Performance Metrics ◽  
Mobility Model ◽  
Traffic Patterns ◽  
Energy Models ◽  
Mobile Ad Hoc ◽  
The Impact

Routing protocols can be tested in realistic conditions of Mobile Ad-hoc network (MANET)). The performance of MANET depends on different parameters such as used number of nodes, mobility speed, routing protocols, mobility model and energy models etc. In this paper, researchers made an effort to analyze the impact of energy and mobility on the performance of AODV and DSR routing protocols with varying mobility speed under random waypoint mobility model and radio energy models in the MANET. Detailed simulations have been carried out using QualNet simulator for 50 nodes. Performance of AODV and DSR routing protocols has been analyzed under the premise of performance metrics namely average throughput, average end to end delay and average jitter using CBR traffic patterns.

Localization and Non-Localization Node Identification Using Dream in MANET

2016 ◽  
Vol 2 (2) ◽  
Author(s):  
Amit Singh ◽  
Nitin Mishra ◽  
Angad Singh
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Fundamental Problem ◽  
Identification Algorithm ◽  
Mobile Nodes ◽  
Position Information ◽  
Location Services ◽  
Wireless Router ◽  
Mobile Ad Hoc

 A Wireless Mobile Ad-hoc Network consists of variety of mobile nodes that temporally kind a dynamic infrastructure less network. To modify communication between nodes that don’t have direct radio contact, every node should operate as a wireless router and potential forward knowledge traffic of behalf of the opposite node. In MANET Localization is a fundamental problem. Current localization algorithm mainly focuses on checking the localizability of a network and/or how to localize as many nodes as possible. It could provide accurate position information foe kind of expanding application. Localization provide information about coverage, deployment, routing, location, services, target tracking and rescue If high mobility among the mobile nodes occurs path failure breaks. Hence the location information cannot be predicted. Here we have proposed a localization based algorithm which will help to provide information about the localized and non-localized nodes in a network. In the proposed approach DREAM protocol and AODV protocol are used to find the localizability of a node in a network. DREAM protocol is a location protocol which helps to find the location of a node in a network whereas AODV is a routing protocol it discover route as and when necessary it does not maintain route from every node to every other. To locate the mobile nodes in a n/w an node identification algorithm is used. With the help of this algorithm localized and non-localized node can be easily detected in respect of radio range. This method helps to improve the performance of a module and minimize the location error and achieves improved performance in the form of UDP packet loss, received packet and transmitted packets, throughput, routing overhead, packet delivery fraction. All the simulation done through the NS-2 module and tested the mobile ad-hoc network.

scholarly journals Reducing Packet Losses in Mobile Ad Hoc Network Using the Warning Message Generated from a Routing Node

2015 ◽  
Vol 62 (2) ◽  
pp. 141-145 ◽  
Author(s):  
Rezvi Shahariar ◽  
Abu Naser
Keyword(s):  
Energy Level ◽  
Total Energy ◽  
Packet Loss ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Critical Energy ◽  
Packet Losses ◽  
Warning Message ◽  
Mobile Ad Hoc

In mobile ad hoc network communication is performed usually by using only send and receive messages and every node is powered by limited energy from low capacity battery. Every send or receive message takes particular amount of energy from the node. So node’s total energy level gradually decreases each time while it is sending or receiving something. In this way node will die out and packets coming from the source will be dropped since one of the routing node on the current route is no longer functioning. These packet loss events are observed and minimized in this paper. In the proposed approach, when source receives Warning Message from any routing node on the ongoing route then it will stop sending packets on the ongoing route. Critical energy level of routing node has been defined to generate a Warning Message when routing node’s energy level reduces to critical energy level. DOI: http://dx.doi.org/10.3329/dujs.v62i2.21979 Dhaka Univ. J. Sci. 62(2): 141-145, 2014 (July)

Security Management in Mobile Ad Hoc Networks

2021 ◽  
pp. 251-265
Author(s):  
Jhum Swain
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Secure Routing ◽  
Main Challenge ◽  
Secure Routing Protocol ◽  
Wireless Medium ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Secured Communication

A mobile ad hoc network (MANETs) is an assortment of a variety of portable nodes that are linked collectively in a greater number in a wireless medium that has no permanent infrastructure. Here, all the nodes in the node partake in acting as both router and host and is in charge for accelerating packets to other nodes. This chapter discusses the various attacks on different layers and on various security protocols. So, designing a secure routing protocol is a main challenge in MANET. As we all know, this is a mobile ad hoc network so nodes in the network dynamically establish paths among each other so it is vulnerable to different kinds of threats. So, in this case, we need secured communication among the nodes present in the network.

Issues Related to Network Security Attacks in Mobile Ad Hoc Networks (MANET)

2015 ◽  
pp. 234-256 ◽  
Author(s):  
Rakesh Kumar Singh
Keyword(s):  
Ad Hoc Network ◽  
Network Architecture ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Resource Constraints ◽  
Dynamic Network ◽  
Communication Devices ◽  
Wireless Medium ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Ad Hoc Network (MANET) is a collection of communication devices or nodes that wish to communicate without any fixed infrastructure. The nodes in MANET themselves are responsible for dynamically discovering other nodes to communicate. A number of challenges like open peer-to-peer network architecture, stringent resource constraints, shared wireless medium, dynamic network topology etc. are posed in MANET. In this research, we identify the existent security threats an ad hoc network faces, the security services required to be achieved and the countermeasures for attacks in each layer. To accomplish our goal, we have done literature survey in gathering information related to various types of attacks and solutions, as well as we have made comparative study to address the threats in different layers. Finally, we have identified the challenges and proposed solutions to overcome them. There is no general algorithm that suits well against the most commonly known attacks such as wormhole, rushing attack, etc.

scholarly journals Improvement of Performance Metrics and Security of AODV Routing Protocol using Central Dogma of Molecular Biology Based DNA Cryptography

2020 ◽  
Vol 9 (4) ◽  
pp. 2613-2620
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Central Dogma ◽  
Wormhole Attack ◽  
Dna Cryptography ◽  
Mobile Ad Hoc ◽  
The Impact ◽  
Aodv Routing Protocol

Mobile ad hoc network is appealing mechanization in many applications, including disaster recovery and communication systems and rescue due to the flexibility offered by the diverse network. An equivalent network, although it has been found that legitimate can operate independently, or may link to the wider Internet. A framework has been introduced in recent years operators and attackers, have used this network environment. Mobile Ad hoc Network is the main concern about dynamic routing access. Mobile ad hoc network provides several well-known protocols for routing responsive like DSR, AODV, TORA, etc. AODV can route both unicast and multicast. AODV routing protocol cannot protect against a wormhole attack. In this paper, we implement a technique of pseudo-DNA cryptography, focused on the molecular biology’s central dogma. In this approach, we simulate the central dogma's transcription and translation process, and even some extra features to make it difficult to crack the resulting ciphertext and defense against wormhole attack. In the sense of ratio for packet drop, throughput and the delay between two nodes we also examine the impact of the wormhole attack on a parameter of ad hoc network.

Sign in / Sign up

Export Citation Format

Share Document