Skip to main content
Log in

A Hopfield neural network approach to decentralized self-synchronizing sensor networks

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Decentralized inference of a sensor network in the difficult case of a nonreciprocal nonlinear context is investigated by transforming the sensor network into a Hopfield neural network. Equilibrium states of the latter correspond to situations of global consensus in the sensor network, characterized by suitable regions (consensus regions) in the space of its parameters. The said transformation was recently proposed by the author and applied to the simple case of three sensors. The general case of more than three sensors is investigated in the present paper. A procedure is developed for determining the structure and the properties of the consensus regions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

Abbreviations

SN:

Sensor network

N :

Number of sensors

M :

N1

ω° :

The common value to which the frequencies of the sensors converge

CR:

Consensus region in the space of the parameters of the SN

ω i , ω :

The result of the observation carried out by the i-th sensor and the corresponding vector

θ i , θ :

The state of the i-th sensor and the corresponding vector

a ik f(.):

Takes into account the local coupling from the k-th to the i-th sensors. a ik  > 0 and f(.) is a nonlinear odd increasing function

a ij :

\( b_{ij} \sqrt {P_{j} } \) where b ij is a topological parameter of the SN

P j :

Is the power delivered by the j-th sensor

α ki :

a i+1,k /a k,i+1

B, R, W, F:

Matrices related to the topology of the SN and to its parameters a ik

THN:

The Hopfield net resulting from the proposed transformation of the SN

E :

Number of coupling links among sensors, coincident with the number of neurons of the THN, i.e. E = N(N−1)

Y, T, Ω:

Output connection matrix and input of the THN

Y 0 :

Equilibrium point of the THN

V, X:

Vectors introduced in the procedure for deriving the consensus regions from the equilibrium points of the THN

U 1 , U 2k :

Matrices of order M introduced in the procedure for deriving the consensus regions from the equilibrium points of the THN

Z i , Ω i :

Variables introduced in the procedure for deriving the consensus regions from the equilibrium points of the THN

C :

(N−1)(N−2)/2, is the number of entries of X to be arbitrarily chosen for deriving one of the consensus regions

References

  1. Special issue on Distributed Signal Processing in Sensor Networks (2006) IEEE Signal Processing Magazine, vol 23, issuse 4

  2. Scherber DS, Papadopoulos H (2005) Distributed computation of averages over ad hoc networks. IEEE J Selected Areas Commun 23(4):776–787

    Article  Google Scholar 

  3. Hong YW, Cheow LF, Scaglione A (2004) Distributed change detection in large scale sensor networks through synchronization of pulse-coupled oscillators. In: proceedings of international conference on audio speech and signal processing (ICASSP ‘04), Lisbon, Portugal, pp III-869-872

  4. Xiao L, Boyd S, Lall S (2005) A scheme for robust distributed sensor fusion based on average consensus. In: proceedings of the fourth international symposium on information processing in sensor networks (IPSN ‘05), Los Angeles (CA), USA, pp 63–75

  5. Barbarossa S (2005) Self-organizing sensor networks with information propagation based on mutual coupling of dynamic systems. In: proceedings of the international workshop on wireless ad-hoc networks (IWWAN ‘05), London, UK

  6. Barbarossa S, Scutari G (2007) Decentralized maximum likelihood estimation for sensor networks composed of nonlinearly coupled dynamical systems. IEEE Trans Signal Proc 55(7):3456–3470

    Article  MathSciNet  Google Scholar 

  7. Scutari G, Barbarossa S, Pescosolido L (2008) Distributed decision through self-synchronizing sensor networks in the presence of propagation delays and asymmetric channels. IEEE Trans Signal Proc 56(4):1667–1684

    Article  Google Scholar 

  8. Wang W, Slotine JJE (2005) On partial contraction analysis for coupled nonlinear oscillators. Biol Cybern 92(1):38–53

    Article  MATH  MathSciNet  Google Scholar 

  9. Martinelli G (2008) Hopfield-like nets and sensor networks. Neural Process Lett 27(4):277–283

    Article  Google Scholar 

  10. Muir T (1960) A treatise on the theory of determinants. Dover Publication, 1960

  11. Barbarossa S, Scutari G, Swami A (2007) Achieving consensus in self-organizing sensor networks: the impact of network topology on energy consumption. In: proceedings of the international conference on acoustic speech and signal processing (ICASSP 2007), Honolulu, USA: II-841 II-844

  12. Chen T, Amari SI (2001) Stability of asymmetric Hopfield networks. IEEE Trans Neural Net 12(1):159–163

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Giuseppe Martinelli.

Appendix: local stability of the THN

Appendix: local stability of the THN

A sufficient condition [12] for the local stability of an equilibrium point Y 0 of the asymmetric Hopfield net, described by the following system of equations

$$ {{\dot{\mathbf{Y}}}} = - {\mathbf{gY}} + {\mathbf{Tf(Y)}} + {\varvec{\Upomega}} \quad {\mathbf{g}} = {\mathbf{diag}}(g_{1} , { }g_{2 \, } \ldots g_{N} ), \, g_{i \, } > 0 $$
(33)

regards the eigenvalues of matrix \( {\mathbf{P = (T - g \, H^{ - 1} )H}} \), where H is a diagonal matrix with entries coincident with the derivatives of f(.) with respect to the components of Y, calculated in correspondence to Y 0 . The said condition requires that all the eigenvalues of P have either negative real part or are negative real. On the basis of lemma 4 of [12], this condition on the eigenvalues of P can be replaced by a similar condition on the matrix P 1  = T − gH −1, since H is a positive diagonal matrix due to the assumption that f(.) is an increasing function. Since g = 0 in the case of the THN, P 1  = T. Moreover, it is important to remark that the THN is characterized by redundant neurons. Only (N−1) of them are independent. Consequently, (N−1)2 eigenvalues of T are equal to zero. In conclusion, the local stability is assured if the remaining (N−1) eigenvalues have negative real part or are negative real.

The previous condition can be applied to matrix B t W in virtue of the cited lemma 4 of [12], since matrix F is a positive diagonal matrix. Since the eigenvalues of B t W, as it was shown in [9], are equal to

  • 0 with a multiplicity equal to (N−1)2

  • N with a multiplicity equal to (N−1)

the local stability of the equilibrium points of the THN is guaranteed.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Martinelli, G. A Hopfield neural network approach to decentralized self-synchronizing sensor networks. Neural Comput & Applic 19, 987–996 (2010). https://doi.org/10.1007/s00521-010-0369-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-010-0369-5

Keywords

Navigation