Performance Analysis of the IEEE 802.16 Wireless Metropolitan Area Network
DFMA '05 Proceedings of the First International Conference on Distributed Frameworks for Multimedia Applications
IEEE Transactions on Mobile Computing
Analysis of Contention-Based Multi-Channel Wireless MAC for Point-to-Multipoint Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
IEEE Transactions on Computers
Performance Evaluation of Reservation Medium Access Control in IEEE 802.16 Networks
AICCSA '06 Proceedings of the IEEE International Conference on Computer Systems and Applications
Survey on performance analysis of embedded and conventional networks
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Dynamic frame scheduling scheme for IEEE802.16 broadband wireless networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Using abstract interpretation to add type checking for interfaces in Java bytecode verification
Theoretical Computer Science
Discrete-time modeling for performance analysis of real-time services in IEEE 802.16 networks
Computer Communications
Using GI-G-1 queuing model for rtPS performance evaluation in 802.16 networks
International Journal of Communication Systems
International Journal of Communication Networks and Distributed Systems
Journal of High Speed Networks
Hi-index | 0.25 |
IEEE 802.16 is proposed to provide middle-range access and high data rate for real-time transmission through wireless channel. The increasing of access range, data rate and total number of nodes makes the wireless media access more difficult and critical. To overcome access contentions from requests, IEEE 802.16 thus adopts a centralized-based polling MAC instead of random access control. In such a polling mechanism, the number of polls (NPS) within a frame period becomes an important factor. There are two main reasons. First, not all of the polled nodes have packets to be sent, and thus wastes bandwidth used for polling these nodes. Second, that the node has packets to be sent may not be polled immediately, and then increases polling delay. Therefore, this paper analyzes NPS based on the Markov chain analysis to minimize average polling delay while increasing network throughput. Numerical results indicate that the analysis results are very close to the simulation results. Moreover, the number of polls and the waste rate are also analyzed under various NDS and offered loads.