Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

A Packet Scheduling Technique Based on (m, k)-Firm Guarantees for Differential Quality of Service in Tactical Ad-Hoc Networks

Full metadata record
DC Field Value Language
dc.contributor.authorLee, Robin-
dc.contributor.authorKim, Beom-Su-
dc.date.accessioned2025-11-28T08:00:14Z-
dc.date.available2025-11-28T08:00:14Z-
dc.date.issued2025-11-
dc.identifier.issn2169-3536-
dc.identifier.issn2169-3536-
dc.identifier.urihttps://scholarworks.gnu.ac.kr/handle/sw.gnu/81027-
dc.description.abstractTactical ad-hoc networks must provide differentiated Quality of Service (QoS) for heterogeneous traffic, yet classic AODV's single-queue FIFO forwarding cannot prevent priority inversion or starvation under load. We propose a packet scheduling scheme that enforces stream-level $(m, k)$ -firm constraints and uses Distance-Based Priority (DBP) to raise the urgency of flows that are close to violating their $(m, k)$ requirement, with EDF then FIFO tie-breaking at dequeue time. The scheduler updates per-flow $k$ -sequences online and selects the head-of-line packet from the stream with the smallest DBP distance. We evaluate the scheme in ns-3 against RL-AODV and FP-AODV under three tactical scenarios (Mountainous Terrain, Urban CQB, and Landing Operation) using AODV and eight traffic classes. Across all scenarios, FP-AODV maximizes PDR for top classes but severely starves low classes, while RL-AODV yields uniform but mediocre service. In contrast, the proposed $(m, k)$ -firm scheduler preserves high PDR and low end-to-end delay for the highest priorities while preventing starvation and lifting the PDR floor for low priorities, particularly in NLOS and many-to-few aggregation topologies. Throughput trends mirror PDR, and end-penalized delay remains bounded for lower classes. The scheduler operates with $O(N\!\cdot \!k)$ complexity for $N$ streams and window size $k$ , making it practical for resource-constrained nodes (e.g., $N{=}100$ , $k{=}15$ ). Deadlines are assigned per traffic class for consistent meet/miss evaluation across hops, and each flow is tracked independently through metadata. In addition, it incorporates an adaptive routing-level load balancing mechanism that refines AODV's path selection in real time using delay, queue, and PDR metrics, while maintaining full protocol compatibility. These results demonstrate that $(m, k)$ -firm scheduling provides a tunable balance between differentiated service, fairness, and adaptability for tactical MANETs.-
dc.format.extent13-
dc.language영어-
dc.language.isoENG-
dc.publisherInstitute of Electrical and Electronics Engineers Inc.-
dc.titleA Packet Scheduling Technique Based on (m, k)-Firm Guarantees for Differential Quality of Service in Tactical Ad-Hoc Networks-
dc.typeArticle-
dc.publisher.location미국-
dc.identifier.doi10.1109/ACCESS.2025.3628221-
dc.identifier.scopusid2-s2.0-105020980358-
dc.identifier.wosid001613075700029-
dc.identifier.bibliographicCitationIEEE Access, v.13, pp 189270 - 189282-
dc.citation.titleIEEE Access-
dc.citation.volume13-
dc.citation.startPage189270-
dc.citation.endPage189282-
dc.type.docTypeArticle-
dc.description.isOpenAccessY-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaComputer Science-
dc.relation.journalResearchAreaEngineering-
dc.relation.journalResearchAreaTelecommunications-
dc.relation.journalWebOfScienceCategoryComputer Science, Information Systems-
dc.relation.journalWebOfScienceCategoryEngineering, Electrical & Electronic-
dc.relation.journalWebOfScienceCategoryTelecommunications-
dc.subject.keywordAuthorRouting-
dc.subject.keywordAuthorAd hoc networks-
dc.subject.keywordAuthorRouting protocols-
dc.subject.keywordAuthorQuality of service-
dc.subject.keywordAuthorDelays-
dc.subject.keywordAuthorScheduling algorithms-
dc.subject.keywordAuthorTopology-
dc.subject.keywordAuthorData communication-
dc.subject.keywordAuthorResource management-
dc.subject.keywordAuthorReal-time systems-
dc.subject.keywordAuthorTactical ad-hoc networks-
dc.subject.keywordAuthorad-hoc on demand distance vector (AODV)-
dc.subject.keywordAuthordistance-based priority (DBP)-
dc.subject.keywordAuthor(m-
dc.subject.keywordAuthork)-firm-
Files in This Item
There are no files associated with this item.
Appears in
Collections
ETC > Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Altmetrics

Total Views & Downloads

BROWSE