Citation Context

...orks have been proposed recently. These include, among others, energy conserving routing (e.g., [1], [2], [3], [4]), topology control (e.g., [5], [6], [7], [8]) and clustering (e.g., [9], [10], [11], =-=[12]-=-). Although all these protocols achieve their optimization goals under certain conditions, they always focus on the sensor nodes. 1 We will show that further improvements on the lifetime of sensor net...

Citation Context

... use a fixed transmission power. Network density has to be sufficiently high in order to ensure that enough gateways are present at the intersection areas between clusters. In another approach (e.g., =-=[2, 3]-=-), the CH overlay constitutes the routing infrastructure, and intercluster routing proceeds only through CHs. This approach (depicted in Fig. 3b) is appropriate if: • A node can tune its transmission ...

Citation Context

...munication. Generally, the role of clusterhead should rotate among all the nodes in the cluster to achieve balanced energy consumption and to prolong the life span of each individual node, such as in =-=[28]-=-. Non-clusterheads only need to report their own position and energy to clusterheads using transmission range r1, while clusterheads will communicate with neighboring clusters, take over the informati...

Citation Context

...ased on a geographical routing paradigm. In order to guarantee scalability and energy efficiency, several solutions based on dividing the sensor network into different clusters have been proposed [12]=-=[13]-=-[14][15]. Most of the existing clustering algorithms can be classified as topology dependent, i.e., clusters are predetermined, depend on the topology of the sensor network, and may be adaptively reco...

Citation Context

...e manager node in this paper.sIII. DESIGNsIn this section, we present details of our design, includingsclustering, data collection, and data processing.sA. ClusteringsWe choose a clustering algorithm =-=[15]-=- as the routingsprotocol in the wireless sensor network. Clustering routing alsosmeets the demand of the neural network method. Moresspecifically, we can treat sensor nodes, cluster headers as inputsl...

Citation Context

...ty of protocols were proposed for prolonging the life of WSN and for routing the correct data to the base station [2], [3], [7], [8], [10], [11], [12], [14], [15], [16], [17], [18], [20], [21], [24], =-=[25]-=-, [26]. But each protocol has disadvantages and is not suitable for area monitoring applications. These protocols cannot be used directly due to resource constraints of sensor nodes for resources like...

Citation Context

... communication to transmit sensed information to the base stations are two of the most important functions of a SN in a WSN. There has been extensive research on energy-aware routing [4], [14], [18], =-=[33]-=-, improvement in Manuscript received July 16, 2008; revised March 20, 2009; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor M. Liu. First published November 24, 2009; current version published ...

Citation Context

...e LEACH protocol. Such performance gain is achieved through the elimination of the overhead caused by dynamic cluster formation in LEACH and through decreasing the number of transmissions and reception by using data aggregation. Although the clustering overhead is avoided, PEGASIS still requires dynamic topology adjustment since a sensor node needs to know about energy status of its neighbors in order to know where to route its data. Such topology adjustment can introduce significant overhead especially for highly utilized networks. Hybrid, Energy-Efficient Distributed Clustering (HEED): HEED [40,41] extends the basic scheme of LEACH by using residual energy and node degree or density as a metric for cluster selection to achieve power balancing. It operates in multi-hop networks, using an adaptive transmission power in the inter-clustering communication. HEED was proposed with four primary goals namely (i) prolonging network lifetime by distributing energy consumption, (ii) terminating the clustering process within a constant number of iterations, (iii) minimizing control overhead, and (iv) producing well-distributed CHs and compact clusters. In HEED, the proposed algorithm periodically s...