Ad Hoc Networks are transmission networks on the structure of wireless networks by consisting of many mobile hosts. But it is no need to use any support by other communication infrastructures like Base Stations, and directly use wireless networks for data-transmission.
Because the feature of per host as fast movement, every host can join or go away as it likes, thus, the topology appeared from Ad Hoc networks will have higher probability to make packet loss or transmission delay and cause network flooded to do unnecessary re-send and lose the flow of running data.
We will explain generally some relative protocols of setting up routes and possible problems. Besides, describe relative researches of how to solve and reduce the possibility of problem happened.
Then, we will bring up a new constructive protocol (Partition-Timing Routing Protocol¡APTR), the protocol can adjust neighboring nodes of covered scope to select certain node to be own core node, if any covered node needs to transmit data to others outside the scope, it has to be managed by core node.
Besides, the timing for update and adjust data of per covered scope is different too and not as same as other ways which update timing is at the same time to reduce the load of the entirely network and more changeable.
Furthermore, it may increase the rate of update of per scope to get the target of succeeding data-transmission.
The simulation results will appear that the load and possibility of data transmission has more advantages than other ways.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0707103-145447 |
| Date | 07 July 2003 |
| Creators | Lin, Tsung-Hsien |
| Contributors | Buh-Yun Sher, Wen-Shyong Hsieh, Jyh-Horng Jeng |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0707103-145447 |
| Rights | off_campus_withheld, Copyright information available at source archive |
Page generated in 0.0021 seconds