A New Algorithm of Self Organization in Wireless Sensor Network

  • KALITA H
  • KAR A
N/ACitations
Citations of this article
22Readers
Mendeley users who have this article in their library.

Abstract

This paper surveys recent advances related to adaptation, learning, and optimization over networks. Various distributed strategies are discussed that enable a collection of networked agents to interact locally in response to streaming data and to continually learn and adapt to track drifts in the data and models. Under reasonable technical conditions on the data, the adaptive networks are shown to be mean square stable in the slow adaptation regime, and their mean square error performance and convergence rate are characterized in terms of the network topology and data statistical moments. Classical results for single-agent adaptation and learning are recovered as special cases. The performance results presented in this work are useful in comparing network topologies against each other, and in comparing adaptive networks against centralized or batch implementations. The presentation is complemented with various examples linking together results from various domains.

Cite

CITATION STYLE

APA

KALITA, H. K., & KAR, A. (2010). A New Algorithm of Self Organization in Wireless Sensor Network. Wireless Sensor Network, 02(01), 43–47. https://doi.org/10.4236/wsn.2010.21006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free