英文摘要 |
Geocasting can deliver information to a group of destinations in a network identified by their specific geographical locations. During packet forwarding, the probability of signal collision and packet loss increase 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. This gateway is then responsible for forwarding data packets to the geocast region. By using the gateway approach, GLA can reduce the required number of packets forwarded. GGLA introduces a greedy routing mechanism to GLA to reduce the probability of packet loss with high-density nodes in the forwarding zone. When a node receives a data packet in the geocast region, it floods the data packet in the geocast region, which may cause a broadcast storm problem. When the network coding mechanisms are combined, two or more packets can be encoded and then broadcast, which can decrease the required number of packets for loss recovery. In this paper, GLA and GGLA are further integrated with a network coding mechanism to improve the efficiency of packet transmission in the geocast region. |