scholarly journals A Complete Feasible and Nodes-Grouped Scheduling Algorithm for Wireless Rechargeable Sensor Networks in Tunnels

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3410 ◽  
Author(s):  
Xiaoming Liu ◽  
Yu Guo ◽  
Wen Li ◽  
Min Hua ◽  
Enjie Ding
Keyword(s):  
Sensor Networks ◽  
State Of The Art ◽  
Scheduling Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Distribution Problem ◽  
Design Constraint ◽  
Charging Time ◽  
Wireless Rechargeable Sensor Networks ◽  
Charging Strategy

Limited energy in each node is the major design constraint in wireless sensor networks (WSNs), especially in mine tunnel scenario where the WSNs are required to work perpetually. To overcome this limit, wireless rechargeable sensor networks (WRSNs) have been proposed and studied extensively over the last few years. To keep the sensor nodes working perpetually, one fundamental question is how to design the charging scheme. Considering the special tunnel scenario, this paper proposes a Complete Feasible Charging Strategy (CFCS) to ensure the whole WRSNs is working perpetually. We divide the whole WRSN into several subnetworks and use several mobile chargers (MCs) to charge every subnetwork periodically and orderly. For a subnetwork, we formulate the main problem as a charging time distribution problem. A series of theorems are deduced to restrict the charging configurations, and a group nodes mechanism is proposed to expand the scale of the WRSNs. Finally, we conduct extensive simulations to evaluate the performance of the proposed algorithms. The results demonstrate which of the CFCS boundary theorems is correct and that our proposed CFCS can keep the WRSNs working perpetually. Furthermore, our Nodes-Grouped mechanism can support more nodes in WRSN compared to the state-of-the-art baseline methods.

scholarly journals A Combined Localization Algorithm for Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Xiaogang Qi ◽  
Xiaoke Liu ◽  
Lifang Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
State Of The Art ◽  
Sensor Nodes ◽  
Vehicle Tracking ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Environment And Health ◽  
Anchor Nodes ◽  
Positioning Algorithm

Wireless sensor networks (WSNs) are widely used in various fields to monitor and track various targets by gathering information, such as vehicle tracking and environment and health monitoring. The information gathered by the sensor nodes becomes meaningful only if it is known where it was collected from. Considering that multilateral algorithm and MDS algorithm can locate the position of each node, we proposed a localization algorithm combining the merits of these two approaches, which is called MA-MDS, to reduce the accumulation of errors in the process of multilateral positioning algorithm and improve the nodes’ positioning accuracy in WSNs. It works in more robust fashion for noise sparse networks, even with less number of anchor nodes. In the MDS positioning phase of this algorithm, the Prussian Analysis algorithm is used to obtain more accurate coordinate transformation. Through extensive simulations and the repeatable experiments under diverse representative networks, it can be confirmed that the proposed algorithm is more accurate and more efficient than the state-of-the-art algorithms.

scholarly journals RELAY DEPLOYMENT ALGORITHMS IN WIRELESS SENSOR NETWORKS: A SURVEY

2018 ◽  
Vol 14 (2) ◽  
pp. 131-137
Author(s):  
Lanny Sitanayah
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocols ◽  
Fault Tolerant ◽  
State Of The Art ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Alternate Routes ◽  
Relay Deployment

Wireless Sensor Networks (WSNs) are subject to failures. Even though reliable routing protocols for WSNs exist and are well-understood, the physical network topology must ensure that alternate routes with an acceptable length to the sinksare in fact available when failures occur. This requires a sensor network deployment to be planned with an objective of ensuring some measure of robustness in the topology, so that when failures do occur the protocols can continue to offer reliable delivery. To ensure that sensor nodes have sufficient paths, it may be necessary to add a number of additional relay nodes, which do not sense, but only forward data from other nodes. In this paper, we review a range of existing algorithms to deploy relay nodes for fault tolerance. We classify the state-of-the-art relay placement algorithms based on routing structures, connectivity requirements, deployment locations, and fault-tolerant requirements.

scholarly journals Characterization and Modeling of Received Signal Strength and Charging Time for Wireless Energy Transfer

2015 ◽  
Vol 2015 ◽  
pp. 1-15 ◽  
Author(s):  
Uthman Baroudi ◽  
Amin-ud-din Qureshi ◽  
Samir Mekid
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Transfer ◽  
Sensor Networks ◽  
Signal Strength ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wireless Energy Transfer ◽  
Wireless Sensor Nodes ◽  
Charging Time ◽  
Indoor And Outdoor

Wireless sensor networks can provide effective means for monitoring and controlling a wide range of applications. Recently, tremendous effort was directed towards devising sensors powered from ambient sources such as heat, wind, and vibration. Wireless energy transfer is another source that has attractive features that make it a promising candidate for supplying power to wireless sensor nodes. This paper is concerned with characterizing and modeling the charging time and received signal strength indicator for wireless energy transfer system. These parameters play a vital role in deciding the geometry of sensor network and the routing protocols to be deployed. The development of communication protocols for wireless-powered wireless sensor networks is also improved with the knowledge of such models. These two quantities were computed from data acquired at various coordinates of the harvester relative to a fixed position of RF energy source. Data was acquired for indoor and outdoor scenarios using the commercially available PowerCast energy harvester and evaluation board. Mathematical models for both indoor and outdoor environments were developed and analyzed. A few guidelines on how to use these models were suggested. Finally, the possibility of harvesting the energy from the ambient RF power to energize wireless sensor nodes was also investigated.

Real-Time Communications in Wireless Sensor Networks

2010 ◽  
pp. 69-78
Author(s):  
Isabelle Augé-Blum ◽  
Fei Yang ◽  
Thomas Watteyne
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
State Of The Art ◽  
Communication Protocols ◽  
The State ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Future Trends ◽  
Wireless Links

This chapter presents the state-of-the-art of real-time communication in the challenging topic of Wireless Sensor Networks (WSNs). In real-time communication, the duration between the event which initiates the sending of a message, and the instant this message is received must be smaller than a known delay. Because topologies are extremely dynamic and not known priori, this type of constraint is very hard to meet in WSNs. In this chapter, the different communication protocols proposed in the literatures, together with their respective advantages and drawbacks, are discussed. We focus on MAC and routing because they are key layers in real-time communication. As most existing protocols are not suitable under realistic constraints where sensor nodes and wireless links are unreliable, we give, at the end of this chapter, some insights about future trends in designing real-time protocols. We hope to give the reader an overview of recent research works in this complex topic which we consider to be essential in critical applications.

Wireless Sensor Networks to Predict the Range Covered by the Priority Scheduling Algorithm for Multi-Target Tracking

2014 ◽  
Vol 687-691 ◽  
pp. 1071-1075
Author(s):  
Yong Long Zhuang ◽  
Xiao Lan Weng ◽  
Xiang He Wei
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Target Tracking ◽  
Scheduling Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Tracking Accuracy ◽  
Detection Range ◽  
Multi Target Tracking ◽  
The Relationship

Research on multi-target tracking wireless sensor networks, the main problem is how to improve tracking accuracy and reduce energy consumption. Proposed use of forecasting methods to predict the target state, the selection of target detection range forecast based on the relationship between states and between sensor nodes deployed. And in accordance with the selected detection range, to wake up and form a cluster to track the target. In multi-target tracking will use to adjust the detection range, time to time to separate the conflict node of conflict, in order to achieve a successful track multiple targets. Simulation results show that the proposed method can indeed improve the chances of success of the track.

scholarly journals An Optimal Task Scheduling Algorithm in Wireless Sensor Networks

2011 ◽  
Vol 6 (1) ◽  
pp. 101 ◽  
Author(s):  
Liang Dai ◽  
Yilin Chang ◽  
Zhong Shen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Resource ◽  
Task Scheduling Algorithm ◽  
Two Phases

Sensing tasks should be allocated and processed among sensor nodes in minimum times so that users can draw useful conclusions through analyzing sensed data. Furthermore, finishing sensing task faster will benefit energy saving, which is critical in system design of wireless sensor networks. To minimize the execution time (makespan) of a given task, an optimal task scheduling algorithm (OTSA-WSN) in a clustered wireless sensor network is proposed based on divisible load theory. The algorithm consists of two phases: intra-cluster task scheduling and inter-cluster task scheduling. Intra-cluster task scheduling deals with allocating different fractions of sensing tasks among sensor nodes in each cluster; inter-cluster task scheduling involves the assignment of sensing tasks among all clusters in multiple rounds to improve overlap of communication with computation. OTSA-WSN builds from eliminating transmission collisions and idle gaps between two successive data transmissions. By removing performance degradation caused by communication interference and idle, the reduced finish time and improved network resource utilization can be achieved. With the proposed algorithm, the optimal number of rounds and the most reasonable load allocation ratio on each node could be derived. Finally, simulation results are presented to demonstrate the impacts of different network parameters such as the number of clusters, computation/communication latency, and measurement/communication speed, on the number of rounds, makespan and energy consumption.

scholarly journals Aggregation Tree Based Data Aggregation Algorithm in Wireless Sensor Networks

2016 ◽  
Vol 12 (06) ◽  
pp. 10
Author(s):  
Hu Yanhua ◽  
Xincai Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Scheduling Algorithm ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Trade Off ◽  
Redundant Data ◽  
Aggregation Tree

Abstract: In wireless sensor networks, efficient and effective data aggregation algorithms can prolong the network lifecycle by reducing communication of redundant data and improve the security of the networks. Tradition data aggregation algorithms in wireless sensor networks mainly aim to improve the energy utilization, and ignore the security and lifecycle. In order to get a good trade-off between these requirements, we proposed a data aggregation algorithm based on constructing a data aggregation tree. After give a formalism description of the problem, we proposed a data aggregation tree constructing algorithm. By minimize the maximal energy consumption of nodes, the algorithm can prolong the lifecycle. In data aggregation scheduling algorithm, we select the number of communications carefully to get the trade-off between low weighted delay and high network lifecycle. The simulation experiments show that, the proposed data aggregation algorithm consumes less energy while aggregating data from sensor nodes, and thus can prolong the network lifecycle.

Real-Time Communications in Wireless Sensor Networks

2012 ◽  
pp. 120-129
Author(s):  
Isabelle Augé-Blum ◽  
Fei Yang ◽  
Thomas Watteyne
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
State Of The Art ◽  
Communication Protocols ◽  
The State ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Future Trends ◽  
Wireless Links

This chapter presents the state-of-the-art of real-time communication in the challenging topic of Wireless Sensor Networks (WSNs). In real-time communication, the duration between the event which initiates the sending of a message, and the instant this message is received must be smaller than a known delay. Because topologies are extremely dynamic and not known priori, this type of constraint is very hard to meet in WSNs. In this chapter, the different communication protocols proposed in the literatures, together with their respective advantages and drawbacks, are discussed. We focus on MAC and routing because they are key layers in real-time communication. As most existing protocols are not suitable under realistic constraints where sensor nodes and wireless links are unreliable, we give, at the end of this chapter, some insights about future trends in designing real-time protocols. We hope to give the reader an overview of recent research works in this complex topic which we consider to be essential in critical applications.

scholarly journals A sensor node scheduling algorithm for heterogeneous wireless sensor networks

2019 ◽  
Vol 15 (1) ◽  
pp. 155014771982631 ◽  
Author(s):  
Zhangquan Wang ◽  
Yourong Chen ◽  
Banteng Liu ◽  
Haibo Yang ◽  
Ziyi Su ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Optimization Model ◽  
Sensor Node ◽  
Scheduling Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Node Scheduling ◽  
Heterogeneous Wireless Sensor Networks

To improve the regional coverage rate and network lifetime of heterogeneous wireless sensor networks, a sensor node scheduling algorithm for heterogeneous wireless sensor networks is proposed. In sensor node scheduling algorithm, heterogeneous perception radius of sensor node is considered. Incomplete coverage constraint and arc coverage interval are analyzed. Regional coverage increment optimization model, arc coverage increment optimization model, and residual energy optimization model are proposed. Multi-objective scheduling model is established using weight factors and integrated function. Furthermore, the heuristic method is proposed to solve the multi-objective optimization model, and scheduling scheme of heterogeneous sensor nodes is obtained. When the network is in operation for a period of time, some sensor nodes are invalid and relevant regions are uncovered. The repair method is proposed to wake up sleep sensor nodes and repair the coverage blind area. The simulation results show that if keeping the same regional coverage rate, sensor node scheduling algorithm improves network lifetime, increases number of living sensor nodes, and keeps average node energy consumption at a low level. Under certain conditions, sensor node scheduling algorithm outperforms DGREEDY, two-tiered scheduling, and minimum connected cover.

Sign in / Sign up

Export Citation Format

Share Document