J4
• Original Articles • Previous Articles Next Articles
SHI Yan;SHENG Min
Received:
Revised:
Online:
Published:
Contact:
Abstract: For the purpose of supporting real-time services in broadband wireless access networks, a scheduling algorithm based on simple network coding, DSNC, is presented. With the newly introduced delivery state parameter, DSNC selectively combines retransmission packets into an innovative one by only XOR operation. Not only can DSNC reach the upper band of the network throughput defined by the maximum flow-minimum cut theorem, but receivers are able to recover original packets immediately upon successful packet receptions, which greatly lowers the system requirements for the processor speed, memory capacity and power consumption at mobile nodes. Integrated with the simple network encoding, the queue-delay-based scheduling scheme of DSNC is capable of providing packets with better delay and jitter performance while maintaining the maximal network throughput. Simulation results indicate that DSNC can nearly reach that throughput superior limit, and the average packet end-to-end delay and jitter decrease 11% and 19%, respectively, compared with other algorithms, which makes it much applicable to broadband real-time services.
Key words: throughput, delay and jitter, simple network coding, delivery state parameter
CLC Number:
SHI Yan;SHENG Min. Study of a scheduling algorithm based on simple network coding in broadband wireless access networks [J].J4, 2008, 35(3): 388-394.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://journal.xidian.edu.cn/xdxb/EN/
https://journal.xidian.edu.cn/xdxb/EN/Y2008/V35/I3/388
Cited