| Summary: | 碩士 === 南台科技大學 === 資訊工程系 === 100 === In MANET, geocasting utilizes geographic information to deliver data packets to nodes within a specific geographical area. During packet forwarding, the probability of signal collision and packet loss are increased when a large number of nodes are within the forwarding zone. In this paper, we propose Grid-base-Location-Aided (GLA) and Greedy-Grid-base-Location-Aided (GGLA) algorithms to solve the problem. GLA partitions the geocast forwarding zone into several 2D logical grids; a node is elected as a gateway in each grid, where the gateway is responsible for forwarding data packets to the geocast region. By using the gateway approach, GLA can reduce the required number of packet forwarding. GGLA introduces a greedy routing mechanism to GLA for reducing the probability of packet loss with high-density nodes in the forwarding zone. When a node is received a date packet in the geocast region, it floods the data packet in the geocast region, which may cause the broadcast storm problem. By using the network coding mechanism, two or more packets can be encoded and then broadcast, which can decrease the required number of packets for loss recovery. In this thesis, GLA and GGLA are further integrated with a network coding mechanism to improve the efficiency of packet transmission in the geocast region.
|
|---|
