eCite Digital Repository

A-CAFDSP: an adaptive-congestion aware Fibonacci sequence based data scheduling policy

Citation

Sharma, VK and Verma, LP and Kumar, M and Naha, RK and Mahanti, A, A-CAFDSP: an adaptive-congestion aware Fibonacci sequence based data scheduling policy, Computer Communications, 158 pp. 141-165. ISSN 0140-3664 (2020) [Refereed Article]


Preview
PDF
Pending copyright assessment - Request a copy
4Mb
  

DOI: doi:10.1016/j.comcom.2020.04.047

Abstract

In today's modern era, the multi-path communication paradigm is becoming prominent in supporting multimedia applications due to its dazzling features of improved network's resilience, reliability, and performance. Specifically, wireless (environments) networks are intended to become typically reliant on the idea of multi-pathing for efficient traffic balancing which ultimately helps in achieving good performance. Although single-path communication is a promising paradigm for supporting multi-media applications but because of its incompetence in providing significant fault-tolerance demands, it is unable to satisfy the good Quality of Service (QoS) and Quality of Experience (QoE) requirements for such applications. Hence, traffic allocation and provisioning in the Mobile Ad-hoc Networks (MANETs) environment, considering the dynamic and dissimilar wireless channel characteristics of paths' and inadequate offered resources (i.e., buffer) in nodes over those paths', is a challenging job. Nevertheless, current works on traffic allocation addresses the data scheduling provision without considering the dissimilar wireless channel characteristics and background traffic of paths' respectively. To address the problem of abrupt data scheduling policy, we propose, a novel Adaptive-Congestion Aware Fibonacci Sequence based Data Scheduling Policy (A-CAFDSP) which takes care of each path's data carrying capacity, dissimilar characteristics and background traffic intensity respectively and ultimately makes data scheduling adaptation decisions to select the efficient paths for concurrent transmissions. Indeed, ACAFDSP includes the paradigm to concurrently distribute the data packets over multiple available network paths using Fibonacci sequence wisely and regulate the traffic of each available network path individually. Moreover, current works simply adopts and have evaluated their approach on the idealized propagation (radio) prototype without considering fading effects. However, we have evaluated our proposed method in fading environment and all the competent multiple available paths are within the interference ranges of each other hence, the inter-flow interference does exist in our simulation, which certainly gives us the correct idea that how our proposed method works in realistic wireless environment. The simulation results indicate that the performance of A-CAFDSP is better than existing conventional (single-path) and multi-path approaches in terms of average throughput, packet delivery ratio (PDR) and normalized load.

Item Details

Item Type:Refereed Article
Keywords:internet protocol, multi-path communication, MANETs, routing
Research Division:Engineering
Research Group:Communications engineering
Research Field:Antennas and propagation
Objective Division:Expanding Knowledge
Objective Group:Expanding knowledge
Objective Field:Expanding knowledge in engineering
UTAS Author:Naha, RK (Mr Ranesh Kumar Naha)
ID Code:151711
Year Published:2020
Web of Science® Times Cited:4
Deposited By:Information and Communication Technology
Deposited On:2022-08-03
Last Modified:2022-08-03
Downloads:0

Repository Staff Only: item control page