Enhanced Route Discovery Mechanism of Ad-Hoc On Demand Distance Vector for MANET

Nouh, May Sayed A.; Elramly, Salwa; Zaki, Mas'ud Mohd; Elsayed, Husein A. A.

doi:10.22247/ijcna/2016/48904

Cited by 2 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Self-organizing network of numerous wireless cellular nodes for the preservation of dynamic topology constitutes Mobile Ad-hoc Network (MANET). MANET is a type of ad hoc network that can change locations and configure itself on the go [1,2]. Because MANETS are mobile, they use wireless connections to connect to various networks.…”

Section: Introductionmentioning

confidence: 99%

Optimal Node Routing Layouts in Mobile Adhoc Network

Mittal

2024

IJSREM

View full text Add to dashboard Cite

Mobile Adhoc Network (MANET) is a self-organizing network of various network devices responsible for communication. In MANET, new layouts are adopted for energy optimization, security implementation, traffic minimization and overhead reduction. MANET are aggressive in nature. This requires modification in network routing protocols for performance enhancement. This paper presents the detailed survey of different layouts involved in the implementation of network routing protocols in MANET. The survey is classified into four phases involved in MANET routing applications namely- routing protocols, neighborhood discovery, distributed or centralized hash tables, and bloom filter. Firstly, the classification of routing protocols based on various traffic models presents the MANET configuration. Secondly, a neighborhood discovery mechanism conveys the enhancement in the routing configurations. Thirdly, application of hash table operation (distributed/ centralized) to MANET to improve the matching efficiencies and computational speed. Finally, the application of bloom filter concept to improve service discovery rate and reduce the fake identities. Traditionally, the unpredictability occurs during the prediction of optimal node routing due to the dynamic nature of the MANET. Moreover, the presence of ejected malicious node in another cluster disgraced the link stability. This survey conveys the problems such as storage overhead, mobility nature, malicious nodes, and false positive rates in the traditional methods. The detailed survey leads to the stone of integration of Distributed Hash Table (DHT) with a bloom filter to reduce the problems in traditional research works. Index Terms – Performance Optimization, Bloom Filter, Centralized Hash Table (CHT), Distributed Hash Table (DHT), Energy Consumption, Mobile Ad- hoc Network (MANET), Quality of Service (QoS), Routing.

show abstract

Section: Introductionmentioning

confidence: 99%

Optimal Node Routing Layouts in Mobile Adhoc Network

Mittal

2024

IJSREM

View full text Add to dashboard Cite

show abstract

“…As [1] explain, to make an accurate routing decision, the routing algorithm must choose some criteria for making routing decision. Some of such metrics include bandwidth, number of hop counts, and transmission power.…”

Section: Introductionmentioning

confidence: 99%

Congestion Aware Packet Routing for Delay Sensitive Cloud Communications

Nyangaresi¹,

Abeka²,

Ogara³

2017

ijcna

View full text Add to dashboard Cite

-In the recent years, many organizations have turned to cloud technology to support their information technology services.The cloud servers are therefore increasingly holding huge and sensitive information belonging to diverse groups of individuals and companies. Additionally, some organizations employ the cloud to provide them with online backup services. One of the most outstanding requirements for cloud customers is availability -the customers must be able to access their information and other resources stored in the cloud any time and from anywhere on the globe. This means that there should be efficient network design such that any delays are averted. The connection between the customer and the cloud can therefore be regarded as delay senstive. Network congestions often lead to delays and packet losses. Transmission control protocol employs four congestion control algorithms -slow start, congestion avoidance, fast retransmit and fast recovery, all of which fail to meet the requirements of delay intolerance. Transmission control protocol pacing has been suggested as a possible solution to delays and packet dropping in computer networks. However, the conventional pacing is static in nature, meaning that constant pauses are introduced between packet transmissions to prevent bursty transmissions which can lead to delays at the receiver buffers. This paper therefore presents a congestion aware packet routing where the delay period is hinged on the prevailing network conditions. This dynamic pacing algorithm was designed and implemented in Spyder using Python programming language. It employed probe signals to gather network intelligence such as the applicable round trip times of the network. Thereafter, this network intelligence was employed to tailor the paces to these network conditions. The results obtained showed that this algorithm introduced longer paces when more packets are transmitted and shorter paces when few packets are transmitted. In so doing, this new algorithm gives enough time for large packets to be delivered and smaller paces when few packets are sent. The analysis was done in terms of bandwidth utilization efficiency, round trip times and congestion window size adjustments. The congestion window -time graphs and throughput -time graphs showed that the developed dynamic pacing algorithm adjusted quickly to network congestions hence ensuring that the network is efficiently utilized by averting delays.

show abstract

Enhanced Route Discovery Mechanism of Ad-Hoc On Demand Distance Vector for MANET

Cited by 2 publications

References 5 publications

Optimal Node Routing Layouts in Mobile Adhoc Network

Optimal Node Routing Layouts in Mobile Adhoc Network

Congestion Aware Packet Routing for Delay Sensitive Cloud Communications

Contact Info

Product

Resources

About