지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 발행연도
- 2014.10
- 수록면
- 958 - 962 (5page)
이용수
초록· 키워드
오류제보하기
In a Zigbee network, when many nodes simultaneously send data packets to a Zigbee coordinator through routes (branches), the Zigbee coordinator cannot deal with all signals. Interference and noises are existed during data transmission. This problem is still one of challenges in the network communication. In this paper, we propose an extended airtime fair algorithm in which throughput of a Zigbee network is maximized and fractions of airtime are taken into account. We adapt a utility function that is proposed by Kelly (1997) in maximizing the network throughput; nevertheless, throughput of each branch is multiplied by a fraction of airtime. Fractions of airtime play a role in creating a balance of throughputs of branches: the throughput and fairness of each branch is guaranteed. Moreover, the usefulness of our proposed algorithm for a Zigbee network is presented; simulation results show that the throughput and fairness are better than those of a case of not using airtime fair.
목차
Abstract
1. INTRODUCTION
2. A ZIGBEE NETWORK
3. EXTENDED AIRTIME FAIR SCHEDULING ALGORITHM
4. SIMULATION RESULTS
5. CONCLUSIONS
REFERENCES
참고문헌 (0)
참고문헌 신청이 논문의 저자 정보
최근 본 자료
댓글(0)
0