A FUNCTION NODE-BASED MULTIPLE PAIRWISE KEYS MANAGEMENT PROTOCOL FOR WIRELESS SENSOR NETWORKS AND ENERGY CONSUMPTION ANALYSIS

In this letter, a Function node-based Multiple Pairwise Keys Management (MPKMF) protocol for Wireless Sensor Networks (WSNs) is firstly designed, in which ordinary nodes and cluster head nodes are responsible for data collection and transmission, and function nodes are responsible for key management. There are more than one function nodes in the cluster consulting the key generation and other security decision-making. The function nodes are the second-class security center because of the characteristics of the distributed WSNs. Secondly, It is also described that the formation of function nodes and cluster heads under the control of the former, and five kinds of keys, i.e., individual key, pairwise keys, cluster key, management key, and group key. Finally, performance analysis and experiments show that, the protocol is superior in communication and energy consumption. The delay of establishing the cluster key meets the requirements, and a multiple pairwise key which adopts the coordinated security authentication scheme is provided.

Coordinated node scheduling for energy-conserving in large wireless sensor networks

Aiming at developing a node scheduling protocol for sensor networks with fewer active nodes,we propose a coordinated node scheduling protocol based on the presentation of a solution and its optimization to determine whether a node is redundant.The proposed protocol can reduce the number of working nodes by turning off as many redundant nodes as possible without degrading the coverage and connectivity.The simulation result shows that our protocol outperforms the peer with respect to the working node number and dynamic coverage percentage.

Employing Orphan Nodes to Avoid Energy Holes in Wireless Sensor Networks

When energy consumption by wireless sensor nodes gets off balance, partitions in the network appear because several of the nodes stop functioning. The respective network’s lifetime also diminishes. This problem is commonly known as the “hot spot” or “energy hole” phenomenon. To resolve this issue, a Multi-Hop Decentralized Cluster-Based Routing (MDCR) protocol is proposed. This algorithm uses orphan nodes as intermediate nodes to form inter-cluster multi-hop routing and balance the energy consumption among sensor nodes. Simulation experiments have shown that MDCR is significantly better at prolonging network lifetime compared to the Adaptive Decentralized Re-Clustering Protocol.

Energy Consumption in Wireless Sensor Networks

Wireless sensor networks （WSNs） can be used to collect surrounding data by multi-hop. As sensor networks have the constrained and not rechargeable energy resource, energy efficiency is an important design issue for its topology. In this paper, the energy consumption issue under the different topology is studied. We derive the exact mathematical expression of energy consumption for the fiat and clustering scheme, respectively. Then the energy consumptions of different schemes are compared. By the comparison, multi-level clustering scheme is more energy efficient in large scale networks. Simulation results demonstrate that our analysis is correct from the view of prolonging the large-scale network lifetime and achieving more power reductions.

Steadfast Energy Proficient Sensor Node Activation System in Wireless Networks Lifetime Enhancement

The wireless sensor network (WSN) is one of the budding exploring areas and fast rising fields in wireless communications. The sensor nodes in the network are generally small-size, low-cost, low-power and multi-function capabilities. Wireless sensor networks (WSNs) are used for various applications;since numerous sensor nodes are usually deployed on remote and inaccessible places, the employment and preservation should be easy and scalable. Sensor nodes in the field being run out of energy quickly has been an issue and many energy efficient routing protocols have been proposed to solve this problem and preserve the long life of the network. This paper work proposes a hierarchical based node activation routing technique which shows energy efficiency. This technique selects cluster head with highest residual energy in each communication round of transmission to the base station from the cluster heads. Hierarchical based node activation routing technique with different levels of hierarchy simulation results prolongs the lifetime of the network compared to other clustering schemes and communication rounds of simulation increase significantly.

A routing algorithm based on clusters and balanced use of energy for wireless sensor networks

In a sensor network, data collected by different sensors are often correlated because they are observations of related phenomena. Efficient sensor data fusion is one of the most important issues in building real sensor networks. To balance energy cost, how to select a cluster head is a key problem that must be addressed. In this paper, we use a compression-centric data collection algorithm for use in wireless sensor networks. Also, we propose a balanced cluster head selection algorithm in each cluster. Simulation results are used to investigate the performance of the algorithm. Compared to the exhaustive search solutions, the proposed algorithm shows a significant improvement in power consumption.

Grid-based energy-aware routing in wireless sensor networks

The model of energy cost in a wireless sensor network （WSN）environment is built, and the energy awareness and the wireless interference mainly due to different path loss models are studied. A special case of a clustering scheme, a twodimensional grid clustering mechanism, is adopted. Clusterheads are rotated evenly among all sensor nodes in an efficient and decentralized manner, based on the residual energy in the battery and the random backoff time. In addition to transmitting and receiving packets within the sensors＇ electrical and amplification circuits, extra energy is needed in the retransmission of packets due to packet collisions caused by severe interference. By analysis and mathematical derivation, which are based on planar geometry, it is shown that the total energy consumed in the network is directly related to the gridstructure in the proposed grid based clustering mechanism. The transmission range is determined by cluster size, and the path loss exponent is determined by nodal separation. The summation of overall interference is caused by all the sensors that are transmitting concurrently. By analysis and simulation, an optimal grid structure with the corresponding grid size is presented, which balances between maximizing energy conservation and minimizing overall interference in wireless sensor networks.

Research on Low Energy Consumption Distributed Fault Detection Mechanism in Wireless Sensor Network

Wireless sensor network is an important technical support for ubiquitous communication. For the serious impacts of network failure caused by the unbalanced energy consumption of sensor nodes, hardware failure and attacker intrusion on data transmission, a low energy consumption distributed fault detection mechanism in wireless sensor network(LEFD) is proposed in this paper. Firstly, the time correlation information of nodes is used to detect fault nodes in LEFD, and then the spatial correlation information is adopted to detect the remaining fault nodes, so as to check the states of nodes comprehensively and improve the efficiency of data transmission. In addition, the nodes do not need to exchange information with their neighbor nodes in the initial detection process since LEFD adopts the data sensed by node itself to detect some types of faults, thus reducing the energy consumption of nodes effectively. Finally, LEFD also considers the nodes that may have transient faults. Performance analysis and simulation results show that the proposed detection mechanism can improve the transmission performance and reduce the energy consumption of network effectively.

A Novel Energy Efficient Routing Protocol in Wireless Sensor Networks

Wireless sensor networks are employed in several applications, including military, medical, environmental and household. In all these applications, energy usage is the determining factor in the performance of wireless sensor networks. Consequently, methods of data routing and transferring to the base station are very important because the sensor nodes run on battery power and the energy available for sensors is limited. In this paper we intend to propose a new protocol called Fair Efficient Location-based Gossiping (FELGossiping) to address the problems of Gossiping and its extensions. We show how our approach increases the network energy and as a result maximizes the network life time in comparison with its counterparts. In addition, we show that the energy is balanced (fairly) between nodes. Saving the nodes energy leads to an increase in the node life in the network, in comparison with the other protocols. Furthermore, the protocol reduces propagation delay and loss of packets.

ANCAEE: A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks

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.

Multiple Node Placement Strategy for Efficient Routing in Wireless Sensor Networks

The advances in recent technology have lead to the development of wireless sensor nodes forming a wireless network, which over the years is used from military application to industry, household, medical etc. The deployment pattern of sensor nodes in Wireless Sensor Network (WSN) is always random for most of the applications. Such technique will lead to ineffective utilization of the network;for example fewer nodes are located at far distance and dense nodes are located at some reason and part of the region may be without the surveillance of any node, where the networks do consume additional energy or even may not transfer the data. The proposed work is intended to develop the optimized network by effective placement of nodes in circular and grid pattern, which we call as uniformity of nodes to be compared with random placement of nodes. Each of the nodes is in optimized positions at uniform distance with neighbors, followed by running a energy efficient routing algorithm that saves an additional energy further to provide connectivity management by connecting all the nodes. Simulation results are compared with the random placement of nodes, the residual energy of a network, lifetime of a network, energy consumption of a network shows a definite improvement for uniform network as that of with the random network.

An Energy-Efficient Access Control Algorithm with Cross-Layer Optimization in Wireless Sensor Networks

This paper presents a wireless sensor network (WSN) access control algorithm designed to minimize WSN node energy consumption. Based on slotted ALOHA protocol, this algorithm incorporates the power control of physical layer, the transmitting probability of medium access control (MAC) layer, and the automatic repeat request (ARQ) of link layer. In this algorithm, a cross-layer optimization is preformed to minimizing the energy consuming per bit. Through theory deducing, the transmitting probability and transmitting power level is determined, and the relationship between energy consuming per bit and throughput per node is provided. Analytical results show that the cross-layer algorithm results in a significant energy savings relative to layered design subject to the same throughput per node, and the energy saving is extraordinary in the low throughput region.

Dynamic Clustering with Relay Nodes (DCRN): A Clustering Technique to Maximize Stability in Wireless Sensor Networks with Relay Nodes

With the growing popularity of wireless sensor networks, network stability has become a key area of current research. Different applications of wireless sensor networks demand stable sensing, coverage, and connectivity throughout their operational periods. In some cases, the death of just a single sensor node might disrupt the stability of the entire network. Therefore, a number of techniques have been proposed to improve the network stability. Clustering is one of the most commonly used techniques in this regard. Most clustering techniques assume the presence of high power sensor nodes called relay nodes and implicitly assume that these relay nodes serve as cluster heads in the network. This assumption may lead to faulty network behavior when any of the relay nodes becomes unavailable to its followers. Moreover, relay node based clustering techniques do not address the heterogeneity of sensor nodes in terms of their residual energies, which frequently occur during the operation of a network. To address these two issues, we present a novel clustering technique, Dynamic Clustering with Relay Nodes (DCRN), by considering the heterogeneity in residual battery capacity and by removing the assumption that relay nodes always serve as cluster-heads. We use an essence of the underlying mechanism of LEACH (Low-Energy Adaptive Clustering Hierarchy), which is one of the most popular clustering solutions for wireless sensor networks. In our work, we present four heuristics to increase network stability periods in terms of the time elapsed before the death of the first node in the network. Based on the proposed heuristics, we devise an algorithm for DCRN and formulate a mathematical model for its long-term rate of energy consumption. Further, we calculate the optimal percentage of relay nodes from our mathematical model. Finally, we verify the efficiency of DCRN and correctness of the mathematical model by exhaustive simulation results. Our simulation results reveal that DCRN enhances the network stability period by a significant margin in comparison to LEACH and its best-known variant.

Energy-Efficient Mobile Data Collection Adopting Node Cooperation in an Underwater Acoustic Sensor Network

This paper considers an underwater acoustic sensor network with one mobile surface node to collect data from multiple underwater nodes,where the mobile destination requests retransmission from each underwater node individually employing traditional automatic-repeat-request(ARQ) protocol.We propose a practical node cooperation(NC) protocol to enhance the collection efficiency,utilizing the fact that underwater nodes can overhear the transmission of others.To reduce the source level of underwater nodes,the underwater data collection area is divided into several sub-zones,and in each sub-zone,the mobile surface node adopting the NC protocol could switch adaptively between selective relay cooperation(SRC) and dynamic network coded cooperation(DNC) .The difference of SRC and DNC lies in whether or not the selected relay node combines the local data and the data overheard from undecoded node(s) to form network coded packets in the retransmission phase.The NC protocol could also be applied across the sub-zones due to the wiretap property.In addition,we investigate the effects of different mobile collection paths,collection area division and cooperative zone design for energy saving.The numerical results showthat the proposed NC protocol can effectively save energy compared with the traditional ARQ scheme.

Survey on node deployment in wireless sensor networks

Node deployment strategy plays an important role in wireless sensor networks(WSNs)application because it determines the coverage,connectivity and network lifetime of WSNs.This paper reports the current research on the optimization means for achieving the desirable design goals in various applications.We categorize the placements strategies into are the static and the dynamic according to whether the node position change after the network is operational.The coverage,connectivity and energy consumption of WSNs are analysed and discussed in detail.

An Energy-Efficient Protocol for Internet of Things Based Wireless Sensor Networks

The performance of Wireless Sensor Networks(WSNs)is an important fragment of the Internet of Things(IoT),where the current WSNbuilt IoT network’s sensor hubs are enticing due to their critical resources.By grouping hubs,a clustering convention offers a useful solution for ensuring energy-saving of hubs andHybridMedia Access Control(HMAC)during the course of the organization.Nevertheless,current grouping standards suffer from issues with the grouping structure that impacts the exhibition of these conventions negatively.In this investigation,we recommend an Improved Energy-Proficient Algorithm(IEPA)for HMAC throughout the lifetime of the WSN-based IoT.Three consecutive segments are suggested.For the covering of adjusted clusters,an ideal number of clusters is determined first.Then,fair static clusters are shaped,based on an updated calculation for fluffy cluster heads,to reduce and adapt the energy use of the sensor hubs.Cluster heads(CHs)are,ultimately,selected in optimal locations,with the pivot of the cluster heads working among cluster members.Specifically,the proposed convention diminishes and balances the energy utilization of hubs by improving the grouping structure,where the IEPAis reasonable for systems that need a long time.The assessment results demonstrate that the IEPA performs better than existing conventions.

Utility-Based Node Cooperation Mechanism in Wireless Sensor Networks

In wireless sensor networks, due to the energy and resource constraints, nodes may be unwilling to forward packets for their neighbors. This can render severe deteriorations in the network performance and malfunctions of the system. To tackle such selfish behaviors and enhance the cooperation among sensors, based on reputation and energy consumption of each node, we present a utility function to punish the malicious nodes and encourage cooperation among nodes. Specifically, we firstly give a mixed strategy Nash equilibrium solution for the two nodes. Then we extend the model to multi-nodes scenario. With the unity function, each sensor’s reputation is evaluated according to its degree of cooperation. The extensive simulation results have shown the effectiveness of the mechanism, in that the cooperative behaviors are encouraged, which can ensure the normal functioning of the network system.

An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks

This paper proposes an energy-efficient geocast algorithm for wireless sensor networks with guaranteed de-livery of packets from the sink to all nodes located in several geocast regions. Our approach is different from those existing in the literature. We first propose a hybrid clustering scheme: in the first phase we partition the network in cliques using an existing energy-efficient clustering protocol. Next the set of clusterheads of cliques are in their turn partitioned using an energy-efficient hierarchical clustering. Our approach to con-sume less energy falls into the category of energy-efficient clustering algorithm in which the clusterhead is located in the central area of the cluster. Since each cluster is a clique, each sensor is at one hop to the cluster head. This contributes to use less energy for transmission to and from the clusterhead, comparatively to multi hop clustering. Moreover we use the strategy of asleep-awake to minimize energy consumption during extra clique broadcasts.

A Novel Approach Based on Hybrid Algorithm for Energy Efficient Cluster Head Identification in Wireless Sensor Networks

The Wireless Sensor Networks(WSN)is a self-organizing network with random deployment of wireless nodes that connects each other for effective monitoring and data transmission.The clustering technique employed to group the collection of nodes for data transmission and each node is assigned with a cluster head.The major concern with the identification of the cluster head is the consideration of energy consumption and hence this paper proposes an hybrid model which forms an energy efficient cluster head in the Wireless Sensor Network.The proposed model is a hybridization of Glowworm Swarm Optimization(GSO)and Artificial Bee Colony(ABC)algorithm for the better identification of cluster head.The performance of the proposed model is compared with the existing techniques and an energy analysis is performed and is proved to be more efficient than the existing model with normalized energy of 5.35%better value and reduction of time complexity upto 1.46%.Above all,the proposed model is 16%ahead of alive node count when compared with the existing methodologies.

Energy Conservation Challenges in Wireless Sensor Networks: A Comprehensive Study

A Wireless Sensor Network (WSN) consists of a large number of randomly deployed sensor nodes. These sensor nodes organize themselves into a cooperative network and perform the three basic functions of sensing, computations and communications. Research in WSNs has become an extensive explorative area during the last few years, especially due to the challenges offered, energy constraints of the sensors being one of them. In this paper, a thorough comprehensive study of the energy conservation challenges in wireless sensor networks is carried out. The need for effective utilization of limited power resources is also emphasized, which becomes pre-eminent to the Wireless Sensor Networks.