Construction of Minimum Progress Set for Guaranteed Delivery of Geographic Routing in Wireless Ad-Hoc Networks

• Main Authors: Yuan,Shiao-An, 袁孝安
• Other Authors: Tsai,Ming-Jer
• Format: Others
• Language: en_US
• Online Access: http://ndltd.ncl.edu.tw/handle/52562339926776559229

碩士 === 國立清華大學 === 資訊工程學系 === 97 === Due to the popularity of the global positioning system, multiple geographic routing protocols are proposed to route packets based on the physical addresses of nodes in wireless ad-hoc networks. The GPSR-like routing protocols, such as GPSR, GFG, GOAFR+, GPVFR, and FaceTrace, guarantee packet delivery by routing a packet from a concave node to a progress node along the face boundary during perimeter forwarding. In the existing GPSR-like routing protocols, however, a concave node has no information about progress nodes; therefore, the concave node often forwards the packet along the face boundary in a wrong direction during perimeter forwarding, resulting in inefficient routing. In this paper, we first propose an algorithm, Zone- MPS, to construct the progress set of a node, such that for any destination at least one progress node is in the progress set or the neighbor set of the node. Subsequently, a GPSR-like routing protocol, MPS-GRLF, is proposed to route a packet based on progress sets during perimeter forwarding. Simulations show that MPS-GRLF conducts a shorter routing path, as compared to GPSR, GFG, GOAFR+, GPVFR, and FaceTrace.