Shortest Path Network-hole Detour Routing using Minimum Boundary Convex Polygons in Wireless Ad-hoc Sensor Networks
Dong-Ook Seong, Jaesoo Yoo · 2011
In recent years, various applications using the collected environment information have been studied in wireless sensor networks. A routing scheme is required to send the collected environment information to a specific location in wireless sensor networks. The geographical routing schemes that send data using only the coordinates of source and destination without keeping routing tables were proposed. In the geographical routing schemes, methods that detour efficiently network-hole due to the factors such as the faults of sensor nodes and the change of the network topology are necessarily required. In this paper, we first propose a minimum boundary convex polygon (MBCP). We also propose a new shortest path network-hole detour routing scheme based on the proposed MBCP. In order to show the superiority of the proposed routing scheme, we compare it with the existing scheme through simulations in various environments.