The main contribution of this paper is to propose a systematic framework to develop low overhead routing algorithms for massively dense WSNs, i.e., coordinate sensor nodes themselves to solve the routing directions using these existing techniques and then route the information with the routing directions.
This project describes the design and implementation of control unit coordinating sensors of various physical quantities and actuators.
Accordingly, the distributed routing algorithm, DGSI-FEM, is proposed to coordinate sensors to solve (widetilde {Phi })s from (18) in parallel using (21).
We consider the two-dimensional field is a square of areas b 2. The number of total sensors can be expressed as M. (x s,y s ) for s=1,…M present the coordinates of sensor s.
Let us represent the maximum deviation on the and coordinates of sensor nodes as and, respectively.
In addition, due to the special construction of spherical array, the receiving signal can be unfolded in special harmonic domain, which can separate the signal position coordinates and sensor position coordinates conveniently.
where S i is the cluster i, X j is coordinate of sensor node j and m i is the coordinate of mean of point.
Although our research results deal with the case in which the positions of sensors are accurately known, some recent works assume the unknown coordinates of sensors [15 18].
As a solution, SDP introduces a priority-aware transmission coordination mechanism by introducing the priority indicator, which coordinates different sensors to transmit packet in a given priority order.
The (x i, y i ) is the coordinate of sensor node s i in a target monitoring area A, each node coordinate is known, and effective perception radii are rand s i = {x i , y i , r}.
