One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques ...One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques that have been using to minimize sensor nodes’ energy consumption during operation. In this paper, A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (ANCAEE) has been proposed. The algorithm achieves good performance in terms of minimizing energy consumption during data transmission and energy consumptions are distributed uniformly among all nodes. ANCAEE uses a new method of clusters formation and election of cluster heads. The algorithm ensures that a node transmits its data to the cluster head with a single hop transmission and cluster heads forward their data to the base station with multi-hop transmissions. Simulation results show that our approach consumes less energy and effectively extends network utilization.展开更多
Sensor nodes in a wireless sensor network （WSN） are typically powered by batteries, thus the energy is constrained. It is our design goal to efficiently utilize the energy of each sensor node to extend its lifetime,...Sensor nodes in a wireless sensor network （WSN） are typically powered by batteries, thus the energy is constrained. It is our design goal to efficiently utilize the energy of each sensor node to extend its lifetime, so as to prolong the lifetime of the whole WSN. In this paper, we propose a path-based data aggregation scheme （PBDAS） for grid-based wireless sensor networks. In order to extend the lifetime of a WSN, we construct a grid infrastructure by partitioning the whole sensor field into a grid of cells. Each cell has a head responsible for aggregating its own data with the data sensed by the others in the same cell and then transmitting out. In order to efficiently and rapidly transmit the data to the base station （BS）, we link each cell head to form a chain. Each cell head on the chain takes turn becoming the chain leader responsible for transmitting data to the BS. Aggregated data moves from head to head along the chain, and finally the chain leader transmits to the BS. In PBDAS, only the cell heads need to transmit data toward the BS. Therefore, the data transmissions to the BS substantially decrease. Besides, the cell heads and chain leader are designated in turn according to the energy level so that the energy depletion of nodes is evenly distributed. Simulation results show that the proposed PBDAS extends the lifetime of sensor nodes, so as to make the lifetime of the whole network longer.展开更多
Cluster-based architectures are one of the most practical solutions in order to cope with the requirements of large-scale wireless sensor networks (WSN). Cluster-head election problem is one of the basic QoS requireme...Cluster-based architectures are one of the most practical solutions in order to cope with the requirements of large-scale wireless sensor networks (WSN). Cluster-head election problem is one of the basic QoS requirements of WSNs, yet this problem has not been sufficiently explored in the context of cluster-based sensor networks. Specifically, it is not known how to select the best candidates for the cluster head roles. In this paper, we investigate the cluster head election problem, specifically concentrating on applications where the energy of full network is the main requirement, and we propose a new approach to exploit efficiently the network energy, by reducing the energy consumed for cluster forming.展开更多
In recent years, the demand for Wireless Sensor Network (WSN) in smart farming has had a tremendous increase in demand for its efficiency. Wireless sensor networks have very many nodes, and it is of no use when the ba...In recent years, the demand for Wireless Sensor Network (WSN) in smart farming has had a tremendous increase in demand for its efficiency. Wireless sensor networks have very many nodes, and it is of no use when the battery dies. This is why there are several routing protocols being take into consideration to cub this problem. In this paper, in order to increase the heterogeneity and energy levels of the network, the M-LEACH protocol is proposed. The key aim of the Leach protocol is to prolong the existence of wireless sensor network by lowering the energy consumption needed for Cluster Head creation and maintenance, the proposed algorithm instructs a node to use high power amplification as it acts as the Cluster heads, and low power amplification when it becomes a Cluster Member, in the next stage. Finally, for better effectiveness, M-LEACH employs hard and soft threshold systems. Since it eliminates collisions and reduces the packet drop ratio for other signals, the M-LEACH protocol proposed works better than the Leach protocol.展开更多
In wireless sensor networks, clustering of nodes effectively conserves considerable amount of energy resulting in increased network life-time. Clustering protocols do not consider density of nodes in cluster formation...In wireless sensor networks, clustering of nodes effectively conserves considerable amount of energy resulting in increased network life-time. Clustering protocols do not consider density of nodes in cluster formation, which increases the possibility of hotspots in areas where the density of nodes is very less. If the node density is very high, cluster-heads may expend high energy leading to their early death. Existing cluster protocols that concentrate on energy conservation have not exhibited their impact on packet delivery and delay. In this proposed protocol, clusters are constructed based on the range of nodes, distance between neighbouring nodes and density of nodes over a region resulting in the formation of dissimilar clusters. With this method, the entire sensing region is considered to be a large circular region with base station positioned at the centre. Initially, the nodes that can be able to reach base station in a single hop are considered for constructing inner smaller circular regions over the entire region. This method is iterated for n-hop nodes until n-concentric circular regions are formed. These circular boundaries are reconstructed based on a distance metric, density of nodes and a divergence factor. Using this architecture, network analysis is done by routing data to the base station from different sized clusters. Based on simulation results, this new protocol Dynamic Unequal Clustered Routing (D-UCR), despite being energy efficient, showed better data delivery ratio and minimized delay when compared with other traditional clustering algorithms such as Leach and Equal Clustered Routing.展开更多
Wireless sensor networks (WSN) are one of the most evolving technologies applicable in various fields where sensitive information is required. However, the constraints of limited resources and requirements for environ...Wireless sensor networks (WSN) are one of the most evolving technologies applicable in various fields where sensitive information is required. However, the constraints of limited resources and requirements for environment-dependent connectivity and life cycle have urged designers to seek more efficient WSN infrastructures. In this paper, we have discussed and compared the results of various single path protocols i.e. LEACH, PAGASIS and VGA. Performance analysis of energy efficient multipath routing protocols incorporating wireless interference has also been performed.展开更多
Sensor nodes are mainly shielded in the field with limited power supply. In Wireless Sensor Networks, there must be a requirement of an efficient power management, because sensor nodes are deployed in unman attended a...Sensor nodes are mainly shielded in the field with limited power supply. In Wireless Sensor Networks, there must be a requirement of an efficient power management, because sensor nodes are deployed in unman attended area with non-rechargeable batteries. Power management can be done by different methods of routing protocols. The proposed Reliable Rim Routing (3R) technique is based on hybrid routing protocol for homogeneous and heterogeneous system for WSNs to ameliorate the performance of the overall system. In 3R, total node deployment area can be multipart in terms of rim and in each rim, and some of the sensor nodes transmit their sensed data directly to base station, and meanwhile remaining sensor nodes send the data through clustering technique to base station like SEP. Proposed 3R technique implementation proves its enhanced WSNs lifetime of 70% energy consumption and 40% throughput compared with existing protocols. Simulation and evaluation results outperformed in terms of energy consumption with increased throughput and network lifetime.展开更多
文摘One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques that have been using to minimize sensor nodes’ energy consumption during operation. In this paper, A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (ANCAEE) has been proposed. The algorithm achieves good performance in terms of minimizing energy consumption during data transmission and energy consumptions are distributed uniformly among all nodes. ANCAEE uses a new method of clusters formation and election of cluster heads. The algorithm ensures that a node transmits its data to the cluster head with a single hop transmission and cluster heads forward their data to the base station with multi-hop transmissions. Simulation results show that our approach consumes less energy and effectively extends network utilization.
基金supported by the NSC under Grant No.NSC-101-2221-E-239-032 and NSC-102-2221-E-239-020
文摘Sensor nodes in a wireless sensor network （WSN） are typically powered by batteries, thus the energy is constrained. It is our design goal to efficiently utilize the energy of each sensor node to extend its lifetime, so as to prolong the lifetime of the whole WSN. In this paper, we propose a path-based data aggregation scheme （PBDAS） for grid-based wireless sensor networks. In order to extend the lifetime of a WSN, we construct a grid infrastructure by partitioning the whole sensor field into a grid of cells. Each cell has a head responsible for aggregating its own data with the data sensed by the others in the same cell and then transmitting out. In order to efficiently and rapidly transmit the data to the base station （BS）, we link each cell head to form a chain. Each cell head on the chain takes turn becoming the chain leader responsible for transmitting data to the BS. Aggregated data moves from head to head along the chain, and finally the chain leader transmits to the BS. In PBDAS, only the cell heads need to transmit data toward the BS. Therefore, the data transmissions to the BS substantially decrease. Besides, the cell heads and chain leader are designated in turn according to the energy level so that the energy depletion of nodes is evenly distributed. Simulation results show that the proposed PBDAS extends the lifetime of sensor nodes, so as to make the lifetime of the whole network longer.
文摘Cluster-based architectures are one of the most practical solutions in order to cope with the requirements of large-scale wireless sensor networks (WSN). Cluster-head election problem is one of the basic QoS requirements of WSNs, yet this problem has not been sufficiently explored in the context of cluster-based sensor networks. Specifically, it is not known how to select the best candidates for the cluster head roles. In this paper, we investigate the cluster head election problem, specifically concentrating on applications where the energy of full network is the main requirement, and we propose a new approach to exploit efficiently the network energy, by reducing the energy consumed for cluster forming.
文摘In recent years, the demand for Wireless Sensor Network (WSN) in smart farming has had a tremendous increase in demand for its efficiency. Wireless sensor networks have very many nodes, and it is of no use when the battery dies. This is why there are several routing protocols being take into consideration to cub this problem. In this paper, in order to increase the heterogeneity and energy levels of the network, the M-LEACH protocol is proposed. The key aim of the Leach protocol is to prolong the existence of wireless sensor network by lowering the energy consumption needed for Cluster Head creation and maintenance, the proposed algorithm instructs a node to use high power amplification as it acts as the Cluster heads, and low power amplification when it becomes a Cluster Member, in the next stage. Finally, for better effectiveness, M-LEACH employs hard and soft threshold systems. Since it eliminates collisions and reduces the packet drop ratio for other signals, the M-LEACH protocol proposed works better than the Leach protocol.
文摘In wireless sensor networks, clustering of nodes effectively conserves considerable amount of energy resulting in increased network life-time. Clustering protocols do not consider density of nodes in cluster formation, which increases the possibility of hotspots in areas where the density of nodes is very less. If the node density is very high, cluster-heads may expend high energy leading to their early death. Existing cluster protocols that concentrate on energy conservation have not exhibited their impact on packet delivery and delay. In this proposed protocol, clusters are constructed based on the range of nodes, distance between neighbouring nodes and density of nodes over a region resulting in the formation of dissimilar clusters. With this method, the entire sensing region is considered to be a large circular region with base station positioned at the centre. Initially, the nodes that can be able to reach base station in a single hop are considered for constructing inner smaller circular regions over the entire region. This method is iterated for n-hop nodes until n-concentric circular regions are formed. These circular boundaries are reconstructed based on a distance metric, density of nodes and a divergence factor. Using this architecture, network analysis is done by routing data to the base station from different sized clusters. Based on simulation results, this new protocol Dynamic Unequal Clustered Routing (D-UCR), despite being energy efficient, showed better data delivery ratio and minimized delay when compared with other traditional clustering algorithms such as Leach and Equal Clustered Routing.
文摘Wireless sensor networks (WSN) are one of the most evolving technologies applicable in various fields where sensitive information is required. However, the constraints of limited resources and requirements for environment-dependent connectivity and life cycle have urged designers to seek more efficient WSN infrastructures. In this paper, we have discussed and compared the results of various single path protocols i.e. LEACH, PAGASIS and VGA. Performance analysis of energy efficient multipath routing protocols incorporating wireless interference has also been performed.
文摘Sensor nodes are mainly shielded in the field with limited power supply. In Wireless Sensor Networks, there must be a requirement of an efficient power management, because sensor nodes are deployed in unman attended area with non-rechargeable batteries. Power management can be done by different methods of routing protocols. The proposed Reliable Rim Routing (3R) technique is based on hybrid routing protocol for homogeneous and heterogeneous system for WSNs to ameliorate the performance of the overall system. In 3R, total node deployment area can be multipart in terms of rim and in each rim, and some of the sensor nodes transmit their sensed data directly to base station, and meanwhile remaining sensor nodes send the data through clustering technique to base station like SEP. Proposed 3R technique implementation proves its enhanced WSNs lifetime of 70% energy consumption and 40% throughput compared with existing protocols. Simulation and evaluation results outperformed in terms of energy consumption with increased throughput and network lifetime.
