On-demand source routing with reduced packets protocol in mobile ad-hoc networks

Omar, Mawloud; Hedjaz, Sabrine; Rebouh, Souhila; Aouchar, Katia; Abbache, Bournane; Tari, Abdelkamel

doi:10.1016/j.aeue.2015.06.009

Cited by 16 publications

(17 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the use of accessible bandwidth criterion for nodes, the proposed method could deliver more packages to destination; thus, this protocol yields better results than two previous protocols. The obtain results according to figure (3) show that increased mobility of nodes has not considerable effect in delay mean. The reason is that the probability of finding a node in neighborhood to a node will be more; thus, the establishment of a path between source and destination becomes rapid and this decreases the delay in delivery of the package to destination; however, the proposed method has more delay compared to two other protocols.…”

Section: Evaluation Of Efficiency and Practical Resultsmentioning

confidence: 59%

Improving DSR Protocol Using Genetic Algorithms in ad hoc Mobile Networks

2016

IJCCIE

View full text Add to dashboard Cite

Abstract-Ad hoc mobile networks are a special kind of computer networks that have no pre-defined infrastructure. In this kind of networks, nodes can freely move in any direction. Due to mobility of nodes, routing in this kind of networks has always been problematic. Most existing protocols use simple algorithms and criteria for routing; while there are other important criteria for path selection. To remove these deficiencies, the existing protocols should be optimized using some algorithms. In this paper, the proposed method is consisted of three phases of path discovery, path selection and repair and maintenance. After path discovery in the source node, the obtained path will be optimized using genetic algorithm and used for sending the data packages. The results of simulation showed that throughput, rate of package delivery and the assumed energy have improved compared to two other protocols. However, in terms of mean of end-to-end delay, DSR acts better than proposed model. The reason is the time spent for processing for selection of optimum path.

show abstract

Section: Evaluation Of Efficiency and Practical Resultsmentioning

confidence: 59%

Improving DSR Protocol Using Genetic Algorithms in ad hoc Mobile Networks

2016

IJCCIE

View full text Add to dashboard Cite

show abstract

“…In this article, the major factor that is taken for consideration is link stability. Few works proposing route stability by means of applying stable links are discussed in Reference 6–11 …”

Section: Related Workmentioning

confidence: 99%

Token system‐based efficient route optimization in mobile ad hoc network for vehicular ad hoc network in smart city

Sultanuddin

Hussain

2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Mobile ad hoc network (MANET) is a well-known wireless hoc network, which several nodes combined together to form a network. These nodes do not have any structure that forms network by self-configuring. In the global area, MANET is one of the popular technologies. At present, the most important real-time challenge in MANET is efficient routing. This is because of dynamic topology and resource constraints. Several existing researcher's workfare were done in an achieving efficient routing mechanism. In our work, we propose a token agent-based route planning protocol for achieving reliable routing. Vehicular ad hoc network (VANET) is advanced concept of the MANET. VANET can be performed in various smart cities, and it travels each city from source to destination. This token system consists of a token agent that monitors and operates the whole network. The tokens are responsible for collecting nodes activity details such as mobile node energy, node location, and speed. Later, its current and previous information is up-to-date and inmate to the token agent for further process in the network. Our proposed routing protocol is well applicable for typical application and a multimedia application. In order to transfer typical packets, our proposed scheme finds the shortest path based on the collect the information.

show abstract

“…Thus, the change in packet size can change the overall network performance. Also, the performance depends on the maximum transfer unit (MTU) of packets; packets whose size is less than MTU create overhead in the network (Omar et al, 2015). However, for the larger packets where size exceeds the network's maximum packet size, it requires a proper mapping function that operates segmentation and reassembly for appropriate packet transfer.…”

Section: Introductionmentioning

confidence: 99%

Effect of data packet size on the performance of RIP and OSPF routing protocols in hybrid networks

Jain

Payal

Jain

2021

IJPCC

View full text Add to dashboard Cite

Purpose The purpose of this study is to calculate the effect of different packet sizes 256, 512, 1,024 and 2,048 bytes on a large-scale hybrid network and analysis and identifies which routing protocol is best for application throughput, application delay and network link parameters for different packet sizes. As the routing protocol is used to select the optimal path to transfer data packets from source to destination. It is always important to consider the performance of the routing protocol before the final network configuration. From the literature, it has been observed that RIP (Routing Information Protocol) and OSPF (Open Shortest Path First) are the most popular routing protocols, and it has always been a challenge to select between these routing protocols, especially for hybrid networks. The efficiency of routing protocol mainly depends on resulting throughput and delay. Also, it has been observed that data packet size also plays an essential role in determining the efficiency of routing protocol. Design/methodology/approach To analyse the effect of different packet sizes using two routing protocols, routing information protocol (RIP) and open shortest path first (OSPF) on the hybrid network, require detailed planning. Designing the network for simulate and then finally analysing the results requires proper study. Each stage needs to be understood well for work accomplishment. Thus, the network’s simulation and evaluation require implementing the proposed work step by step, saving time and cost. Here, the proposed work methodology is defined in six steps or stages. Findings The simulation results show that both routing protocols – RIP and OSPF are equally good in terms of network throughput for all different packet sizes. However, OSPF performs better in terms of network delay than RIP routing protocol in different packet size scenarios. Research limitations/implications In this paper, a fixed network of 125 objects and only RIP and OSPF routing protocol have been used for analysis. Therefore, in the future, a comparison of different network sizes can be considered by increasing or decreasing the number of objects in the proposed network. Furthermore, the other routing protocols can be used for performance evaluation on the same proposed network. Originality/value The analysis can be conducted by simulation of the network, enabling us to develop a network environment without restricting the selection of parameters as it minimizes cost, network deployment overhead, human resources, etc. The results are analysed, calculated and compared for each packet size on different routing protocol networks individually and the conclusion is made.

show abstract

On-demand source routing with reduced packets protocol in mobile ad-hoc networks

Cited by 16 publications

References 10 publications

Improving DSR Protocol Using Genetic Algorithms in ad hoc Mobile Networks

Improving DSR Protocol Using Genetic Algorithms in ad hoc Mobile Networks

Token system‐based efficient route optimization in mobile ad hoc network for vehicular ad hoc network in smart city

Effect of data packet size on the performance of RIP and OSPF routing protocols in hybrid networks

Contact Info

Product

Resources

About