Target guiding self-avoiding random walk with intersection algorithm for minimum exposure path problem in wireless sensor networks

Abstract

To solve minimum exposure path (MEP) problem in wireless sensor networks more efficiently, this work proposes an algorithm called target guiding self-avoiding random walk with intersection (TGSARWI), which mimics the behavior of a group of random walkers that seek path to their destinations in a strange area. Target guiding leads random walkers move toward their end points, while self-avoiding prevents them from taking roundabout routes. Route intersections further accelerate the speed of seeking connected paths. Dijkstra algorithm (DA) is applied to solve MEP problem in a sub-network formed by multiple connected paths that walkers generate (called TGSARWI DA). Simulations show that the path exposure found by TGSARWI DA is very close to that by DA in the global network (Global DA), whereas the time complexity of computation is much lower. Compared with existing heuristic algorithms such as physarum optimization algorithm (POA), our algorithm shows higher generality and efficiency. This algorithm also exhibits good robustness to the fluctuations of parameters. Our algorithm could be very useful for the solution to MEP problem in fields with large-or highdensity sensors.

An Improved Artificial Bees Colony Algorithm to Solve Minimal Exposure Problem in Wireless Sensor Networks

“…The problem of continuous MEP is translated into a discrete problem in this section. Assuming that the identified field is a rectangular area, the rectangle can be split into grids [5]. In this, the sensor-identified grid is a weighted connected network graph , where indicates the set of all nodes and E refers to the set of all edges.…”

“…The PM-based-MEP is then translated into a numerically functional extreme that is higher dimensional, nondifferential and non-linear. In order to resolve the MEP problem in wireless sensor networks with more efficiency, in [5] an algorithm known as Target Guiding Self-Avoiding Random Walk with Intersection (TGSARWI) is proposed, which imitates the behavior of a set of random walkers who try to find the path to their destinations in a queer region. Dijkstra algorithm (DA) is used for solving the MEP problem in a sub-network created by several connected paths generated by the walkers.…”