“Woah! It's like Spotify but for academic articles.”

Instant Access to Thousands of Journals for just $40/month

Get 2 Weeks Free

Block Least Mean Squares Algorithm over Distributed Wireless Sensor Network

Block Least Mean Squares Algorithm over Distributed Wireless Sensor Network Block Least Mean Squares Algorithm over Distributed Wireless Sensor Network Hindawi Publishing Corporation Home Journals About Us About this Journal Submit a Manuscript Table of Contents Journal Menu Abstracting and Indexing Aims and Scope Article Processing Charges Articles in Press Author Guidelines Bibliographic Information Contact Information Editorial Board Editorial Workflow Free eTOC Alerts Reviewers Acknowledgment Subscription Information Open Special Issues Published Special Issues Special Issue Guidelines Abstract Full-Text PDF Full-Text HTML Full-Text ePUB Linked References How to Cite this Article Journal of Computer Networks and Communications Volume 2012 (2012), Article ID 601287, 13 pages doi:10.1155/2012/601287 Research Article <h2>Block Least Mean Squares Algorithm over Distributed Wireless Sensor Network</h2> T. Panigrahi , 1 P. M. Pradhan , 2 G. Panda , 2 and B. Mulgrew 3 1 Department of ECE, National Institute of Technology, Rourkela 769008, India 2 School of Electrical Sciences, Indian Institute of Technology, Bhubaneswar 713002, India 3 Institute for Digital Communication, The University of Edinburgh, Edinburgh EH899AD, UK Received 31 October 2011; Accepted 1 December 2011 Academic Editor: Liansheng Tan Copyright © 2012 T. Panigrahi et al. This is an open access article distributed under the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In a distributed parameter estimation problem, during each sampling instant, a typical sensor node communicates its estimate either by the diffusion algorithm or by the incremental algorithm. Both these conventional distributed algorithms involve significant communication overheads and, consequently, defeat the basic purpose of wireless sensor networks. In the present paper, we therefore propose two new distributed algorithms, namely, block diffusion least mean square (BDLMS) and block incremental least mean square (BILMS) by extending the concept of block adaptive filtering techniques to the distributed adaptation scenario. The performance analysis of the proposed BDLMS and BILMS algorithms has been carried out and found to have similar performances to those offered by conventional diffusion LMS and incremental LMS algorithms, respectively. The convergence analyses of the proposed algorithms obtained from the simulation study are also found to be in agreement with the theoretical analysis. The remarkable and interesting aspect of the proposed block-based algorithms is that their communication overheads per node and latencies are less than those of the conventional algorithms by a factor as high as the block size used in the algorithms. 1. Introduction A wireless sensor network (WSN) consists of a group of sensors nodes which perform distributed sensing by coordinating themselves through wireless links. Since the nodes operate in a WSN function with limited battery power, it is important to design the networks with a minimum of communication among the nodes to estimate the required parameter vector [ 1 , 2 ]. In the literature, a number of research papers have appeared which address the energy issues of sensor networks. According to the energy estimation scheme based on the 4th power loss model with Rayleigh fading [ 3 ], the transmission of 1 kb of data over a distance of 100 m, operating at 1 GHz using BPSK modulation with 1 0 − 6 bit-error rate, requires 3 J of energy. The same energy can be used for executing 300 M instructions in a 100 MIPS/watt general purpose processor. Therefore, it is of great importance to minimize the communication among nodes by maximizing local estimation in each sensor node. Each node in a WSN collects noisy observations related to certain desired parameters. In the centralized solution, every node in the network transmits its data to a central fusion center (FC) for processing. This approach has the disadvantage of being nonrobust to the failure of the FC and also needs a powerful central processor. Again the problem with centralized processing is the lack of scalability and the requirement for a large communication resource [ 1 ]. If the intended application and the sensor architecture allow more local processing, then it would be more energy efficient compared to communication extensive centralized processing. Alternatively, each node in the network can function as an individual adaptive filter to estimate the parameter from the local observations and by cooperating with the neighbors. So there is a need to search for new distributed adaptive algorithms to reduce communication overhead for low-power consumption and low-latency systems for real-time operation. The performance of distributed algorithms depends on the mode of cooperation among the nodes, for example, incremental [ 4 , 5 ], diffusion [ 6 ], probabilistic diffusion [ 7 ], and diffusion with adaptive combiner [ 8 ]. To improve the robustness against the spatial variation of signal-to-noise ratio (SNR) over the network, recently an efficient adaptive combination strategy has been proposed [ 8 ]. Also a fully distributed and adaptive implementation to make individual decisions by each node in the network is dealt with in [ 9 ]. Since in block filtering technique [ 10 ], the filter coefficients are adjusted once for each new block of data in contrast to once for each new input sample in the least mean square (LMS) algorithm, the block adaptive filter permits faster implementation while maintaining equivalent performance as that of widely used LMS adaptive filter. Therefore, the block LMS algorithms could be used at each node in order to reduce the amount of communications. With this in mind, we present a block formulation of the existing cooperative algorithm [ 4 , 11 ] based on the distributed protocols. Distinctively, in this paper, the adaptive mechanism is proposed in which the nodes of the same neighborhood communicate with each other after processing a block of data, instead of communicating the estimates to the neighbors after every sample of input data. As a result, the average bandwidth for communication among the neighboring nodes decreases by a factor equal to the block size of the algorithm. In real-time scenarios, the nodes in the sensor network follow a particular protocol for communication [ 12 – 14 ], where the communication time is much more than the processing time. The proposed block distributed algorithm provides an excellent balance between the message transmission delay and processing delay, by increasing the interval between two messages and by increasing the computational load on each node in the interval between two successive transmissions. The main motivation here is to propose communication-efficient block distributed LMS algorithms (both incremental and diffusion type). We analyze the performance of the proposed algorithms and compare them with existing distributed LMS algorithms. The reminder of the paper is organized as follows. In Section 2 , we present the BDLMS algorithm and its network global model. The performance analysis of BDLMS and its learning characteristics obtained from a simulation study are presented in Section 3 . Performance analysis of the BILMS and its simulation results are presented in Section 4 . The performance of the proposed algorithms in terms of communication cost and latency is compared with the conventional distributed adaptive algorithms in Section 5 . Finally, Section 6 discusses the conclusions of the paper. 2. Block Adaptive Distributed Solution Consider a sensor network with ๐‘ number of sensor nodes randomly distributed over the region of interest. The topology of a sensor network is modeled by an undirected graph. Let ๐’ข be an undirected graph defined by a set of nodes ๐’ฑ and a set of edges โ„ฐ . Nodes ๐‘– and ๐‘— are called neighbors if the are connected by an edgey that is, ( ๐‘– , ๐‘— ) ∈ โ„ฐ . We also considered a loop which consists of a set of nodes ๐‘– 1 , ๐‘– 2 , … , ๐‘– ๐‘ such that the node ๐‘– ๐‘˜ is ๐‘– ๐‘˜ + 1 ’s neighbor, ๐‘˜ = 1 , 2 , … , ๐‘ , and ๐‘– 1 is ๐‘– ๐‘ ’s neighbor. Every node in the network ๐‘– ∈ ๐’ฑ is associated with noisy output ๐‘‘ ๐‘– to the input data vector ๐‘ข ๐‘– . We have assumed that the noise is independent of both input and output data; therefore, the observations are spatially and temporally independent. The neighborhood of node ๐‘– is defined as the set of nodes connected to node ๐‘– which is defined as ๐’ฉ ๐‘– = ๐‘— โˆฃ ( ๐‘– , ๐‘— ) ∈ โ„ฐ [ 15 ]. Now, the objective is to estimate an ๐‘€ × 1 unknown vector ๐ฐ โˆ˜ from the measurements of ๐‘ nodes. In order estimate this, every node is modeled as a block adaptive linear filter where each node updates its weights using the set of errors observed in the estimated output vector, and broadcasts that to its neighbors. The estimated weight vector of the ๐‘˜ th node at time ๐‘› is denoted as ๎ ๐ฐ ๐‘˜ ( ๐‘› ) . Let ๐‘ข ๐‘˜ ( ๐‘› ) be the input data of ๐‘˜ th node at time instant ๐‘› , then the input vector to the filter at time instant ๐‘› is ๐ฎ ๐‘˜ ๎€บ ๐‘ข ( ๐‘› ) = ๐‘˜ ( ๐‘› ) , ๐‘ข ๐‘˜ ( ๐‘› − 1 ) , … , ๐‘ข ๐‘˜ ๎€ป ( ๐‘› − ๐‘€ + 1 ) ๐‘‡ . ( 1 ) The corresponding desired output of the node for the input vector ๐ฎ ๐‘˜ ( ๐‘› ) is modeled as [ 16 , 17 ] ๐‘‘ ๐‘˜ ( ๐‘› ) = ๐ฎ ๐‘‡ ๐‘˜ ( ๐‘› ) ๐ฐ โˆ˜ + ๐œ ๐‘˜ ( ๐‘› ) , ( 2 ) where ๐œ ๐‘˜ ( ๐‘› ) denotes a temporally and spatially uncorrelated white noise with variance ๐œŽ 2 ๐œ , ๐‘˜ . The block index ๐‘— is related to the time index ๐‘› as ๐‘› = ๐‘— ๐ฟ + ๐‘– , ๐‘– = 0 , 1 , 2 , … , ๐ฟ − 1 , ๐‘— = 1 , 2 , … , ( 3 ) where ๐ฟ is the block length . The ๐‘— th block contains time indices ๐‘› = [ ๐‘— ๐ฟ , ๐‘— ๐ฟ + 1 , … , ๐‘— ๐ฟ + ๐ฟ − 1 ] . Combining input vectors of ๐‘˜ th node for block ๐‘— to form a matrix given by ๐— ๐‘— ๐‘˜ = ๎€บ ๐ฎ ๐‘˜ ( ๐‘— ๐ฟ ) , ๐ฎ ๐‘˜ ( ๐‘— ๐ฟ + 1 ) , … , ๐ฎ ๐‘˜ ๎€ป ( ๐‘— ๐ฟ + ๐ฟ − 1 ) ๐‘‡ , ( 4 ) the corresponding desired response at ๐‘— th block index of ๐‘˜ th node is represented as ๐ ๐‘— ๐‘˜ = ๎€บ ๐‘‘ ๐‘˜ ( ๐‘— ๐ฟ ) , ๐‘‘ ๐‘˜ ( ๐‘— ๐ฟ + 1 ) , … , ๐‘‘ ๐‘˜ ๎€ป ( ๐‘— ๐ฟ + ๐ฟ − 1 ) ๐‘‡ . ( 5 ) Let ๐ž ๐‘— ๐‘˜ represent the ๐ฟ × 1 error signal vector for ๐‘— th block of ๐‘˜ th node and is defined as ๐ž ๐‘— ๐‘˜ = ๐ ๐‘˜ ( ๐‘— ) − ๐— ๐‘— ๐‘˜ ๎ ๐ฐ ๐‘— ๐‘˜ , ( 6 ) where ๎ ๐ฐ ๐‘— ๐‘˜ estimated weight vector of the filter when ๐‘— th block of the data is input at the ๐‘˜ th node and of the order of ๐‘€ × 1 . The regression input data and corresponding desired responses are distributed across all the nodes and are represented in two global matrices: ๐— ๐‘— ๐‘ ๐‘” ๎€ฝ ๐— = c o l ๐‘— 1 , ๐— ๐‘— 2 , … , ๐— ๐‘— ๐‘ ๎€พ , ๐ ๐‘— ๐‘ ๐‘” ๎€ฝ ๐ = c o l ๐‘— 1 , ๐ ๐‘— 2 , … , ๐ ๐‘— ๐‘ ๎€พ . ( 7 ) The objective is to estimate the ๐‘€ × 1 vector ๐ฐ from the above quantities, those collected the data across ๐‘ nodes. By using this global data, the block error vector for the whole network is ๐ž ๐‘— ๐‘ ๐‘” = ๐ ๐‘— ๐‘ ๐‘” − ๐— ๐‘— ๐‘ ๐‘” ๎ ๐ฐ . ( 8 ) Now, the vector ๎ ๐ฐ can be estimated by minimizing MSE function as ๎ ๐ฐ ๐ธ โ€– โ€– ๐ m i n ๐‘ ๐‘” − ๐— ๐‘ ๐‘” ๎ ๐ฐ โ€– โ€– 2 . ( 9 ) The time index is dropped here for simple mathematical representation. Since the quantities are collected data across the network in block format; therefore, the block mean square error (BMSE) is to be minimized. The BMSE is given by [ 17 , 18 ] 1 B M S E = ๐ฟ ๎‚ƒ ๐ธ ๎‚ƒ ๐ ๐‘‡ ๐‘ ๐‘” ๐ ๐‘ ๐‘” ๎‚„ ๎‚ƒ ๐ − ๐ธ ๐‘‡ ๐‘ ๐‘” ๐— ๐‘ ๐‘” ๎‚„ ๎ ๎ ๐ฐ ๐ฐ − ๐‘‡ ๐ธ ๎‚ƒ ๐— ๐‘‡ ๐‘ ๐‘” ๐ ๐‘ ๐‘” ๎‚„ − ๎ ๐ฐ ๐‘‡ ๐ธ ๎‚ƒ ๐— ๐‘‡ ๐‘ ๐‘” ๐— ๐‘ ๐‘” ๎‚„ ๎ ๐ฐ ๎‚„ . ( 1 0 ) Let the input regression data ๐ฎ be Gaussian and defined by the correlation function ๐‘Ÿ ( ๐‘™ ) = ๐œŽ 2 ๐›ผ | ๐‘™ | in the covariance matrix, where ๐›ผ is the correlation index and ๐œŽ 2 is the variance of the input regression data, then the relation between correlation and cross-correlation quantities among blocked and unblocked data can be denoted as [ 10 ] R ๐‘‹ ๐‘ ๐‘” = ๐ฟ R ๐‘” ๐‘ˆ , R ๐‘ ๐‘” ๐‘‘ ๐‘‹ = ๐ฟ R ๐‘” ๐‘‘ ๐‘ข , R ๐‘‘ ๐‘ ๐‘” = ๐ฟ R ๐‘” ๐‘‘ , ( 1 1 ) where R ๐‘‹ ๐‘ ๐‘” = ๐ธ [ ๐— ๐‘‡ ๐‘ ๐‘” ๐— ๐‘ ๐‘” ] , R ๐‘ ๐‘” ๐‘‘ ๐‘‹ = ๐ธ [ ๐— ๐‘‡ ๐‘ ๐‘” ๐ ๐‘ ๐‘” ] , and R ๐‘‘ ๐‘ ๐‘” = ๐ธ [ ๐ ๐‘‡ ๐‘ ๐‘” ๐ ๐‘ ๐‘” ] , which are the autocorrelation and cross-correlation matrices for global data in blocked form. Similarly, the correlation matrices for unblocked data are defined as R ๐‘” ๐‘ˆ = ๐ธ [ ๐” ๐‘‡ ๐‘” ๐” ๐‘” ] , R ๐‘” ๐‘‘ ๐‘ข = ๐ธ [ ๐” ๐‘‡ ๐‘” ๐ ๐‘” ] , and R ๐‘” ๐‘‘ = ๐ธ [ ๐ ๐‘‡ ๐‘” ๐ ๐‘” ] where the global distribution of data across the network is represented as ๐” ๐‘” = [ ๐ฎ 1 , ๐ฎ 2 , … , ๐ฎ ๐‘ ] ๐‘‡ and ๐ ๐‘” = [ ๐ 1 , ๐ 2 , … , ๐ ๐‘ ] ๐‘‡ . These relations are also valid for node data in individual nodes. Now, the block mean square error (BMSE) in ( 10 ) is reduced to 1 B M S E = ๐ฟ ๎‚ƒ ๐ฟ R ๐‘” ๐‘‘ − ๐ฟ R ๐‘” ๐‘‘ ๐‘ข ๎ ๎ ๐ฐ ๐ฐ − ๐ฟ ๐‘‡ R ๐‘” ๐‘‘ ๐‘ข − ๐ฟ ๐ฐ ๐‘‡ R ๐‘” ๐‘ข ๎ ๐ฐ ๎‚„ = R ๐‘” ๐‘‘ − R ๐‘” ๐‘‘ ๐‘ข ๎ ๎ ๐ฐ ๐ฐ − ๐‘‡ R ๐‘” ๐‘‘ ๐‘ข − ๐ฐ ๐‘‡ R ๐‘” ๐‘ข ๎ ๐ฐ = M S E . ( 1 2 ) Comparing ( 12 ) with the MSE of conventional LMS for global data [ 17 , 19 ], it can be concluded that the MSE in both the cases is same. Hence, block LMS algorithm has similar properties as that of the conventional LMS algorithm. Now, ( 9 ) for blocked data can be reduced to a form similar to that of unblocked data as ๎ ๐ฐ ๐ธ โ€– โ€– ๐ m i n ๐‘” − ๐” ๐‘” ๎ ๐ฐ โ€– โ€– 2 . ( 1 3 ) The basic difference between blocked and unblocked LMS lies in the estimation of the gradient vector used in their respective implementation. The block LMS algorithm uses a more accurately estimated gradient because of the time averaging. The accuracy increases with the increase in block size. Taking into account the advantages of block LMS over conventional LMS, the distributed block LMS is proposed here. 2.1. Adaptive Block Distributed Algorithms In adaptive block LMS algorithm, each node ๐‘˜ in the network receives the estimates from its neighboring nodes after each block of input data to adapt the local changes in the environment. Two different types of distributed LMS in WSN have been reported in literature, namely, incremental and diffusion LMS [ 6 , 19 ]. These algorithms are based on conventional LMS for local learning process which in terms needs large communication resources. In order to achieve the same performance with less communication resource, the block distributed LMS is proposed here. 2.1.1. The Block Incremental LMS (BILMS) Algorithm In an incremental mode of cooperation, information flows in a sequential manner from one node to the adjacent one in the network after processing one sample of data [ 4 ]. The communications in the incremental way of cooperation can be reduced if each node need to communicate only after processing a block of data. For any block of data ๐‘— , it is assumed that node ๐‘˜ has access to the ๎ ๐ฐ ๐‘— ๐‘˜ − 1 estimates from its predecessor node, as defined by the network topology and constitution. Based on these assumptions, the proposed block incremental LMS algorithm can be stated by reducing the conventional incremental LMS algorithm ((16) in [ 19 ]) to a blocked data form as follows, ๎ ๐ฐ ๐‘— 0 = ๎ ๐ฐ ๐‘— − 1 , ๎ ๐ฐ ๐‘— ๐‘˜ = ๎ ๐ฐ ๐‘— ๐‘˜ − 1 + ๐œ‡ ๐‘˜ ๐ฟ ๐ฟ − 1 ๎“ ๐‘ž = 0 ๐ฎ ๐‘˜ × ๎‚€ ๐‘‘ ( ๐‘— ๐ฟ + ๐‘ž ) ๐‘˜ ( ๐‘— ๐ฟ + ๐‘ž ) − ๐ฎ ๐‘‡ ๐‘˜ ๎ ๐ฐ ( ๐‘— ๐ฟ + ๐‘ž ) ๐‘— ๐‘˜ − 1 ๎‚ = ๎ ๐ฐ ๐‘— ๐‘˜ − 1 + ๐œ‡ ๐‘˜ ๐ฟ ๐— ๐‘— ๐‘‡ ๐‘˜ ๎‚€ ๐ ๐‘— ๐‘˜ − ๐— ๐‘— ๐‘˜ ๎ ๐ฐ ๐‘— ๐‘˜ − 1 ๎‚ ๎ ๐ฐ , f o r ๐‘˜ = 1 , 2 , … ๐‘ , ๐‘— = ๎ ๐ฐ ๐‘— ๐‘ , ( 1 4 ) where ๐œ‡ ๐‘˜ is the local step size, and ๐ฟ is the block size. 2.1.2. The Block Diffusion LMS (BDLMS) Algorithm Here, each node ๐‘˜ updated its estimate by using a simple local rule based on the average of its own estimates plus the information received from its neighbor ๐’ฉ ๐‘˜ . In this case, for every ๐‘— th block of data at the ๐‘˜ th node, the node has access to a set of estimates from its neighbors ๐’ฉ ๐‘˜ . Similar to block incremental LMS, the proposed block diffusion strategy for a set of local combiners ๐‘ ๐‘˜ ๐‘™ and for local step size ๐œ‡ ๐‘˜ can be described as a reduced form of conventional diffusion LMS [ 6 , 20 ] as ๐œฝ ๐‘˜ ๐‘— − 1 = ๎“ ๐‘™ ∈ ๐’ฉ ๐‘˜ , ๐‘— − 1 ๐‘ ๐‘˜ ๐‘™ ๎ ๐ฐ ๐‘˜ ๐‘— − 1 , ๐œฝ ๐‘˜ ๎ ๐ฐ ( − 1 ) = 0 , ๐‘— ๐‘˜ = ๐œฝ ๐‘˜ ๐‘— − 1 + ๐œ‡ ๐‘˜ ๐ฟ ๐ฟ − 1 ๎“ ๐‘ž = 0 ๐ฎ ๐‘˜ ( × ๎‚€ ๐‘‘ ๐‘— ๐ฟ + ๐‘ž ) ๐‘˜ ( ๐‘— ๐ฟ + ๐‘ž ) − ๐ฎ ๐‘‡ ๐‘˜ ( ๐‘— ๐ฟ + ๐‘ž ) ๐œฝ ๐‘˜ ๐‘— − 1 ๎‚ . ( 1 5 ) The weight update equation can be rewritten in more compact form by using the data in block format given in ( 4 ) and ( 5 ) as ๎ ๐ฐ ๐‘— ๐‘˜ = ๐œฝ ๐‘˜ ๐‘— − 1 + ๐œ‡ ๐‘˜ ๐ฟ ๐— ๐‘— ๐‘˜ ๐‘‡ ๎‚€ ๐ ๐‘— ๐‘˜ − ๐— ๐‘— ๐‘˜ ๐œฝ ๐‘˜ ๐‘— − 1 ๎‚ . ( 1 6 ) Comparing ( 15 ) with (19) in [ 21 ], it is concluded that the weight update equation is modified into block format. 3. Performance Analysis of BDLMS Algorithm The performance of an adaptive filter is evaluated in terms of its transient and steady-state behaviors, which, respectively provide the information about how fast and how well a filter is capable to learn. Such performance analysis is usually challenging in interconnected network because each node ๐‘˜ is influenced by local data with local statistics { ๐‘… ๐‘‘ ๐‘ฅ , ๐‘˜ , ๐‘… ๐‘‹ , ๐‘˜ } , by its neighborhood nodes through local diffusion, and by local noise with variance ๐œŽ 2 ๐œ , ๐‘˜ . In case of block distributed system, the analysis becomes more challenging as it has to handle data in block form. The key performance metrics used in the analysis are MSD (mean square deviation), EMSE (excess mean square error), and MSE for local and also for global networks and are defined as ๐œ‚ ๐‘— ๐‘˜ โ€– โ€– ๎‚ ๐ฐ = ๐ธ ๐‘— ๐‘˜ − 1 โ€– โ€– 2 ๐œ ( M S D ) , ๐‘— ๐‘˜ โ€– โ€– ๐‘’ = ๐ธ ๐‘— ๐‘Ž , ๐‘˜ โ€– โ€– 2 ( ๐œ‰ E M S E ) , ๐‘— ๐‘˜ โ€– โ€– ๐‘’ = ๐ธ ๐‘˜ โ€– โ€– ( ๐‘— ) 2 = ๐œ ๐‘— ๐‘˜ + ๐œŽ 2 ๐œ , ๐‘˜ ( M S E ) , ( 1 7 ) and the local error signals such as weight error vector and a priori error at ๐‘˜ th node for ๐‘— th block are given as ๎‚ ๐ฐ ๐‘— ๐‘˜ − 1 = ๐ฐ โˆ˜ − ๎ ๐ฐ ๐‘— ๐‘˜ − 1 , ๐‘’ ๐‘— ๐‘Ž , ๐‘˜ = ๐ฎ ๐‘— ๐‘˜ ๎‚ ๐ฐ ๐‘— ๐‘˜ − 1 . ( 1 8 ) The algorithm described in ( 15 ) is looking like the interconnection of block adaptive filters instead of conventional LMS adaptive algorithm among all the nodes across the network. As shown in ( 12 ) that the block LMS algorithm has similar properties to those of the conventional LMS algorithm, the convergence analysis of the proposed block diffusion LMS algorithm can be carried out similar to the diffusion LMS algorithm described in [ 18 , 21 ]. The estimated weight vector for ๐‘— th block across the network is defined as ๎ ๐ฐ ๐‘— = ๎‚ƒ ๎ ๐ฐ ๐‘— 1 ๎ ๐ฐ ; … ; ๐‘— ๐‘ ๎‚„ . ( 1 9 ) Let ๐ถ be the ๐‘ × ๐‘ metropolis with entries [ ๐‘ ๐‘˜ ๐‘™ ] , then the global transaction combiner matrix ๐บ is defined as ๐บ = ๐ถ ⊗ ๐ผ ๐‘€ . The diffusion global vector for ๐‘— th block is defined as ๐œฝ ๐‘— ๎ ๐ฐ = ๐บ ๐‘— . ( 2 0 ) Now, the input data vector at ๐‘— th block is defined as ๐— ๐‘— ๎€ฝ ๐— = d i a g ๐‘— 1 , … , ๐— ๐‘— ๐‘ ๎€พ . ( 2 1 ) The desired block responses at each node ๐‘˜ are assumed which have to obey the traditional data model used in literature [ 16 – 18 ], that is, ๐ ๐‘— ๐‘˜ = ๐— ๐‘— ๐‘˜ ๐ฐ โˆ˜ + ๐ฏ ๐‘— ๐‘˜ , ( 2 2 ) where ๐ฏ ๐‘— ๐‘˜ is the background noise vector of length ๐ฟ . The noise is assumed to be spatially and temporarily independent with variance ๐œŽ 2 ๐œ , ๐‘˜ . Using blocked desired response for single node ( 17 ), the global response for ๐‘˜ th block can be modeled as ๐ ๐‘— ๐‘ ๐‘” = ๐— ๐‘— ๐‘ ๐‘” ๐ฐ โˆ˜ ๐‘” + ๐ฏ ๐‘— , ( 2 3 ) where ๐ฐ โˆ˜ ๐‘” is the optimum global weight vector defined for every node and is written as ๐ฐ โˆ˜ ๐‘” = [ ๐ฐ โˆ˜ ; , … , ; ๐ฐ โˆ˜ ] and ๐ฏ ๐‘— = ๎€บ ๐ฏ ๐‘— 1 ; , … , ; ๐ฏ ๐‘— ๐‘ ๎€ป ( ๐ฟ ๐‘ × 1 ) ( 2 4 ) is the additive Gaussian noise for ๐‘— th block index. Using the relations defined above, the block diffusion strategy in ( 15 ) can be written in global form as ๎ ๐ฐ ๐‘— = ๐œฝ ๐‘— − 1 + 1 ๐ฟ ๐’ ๐— ๐‘— ๎‚€ ๐ ๐‘— ๐‘ ๐‘” − ๐— ๐‘— ๐œฝ ๐‘— − 1 ๎‚ , ( 2 5 ) where the step sizes for all the nodes are embedded in a matrix ๐’ , ๎€ฝ ๐œ‡ ๐’ = d i a g 1 I ๐‘€ , ๐œ‡ 2 I ๐‘€ , … , ๐œ‡ ๐‘ I ๐‘€ ๎€พ ( ๐‘ ๐‘€ × ๐‘ ๐‘€ ) . ( 2 6 ) Using ( 20 ), it can be written as ๎ ๐ฐ ๐‘— ๎ ๐ฐ = ๐บ ๐‘— − 1 + 1 ๐ฟ ๐’ ๐— ๐‘— ๎‚€ ๐ ๐‘— ๐‘ ๐‘” − ๐— ๐‘— ๐บ ๎ ๐ฐ ๐‘— − 1 ๎‚ . ( 2 7 ) 3.1. Mean Transient Analysis The mean behavior of the proposed BDLMS is similar to diffusion LMS given in [ 18 , 21 ]. The mean error vector signal is given as ๐ธ ๎€บ ๎‚ ๐ฐ ๐‘— ๎€ป = ๎‚€ I ๐‘ ๐‘€ − 1 ๐ฟ ๐’ R ๐‘‹ ๎‚ ๎‚ƒ ๎‚ ๐ฐ ๐บ ๐ธ ๐‘— − 1 ๎‚„ , ( 2 8 ) where R ๐‘‹ = d i a g { R ๐‘‹ , 1 , R ๐‘‹ , 2 , … , R ๐‘‹ , ๐‘ } is a block diagonal matrix and R ๐‘‹ , ๐‘˜ ๎€บ ๐— = ๐ธ ๐‘˜ ๐‘‡ ๐— ๐‘˜ ๎€ป ๎€บ ๐” = ๐ฟ ๐ธ ๐‘‡ ๐‘˜ ๐” ๐‘˜ ๎€ป = ๐ฟ R ๐‘ˆ . ( 2 9 ) Hence, ( 28 ) can be written as ๐ธ ๎€บ ๎‚ ๐ฐ ๐‘— ๎€ป = ๎€ท I ๐‘ ๐‘€ − ๐’ R ๐‘ˆ ๎€ธ ๎‚ƒ ๎‚ ๐ฐ ๐บ ๐ธ ๐‘— − 1 ๎‚„ . ( 3 0 ) Comparing ( 30 ) with that of diffusion LMS (( 35 ) in [ 21 ]), we can find that both block diffusion LMS and diffusion LMS yield the same characteristic equation for the convergence of mean; and it can be concluded that block diffusion protocol defined in ( 15 ) has the same stabilizing effect on the network as diffusion LMS, 3.2. Mean-Square Transient Analysis The variance estimate is a key performance indicator in mean-square transient analysis of any adaptive system. The variance relation for block data is similar to that of conventional diffusion LMS ๐ธ โ€– โ€– ๎‚ ๐ฐ ๐‘— โ€– โ€– 2 Σ โ€– โ€– ๎‚ ๐ฐ = ๐ธ ๐‘— − 1 โ€– โ€– 2 Σ ′ + 1 ๐ฟ 2 ๐ธ ๎‚ƒ ๐ฏ ๐‘— ๐‘‡ ๐— ๐‘— ๐’ Σ ๐’ ๐— ๐‘— ๐‘‡ ๐ฏ ๐‘— ๎‚„ Σ , ( 3 1 ) ๎…ž = ๐บ ๐‘‡ 1 Σ ๐บ − ๐ฟ ๐บ ๐‘‡ ๎‚ƒ ๐— Σ ๐’ ๐ธ ๐‘— ๐‘‡ ๐— ๐‘— ๎‚„ ๐บ − 1 ๐ฟ ๐บ ๐‘‡ ๐ธ ๎‚ƒ ๐— ๐‘— ๐‘‡ ๐— ๐‘— ๎‚„ + 1 ๐’ Σ ๐บ ๐ฟ 2 ๐บ ๐‘‡ ๐ธ ๎‚ƒ ๐— ๐‘— ๐‘‡ ๐— ๐‘— ๎‚„ ๎‚ƒ ๐— ๐’ Σ ๐’ ๐ธ ๐‘— ๐‘‡ ๐— ๐‘— ๎‚„ ๐บ . ( 3 2 ) Using ๐ธ [ ๐— ๐‘— ๐‘‡ ๐— ๐‘— ] = ๐ฟ ๐ธ [ ๐” ๐‘— ๐‘‡ ๐” ๐‘— ] from the definition in ( 32 ), we obtain Σ ๎…ž = ๐บ ๐‘‡ Σ ๐บ − ๐บ ๐‘‡ ๎‚ƒ ๐” Σ ๐’ ๐ธ ๐‘— ๐‘‡ ๐” ๐‘— ๎‚„ ๐บ − ๐บ ๐‘‡ ๐ธ ๎€บ ๐” ( ๐‘— ) ๐‘‡ ๐” ๐‘— ๎€ป ๐’ Σ ๐บ + ๐บ ๐‘‡ ๐ธ ๎‚ƒ ๐” ๐‘— ๐‘‡ ๐” ๐‘— ๎‚„ ๎‚ƒ ๐” ๐’ Σ ๐’ ๐ธ ๐‘— ๐‘‡ ๐” ๐‘— ๎‚„ ๐บ , ( 3 3 ) which is similar to (45) in [ 21 ]. Using the properties of expectation and trace [ 18 ], the second term of ( 31 ) is solved as 1 ๐ฟ 2 ๐ธ ๐ฏ ๐‘— ๐‘‡ ๐— ๐‘— ๐’ Σ ๐’ ๐— ๐‘— ๐‘‡ ๐ฏ ๐‘— = 1 ๐ฟ 2 ๐ธ ๎‚ƒ ๎‚ƒ ๐— t r ๐‘— ๐’ Σ ๐’ ๐— ๐‘— ๐‘‡ ๐ธ ๎‚ƒ ๐ฏ ๎‚„ ๎‚„ ๐‘— ๐‘‡ ๐ฏ ๐‘— ๎‚„ ๎‚ƒ ๐ง = ๐ธ ๐‘— ๐‘‡ ๐” ๐‘— ๐’ Σ ๐’ ๐” ๐‘— ๐‘‡ ๐ง ๐‘— ๎‚„ , ( 3 4 ) where the noise variance vector ๐ง ๐‘— is not in block form, and it is assumed that the noise is stationary Gaussian. Equations ( 31 ) and ( 32 ) may therefore be written as ๐ธ โ€– โ€– ๎‚ ๐ฐ ๐‘— โ€– โ€– 2 Σ โ€– โ€– ๎‚ ๐ฐ = ๐ธ ๐‘— − 1 โ€– โ€– 2 Σ ′ + 1 ๐ฟ 2 ๐ธ ๐ง ๐‘— ๐‘‡ ๐” ๐‘— ๐’ Σ ๐’ ๐” ๐‘— ๐‘‡ Σ ๐ง ( ๐‘— ) , ( 3 5 ) ๎…ž = ๐บ ๐‘‡ Σ ๐บ − ๐บ ๐‘‡ ๎‚€ ๐” Σ ๐’ ๐ธ ๐‘— ๐‘‡ ๐” ๐‘— ๎‚ ๐บ − ๐บ ๐‘‡ ๐ธ ๎‚€ ๐” ๐‘— ๐‘‡ ๐” ๐‘— ๎‚ ๐’ Σ ๐บ + ๐บ ๐‘‡ ๐ธ ๎‚€ ๐” ๐‘— ๐‘‡ ๐” ๐‘— ๎‚ ๎‚€ ๐” ๐’ Σ ๐’ ๐ธ ๐‘— ๐‘‡ ๐” ๐‘— ๎‚ ๐บ . ( 3 6 ) It may be noted that variance estimate ( 36 ) for BDLMS algorithm is exactly the same as that of DLMS [ 21 ]. In the block LMS algorithm, the local step size is chosen to be ๐ฟ times that of the local step size of diffusion LMS in order to have the same level of performance. As the proposed algorithm and the diffusion LMS algorithm have similar properties, the evolution of their variances is also similar. Therefore, the recursion equation of the global variances for BDLMS will be similar to (73) and (74) in [ 21 ]. Similarly, the local node performances will be similar to (89) and (91) of [ 21 ]. 3.3. Learning Behavior of BDLMS Algorithm The learning behavior of BDLMS algorithm is examined using simulations. The characteristic or variance curves are plotted for block LMS and are compared with that of DLMS. The row regressors with shift invariance input [ 18 ] are used with each regressor having data as ๐ฎ ๐‘˜ ๎€บ ๐‘ข ( ๐‘– ) = ๐‘˜ ( ๐‘– ) , ๐‘ข ๐‘˜ ( ๐‘– − 1 ) , … , ๐‘ข ๐‘˜ ๎€ป ( ๐‘– − ๐‘€ + 1 ) ๐‘‡ . ( 3 7 ) In block LMS, the regressors for ๐ฟ = 3 and ๐‘€ = 3 are given as ๐— ๐‘˜ โŽ› โŽœ โŽœ โŽœ โŽœ โŽ ๐‘ข ( 1 ) = ๐‘˜ ๐‘ข ( 1 ) 0 0 ๐‘˜ ( 2 ) ๐‘ข ๐‘˜ ( ๐‘ข 1 ) 0 ๐‘˜ ( 3 ) ๐‘ข ๐‘˜ ( 2 ) ๐‘ข ๐‘˜ โŽž โŽŸ โŽŸ โŽŸ โŽŸ โŽ  , ๐— ( 1 ) ๐‘˜ โŽ› โŽœ โŽœ โŽœ โŽœ โŽ ๐‘ข ( 2 ) = ๐‘˜ ( 4 ) ๐‘ข ๐‘˜ ( 3 ) ๐‘ข ๐‘˜ ๐‘ข ( 2 ) ๐‘˜ ( 5 ) ๐‘ข ๐‘˜ ( 4 ) ๐‘ข ๐‘˜ ๐‘ข ( 3 ) ๐‘˜ ( 6 ) ๐‘ข ๐‘˜ ( 5 ) ๐‘ข ๐‘˜ โŽž โŽŸ โŽŸ โŽŸ โŽŸ โŽ  . ( 4 ) ( 3 8 ) The desired data are generated according to the model given in literature [ 18 ]. The unknown vector ๐ฐ โˆ˜ is set to [ 1 , 1 , … , 1 ] ๐‘‡ / √ ๐‘€ . The input sequence { ๐ฎ ๐‘˜ ( ๐‘– ) } is assumed to be spatially correlated and is generated as ๐‘ข ๐‘˜ ( ๐‘– ) = ๐‘Ž ๐‘˜ ⋅ ๐‘ข ๐‘˜ ( ๐‘– − 1 ) + ๐‘ ๐‘˜ ⋅ ๐‘› ๐‘˜ ( ๐‘– ) , ๐‘– > − ∞ . ( 3 9 ) Here, ๐‘Ž ๐‘˜ ∈ [ 0 , 1 ) is the correlation index, and ๐‘› ๐‘˜ ( ๐‘– ) is a spatially independent white Gaussian process with unit variance and ๐‘ ๐‘˜ = ๎” ๐œŽ 2 ๐‘ข , ๐‘˜ ⋅ ( 1 − ๐‘Ž 2 ๐‘˜ ) . The regressors power profile is given by { ๐œŽ 2 ๐‘ข , ๐‘˜ } ∈ ( 0 , 1 ] . The resulting regressors have Toeplitz covariance with corelation sequence ๐‘Ÿ ๐‘˜ ( ๐‘– ) = ๐œŽ 2 ๐‘ข , ๐‘˜ ⋅ ( ๐‘Ž ๐‘˜ ) | ๐‘– | , ๐‘– = 0 , 1 , 2 , … , ๐‘€ − 1 . Figure 1 shows an eight-node network topology used in the simulation study. The network settings are given in Figures 2(a) and 2(b) . Figure 1: Network topology used for block diffusion LMS. Figure 2: Network statistics used for the simulation of BDLMS. (a) Network corelation index per node. (b) Regressor power profile. 3.4. The Simulation Conditions The algorithm is valid for any block of length greater than one [ 10 ], while ๐ฟ = ๐‘€ is the most preferable and optimum choice. The background noise is assumed to be Gaussian white noise of variance ๐œŽ 2 ๐œ , ๐‘˜ = 1 0 − 3 , and the data used in the study is generated using ๐‘‘ ๐‘˜ ( ๐‘› ) = ๐ฎ ๐‘˜ ( ๐‘› ) ๐ฐ โˆ˜ + ๐‘ฃ ๐‘˜ ( ๐‘› ) . In order to generate the performance curves, 50 independent experiments are performed and averaged. The results are obtained by averaging the last 50 samples of the corresponding learning curves. The global MSD curve is shown in Figure 3 . This is obtained by averaging ๎‚ ๐‘ค ๐ธ โ€– ๐‘˜ ๐‘— − 1 โ€– 2 across all the nodes over 100 experiments. Similarly, the global EMSE curve obtained by averaging ๐ธ โ€– ๐ž ๐ฃ ๐‘Ž , ๐‘˜ โ€– 2 , where ๐ž ๐ฃ ๐‘Ž , ๐‘˜ = ๐ฑ ๐‘— ๐‘˜ ๎‚ ๐‘ค ๐‘˜ ๐‘— − 1 , across all the nodes over 100 experiments is displayed in Figure 4 . The global MSE is depicted in Figure 5 . It shows that in both the cases the MSE is exactly matching. Figure 3: Global mean-square deviation (MSD) curve for diffusion and block diffusion LMS. Figure 4: Global excess mean-square deviation (EMSE) curve for diffusion and block diffusion LMS. Figure 5: Global mean-square deviation (MSE) curve for diffusion and block diffusion LMS. Since the weights are updated and then communicated for local diffusion after every ๐ฟ data samples, the number of communications between neighbors is reduced by ๐ฟ times compared to that of the diffusion LMS case where the weights are updated and communicated after each sample of data. The global performances are the contributions of all individual nodes, and it is obtained by taking the mean performance of all the nodes. The simulation results are provided to compare with that obtained by diffusion LMS for individual node. The local MSD evolution at node 1 is given in Figure 6(a) and at node 5 is given in Figure 6(b) . Similarly, the local EMSE evolution at nodes 1 and 7 is depicted in Figure 7 . The convergence speed is nearly the same in both MSD and EMSE evolution, but the performance is slightly degraded in case of BDLMS. The loss of performance in case of BDLMS could be traded for the huge reduction in of communication bandwidth. Figure 6: Local mean-square deviation (MSD) comparison between block diffusion LMS and diffusion LMS. (a) MSD curve at node 1. (b) MSD curve at node 7. Figure 7: Local EMSE at node 7 for the same network. 4. Performance Analysis of BILMS Algorithm To show that the BILMS algorithm has guaranteed convergence, we may follow the steady-state performance analysis of the algorithm using the same data model as the one which is commonly used in the conventional sequential adaptive algorithms [ 5 , 22 , 23 ]. The weight-energy relation is derived by using the definition of weighted a priori and a posteriori error [ 18 ] โ€– โ€– ๎‚ ๐ฐ ๐‘— ๐‘˜ โ€– โ€– 2 Σ + | | | ๐‘’ ๐‘— Σ ๐‘Ž , ๐‘˜ | | | 2 โ€– โ€– ๐— ๐‘— ๐‘˜ โ€– โ€– 2 Σ = โ€– โ€– ๎‚ ๐ฐ ๐‘— ๐‘˜ − 1 โ€– โ€– 2 Σ + | | | ๐‘’ ๐‘— Σ ๐‘ , ๐‘˜ | | | 2 โ€– โ€– ๐— ๐‘— ๐‘˜ โ€– โ€– 2 Σ . ( 4 0 ) Since ( 40 ) is similar to that of (35) in [ 19 ]. Thus, the performance of BILMS is similar to that of ILMS. The variance expression is obtained from the energy relation ( 40 ) by replacing a posteriori error by its equivalent expression and then averaging both the sides ๐ธ ๎‚ƒ โ€– โ€– ๎‚ ๐ฐ ๐‘— ๐‘˜ โ€– โ€– 2 Σ ๎‚„ ๎‚ƒ โ€– โ€– ๎‚ ๐ฐ = ๐ธ ๐‘— ๐‘˜ − 1 โ€– โ€– 2 Σ ′ ๎‚„ + | | | ๐œ‡ ๐‘˜ ๐ฟ | | | 2 ๐ธ ๎‚ƒ ๐‘‰ ๐‘— ๐‘‡ ๐‘˜ ๐— ๐‘— ๐‘˜ Σ ๐— ๐‘— ๐‘‡ ๐‘˜ ๐‘‰ ๐‘— ๐‘˜ ๎‚„ Σ ๎…ž ๐œ‡ = Σ − ๐‘˜ ๐ฟ ๎‚€ Σ ๐— ๐‘— ๐‘‡ ๐‘˜ ๐— ๐‘— ๐‘˜ + ๐— ๐‘— ๐‘‡ ๐‘˜ ๐— ๐‘— ๐‘˜ Σ ๎‚ + | | | ๐œ‡ ๐‘˜ ๐ฟ | | | 2 ๐— ๐‘— ๐‘‡ ๐‘˜ ๐— ๐‘— ๐‘˜ Σ ๐— ๐‘— ๐‘‡ ๐‘˜ ๐— ๐‘— ๐‘˜ . ( 4 1 ) The variance relation in ( 41 ) is similar to the variance relation of ILMS in [ 19 ]. The performance of ILMS is studied in detail in literature. It is observed that the theoretical performance of block incremental LMS and conventional incremental LMS algorithms are similar because both have the same variance expressions. Simulation results provide the validation of this analysis. 4.1. Simulation Results of BILMS Algorithm For the simulation study of IBLMS, we have used the regressors with shift-invariance as with the same desired data used in the case of BDLMS algorithm. The time-correlated sequences are generated at every node according to the network statistics. The same network has been chosen here for simulation study as defined for block diffusion network in Section 3.3 . In incremental way of cooperation, each node receives information from its previous node, updates it by using own data, and sends the updated estimate to the next node. The ring topology used here is shown in Figure 8 . We assume that the background noise to be temporarily and spatially uncorrelated additive white Gaussian noise with variance 1 0 − 3 . The learning curves are obtained by averaging the performance of 100 independent experiments, generated by 5,000 samples in the network. It can be observed from figures that the steady-state performances at different nodes of the network achieved by BILMS matche very closely with that of ILMS algorithm. The EMSE plots which are more sensitive to local statistics are depicted in Figures 9(a) and 9(b) . A good match between BILMS and ILMS is observed from these plots. In [ 19 ], the authors have already proved the theoretical matching of steady-state nodal performance with simulation results. As the MSE roughly reflects the noise power and the plot indicates the good performance of the adaptive network, it may be inferred that the adaptive node performs well in the steady state. Figure 8: Network topology. Figure 9: Network nodal performance. (a) Mean-square error (MSE) versus node. (b) excess mean-square error (EMSE) versus node. (c) Mean-square deviation (MSD) versus node. The global MSD curve shown in Figure 10 is obtained by averaging ๎‚ ๐ ๐ธ โ€– ๐‘˜ ( ๐‘— − 1 ) โ€– 2 across all the nodes and over 50 experiments. Similarly, the global EMSE and MSE plots are displayed in Figures 11 and 12 , respectively. These are obtained by averaging ๐ธ โ€– ๐ž ๐‘Ž , ๐‘˜ ( ๐‘— ) โ€– 2 , where ๐ž ๐‘Ž , ๐‘˜ ( ๐‘— ) = ๐ฑ ๐‘˜ , ๐‘— ๎‚ ๐ ๐‘˜ ( ๐‘— − 1 ) across all the nodes over 50 experiments. Figure 10: Global mean-square deviation (MSD) curve for incremental LMS and block incremental LMS. Figure 11: Global excess mean-square deviation (EMSE) curve for incremental LMS and block incremental LMS. Figure 12: Global mean-square deviation (MSE) curve for incremental LMS and block incremental LMS. If the weights are updated after ๐ฟ data points and then communicated for local diffusion, the number of communications between neighbors is reduced by ๐ฟ times that of ILMS where the weights are updated after processing each sample of data. Therefore, similar to BDLMS, the communication overhead in BILMS also gets reduced by ๐ฟ times that of ILMS algorithm. The performance comparison between two proposed algorithms BDLMS and BILMS for the same network is shown in Figures 13 – 15 . One can observe from Figure 13 that the MSE for BILMS algorithm is converging faster than BDLMS. Since the same noise model is used for both the algorithms, therefore after convergence, the steady-state performances are the same for both of them. But in case of MSD and EMSE performances in Figures 14 and 15 , little difference is observed. It is due the different cooperation scheme used for different algorithms. However, the diffusion cooperation scheme is more adaptive to the environmental change compared to the incremental cooperation. But a higher number of communication overhead are required for BDLMS than BILMS algorithm. Figure 13: Global mean-square error curve for BILMS and BDLMS. Figure 14: Global mean-square deviation curve for BILMS and BDLMS. Figure 15: Global excess mean-square error curve for BILMS and BDLMS. 5. Performance Comparison In this section, we present an analysis of communication cost and latency to have a theoretical comparison of the performances of distributed LMS with block distributed LMS. 5.1. Analysis of Communication Cost Assuming that the messages are of fixed bit width, the communication cost is modeled as the number of messages transmitted to achieve the steady-state value in the network. Let ๐‘ be the number of nodes in the network, and let ๐‘€ be the filter length. The block length ๐ฟ is chosen to be the same as the filter length. Let โ„Ž be the average time required for the transmission of one message, that is, for one communication between the nodes [ 24 – 26 ]. 5.1.1. ILMS and BILMS Algorithms In the incremental mode of cooperation, every node sends its own estimated weight vector to its adjacent node in a unidirectional cyclic manner. Since at any instant of time, only one node is active/allowed to transmit to only one designated node, the number of messages transmitted in one complete cycle is ๐‘ − 1 . Let ๐พ be the number of cycles required to attain the steady-state value in the network. Therefore, the total number of communications required to converge the system to steady state is given by ๐ถ I L M S = ( ๐‘ − 1 ) ๐พ . ( 4 2 ) In case of BILMS also, at any instant of time, only one node in the network is active/allowed to transmit to one designated follower node, as in the case of ILMS. But, in case of BILMS, each node sends its estimated weight vector to its follower node in the network after an interval of ๐ฟ sample periods after processing a block of ๐ฟ data samples. Therefore, the number of messages sent by a node in this case is reduced to ๐พ / ๐ฟ , and accordingly, the total communication cost is given by ๐ถ B I L M S = ( ๐‘ − 1 ) ๐พ ๐ฟ . ( 4 3 ) 5.1.2. DLMS and BDLMS Algorithms The diffusion-based algorithms are communication intensive. In DLMS mode of cooperation, in each cycle, each node in the network sends its estimated information to all its connected nodes in the network. So the total number of messages transmitted by all the nodes in a cycle is ๐‘ = ๐‘ ๎“ ๐‘– = 1 ๐‘› ๐‘– , ( 4 4 ) where ๐‘› ๐‘– is the number of nodes connected to the ๐‘– th node, and the total communication cost to attain convergence is given by ๐ถ D L M S = ๐‘ ๐พ . ( 4 5 ) In this proposed block diffusion strategy, the number of connected nodes ๐‘› ๐‘– and the total size of the messages remain the same as that of DLMS. But, in case of BDLMS algorithm, each node distributes the message after ๐ฟ data samples. Therefore the communication is reduced by a factor equal to the block length, and the total communication cost in this case is given by ๐ถ B D L M S = ๐‘ ๐พ ๐ฟ . ( 4 6 ) 5.2. Analysis of Duration for Convergence The time interval between the arrival of input to a node and the time of reception of corresponding updates by the designated node(s) may be assumed to be comprised of two major components. Those are processing delay to perform the necessary computations in a node to obtain the estimates to be updated and the communication delay involved in transferring the message to the receiver node(s). The processing delay will very much depend on the hardware architecture of the nodes to perform the computation which could be widely varying. But, without losing much of the generality of analysis, we can assume that each node has ๐‘€ parallel multipliers and one full adder to implement the LMS algorithm. Let ๐‘‡ ๐‘€ and ๐‘‡ ๐ด be the time required for executing a multiplication and an addition, respectively. Therefore, the processing delay needed for single update in LMS is ๐ท = 2 ๐‘‡ ๐‘€ + ( ๐‘€ + 1 ) ๐‘‡ ๐ด . ( 4 7 ) The communication delay is mostly due to the implementation of protocols for transmission and reception, which remains almost the same for different nodes. The location of nodes will not have any major contribution to the delay unless the destination node is far apart, and a relay node is required to make the message reach the destination. In this backdrop, we can assume that the same average delay โ„Ž is required to transfer each message for all receiver-transmitter pairs in the network. 5.2.1. Estimation of Delays for the ILMS and BILMS Algorithms In case of ILMS, the duration of each updating cycle by all the nodes is ๐‘ ๐ท + ( ๐‘ − 1 ) โ„Ž , ( 4 8 ) and the total duration for convergence of the network is given as ๐ฟ I L M S = [ ] ๐‘ ๐ท + ( ๐‘ − 1 ) โ„Ž ๐พ . ( 4 9 ) If the same hardware as that of ILMS is used for the implementation of BILMS, the delay for processing one block of data is 2 ๐‘€ ๐‘‡ ๐‘€ + ๐‘€ ( ๐‘€ + 1 ) ๐‘‡ ๐ด = ๐‘€ ๐ท . Then the duration of one cycle of update by the block incremental LMS is ๐‘ { 2 ๐‘€ ๐‘‡ ๐‘€ + ๐‘€ ( ๐‘€ + 1 ) ๐‘‡ ๐ด } + ( ๐‘ − 1 ) โ„Ž , and the duration of convergence of this algorithm is ๐ฟ B I L M S = [ ] ๐พ ๐‘ ๐‘€ ๐ท + ( ๐‘ − 1 ) โ„Ž ๐ฟ . ( 5 0 ) For ๐ฟ = ๐‘€ , the above expression could be reduced to ๐ฟ B I L M S = ๎‚ธ ๐‘ ๐ท + ( ๐‘ − 1 ) โ„Ž ๐ฟ ๎‚น ๐พ . ( 5 1 ) Comparing ( 51 ) with ( 49 ), we can find that in BILMS the processing delay remains the same as that in ILMS, but the communication overhead is reduced by ๐ฟ times. 5.2.2. Estimation of Delays for the DLMS and BDLMS Algorithms Similar to ILMS, it is also assumed here that the updates of a node reaches all the connected nodes after the same average delay โ„Ž . Therefore, the communication delay remains the same as that of ILMS, but in this case, it needs more processing delay to process the unbiased estimates received from the connected neighboring nodes. The total communication delay in a cycle in this case can be given by ๐‘ ๐‘‡ ๐ด + ๐‘ ๐‘‡ ๐‘€ , where ๐‘ is the total number of messages transferred in a cycle given by ( 44 ). Now, the total duration of a cycle in diffusion LMS with the same hardware constraints is given by ๐ฟ D L M S = ๎€บ ๐‘ ๐‘‡ ๐ด + ๐‘ ๐‘‡ ๐‘€ ๎€ป + ๐‘ ๐ท + ( ๐‘ − 1 ) โ„Ž ๐พ . ( 5 2 ) In case of DBLMS, the total communication delay per cycle is reduced by a factor of ๐ฟ , which can be expressed as ๐ฟ B D L M S = ๎€บ ๐‘ ๐‘‡ ๐ด + ๐‘ ๐‘‡ ๐‘€ ๎€ป ๐พ + ๐‘ ๐‘€ ๐ท + ( ๐‘ − 1 ) โ„Ž ๐ฟ . ( 5 3 ) The mathematical expressions of communication cost and latency for the distributed LMS and the block distributed LMS algorithms are summarized in Table 1 . A numerical example is given in Table 2 to show the advantage of block-distributed algorithms over the sequential-distributed algorithms. The authors have simulated the hardware for 8-bit multiplication and addition in TSMC 90 nm. The multiplication and addition time are found to be ๐‘‡ ๐ด = 1 0 − 5 n s , ๐‘‡ ๐‘€ = 1 0 − 3 n s . We assume the transmission delay โ„Ž = 1 0 − 2 s . Looking at the convergence curves obtained from the simulation studies, we can say that the network attains steady state after 250-input data in DLMS and 50-input data in ILMS case. The filter length ๐‘€ as well as the block size ๐ฟ are taken to be 10 in the numerical study. Table 1: Comparison of performances of distributed algorithms and block distributed algorithms. Table 2: Numerical comparison of performances of sequential and block distributed adaptive algorithms. 6. Conclusion We have proposed the block implementation of the distributed LMS algorithms for WSN. The theoretical analysis and the corresponding simulation results demonstrate that the performance of the block-distributed LMS algorithms is similar to that of the sequential-distributed LMS. The remarkable achievement of the proposed algorithms is that a node requires ๐ฟ (block size) times of less communications compared to the conventional sequential-distributed LMS algorithms. This would be of great advantage in reducing the communication bandwidth and power consumption involved in the transmission and reception of messages across the resource-constrained nodes in a WSN. In the coming years, with continuing advances in microelectronics, we can accommodate enough computing resources in the nodes to reduce the processing delays in the nodes, but the communication bandwidth and communication delay could be the major operational bottlenecks in the WSNs. The proposed block formulation therefore would have further advantages over the sequential counterpart in the coming years. <h4>References</h4> D. Estrin, L. Girod, G. Pottie, and M. Srivastava, “Instrumenting the world with wireless sensor networks,” in Proceedings of the IEEE Interntional Conference on Acoustics, Speech, and Signal Processing (ICASP'01) , pp. 2033–2036, May 2001. D. Estin, R. Govindan, J. Heidemann, and S. Kumar, “Next century chanlanges: scalable cordination in sensor network,” in Proceedings of the International Conference on Mobile Computing and Networks (MobiCOM '99) , pp. 263–270, 1999. G. J. Pottie and W. J. Kaiser, “Wireless integrated network sensors,” Communications of the ACM , vol. 43, no. 5, pp. 51–53, 2000. M. G. Rabbat and R. D. Nowak, “Decentralized source localization and tracking [wireless sensor networks],” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, (ICASSP'04) , vol. 3, pp. III921–III924, 2004. A. Nediฤ‡ and D. P. Bertsekas, “Incremental subgradient methods for nondifferentiable optimization,” SIAM Journal on Optimization , vol. 12, no. 1, pp. 109–138, 2001. View at Publisher · View at Google Scholar · View at MathSciNet F. S. Cattivelli and A. H. Sayed, “Diffusion LMS strategies for distributed estimation,” IEEE Transactions on Signal Processing , vol. 58, no. 3, pp. 1035–1048, 2010. View at Publisher · View at Google Scholar C. G. Lopes and A. H. Sayed, “Diffusion adaptive networks with changing topologies,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, (ICASSP'08) , pp. 3285–3288, April 2008. View at Publisher · View at Google Scholar N. Takahashi, I. Yamada, and A. H. Sayed, “Diffusion adaptive networks with changing topologies,” in Proceedings of the International Conference on Acoustics, Speech and Signal Processing, (ICASSP '06) , pp. 2845–2849, 2009. F. S. Cattivelli and A. H. Sayed, “Distributed detection over adaptive networks using diffusion adaptation,” IEEE Transactions on Signal Processing , vol. 59, no. 5, pp. 1917–1932, 2011. View at Publisher · View at Google Scholar G. A. Clark, S. K. Mitra, and S. R. Parker, “Block implementation of adaptive digital filters,” IEEE Transactions on Signal Processing , vol. 29, no. 3, pp. 744–752, 1981. F. S. Cattivelli and A. H. Sayed, “Analysis of spatial and incremental LMS processing for distributed estimation,” IEEE Transactions on Signal Processing , vol. 59, no. 4, pp. 1465–1480, 2011. View at Publisher · View at Google Scholar X. Liu, Q. Huang, and Y. Zhang, “Combs, needles, haystacks: balancing push and pull for discovery in large-scale sensor networks,” in Proceedings of the Second International Conference on Embedded Networked Sensor Systems, (SenSys'04) , pp. 122–133, November 2004. S. Madden, M. Franklin, J. Hellerstein, and W. Wong, “TAG: a tiny aggregation service for ad-hoc sensor network,” in Proceedings of the ACM Symposium on Operating System Design and Implementation (OSDI'02) , 2002. J. Ahn and B. Krishnamachari, “Modelling search cost in wireless sensor network,” Tech. Rep. CENG-2007-1, Computer Science Department, Unversity of southern California, 2007. A. Jadbabaie, J. Lin, and A. S. Morse, “Coordination of groups of mobile autonomous agents using nearest neighbor rules,” IEEE Transactions on Automatic Control , vol. 48, no. 6, pp. 988–1001, 2003. View at Publisher · View at Google Scholar · View at MathSciNet B. Widrow and S. D. Strearns, Adaptive Signal Processing , Prentice Hall, Englewood Cliffs, NJ, USA, 1985. S. Haykin, Adaptive Filter Theory , Prentice Hall, Englewood Cliffs, NJ, USA, 2001. A. H. Sayed, Fundamentals of Adaptive Filtering , John Wiley and Sons, 2003. C. G. Lopes and A. H. Sayed, “Incremental adaptive strategies over distributed networks,” IEEE Transactions on Signal Processing , vol. 55, no. 8, pp. 4064–4077, 2007. View at Publisher · View at Google Scholar D. P. Bertsekas and J. N. Tsitsiklis, “Comments on "Coordination of groups of mobile autonomous agents using nearest neighbor rules",” IEEE Transactions on Automatic Control , vol. 52, no. 5, pp. 968–969, 2007. View at Publisher · View at Google Scholar · View at MathSciNet C. G. Lopes and A. H. Sayed, “Diffusion least-mean squares over adaptive networks: formulation and performance analysis,” IEEE Transactions on Signal Processing , vol. 56, no. 7, pp. 3122–3136, 2008. View at Publisher · View at Google Scholar A. Geary and D. P. Bertsekas, “Incremental subgradient methods for nondifferentiable optimization,” in Proceedings of the 38th IEEE Conference on Decision and Control (CDC'99) , pp. 907–912, December 1999. D. P. Bertsekas, “A new class of incremental gradient methods for least squares problems,” SIAM Journal on Optimization , vol. 7, no. 4, pp. 913–926, 1997. R. F. Woods, J. V. McCanny, and J. G. McWhirter, “From bit level systolic arrays to HDTV processor chips,” Journal of Signal Processing Systems , vol. 53, no. 1-2, pp. 35–49, 2008. View at Publisher · View at Google Scholar L.-K. Ting, R. Woods, and C. F. N. Cowan, “Virtex FPGA implementation of a pipelined adaptive LMS predictor for electronic support measures receivers,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems , vol. 13, no. 1, pp. 86–95, 2005. View at Publisher · View at Google Scholar P. Fletcher and M. Dean, “Low complexity implementation of LMS algorithm,” Electronics Letters , vol. 38, no. 15, pp. 836–837, 2002. View at Publisher · View at Google Scholar var _gaq = _gaq || []; _gaq.push(['_setAccount', 'UA-8578054-2']); _gaq.push(['_setDomainName', 'hindawi.com']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Computer Networks and Communications Hindawi Publishing Corporation

Loading next page...
 
/lp/hindawi-publishing-corporation/block-least-mean-squares-algorithm-over-distributed-wireless-sensor-nshNfkbXwH

You're reading a free preview. Subscribe to read the entire article.

And millions more from thousands of peer-reviewed journals, for just $40/month

Get 2 Weeks Free

To be the best researcher, you need access to the best research

  • With DeepDyve, you can stop worrying about how much articles cost, or if it's too much hassle to order — it's all at your fingertips. Your research is important and deserves the top content.
  • Read from thousands of the leading scholarly journals from Springer, Elsevier, Nature, IEEE, Wiley-Blackwell and more.
  • All the latest content is available, no embargo periods.

Stop missing out on the latest updates in your field

  • Weโ€™ll send you automatic email updates on the keywords and journals you tell us are most important to you.
  • There is a lot of content out there, so we help you sift through it and stay organized.