An Efficient Sleeping Scheduling for Save Energy Consumption in Wireless Sensor Networks

2013 ◽  
Vol 756-759 ◽  
pp. 2288-2293
Author(s):  
Shu Guang Jia ◽  
Li Peng Lu ◽  
Ling Dong Su ◽  
Gui Lan Xing ◽  
Ming Yue Zhai

Smart grid has become one hot topic at home and abroad in recent years. Wireless Sensor Networks (WSNs) has applied to lots of fields of smart grid, such as monitoring and controlling. We should ensure that there are enough active sensors to satisfy the service request. But, the sensor nodes have limited battery energy, so, how to reduce energy consumption in WSNs is a key challenging. Based on this problem, we propose a sleeping scheduling model. In this model, firstly, the sensor nodes round robin is used to let as little as possible active nodes while all the targets in the power grid are monitored; Secondly, for removing the redundant active nodes, the sensor nodes round robin is further optimized. Simulation result indicates that this sleep mechanism can save the energy consumption of every sensor node.

2012 ◽  
Vol 229-231 ◽  
pp. 1261-1264
Author(s):  
Li Peng Lu ◽  
Ming Yue Zhai ◽  
Ying Liu ◽  
Xiao Da Sun

Wireless Sensor Networks (WSNs) has been widely recognized as a promising technology in smart grid. However, sensor nodes have limited battery energy. So, we present a mathematical model which is to reduce energy consumption and prolong the lifetime of WSNs. Because of the high density of sensor nodes deployment, a sleep mechanism is proposed to make all sensor nodes work by turns while all service requests can be satisfied. And then, an Improved Sleep Mechanism is put forward to remove redundant active nodes. The simulation result indicates that energy consumption adopting the ISNSS is lower than or equal to the energy consumption adopting SNSS. The SNSS and ISNSS all can save some energy of WSNs to some extent and when the redundant active nodes are removed, the network energy consumption is further reduced based on the SNSS.


Author(s):  
Chinedu Duru ◽  
Neco Ventura ◽  
Mqhele Dlodlo

Background: Wireless Sensor Networks (WSNs) have been researched to be one of the ground-breaking technologies for the remote monitoring of pipeline infrastructure of the Oil and Gas industry. Research have also shown that the preferred deployment approach of the sensor network on pipeline structures follows a linear array of nodes, placed a distance apart from each other across the infrastructure length. The linear array topology of the sensor nodes gives rise to the name Linear Wireless Sensor Networks (LWSNs) which over the years have seen themselves being applied to pipelines for effective remote monitoring and surveillance. This paper aims to investigate the energy consumption issue associated with LWSNs deployed in cluster-based fashion along a pipeline infrastructure. Methods: Through quantitative analysis, the study attempts to approach the investigation conceptually focusing on mathematical analysis of proposed models to bring about conjectures on energy consumption performance. Results: From the derived analysis, results have shown that energy consumption is diminished to a minimum if there is a sink for every placed sensor node in the LWSN. To be precise, the analysis conceptually demonstrate that groups containing small number of nodes with a corresponding sink node is the approach to follow when pursuing a cluster-based LWSN for pipeline monitoring applications. Conclusion: From the results, it is discovered that energy consumption of a deployed LWSN can be decreased by creating groups out of the total deployed nodes with a sink servicing each group. In essence, the smaller number of nodes each group contains with a corresponding sink, the less energy consumed in total for the entire LWSN. This therefore means that a sink for every individual node will attribute to minimum energy consumption for every non-sink node. From the study, it can be concurred that energy consumption of a LWSN is inversely proportional to the number of sinks deployed and hence the number of groups created.


Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.


2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Mingxin Yang ◽  
Jingsha He ◽  
Yuqiang Zhang

Due to limited resources in wireless sensor nodes, energy efficiency is considered as one of the primary constraints in the design of the topology of wireless sensor networks (WSNs). Since data that are collected by wireless sensor nodes exhibit the characteristics of temporal association, data fusion has also become a very important means of reducing network traffic as well as eliminating data redundancy as far as data transmission is concerned. Another reason for data fusion is that, in many applications, only some of the data that are collected can meet the requirements of the sink node. In this paper, we propose a method to calculate the number of cluster heads or data aggregators during data fusion based on the rate-distortion function. In our discussion, we will first establish an energy consumption model and then describe a method for calculating the number of cluster heads from the point of view of reducing energy consumption. We will also show through theoretical analysis and experimentation that the network topology design based on the rate-distortion function is indeed more energy-efficient.


Sensors ◽  
2018 ◽  
Vol 18 (7) ◽  
pp. 2328 ◽  
Author(s):  
Juan Feng ◽  
Xiaozhu Shi

In target tracking wireless sensor networks, choosing a part of sensor nodes to execute tracking tasks and letting the other nodes sleep to save energy are efficient node management strategies. However, at present more and more sensor nodes carry many different types of sensed modules, and the existing researches on node selection are mainly focused on sensor nodes with a single sensed module. Few works involved the management and selection of the sensed modules for sensor nodes which have several multi-mode sensed modules. This work proposes an efficient node and sensed module management strategy, called ENSMM, for multisensory WSNs (wireless sensor networks). ENSMM considers not only node selection, but also the selection of the sensed modules for each node, and then the power management of sensor nodes is performed according to the selection results. Moreover, a joint weighted information utility measurement is proposed to estimate the information utility of the multiple sensed modules in the different nodes. Through extensive and realistic experiments, the results show that, ENSMM outperforms the state-of-the-art approaches by decreasing the energy consumption and prolonging the network lifetime. Meanwhile, it reduces the computational complexity with guaranteeing the tracking accuracy.


Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).


2020 ◽  
Author(s):  
Ademola Abidoye ◽  
Boniface Kabaso

Abstract Wireless sensor networks (WSNs) have been recognized as one of the most essential technologies of the 21st century. The applications of WSNs are rapidly increasing in almost every sector because they can be deployed in areas where cable and power supply are difficult to use. In the literature, different methods have been proposed to minimize energy consumption of sensor nodes so as to prolong WSNs utilization. In this article, we propose an efficient routing protocol for data transmission in WSNs; it is called Energy-Efficient Hierarchical routing protocol for wireless sensor networks based on Fog Computing (EEHFC). Fog computing is integrated into the proposed scheme due to its capability to optimize the limited power source of WSNs and its ability to scale up to the requirements of the Internet of Things applications. In addition, we propose an improved ant colony optimization (ACO) algorithm that can be used to construct optimal path for efficient data transmission for sensor nodes. The performance of the proposed scheme is evaluated in comparison with P-SEP, EDCF, and RABACO schemes. The results of the simulations show that the proposed approach can minimize sensor nodes’ energy consumption, data packet losses and extends the network lifetime


2018 ◽  
Vol 17 ◽  
pp. 02001
Author(s):  
Churan Tang ◽  
Linghua Zhang

A central question in wireless sensor network research is how to reduce the consumption of the energy of the sensor nodes. Theoretically, the network coding technology proposed by Ahlswede et al (2000) can improve the network reliability and network throughput, increase the robustness and save energy. Based on the classic flooding routing protocol, the present study proposes a new flooding control protocol, i.e. NC-Flooding for wireless sensor networks. NC-Flooding protocol introduces five mechanisms to enhance the efficiency of wireless sensor networks. As shown by MATLAB simulation results, NC-Flooding protocol reduces the number of broadcasts of wireless sensor networks, increases the throughput of the network and increases the bandwidth utilization. We conclude that NC-Flooding protocol reduces data forwarding cost and node energy consumption and extends nodes’ life cycle, thus increasing network utilization.


Author(s):  
Amarasimha T. ◽  
V. Srinivasa Rao

Wireless sensor networks are used in machine learning for data communication and classification. Sensor nodes in network suffer from low battery power, so it is necessary to reduce energy consumption. One way of decreasing energy utilization is reducing the information transmitted by an advanced machine learning process called support vector machine. Further, nodes in WSN malfunction upon the occurrence of malicious activities. To overcome these issues, energy conserving and faulty node detection WSN is proposed. SVM optimizes data to be transmitted via one-hop transmission. It sends only the extreme points of data instead of transmitting whole information. This will reduce transmitting energy and accumulate excess energy for future purpose. Moreover, malfunction nodes are identified to overcome difficulties on data processing. Since each node transmits data to nearby nodes, the misbehaving nodes are detected based on transmission speed. The experimental results show that proposed algorithm provides better results in terms of reduced energy consumption and faulty node detection.


Author(s):  
Ajay Kaushik ◽  
S. Indu ◽  
Daya Gupta

Wireless sensor networks (WSNs) are becoming increasingly popular due to their applications in a wide variety of areas. Sensor nodes in a WSN are battery operated which outlines the need of some novel protocols that allows the limited sensor node battery to be used in an efficient way. The authors propose the use of nature-inspired algorithms to achieve energy efficient and long-lasting WSN. Multiple nature-inspired techniques like BBO, EBBO, and PSO are proposed in this chapter to minimize the energy consumption in a WSN. A large amount of data is generated from WSNs in the form of sensed information which encourage the use of big data tools in WSN domain. WSN and big data are closely connected since the large amount of data emerging from sensors can only be handled using big data tools. The authors describe how the big data can be framed as an optimization problem and the optimization problem can be effectively solved using nature-inspired algorithms.


Sign in / Sign up

Export Citation Format

Share Document