Many location-based routing protocols have been developed recently, and have been demonstrated to be scalable and efficient for packet routing in mobile ad hoc networks. Using location-based routing requires that a node obtains the node position with which it wants to communicate. This task is generally achieved by a location service. This work presents a novel routing protocol, called Hierarchical Cell-Structured Routing (HCR) Scheme, with a location service. The network area is divided into a number of regular triangular regions, called cells. The nodes forward the packets by some chosen cells, and are classified to be three level hierarchical structures. The hierarchical approach of HCR makes it especially suitable for high network density. Moreover, the traffic loads in HCR are shared by all nodes rather than just by some specific nodes, thus the overhead is reduced at high traffic loads. Simulation results indicate that HCR has better performance than Location-Aid Routing (LAR), in terms of packet delivery ratio, end-to-end delay and overhead in high traffic load.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0201110-173322 |
| Date | 01 February 2010 |
| Creators | Huang, Shih-kai |
| Contributors | Ren-Hung Hwang, Tsang-Ling Sheu, Ting-Wei Hou, Rong-Hong Jan, Tsung-Chuan Huang |
| 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-0201110-173322 |
| Rights | campus_withheld, Copyright information available at source archive |
Page generated in 0.0021 seconds