TY - GEN
T1 - Mobile network management and robust spatial retreats via network dynamics
AU - Ma, Ke
AU - Zhang, Yanyong
AU - Trappe, Wade
PY - 2005
Y1 - 2005
N2 - The mobility provided by mobile ad hoc and sensor networks will facilitate new mobility-oriented services. Recent work has demonstrated that, for many issues, mobility is advantageous to network operations. This paper proposes that the need for mobility may be captured by formulating the movement of nodes as a classical dynamical system. Motivated by classical mechanics, we propose the notion of network dynamics, where the position and movement of mobile devices evolve according to forces arising from system potential functions that capture the operational goals of the network. We argue that, in the context of moving communicating nodes, the equations of motion should be formulated as a steepest descent minimization of the system potential energy. Further, since global information is not practical in sensor networks, we introduce distributed algorithms that yield more practical implementations of network dynamics. The resulting algorithms are generic, and may be applied to produce balanced network configurations for different initial network deployments. As a second application of network dynamics, we examine the problem of adapting a mobile sensor network to the threat of a jammer. We show that the combination of spatial escape strategies with network dynamics prevents network partitioning that might arise from a mobile jammer.
AB - The mobility provided by mobile ad hoc and sensor networks will facilitate new mobility-oriented services. Recent work has demonstrated that, for many issues, mobility is advantageous to network operations. This paper proposes that the need for mobility may be captured by formulating the movement of nodes as a classical dynamical system. Motivated by classical mechanics, we propose the notion of network dynamics, where the position and movement of mobile devices evolve according to forces arising from system potential functions that capture the operational goals of the network. We argue that, in the context of moving communicating nodes, the equations of motion should be formulated as a steepest descent minimization of the system potential energy. Further, since global information is not practical in sensor networks, we introduce distributed algorithms that yield more practical implementations of network dynamics. The resulting algorithms are generic, and may be applied to produce balanced network configurations for different initial network deployments. As a second application of network dynamics, we examine the problem of adapting a mobile sensor network to the threat of a jammer. We show that the combination of spatial escape strategies with network dynamics prevents network partitioning that might arise from a mobile jammer.
UR - http://www.scopus.com/inward/record.url?scp=33750301241&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33750301241&partnerID=8YFLogxK
U2 - 10.1109/MAHSS.2005.1542805
DO - 10.1109/MAHSS.2005.1542805
M3 - Conference contribution
AN - SCOPUS:33750301241
SN - 0780394666
SN - 9780780394667
T3 - 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2005
SP - 235
EP - 242
BT - 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2005
T2 - 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2005
Y2 - 7 November 2005 through 10 November 2005
ER -