Zigbee is a non-infrastructural wireless network which has low data rate and self-reconstruct capacity. There are two routing algorithms for Zigbee mesh network : Tree routing and On Demand routing. If the parameter is setting improperly in a large scale of network, Tree routing algorithm will cause the problem of device addressing. Some researches show that the efficiency of On Demand routing is as well as the Tree routing in periodic data transmition. Therefore, this paper attempts to using On Demand routing protocol to construct the data transfer path in symmetric street light structure. Like AODV(Ad-hoc On-demand Distance vector), we must reduce control message to find the route in limited bandwidth network. We propose AODV-BN(Backup Next) according to Sung-Ju Lee and Mario Gerla¡¦s algorithm, ¡§AODV-BR¡¨. AODV-BN only use RREP message to find the back up node and get the neighbor table by eavesdropping instead of sending Hello Message. So we can use very small amount of control messages to fix the broken route and reduce the collision. Finally, we use NS-2(Network Simulation) to simulate the performance of AODV-BN. The simulation results present that our methods reduce the control message indeed and improve the throughput of the network.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0811109-144251 |
| Date | 11 August 2009 |
| Creators | Yu, Hsiao-wen |
| Contributors | Ju-Ya Chen, Da-wei Chang, Jih-Ching Chiu, Zi-Tsan Chou |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811109-144251 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0018 seconds