| Summary: | 碩士 === 臺北市立教育大學 === 資訊科學系碩士班 === 99 === Opportunistic routing has been shown to achieve the high throughput of the wireless mesh network with lossy channels. Different from traditional routing mechanisms in which a transmitting packet is only forwarded by the node along with the deterministic path, the opportunistic routing technique allows multiple nodes hearing the packet to form the forwarder set containing promising candidates for the packet forwarding. Existing opportunistic routing protocols typically choose among forwarding candidates based on the decision made from the transmitter disregarding the current loads in candidates. In this paper, the opportunistic routing mechanism with considering race among forwarders is proposed. Specifically, in addition to the consideration of delivery probability, a candidate of the forwarder set for a given transmitter is restricted to those wireless nodes whose transmission range covers one another. Augmented with the novel queue management, our proposal makes the true forwarder picked from the forward set of a given transmitting packet being the one who gains access to wireless channel for the packet before others do. Therefore, the efficient and load-balanced opportunistic routing for wireless mesh networks can be achieved. Numerical results show that the proposed method compared to the traditional routing methodology can achieve the high packet delivery ratio. Overall, the proposed scheme is simple, efficient, and compliant to the IEEE 802.11s MAC protocol.
|
|---|
