earticle

논문검색

Enhanced Packet Scheduling Algorithm for Multihop Wireless LANs

초록

영어

The use of wireless devices are flooding the network, thus giving rise to extensive data transmission. One of the main concerns is how to dictate the buffering of data so that throughput fairness can be achieved, specifically in the multihop wireless networks. The technique of buffering has to be based on the scheduling algorithms. Several studies on scheduling algorithms as a part of congestion control have been carried out, such as by Shagdar, Nakagawa and Zhang [1], Izumikawa, Ishikawa, and Sugiyama [2], and Giang and Nakagawa [3]. The Round Robin (RR) scheme is considerably simpler than other known schemes for achieving throughput fairness in multihop wireless networks. As is RR scheme, the main cause of concern is the delay that is been caused by high volumes of workloads at the wireless source nodes. It is therefore the purpose of this paper to enhance the network performance in wireless LANs by improving the fairness index and average end-to-end delay the through the scheme identified as Proposed Packet Reverse Function.

목차

Abstract
 1. Introduction
 2. Preliminaries
  2.1. Buffer Management Issue for Multi-hop Wireless LANs
  2.2. Fairness and Max-min Fairness in Multi-hop Wireless Networks
  2.3. Round Robin Scheduling
 3. Simulation Design
  3.1. Base Work
  3.2. Simulation Model
 4. Result and Analysis
 5. Conclusion and Future Works
 References

저자정보

  • Raja Hasyifah Raja Bongsu Faculty of Informatics, UniSZA, Terengganu, Malaysia
  • Nazirah Abd. Hamid Faculty of Informatics, UniSZA, Terengganu, Malaysia
  • Ahmad Nazari Mohd. Rose Faculty of Informatics, UniSZA, Terengganu, Malaysia
  • Shamala Subramaniam Faculty of Computer Science and Information Technology, UPM, Selangor, Malaysia

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.