Welcome![Sign In][Sign Up]
Location:
Search - clustering in sensor node

Search list

[Bookscluster

Description: 一种考虑节点能量的无线传感器网络的分簇算法,对研究路由算法有帮助-Consider the energy of a node of the wireless sensor network clustering algorithm, routing algorithm for research help
Platform: | Size: 59392 | Author: df | Hits:

[Industry researchESCAL_An_Energy_Saving_Clustering_Algorithm_Based

Description: Abstract—the application of wireless sensor network (WSN) is always restricted by the energy shortage of sensor nodes. In order to reduce the entire energy consumption of the WSN, a promising approach is to design light clustering algorithms.LEACH is such a well-known clustering algorithm that was designed to distribute the energy consumption to nodes in the WSN evenly. LEACH is characterized by its attactive clusterbased strategy however, in the algorithm, energy dissipation of entire network is still great during the process that cluster-heads (CH) transmit data to base station (BS). In this paper, based on LEACH, we propose a modified clustering orithm which is named ESCAL. In ESCAL, CHs won’t communicate with BS directly, but transfer aggregated data to the nearest node in term of received signal strength then this elected nearest node willcompress and forward the data to BS.-Abstract—the application of wireless sensor network (WSN) is always restricted by the energy shortage of sensor nodes. In order to reduce the entire energy consumption of the WSN, a promising approach is to design light clustering algorithms.LEACH is such a well-known clustering algorithm that was designed to distribute the energy consumption to nodes in the WSN evenly. LEACH is characterized by its attactive clusterbased strategy however, in the algorithm, energy dissipation of entire network is still great during the process that cluster-heads (CH) transmit data to base station (BS). In this paper, based on LEACH, we propose a modified clustering orithm which is named ESCAL. In ESCAL, CHs won’t communicate with BS directly, but transfer aggregated data to the nearest node in term of received signal strength then this elected nearest node willcompress and forward the data to BS.
Platform: | Size: 86016 | Author: Amir | Hits:

[matlabcluster

Description: 一种无线传感器网络分簇算法的matlab仿真实验程序,用于查看各节点剩余能量及节电存活数目-A wireless sensor network clustering algorithm matlab simulation program for viewing and saving the residual energy of each node the number of surviving
Platform: | Size: 3072 | Author: 周波 | Hits:

[Program docA-new-clustering-method-to-prolong-the-lifetime-o

Description: One of the most critical issues in the wireless sensor networks is the network s nodes limited availability of energy. The network lifetime strictly depends on its energy efficiency. Clustering is a method to make the consumed energy efficient. LEACH is one of the fundamental clustering algorithms. In this paper we have proposed an algorithm which extends LEACH by considering number of neighbors and remaining of the energy of each node to be a cluster head. We have also proposed to use gateway nodes in each cluster to enable the cluster head to reduce its transmission radius within the cluster to achieve better power saving. We analyze and compared the proposed algorithm along with the LEACH, LEACH-c and MIMO the most recent extend over the LEACH and show that the proposed algorithm can prolong the lifetime of the network.
Platform: | Size: 307200 | Author: Mohamed Rias | Hits:

[matlabClustering-Algorithm-

Description: 本文通过介绍新的聚类算法到传感器节点调度算法中,从而实现网络覆盖的最优化-This paper describes a new clustering algorithm to the sensor node scheduling algorithm in order to achieve optimal network coverage
Platform: | Size: 934912 | Author: 吴田 | Hits:

[Program doc05459892

Description: The cluster head is selected by the random number generated by nodes in the hierarchical routing protocol which is implementing Low Energy Adaptive Clustering Hierarchy (LEACH). As a result, the cluster head may be chosen randomly and be distributed asymmetrically. Focus on this problem, this paper introduces a function to improve the problem. This function uses the relative distance between nodes and base station and the round number as its parameters. Hence, the distribution of cluster head can be symmetrical through changing parameters of the function, and. With the increasing of running time, every node in the network has the chance to be a cluster head, that is, the energy consumption could be balance. The simulation result shows that the lifetime of Wireless Sensor Network (WSN) has been prolonged about 14 . -The cluster head is selected by the random number generated by nodes in the hierarchical routing protocol which is implementing Low Energy Adaptive Clustering Hierarchy (LEACH). As a result, the cluster head may be chosen randomly and be distributed asymmetrically. Focus on this problem, this paper introduces a function to improve the problem. This function uses the relative distance between nodes and base station and the round number as its parameters. Hence, the distribution of cluster head can be symmetrical through changing parameters of the function, and. With the increasing of running time, every node in the network has the chance to be a cluster head, that is, the energy consumption could be balance. The simulation result shows that the lifetime of Wireless Sensor Network (WSN) has been prolonged about 14 .
Platform: | Size: 261120 | Author: mihir | Hits:

[Program doc05552317

Description: In wireless sensor networks, the power resource of each sensor node is limited. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of routing protocols for sensor networks. In this paper, Cluster routing protocol LEACH (Low-Energy Adaptive Clustering Hierarchy) is research and improved. We extend LEACH stochastic cluster-head selection algorithm via changing the round time According to the situation of sensor network. It is named Variable-round LEACH. The result simulated in NS2 shows that the energy is significantly reduced and the lifetime of the whole network is increased compared with the previous routing algorithm for the sensor networks.
Platform: | Size: 118784 | Author: mihir | Hits:

[Compress-Decompress algrithmsleachRouting.tar

Description: we have discussed HCTA based tracking and single hop routing and LEACH based tracking and clustering routing. LEACH based tracking is divides sensor nodes in cluster. In each cluster CH (cluster head) applies aggregation process on packets then directly transmits to sink node. Thus, minimum packets transmit and packets does not route entire sensor nodes in WSN. CHs in clusters transmit packets based on carrier sense multiple access collision avoidance (CSMA/CA), to prevent collision and minimize transmission and reception process. Overall energy conserve by LEACH during simulation is same.
Platform: | Size: 4096 | Author: FH | Hits:

[matlabLEACH

Description: 无线传感器网络中LEACH协议代码,实现节点的分簇。-LEACH protocol code in wireless sensor network node clustering.
Platform: | Size: 2048 | Author: jiangxue | Hits:

[File FormatLEACH

Description: LEACH [1] is an autonomous adaptive clustering protocol that distributes the energy load evenly among the sensors in the network using randomization. The nodes organize themselves into local clusters, with one node acting as the local base station or cluster head. In order to not drain the battery of a single sensor randomized rotation of the high-energy cluster head position such that it rotates among the various sensors. Once the cluster head has all the data from the nodes in its cluster, the cluster head node aggregates the data and then transmits the compressed data to the base station. Since it compress the amount of data being sent from the clusters to the base station, energy dissipation is reduced and system lifetime is thus enhanced. A Comparative Analysis of Energy-Efficient Routing Protocols 401 This
Platform: | Size: 2048 | Author: jagadish | Hits:

[Software Engineeringcoleach_3

Description: Energy efficiency is the most important design goal for wireless sensor networks (WSNs). In this paper, we propose an energy-efficient cooperative MIMO scheme, which combines energy-efficient LEACH (EE-LEACH) protocol and cooperative MIMO. We name it as EE-LEACH-MIMO scheme. EE-LEACH is an improved LEACH algorithm, in which the network is partitioned to sectors with equal angle for avoiding the distribution non-uniformity of cluster heads. In EE-LEACH-MIMO scheme, the location and the residual energy of each node are considered when the cluster heads for clustering and cooperative nodes for MIMO system are chosen. For comparisons, LEACH, EE-LEACH, the simple cooperative scheme with LEACH and MIMO (LEACHMIMO), and EE-LEACH-MIMO scheme are simulated. The result shows that EE-LEACH-MIMO scheme can well balance the network load, save energy and prolong the network lifetime
Platform: | Size: 2048 | Author: 龙飞天涯268 | Hits:

[Program doccoleach_4

Description: Energy efficiency is the most important design goal for wireless sensor networks (WSNs). In this paper, we propose an energy-efficient cooperative MIMO scheme, which combines energy-efficient LEACH (EE-LEACH) protocol and cooperative MIMO. We name it as EE-LEACH-MIMO scheme. EE-LEACH is an improved LEACH algorithm, in which the network is partitioned to sectors with equal angle for avoiding the distribution non-uniformity of cluster heads. In EE-LEACH-MIMO scheme, the location and the residual energy of each node are considered when the cluster heads for clustering and cooperative nodes for MIMO system are chosen. For comparisons, LEACH, EE-LEACH, the simple cooperative scheme with LEACH and MIMO (LEACHMIMO), and EE-LEACH-MIMO scheme are simulated. The result shows that EE-LEACH-MIMO scheme can well balance the network load, save energy and prolong the network lifetime
Platform: | Size: 2048 | Author: 龙飞天涯268 | Hits:

[Software Engineeringuntitled

Description: Energy efficiency is the most important design goal for wireless sensor networks (WSNs). In this paper, we propose an energy-efficient cooperative MIMO scheme, which combines energy-efficient LEACH (EE-LEACH) protocol and cooperative MIMO. We name it as EE-LEACH-MIMO scheme. EE-LEACH is an improved LEACH algorithm, in which the network is partitioned to sectors with equal angle for avoiding the distribution non-uniformity of cluster heads. In EE-LEACH-MIMO scheme, the location and the residual energy of each node are considered when the cluster heads for clustering and cooperative nodes for MIMO system are chosen. For comparisons, LEACH, EE-LEACH, the simple cooperative scheme with LEACH and MIMO (LEACHMIMO), and EE-LEACH-MIMO scheme are simulated. The result shows that EE-LEACH-MIMO scheme can well balance the network load, save energy and prolong the network lifetime
Platform: | Size: 18432 | Author: 龙飞天涯268 | Hits:

CodeBus www.codebus.net