Data Aggregation Algorithm Based On TD-SCDMA Transmission Technology For Wireless Sensor Networks

Wireless sensor networks(WSNs) is becoming a cutting-edge issue in recentyears and covers many subject areas. WSN is a self-organization network systemthat consists of a large number of sensor nodes deployed in the monitering area.These sensor nodes work together in sensing, acquisiting and processing theinformation of the object to be detected, after that the information is sent to basestation or sink. The ubiquitous applictions of WSNs have attracted the interest ofresearchers in various fields, and many study ways have been proposed.This article studys the data aggregation algorithm based on TD-SCDMAtransmission technology in WSNs. WSNs is energy constrained, which limits thedata-centric applications. Besides, the node reaches the Node-B in one hopcommunication when using TD-SCDMA transmission. A large number of redundantdata experienced in a long-distance will quickly run out of network energy,moreover the Node-B does not have enough energy to transmit. Therefore, we adoptdata aggregation processing the data coming from different nodes to remove theredundant data and reduce the quantity of data over the network. Clustering networkis the most favorite choice for data aggregation, while network coding(NC) canimprove network throughput and utilize the node’s energy efficiently. Thus, we usethese two technologies to reduce network energy consumptions and prolong thenetwork lifetime.The paper first introduces LEACH(Low-energy adaptive clustering hierarchy)algorithm. As a classical clustering route protocol, we analyze LEACH’s operationprocedure. The operation of LEACH is divided into rounds, where each roundinclude two phases: a set-up phase when the clusters are organized and asteady-state phase when data transferred from the nodes to the cluster and on to theBS. LEACH utilizes randomized rotation of local cluster heads to evenly distributeenergy load among the sensor nodes in the network. Then we describe severalimproved algorithms based on LEACH and propose LEACH-E and LEACH-ED,based on energy and distancce. LEACH-E and LEACH-ED improve LEACH in twoaspects for the purpose of minimizing node energy consumption and extendingnetwork lifetime.After that, we study the network coding, and analyze COPE in details. COPE isan opportunistic approach to network coding, where each node snoops on themedium, learns the status of its neighbors, detects coding opportunities, and codesas long as the recipients can decode. COPE has three components: opportunisticlistening, opportunistic coding and learning neighbor state. At last we propose clustering data aggregation algorithm based on network coding, which exploitsnetwork coding in cluster networks, in order to improve throughput and utilize nodeenergy efficiently.