Coverage Efficient Clustering with a Minimum Number of Active Sensors for Wireless Sensor Networks

2009 ◽  
Author(s):  
Ji Gong ◽  
Gihwan Cho
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Active Sensors ◽  
Minimum Number

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
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Smart Grid ◽  
Round Robin ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Active Sensors ◽  
Save Energy ◽  
Battery Energy

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.

Obstacle mapping in wireless sensor networks via minimum number of measurements

2016 ◽  
Vol 10 (3) ◽  
pp. 237-246 ◽  
Author(s):  
Amirafshar Moshtaghpour ◽  
Mohammad Ali Akhaee ◽  
Masoud Attarifar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Minimum Number

scholarly journals Performance Evaluation of Wireless Sensor Networks for Event-Detection with Shadowing-Induced Radio Irregularities

2007 ◽  
Vol 3 (3-4) ◽  
pp. 251-266
Author(s):  
Giuseppe De Marco ◽  
Tao Yang ◽  
Makoto Ikeda ◽  
Leonard Barolli
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Event Detection ◽  
Radio Signal ◽  
Previous Analysis ◽  
Radio Channel ◽  
Wireless Sensor ◽  
Detection And Tracking ◽  
Minimum Number ◽  
The Subject

In this paper, we study a particular application of wireless sensor networks for event-detection and tracking. In this kind of application, the transport of data is simplified, and guaranteeing a minimum number of packets at the monitoring node is the only constraint on the performance of the sensor network. This minimum number of packets is called event-reliability. Contrary to other studies on the subject, here we consider the behavior of such a network in presence of a realistic radio model, such as the shadowing of the radio signal. With this setting, we extend our previous analysis of the event-reliability approach for the transport of data. In particular, both regular and random networks are considered. The contribute of this work is to show via simulations that, in the presence of randomness or irregularities in the radio channel, the event-reliability can be jeopardized, that is the constraint on the minimum number of packets at the sink node could not be satisfied.

scholarly journals Improved Location Estimation in Wireless Sensor Networks Using a Vector-Based Swarm Optimized Connected Dominating Set

Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 376 ◽  
Author(s):  
Gulshan Kumar ◽  
Rahul Saha ◽  
Mritunjay Rai ◽  
Reji Thomas ◽  
Tai-Hoon Kim ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Estimation Error ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Location Estimation ◽  
Wireless Sensor ◽  
Minimum Number ◽  
Anchor Nodes

Location estimation in wireless sensor networks (WSNs) has received tremendous attention in recent times. Improved technology and efficient algorithms systematically empower WSNs with precise location identification. However, while algorithms are efficient in improving the location estimation error, the factor of the network lifetime has not been researched thoroughly. In addition, algorithms are not optimized in balancing the load among nodes, which reduces the overall network lifetime. In this paper, we have proposed an algorithm that balances the load of computation for location estimation among the anchor nodes. We have used vector-based swarm optimization on the connected dominating set (CDS), consisting of anchor nodes for that purpose. In this algorithm, major tasks are performed by the base station with a minimum number of messages exchanged by anchor nodes and unknown nodes. The simulation results showed that the proposed algorithm significantly improves the network lifetime and reduces the location estimation error. Furthermore, the proposed optimized CDS is capable of providing a global optimum solution with a minimum number of iterations.

scholarly journals QC2: A QoS Control Scheme with Quick Convergence in Wireless Sensor Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Hao-Li Wang ◽  
Wei-Lun Hung
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Convergence Time ◽  
Wireless Sensor ◽  
Qos Control ◽  
Active Sensors ◽  
Target Number ◽  
Target Value ◽  
Control Scheme

In wireless sensor networks, too many or too few power-on sensors may cause the waste of resources or poor sensing efficiency; thus, controlling the number of active sensors to meet the predicted target number is the purpose of this research. However, the total number of sensors may be unstable because of the increment and damage to the sensors. It is difficult to control the number of active sensors to meet the predicted target in this condition. Previous studies proposed the Gur Game algorithm to solve this problem. However, the convergence time of the Gur Game algorithm is too long, which causes sensors to consume excessive power and waste resources. Therefore, this paper proposed the QoS Control with Quick Convergence (QC2). This method utilizes total virtual value to accelerate the convergence operation from the number of sensors to the target number. The experiment result shows that the QC2 method can cause the number of sensors to converge rapidly with the target value and that QC2 can be over a hundred times faster than the Gur Game algorithm with regard to convergence.

Data Gathering With Minimum Number of Relay Packets in Wireless Sensor Networks

2017 ◽  
Vol 17 (21) ◽  
pp. 7196-7208 ◽  
Author(s):  
Chien-Fu Cheng ◽  
Lung-Hao Li ◽  
Chen-Chuan Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Wireless Sensor ◽  
Minimum Number

scholarly journals Flexible Energy Efficient Density Control on Wireless Sensor Networks

2007 ◽  
Vol 3 (1) ◽  
pp. 5-21
Author(s):  
Yi Shang ◽  
Hongchi Shi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimality Conditions ◽  
Wireless Sensor ◽  
Energy Usage ◽  
Active Sensors ◽  
Coverage Gap ◽  
Density Control ◽  
Save Energy ◽  
The Ideal

In dense wireless sensor networks, density control is an important technique for prolonging the network's lifetime while providing sufficient sensing coverage. In this paper, we develop three new density control protocols by considering the tradeoff between energy usage and coverage. The first one, Non-Overlapping Density Control, aims at maximizing coverage while avoiding the overlap of sensing areas of active sensors. For the ideal case, a set of optimality conditions are derived to select sensors such that the sensing space is covered systematically to maximize the usage of each sensor and minimize the coverage gap. Based on theoretical optimality conditions, we develop a distributed protocol that can be efficiently implemented in large sensor networks. Next, we present a protocol called Non-Overlapping Density Control Based on Distances that does not require location information of the nodes. This protocol is more flexible and easier to implement than existing location-based methods. Finally, we present a new range-adjustable protocol called Non-Overlapping Density Control for Adjustable Sensing Ranges. It allows heterogenous sensing ranges for different sensors to save energy consumption. Extensive simulation shows promising results of the new protocols.

scholarly journals A Novel Deployment Scheme Based on Three-Dimensional Coverage Model for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Fu Xiao ◽  
Yang Yang ◽  
Ruchuan Wang ◽  
Lijuan Sun
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Three Dimensional ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Computing Power ◽  
Deployment Strategy ◽  
Coverage Model ◽  
Minimum Number ◽  
Random Method

Coverage pattern and deployment strategy are directly related to the optimum allocation of limited resources for wireless sensor networks, such as energy of nodes, communication bandwidth, and computing power, and quality improvement is largely determined by these for wireless sensor networks. A three-dimensional coverage pattern and deployment scheme are proposed in this paper. Firstly, by analyzing the regular polyhedron models in three-dimensional scene, a coverage pattern based on cuboids is proposed, and then relationship between coverage and sensor nodes’ radius is deduced; also the minimum number of sensor nodes to maintain network area’s full coverage is calculated. At last, sensor nodes are deployed according to the coverage pattern after the monitor area is subdivided into finite 3D grid. Experimental results show that, compared with traditional random method, sensor nodes number is reduced effectively while coverage rate of monitor area is ensured using our coverage pattern and deterministic deployment scheme.

Sign in / Sign up

Export Citation Format

Share Document