Performance comparison of scheduling algorithms in network mobility environment

Wang, Yaning; Fan, Linghang; He, Dan; Tafazolli, Rahim

doi:10.1016/j.comcom.2007.11.017

Cited by 8 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Advertisements are used to suggest a route to the destination, and solicitation is used to ask for information to the destination [12]. For a network with asymmetric links, A4LP [13], [10] introduced a limited packet forwarding technique. The receiver must qualify a pre-set fitness value by the sender before rebroadcasting a packet.…”

Section: Background and Related Workmentioning

confidence: 99%

An Efficient Gateway Routing Scheme for Disaster Recovery Scenario

Mahiddin

Sarkar

2019

2019 International Conference on Information Networking (ICOIN)

View full text Add to dashboard Cite

Natural disaster can strike at any time and in any place. Once it has occurred, it can ruin large regions, cause damage to houses and buildings, and destroy physical communication infrastructure. Therefore, a network backup is required in the disaster recovery area because victims will want to contact their important person to update the current situation as soon as possible. A mobile ad hoc network (MANET) is a collection of mobile devices that dynamically communicate with each other without any physical infrastructure. This feature offers a solution for communication problems during disaster recovery and keeping communication in disaster recovery areas alive. In this paper, an efficient routing scheme (GWRS) is proposed to eliminate the congestion that occurs when people in a disaster recovery area want to connect to a network. This new scheme provides a flexible and feasible approach in determining the best route. The routing scheme will simplify the selection of routes and prevent nodes from broadcasting packets to the entire network. In addition, this scheme eradicates any redundant nodes in each level of the routing table. These schemes have been simulated in a realistic environment of disaster recovery area. Ad-Hoc On-Demand Distance Vector (AODV) and Destination Sequenced Distance Vector (DSDV) routing schemes were also selected to be simulated in the same environment because these schemes show the best performance for reactive and proactive categories in emergency scenarios. Then, the performance of the proposed scheme was compared to these two schemes and evaluated through computer simulations using OMNET++ simulation tools. The results have shown that our proposed method has better results.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

An Efficient Gateway Routing Scheme for Disaster Recovery Scenario

Mahiddin

Sarkar

2019

2019 International Conference on Information Networking (ICOIN)

View full text Add to dashboard Cite

show abstract

“…The first category consists of the schedulers which aim to provide a guaranteed rate for each traffic flow such as Idealized Wireless Fair Queuing (IWFQ) [4], Channel condition Independent Fair Queuing (CIF-Q) [5] and Server Based Fairness Approach (SBFA) [6]. All these schemes are developed on the same basis; they emulate a Generalized Processor Sharing (GPS) scheduler [7] in an error free environment and they use it as a reference model for the actual rate allocation.…”

Section: Related Workmentioning

confidence: 99%

A Delay Optimal Scheduling Policy for Real Time Services in WCDMA Systems

Komnakos

Skoutas

Vouyioukas

et al. 2010

Wireless Pers Commun

View full text Add to dashboard Cite

Enhanced Uplink operation of WCDMA-UMTS systems utilizes fast Node B scheduling and a short Transmission Time Interval (TTI) of 2 ms. The scheduling decisions are based on Scheduling Information (SI) sent from each User Equipment (UE) to the Node B. The weakness of the existing scheduling framework is that the SI does not include information regarding the delay sensitivity of each traffic flow, as well as the actual delay that the buffered data have experienced, especially for real-time services. In this paper, we propose the inclusion of such information in SI by introducing modifications into the respective 3GPP specifications. Thus, we propose a Delay Aware Channel Prioritization (DACP) criterion optimized for real-time services. Furthermore, we propose a DACP-based packet Scheduler (DACP-S) which is able to dynamically manage the Enhanced Dedicated Channel's (E-DCH) transmissions and offer Quality of Service differentiation. The performance of the proposed scheme is evaluated by means of system level simulations.

show abstract