RSQS: Resource-Saving Multi-query Scheduling in Wireless Sensor Networks

2008 ◽  
Author(s):  
Yuan Zheng ◽  
Ming Liu ◽  
Jiannong Cao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Resource Saving ◽  
Query Scheduling

scholarly journals Deadline-Aware Energy-Efficient Query Scheduling in Wireless Sensor Networks with Mobile Sink

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Murat Karakaya
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Scheduling Algorithm ◽  
Data Gathering ◽  
Mobile Sink ◽  
Base Station ◽  
Wireless Sensor ◽  
Mobile Sinks ◽  
Delay Tolerant ◽  
Query Scheduling

Mobile sinks are proposed to save sensor energy spent for multihop communication in transferring data to a base station (sink) in Wireless Sensor Networks. Due to relative low speed of mobile sinks, these approaches are mostly suitable for delay-tolerant applications. In this paper, we study the design of a query scheduling algorithm for query-based data gathering applications using mobile sinks. However, these kinds of applications are sensitive to delays due to specified query deadlines. Thus, the proposed scheduling algorithm aims to minimize the number of missed deadlines while keeping the level of energy consumption at the minimum.

scholarly journals Fast, Resource-Saving, and Anti-Collaborative Attack Trust Computing Scheme Based on Cross-Validation for Clustered Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (6) ◽  
pp. 1592 ◽  
Author(s):  
Chuanyi Liu ◽  
Xiaoyong Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Cross Validation ◽  
Base Stations ◽  
Wireless Sensor ◽  
Malicious Nodes ◽  
Resource Saving ◽  
Cluster Heads ◽  
Computing Scheme ◽  
Trust Computing

The trust computing mechanism has an increasing role in the cooperative work of wireless sensor networks. However, the computing speed, resource overhead, and anti-collaborative attack ability of a trust mechanism itself are three key challenging issues for any open and resource-constrained wireless sensor networks. In this study, we propose a fast, resource-saving, and anti-collaborative attack trust computing scheme (FRAT) based on across-validation mechanism for clustered wireless sensor networks. First, according to the inherent relationship among three network entities (which are made up of three types of network nodes, namely base stations, cluster heads, and cluster members), we propose the cross-validation mechanism, which is effective and reliable against collaborative attacks caused by malicious nodes. Then, we adopt a fast and resource-saving trust computing scheme for cooperation between between cluster heads or cluster members. This scheme is suitable for wireless sensor networks because it facilitates resource-saving. Through theoretical analysis and experiments, the feasibility and effectiveness of the trust computing scheme proposed in this study are verified.

Multi-regional query scheduling in wireless sensor networks with minimum latency

2012 ◽  
Vol 14 (9) ◽  
pp. 849-864 ◽  
Author(s):  
Mingyuan Yan ◽  
Jing Selena He ◽  
Shouling Ji ◽  
Yingshu Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Minimum Latency ◽  
Query Scheduling

scholarly journals Real-Time Query Scheduling for Wireless Sensor Networks

2013 ◽  
Vol 62 (9) ◽  
pp. 1850-1865 ◽  
Author(s):  
Octav Chipara ◽  
Chenyang Lu ◽  
Gruia-Catalin Roman
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Wireless Sensor ◽  
Query Scheduling
Sign in / Sign up

Export Citation Format

Share Document