In recent years, the applications of wireless mesh network in the embedded systems have become more widely. It's an important issue that how to consume lower energy and transfer data stably based on energy considerations. The embedded systems must have the appropriate routing protocol for low power consumption and stable long-distance data transmission. In this paper, a routing protocol is proposed with sequential repair and backup routing protocol(Ad Hoc On-Demand Distance Vector Routing-Sequential Repair and Backup Routing Protocol, AODV-SRBR Protocol), that can reduce the number of transceivers and have a stable connection. In the proposed routing protocol, the node of network can create multi-route message through decoding the path information of packets. Using a complete routing information can reduce the number of route request packets efficiently. when the link is broken, the proposed protocol can repair the data transmission by sequential repair or select backup routing. In this paper, we implement the routing protocol to verify a multi-hop connection and data transfer in the general environment. The performance of AODV-SRBR and AODV is compared and simulated by NS2. The proposed routing protocol can achieve same transmission efficiency in the fewer route request packets, fewer maintance packets and fewer transmit and receive times according to the simulation result. By stable connection¡Blow power consumption and multi-hop data transfer, we expect that the proposed routing protocol on the embedded systems platform can be extended in large sensor mesh network.
Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0811111-234935 |
Date | 11 August 2011 |
Creators | Cheng, Chun-yao |
Contributors | none, none, none, Jih-ching Chiu |
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-0811111-234935 |
Rights | user_define, Copyright information available at source archive |
Page generated in 0.0015 seconds