The N sensor nodes are positioned
within a 2D or 3D spatial domain ??– and do not have positional uncertainty.
We assume that an ad hoc WSN routing algorithm is available. Constant
" > 0 is given, and a fixed number of iterations N0 is chosen.
Step1 (initialize): Assume starting mobile sensor locations X0. Assume
that a table look-up is available and stored for the forces generated by optimal
network flow in the 3 and 4 node network models shown in section 3.1. This
table look-up contains information on the potential field force acting on a
???middle??? node or an ???end??? node in these two simple networks, given the
relative location of the nodes. Examples of look-up tables for the 3 and 4
node networks are shown in Figures 7(a), (b).
55
Dan O. Popa and Frank L. Lewis
Step2: Increase the iteration count k = k + 1.
Step3: For each node I, do:
??? Consider each of the routes J passing through it that connects a sensor
node to the network sink.
??? If node I is not a terminal node:
??“ Consider the nodes I1 ??’ preceding I along the route, and I2 ??’ following
node I along the same route.
??“ Calculate the node force acting on I based on a previously computed
I1 ??’ I ??’ I2 middle node network model.
??? If node I is a terminal node (first node along the route):
??“ Consider the node I2 ??’ following node along route J.
??“ Calculate the node force acting on I based on a previously computed
I ??’ I2 end node network model.
Pages:
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121