| Summary: | 碩士 === 國立交通大學 === 資訊科學與工程研究所 === 94 === Recently, wireless mesh networks (WMNs) have emerged as a key technology for next-generation wireless networking. Spatial reuse in a WMN can allow multiple communications to proceed simultaneously; thereby observably improve the overall network throughput. However, interferences between mesh nodes are a critical factor for maximizing the spatial reuse. In the thesis, we propose a novel scheduling mechanism without modifying the existing IEEE 802.11 MAC, called wireless Radio-Matching Protocol (RMP). It takes account of interferences in wireless environments to achieve maximum spatial reuse by using pre-specified radio transmissions. In contrast to existing random access approaches, RMP uses a decentralized controlled access approach to protect nodes from unintentional packet collisions. RMP adopts a chain topology of bidirectional transmissions, where nodes are equally spaced so that radios of non-neighboring nodes do not interference with each other. Simulation results indicate that the throughput of RMP is about 30% better than that of Ripple [14] and almost 200% better than that of the IEEE 802.11 DCF. Although RMP achieves higher throughput than Ripple, it still maintains the same delay time and transmission quality, as verified by our simulation results. RMP achieved a stable throughput and a low end-to-end transmission delay in both CBR and FTP traffic compared to the IEEE 802.11 DCF. In additions, RMP is simple, easy to implement, and it eliminates the back-off inefficiencies and the collision problem in IEEE 802.11 wireless environments.
|
|---|
