Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userModeling and Evaluating Performance of Routing Operations in Proactive Routing Protocols
378
0
0.0
(
0
)
Added by
Dr. Nadeem Javaid
Publication date
2013
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
To ensure seamless communication in wireless multi-hop networks, certain classes of routing protocols are defined. This vary paper, is based upon proactive routing protocols for Wireless multihop networks. Initially, we discuss Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR), precisely followed by mathematical frame work of control overhead regarding proactive natured routing protocols. Finally, extensive simulations are done using NS 2 respecting above mentioned routing protocols covering mobility and scalability issues. Said protocols are compared under mobile and dense environments to conclude our performance analysis.
rate research
Read More
Reactive routing protocols are gaining popularity due to their event driven nature day by day. In this vary paper, reactive routing is studied precisely. Route request, route reply and route maintenance phases are modeled with respect to control overhead. Control overhead varies with respect to change in various parameters. Our model calculates these variations as well. Besides modeling, we chose three most favored reactive routing protocols as Ad-Hoc on Demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Dynamic MANET on Demand (DYMO) for our experiments. We simulated these protocols using ns-2 for a detailed comparison and performance analysis with respect to mobility and scalability issues keeping metrics of throughput, route delay and control over head. Their performances and comparisons are extensively presented in last part of our work.
In this paper, a framework is presented for node distribution with respect to density, network connectivity and communication time. According to modeled framework we evaluate and compare the performance of three routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Fisheye State Routing (FSR) in MANETs and VANETs using two Mac-layer protocols; 802.11 and 802.11p. We have further modified these protocols by changing their routing information exchange intervals; MOD AODV, MOD DSR and MOD FSR. A comprehensive simulation work is performed in NS-2 for the comparison of these routing protocols for varying mobilities and scalabilities of nodes. To evaluate their efficiency; throughput, End-to-End Delay (E2ED) and Normalized Routing Load (NRL) of these protocols are taken into account as performance parameters. After extensive simulations, we observe that AODV outperforms both with MANETs and VANETs.
The ever-continuing explosive growth of on-demand content requests has imposed great pressure on mobile/wireless network infrastructures. To ease congestion in the network and increase perceived user experience, caching popular content closer to the end-users can play a significant role and as such this issue received significant attention over the last few years. Additionally, energy efficiency is treated as a fundamental requirement in the design of next-generation mobile networks. However, there has been little attention to the overlapping area between energy efficiency and network caching especially when considering multipath routing. To this end, this paper proposes an energy-efficient caching with multipath routing support. The proposed scheme provides a joint anchoring of popular content into a set of potential caching nodes with optimized multi-path support whilst ensuring a balance between transmission and caching energy cost. The proposed model also considers different content delivery modes, such as multicast and unicast. Two separated Integer-Linear Programming (ILP) models are formulated for each delivery mode. To tackle the curse of dimensionality we then provide a greedy simulated annealing algorithm, which not only reduces the time complexity but also provides a competitive performance as ILP models. A wide set of numerical investigations has shown that the proposed scheme is more energy-efficient compared with other widely used approaches in caching under the premise of network resource limitation.
An energy efficient routing protocol is the major attentiveness for researcher in field of Wireless Sensor Networks (WSNs). In this paper, we present some energy efficient hierarchal routing protocols, prosper from conventional Low Energy Adaptive Clustering Hierarchy (LEACH) routing protocol. Fundamental objective of our consideration is to analyze, how these ex- tended routing protocols work in order to optimize lifetime of network nodes and how quality of routing protocols is improved for WSNs. Furthermore, this paper also emphasizes on some issues experienced by LEACH and also explains how these issues are tackled by other enhanced routing protocols from classi- cal LEACH. We analytically compare the features and performance issues of each hierarchal routing protocol. We also simulate selected clustering routing protocols for our study in order to elaborate the enhancement achieved by ameliorate routing protocols.
Routing plays a fundamental role in network applications, but it is especially challenging in Delay Tolerant Networks (DTNs). These are a kind of mobile ad hoc networks made of e.g. (possibly, unmanned) vehicles and humans where, despite a lack of continuous connectivity, data must be transmitted while the network conditions change due to the nodes mobility. In these contexts, routing is NP-hard and is usually solved by heuristic store and forward replication-based approaches, where multiple copies of the same message are moved and stored across nodes in the hope that at least one will reach its destination. Still, the existing routing protocols produce relatively low delivery probabilities. Here, we genetically improve two routing protocols widely adopted in DTNs, namely Epidemic and PRoPHET, in the attempt to optimize their delivery probability. First, we dissect them into their fundamental components, i.e., functionalities such as checking if a node can transfer data, or sending messages to all connections. Then, we apply Genetic Improvement (GI) to manipulate these components as terminal nodes of evolving trees. We apply this methodology, in silico, to six test cases of urban networks made of hundreds of nodes, and find that GI produces consistent gains in delivery probability in four cases. We then verify if this improvement entails a worsening of other relevant network metrics, such as latency and buffer time. Finally, we compare the logics of the best evolved protocols with those of the baseline protocols, and we discuss the generalizability of the results across test cases.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
