Complexity Analysis of a Propagation Territory-based Routing in MANET with Obstacles
Chih‐Hung Chao, Yi-Chung Tseng, Shyue-Liang Wang · 2016
This study considers constructing an efficient routing protocol in MANET with obstacles. It is assumed that the wireless nodes are equipped with a Global Position System (GPS) chip. We take advantage of the location information by GPS to propose a novel greedy propagation territory-based routing mechanism to establish the routing path between a source and destination. It defines a propagation territory to make a locally optimal decision for each forwarding node. The forwarding nodes, including a source and relay nodes, select one node in their propagation territories closest to destination as a next hop relay node to forward the packets until the destination is reached. Moreover, the signal interferences of nodes by obstacles are considered, while a source and relay nodes move close to obstacles. If the radio signal of a node is disturbed by an obstacle, the neighboring node with the lowest signal interference in its propagation territory is substituted as a next hop relay node. In addition, it is shown that the proposed routing mechanism demonstrates a tradeoff improvement than those of the other ondemand routing schemes in terms of the computational complexity and communication overheads.