Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 5

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  cluster head
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Energy is one of the crucial performance parameters in wireless sensor networks (WSNs). Enhancement of network lifetime is an important consideration as well. Low energy-aware clustering hierarchy (LEACH) is one of the protocols proposed for WSNs. In this paper, a residual energy-aware clustering transformation protocol for LEACH (REACT-LEACH), enhancing performance of LEACH by introducing a clustering mechanism, is proposed. The proposed cluster head (CH) rotation and cluster reformation processes are more effective in REACT-LEACH, as residual energy is considered to be one of the metrics. Performance of REACT-LEACH is validated based on simulations.
EN
Wireless sensor networks are typically operated on batteries. Therefore, in order to prolong network lifetime, an energy efficient routing algorithm is required. In this paper, an energy-aware routing protocol for the co-operative MIMO scheme in WSNs (EARPC) is presented. It is based on an improved cluster head selection method that considers the remaining energy level of a node and recent energy consumption of all nodes. This means that sensor nodes with lower energy levels are less likely to be chosen as cluster heads. Next, based on the cooperative node selection in each cluster, a virtual MIMO array is created, reducing uneven distribution of clusters. Simulation results show that the proposed routing protocol may reduce energy consumption and improve network lifetime compared with the LEACH protocol.
EN
Data aggregation is the process aimed at reducing the transmission count of packets being transmitted in the framework of in-network data processing. It is the data transmission model that takes the information transmitted from different nodes and generates a single data packet after finding and eliminating the redundant packets. Accordingly, this process decreases the transmission count and makes it possible to consume less energy. The major issues in data aggregation mechanism are related to reduction of latency and to energy balancing. Moreover, it is very complex to resolve the issue of packet loss, which is the failure of one or more transmitted packets to arrive at their destination due to the bad and/or congested channel conditions. The present survey involves a collection of 50 research papers dealing with the data aggregation models in wireless sensor networks (WSN). Various data aggregation methods, like the cluster-based approach, structure-free method, tree-based approach, in-network methods, and energy based aggregation model are considered in this survey, regarding the application and the energy usage involved. On the basis of the survey, the issues and drawbacks faced by the respective methodologies are highlighted. In addition, the paper presents simple statistics of the studies considered with respect to the performance measures, simulation tools, publication year, and classification of methods. The future dimensions of the respective research are supposed to be based on the challenges identified in this survey.
4
Content available remote Secure energy efficient routing protocol for wireless sensor network
EN
The ease of deployment of economic sensor networks has always been a boon to disaster management applications. However, their vulnerability to a number of security threats makes communication a challenging task. This paper proposes a new routing technique to prevent from both external threats and internal threats like hello flooding, eavesdropping and wormhole attack. In this approach one way hash chain is used to reduce the energy drainage. Level based event driven clustering also helps to save energy. The simulation results show that the proposed scheme extends network lifetime even when the cluster based wireless sensor network is under attack.
EN
Distributed Sensor Networks (DSNs) have attracted significant attention over the past few years. A growing list of many applications can employ DSNs for increased effectiveness especially in hostile and remote are as. In all application salargen umber of sensors are expected and requiring careful architecture and management of the net work. Grouping nodes in toclusters has been the most popular approach for support scalability in DSN. This paper proposes acluster based optimization of routing in DSN by employing a Bayesi an network (BN) with Tabu search (TS) approach. BN based approach is used to select efficient cluster head sand construction of BN for the proposed scheme. This approach in corporates energy level of each node, band width and link efficiency. The optimization of routing is considered as a design issue in DSN due to lack of energy consumption, delay and maximum time required for data transmission between source nodes (cluster heads) to sink node. In this work optimization of routing takes place through cluster head nodes by using TS. Simulations have been conducted to compare the performance of the proposed approach with LEACH protocol. The objective of the proposed work is to improve the performance of network in terms of energy consumption, through put, packet delivery ratio, and time efficiency of optimization of routing. The results hows that the proposed approach perform better than LEACH protocol that utilizes minimum energy, latency for cluster formation and reduce over head of the protocol.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.