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 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.

Energy-Efficient Routing Using Novel Optimization with Tabu Techniques for Wireless Sensor Network

Wireless Sensor Network(WSN)consists of a group of limited energy source sensors that are installed in a particular region to collect data from the environment.Designing the energy-efficient data collection methods in largescale wireless sensor networks is considered to be a difficult area in the research.Sensor node clustering is a popular approach for WSN.Moreover,the sensor nodes are grouped to form clusters in a cluster-based WSN environment.The battery performance of the sensor nodes is likewise constrained.As a result,the energy efficiency of WSNs is critical.In specific,the energy usage is influenced by the loads on the sensor node as well as it ranges from the Base Station(BS).Therefore,energy efficiency and load balancing are very essential in WSN.In the proposed method,a novel Grey Wolf Improved Particle Swarm Optimization with Tabu Search Techniques(GW-IPSO-TS)was used.The selection of Cluster Heads(CHs)and routing path of every CH from the base station is enhanced by the proposed method.It provides the best routing path and increases the lifetime and energy efficiency of the network.End-to-end delay and packet loss rate have also been improved.The proposed GW-IPSO-TS method enhances the evaluation of alive nodes,dead nodes,network survival index,convergence rate,and standard deviation of sensor nodes.Compared to the existing algorithms,the proposed method outperforms better and improves the lifetime of the network.

Hybrid Power Bank Deployment Model for Energy Supply Coverage Optimization in Industrial Wireless Sensor Network

Energy supply is one of the most critical challenges of wireless sensor networks(WSNs)and industrial wireless sensor networks(IWSNs).While research on coverage optimization problem(COP)centers on the network’s monitoring coverage,this research focuses on the power banks’energy supply coverage.The study of 2-D and 3-D spaces is typical in IWSN,with the realistic environment being more complex with obstacles(i.e.,machines).A 3-D surface is the field of interest(FOI)in this work with the established hybrid power bank deployment model for the energy supply COP optimization of IWSN.The hybrid power bank deployment model is highly adaptive and flexible for new or existing plants already using the IWSN system.The model improves the power supply to a more considerable extent with the least number of power bank deployments.The main innovation in this work is the utilization of a more practical surface model with obstacles and training while improving the convergence speed and quality of the heuristic algorithm.An overall probabilistic coverage rate analysis of every point on the FOI is provided,not limiting the scope to target points or areas.Bresenham’s algorithm is extended from 2-D to 3-D surface to enhance the probabilistic covering model for coverage measurement.A dynamic search strategy(DSS)is proposed to modify the artificial bee colony(ABC)and balance the exploration and exploitation ability for better convergence toward eliminating NP-hard deployment problems.Further,the cellular automata(CA)is utilized to enhance the convergence speed.The case study based on two typical FOI in the IWSN shows that the CA scheme effectively speeds up the optimization process.Comparative experiments are conducted on four benchmark functions to validate the effectiveness of the proposed method.The experimental results show that the proposed algorithm outperforms the ABC and gbest-guided ABC(GABC)algorithms.The results show that the proposed energy coverage optimization method based on the hybrid power bank deployment model generates more accurate results than the results obtained by similar algorithms(i.e.,ABC,GABC).The proposed model is,therefore,effective and efficient for optimization in the IWSN.

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.

Metaheuristic Secure Clustering Scheme for Energy Harvesting Wireless Sensor Networks

Recently,energy harvesting wireless sensor networks(EHWSN)have increased significant attention among research communities.By harvesting energy from the neighboring environment,the sensors in EHWSN resolve the energy constraint problem and offers lengthened network lifetime.Clustering is one of the proficient ways for accomplishing even improved lifetime in EHWSN.The clustering process intends to appropriately elect the cluster heads(CHs)and construct clusters.Though several models are available in the literature,it is still needed to accomplish energy efficiency and security in EHWSN.In this view,this study develops a novel Chaotic Rider Optimization Based Clustering Protocol for Secure Energy Harvesting Wireless Sensor Networks(CROC-SEHWSN)model.The presented CROC-SEHWSN model aims to accomplish energy efficiency by clustering the node in EHWSN.The CROC-SEHWSN model is based on the integration of chaotic concepts with traditional rider optimization(RO)algorithm.Besides,the CROC-SEHWSN model derives a fitness function(FF)involving seven distinct parameters connected to WSN.To accomplish security,trust factor and link quality metrics are considered in the FF.The design of RO algorithm for secure clustering process shows the novelty of the work.In order to demonstrate the enhanced performance of the CROC-SEHWSN approach,a wide range of simulations are carried out and the outcomes are inspected in distinct aspects.The experimental outcome demonstrated the superior performance of the CROC-SEHWSN technique on the recent approaches with maximum network lifetime of 387.40 and 393.30 s under two scenarios.

Genetic-Chicken Swarm Algorithm for Minimizing Energy in Wireless Sensor Network

Wireless Sensor Network(WSN)technology is the real-time applica-tion that is growing rapidly as the result of smart environments.Battery power is one of the most significant resources in WSN.For enhancing a power factor,the clustering techniques are used.During the forward of data in WSN,more power is consumed.In the existing system,it works with Load Balanced Cluster-ing Method(LBCM)and provides the lifespan of the network with scalability and reliability.In the existing system,it does not deal with end-to-end delay and deliv-ery of packets.For overcoming these issues in WSN,the proposed Genetic Algo-rithm based on Chicken Swarm Optimization(GA-CSO)with Load Balanced Clustering Method(LBCM)is used.Genetic Algorithm generates chromosomes in an arbitrary method then the chromosomes values are calculated using Fitness Function.Chicken Swarm Optimization(CSO)helps to solve the complex opti-mization problems.Also,it consists of chickens,hens,and rooster.It divides the chicken into clusters.Load Balanced Clustering Method(LBCM)maintains the energy during communication among the sensor nodes and also it balances the load in the gateways.The proposed GA-CSO with LBCM improves the life-span of the network.Moreover,it minimizes the energy consumption and also bal-ances the load over the network.The proposed method outperforms by using the following metrics such as energy efficiency,ratio of packet delivery,throughput of the network,lifetime of the sensor nodes.Therefore,the evaluation result shows the energy efficiency that has achieved 83.56%and the delivery ratio of the packet has reached 99.12%.Also,it has attained linear standard deviation and reduced the end-to-end delay as 97.32 ms.

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.

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 flat 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.

Proportional Fairness Based Energy Efficient Routing in Wireless Sensor Network

Wireless Sensor Network (WSN) is an independent device that comprises a discrete collection of Sensor Nodes (SN) to sense environmental positions,device monitoring, and collection of information. Due to limited energy resourcesavailable at SN, the primary issue is to present an energy-efficient framework andconserve the energy while constructing a route path along with each sensor node.However, many energy-efficient techniques focused drastically on energy harvesting and reduced energy consumption but failed to support energy-efficient routingwith minimal energy consumption in WSN. This paper presents an energy-efficientrouting system called Energy-aware Proportional Fairness Multi-user Routing(EPFMR) framework in WSN. EPFMR is deployed in the WSN environment usingthe instance time. The request time sent for the route discovery is the foremost stepdesigned in the EPFMR framework to reduce the energy consumption rate. Theproportional fairness routing in WSN selects the best route path for the packet flowbased on the relationship between the periods of requests between different SN.Route path discovered for packet flow also measure energy on multi-user route pathusing the Greedy Instance Fair Method (GIFM). The GIFM in EPFMR developsnode dependent energy-efficient localized route path, improving the throughput.The energy-aware framework maximizes the throughput rate and performs experimental evaluation on factors such as energy consumption rate during routing,Throughput, RST, node density and average energy per packet in WSN. The RouteSearching Time (RST) is reduced using the Boltzmann Distribution (BD), and as aresult, the energy is minimized on multi-user WSN. Finally, GIFM applies aninstance time difference-based route searching on WSN to attain an optimal energyminimization system. Experimental analysis shows that the EPFMR framework canreduce the RST by 23.47% and improve the throughput by 6.79% compared withthe state-of-the-art works.

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.

A PSO based Energy Efficient Coverage Control Algorithm for Wireless Sensor Networks

Wireless Sensor Networks(WSNs)are large-scale and high-density networks that typically have coverage area overlap.In addition,a random deployment of sensor nodes cannot fully guarantee coverage of the sensing area,which leads to coverage holes in WSNs.Thus,coverage control plays an important role in WSNs.To alleviate unnecessary energy wastage and improve network performance,we consider both energy efficiency and coverage rate for WSNs.In this paper,we present a novel coverage control algorithm based on Particle Swarm Optimization(PSO).Firstly,the sensor nodes are randomly deployed in a target area and remain static after deployment.Then,the whole network is partitioned into grids,and we calculate each grid’s coverage rate and energy consumption.Finally,each sensor nodes’sensing radius is adjusted according to the coverage rate and energy consumption of each grid.Simulation results show that our algorithm can effectively improve coverage rate and reduce energy consumption.

Node deployment strategy optimization for wireless sensor network with mobile base station

The optimization of network performance in a movement-assisted data gathering scheme was studied by analyzing the energy consumption of wireless sensor network with node uniform distribution. A theoretically analytical method for avoiding energy hole was proposed. It is proved that if the densities of sensor nodes working at the same time are alternate between dormancy and work with non-uniform node distribution. The efficiency of network can increase by several times and the residual energy of network is nearly zero when the network lifetime ends.

Energy optimal routing for long chain-type wireless sensor networks in underground mines

无线传感器网络是到存在在地下的矿监视系统的有用补充。他们起监视系统的安全提高和改善范围和灵活性的一个重要作用。对在在地下的矿的灾难以后的危险和环境敏感的区域要求节点的节省并且平衡的精力消费延长网络的 lifespan。基于一条隧道的结构，我们在场一个长链类型无线传感器网络(LC-WSN ) 掘监视地下的矿的安全。我们定义最佳的传播距离和关键区域和礼品的范围为 LC-WSN 到的一个精力最佳的路由(EOR ) 算法平衡节点的精力消费并且最大化网络的 lifespan。EOR 基于最佳的传播距离构造路由路径并且使用在关键区域平衡策略的一个精力。模拟结果证明 EOR 算法扩大一个网络的 lifespan，在关键区域平衡节点的精力消费并且有效地限制路由路径的长度，与类似的算法相比。

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.

Adaptive ant-based routing in wireless sensor networks using Energy~* Delay metrics

To find the optimal routing is always an important topic in wireless sensor networks (WSNs). Considering a WSN where the nodes have limited energy, we propose a novel Energy*Delay model based on ant algorithms ("E&D ANTS" for short) to minimize the time delay in transferring a fixed number of data packets in an energy-constrained manner in one round. Our goal is not only to maximize the lifetime of the network but also to provide real-time data transmission services. However, because of the tradeoff of energy and delay in wireless network systems, the reinforcement learning (RL) algorithm is introduced to train the model. In this survey, the paradigm of E&D ANTS is explicated and compared to other ant-based routing algorithms like AntNet and AntChain about the issues of routing information, routing overhead and adaptation. Simulation results show that our method performs about seven times better than AntNet and also outperforms AntChain by more than 150% in terms of energy cost and delay per round.

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.

An Integrative Comparison of Energy Efficient Routing Protocols in Wireless Sensor Network

Many advances have been made in sensor technologies which are as varied as the applications;and many more are in progress. It has been reasonable to design and develop small size sensor nodes of low cost and low power. In this work, we have explored some energy-efficient routing protocols (LEACH, Directed Diffusion, Gossiping and EESR) and their expansions (enhancements), and furthermore, their tactics specific to wireless sensor network, such as data aggregation and in-network processing, clustering, different node role assignment, and data-centric methods. After that we have compared these explored routing protocols based on different metrics that affect the specific application requirements and WSN in general.