Patent Document ID: 20140010069
Application ID: 13541470
Patent Flag: 0

Claim One:
1. In a wireless sensor-actor network (WSAN) having a topology defined by a plurality of connected sensor nodes and actor nodes, the WSAN being modeled by a weighted graph having a plurality of edges connecting the nodes, a plurality of weights of the graph being assigned to the edges, the weights representing distances of the edges connecting the nodes, a computer-implemented least movement wireless sensor-actor network (WSAN) topology repair method, comprising the steps of: using available weights, building a shortest path routing table for each of the actor nodes in the WSAN, thereby allowing each of the actor nodes to be aware of an entire topography of the WSAN; for each of the actor nodes, determining whether a neighbor actor node has failed; when one of the neighbor actor nodes has failed, determining whether the failed neighbor actor node is a cut-vertex node; using the shortest path routing table, determining a failure replacement best candidate actor node for the failed neighbor actor node if the failed neighbor actor node is a cut-vertex node; moving the best candidate actor node to a locus proximate the failed cut-vertex node, thereby replacing the failed cut-vertex node; notifying all child nodes belonging to the best candidate actor node that the best candidate actor node is moving to the failed neighbor actor node's proximity and is replacing the failed neighbor actor node; and broadcasting a node-recovered message to the remaining actor nodes in the WSAN.