Scheduling Algorithm for Real Time Applications in Mobile ad hoc Network With Opnet Modeler

Rukmani, P.; Ganesan, R.

doi:10.1016/j.proeng.2013.09.080

Cited by 13 publications

(6 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Scheduling algorithms basically classifies and categorizes high priority-based real time applications to enhance the efficient delivery of realtime packets in the channel. In paper [11] five types of such scheduling algorithms are examined under real time traffic condition. They are First-In-First-Out (FIFO) Scheduling Algorithm, Priority Queuing Algorithm, Weighted Fair Queuing (WFQ) Algorithm, Class Based Weighted Fair Queuing (CBWFQ) Algorithm and Low Latency Queuing (LLQ) Algorithm.After simulation was done in OPNET, the results were compared and evaluated for the following parameters for the above five algorithms.a.Voice traffic receivedb.…”

Section: Literature Reviewmentioning

confidence: 99%

Manet Routing Protocols on Network Layer in Realtime Scenario

Rath¹,

Pattanayak²,

Pati³

2016

IJCI

View full text Add to dashboard Cite

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Manet Routing Protocols on Network Layer in Realtime Scenario

Rath¹,

Pattanayak²,

Pati³

2016

IJCI

View full text Add to dashboard Cite

show abstract

“…In the network, the data is encapsulated into packets where each packet contains the source address, destination addresses and other routing information (Rukmani and Ganesan, 2013;Alotaibi and Mukherjee, 2012). These packets are fixed or variable in size and their size can affect the network's performance.…”

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

“…It will monitor the queuing fluctuations in various circumstances and also increase the network's performance. Advancement in the multimedia and Internet applications has necessitated the importance of studying the scheduling algorithms for providing the QoS assurances with respect to delay, jitter, assured rate and fairness among the various sessions (Rukmani & Ganesan, 2013).…”

Section: Introductionmentioning

confidence: 99%

Enhanced Low Latency Queuing Algorithm for Real Time Applications in Wireless Networks

Rukmani¹,

Ganesan²

2016

IJTech

Self Cite

View full text Add to dashboard Cite

In recent times, the demand for the real time audio and video applications in wireless networks is very high due to widespread use of latest wireless communication technologies. Many of these applications require different Quality of Service (QoS) in terms of delay and throughput in the resource constrained wireless networks. In order to handle the resources effectively and to increase the QoS, proper packet scheduling algorithms need to be developed. Low-latency Queuing (LLQ) is a packet scheduling algorithm which combines Strict Priority Queuing (SPQ) to Class-Based Weighted Fair Queuing (CB-WFQ). LLQ places delay sensitive applications such as voice and video in the SPQ and treat them preferentially over other traffic by allowing the application to be processed and sent first from the SPQ. In this paper, an Enhanced LLQ (ELLQ) is proposed. An additional SPQ is introduced for scheduling the video applications separately along with the dedicated SPQ for voice applications. The performance of the proposed algorithm is compared with other existing algorithms through simulations using the OPNET modeler. Simulation and Statistical results show that the proposed algorithm has given 1.5 times performance improvement in terms of throughput and delay than the existing algorithms for the real time audio and video applications.

show abstract

Scheduling Algorithm for Real Time Applications in Mobile ad hoc Network With Opnet Modeler

Cited by 13 publications

References 11 publications

Manet Routing Protocols on Network Layer in Realtime Scenario

Manet Routing Protocols on Network Layer in Realtime Scenario

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

Enhanced Low Latency Queuing Algorithm for Real Time Applications in Wireless Networks

Contact Info

Product

Resources

About