Cited 0 time in
A Packet Scheduling Technique Based on (m, k)-Firm Guarantees for Differential Quality of Service in Tactical Ad-Hoc Networks
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lee, Robin | - |
| dc.contributor.author | Kim, Beom-Su | - |
| dc.date.accessioned | 2025-11-28T08:00:14Z | - |
| dc.date.available | 2025-11-28T08:00:14Z | - |
| dc.date.issued | 2025-11 | - |
| dc.identifier.issn | 2169-3536 | - |
| dc.identifier.issn | 2169-3536 | - |
| dc.identifier.uri | https://scholarworks.gnu.ac.kr/handle/sw.gnu/81027 | - |
| dc.description.abstract | Tactical 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.extent | 13 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
| dc.title | A Packet Scheduling Technique Based on (m, k)-Firm Guarantees for Differential Quality of Service in Tactical Ad-Hoc Networks | - |
| dc.type | Article | - |
| dc.publisher.location | 미국 | - |
| dc.identifier.doi | 10.1109/ACCESS.2025.3628221 | - |
| dc.identifier.scopusid | 2-s2.0-105020980358 | - |
| dc.identifier.wosid | 001613075700029 | - |
| dc.identifier.bibliographicCitation | IEEE Access, v.13, pp 189270 - 189282 | - |
| dc.citation.title | IEEE Access | - |
| dc.citation.volume | 13 | - |
| dc.citation.startPage | 189270 | - |
| dc.citation.endPage | 189282 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | Y | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.relation.journalResearchArea | Engineering | - |
| dc.relation.journalResearchArea | Telecommunications | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
| dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
| dc.relation.journalWebOfScienceCategory | Telecommunications | - |
| dc.subject.keywordAuthor | Routing | - |
| dc.subject.keywordAuthor | Ad hoc networks | - |
| dc.subject.keywordAuthor | Routing protocols | - |
| dc.subject.keywordAuthor | Quality of service | - |
| dc.subject.keywordAuthor | Delays | - |
| dc.subject.keywordAuthor | Scheduling algorithms | - |
| dc.subject.keywordAuthor | Topology | - |
| dc.subject.keywordAuthor | Data communication | - |
| dc.subject.keywordAuthor | Resource management | - |
| dc.subject.keywordAuthor | Real-time systems | - |
| dc.subject.keywordAuthor | Tactical ad-hoc networks | - |
| dc.subject.keywordAuthor | ad-hoc on demand distance vector (AODV) | - |
| dc.subject.keywordAuthor | distance-based priority (DBP) | - |
| dc.subject.keywordAuthor | (m | - |
| dc.subject.keywordAuthor | k)-firm | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Gyeongsang National University Central Library, 501, Jinju-daero, Jinju-si, Gyeongsangnam-do, 52828, Republic of Korea+82-55-772-0532
COPYRIGHT 2022 GYEONGSANG NATIONAL UNIVERSITY LIBRARY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
