In ad hoc network, one needs other nodes to relay data packets. But resources in each node are limited. Therefore, these nodes may not relay other¡¦s data packet without getting any benefit. In this paper, a routing path selecting algorithm based on price mechanism is proposed. It helps nodes to get some benefits by relaying others¡¦ data packets. Moreover, the algorithm we proposed selects a routing path with less payment and more resources. Simulation results show that the drop rate, block rate and the cost of routing paths are reduced compared to the competing algorithms.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0817104-164648 |
| Date | 17 August 2004 |
| Creators | Chen, Chih-Chan |
| Contributors | Tain-chi Lu, Tsung-Chuan Huang, Chung-nan Lee, Chu-Sing Yang, Yen-Wen Lin |
| 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-0817104-164648 |
| Rights | withheld, Copyright information available at source archive |
Page generated in 0.0019 seconds