Fair data collection in wireless sensor networks: analysis and protocol

2010 ◽  
Vol 65 (7-8) ◽  
pp. 433-446 ◽  
Author(s):  
Md. Abdul Hamid ◽  
Muhammad Mahbub Alam ◽  
Md. Shariful Islam ◽  
Choong Seon Hong ◽  
Sungwon Lee
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Wireless Sensor ◽  
Networks Analysis

A Secure and Verifiable Continuous Data Collection Algorithm in Wireless Sensor Networks

2021 ◽  
Author(s):  
Taochun Wang ◽  
Chengmei Lv ◽  
Xin Jin ◽  
Fulong Chen ◽  
Chengtian Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Wireless Sensor ◽  
Continuous Data

Latency-efficient Data Collection Scheduling in Battery-free Wireless Sensor Networks

2020 ◽  
Vol 16 (3) ◽  
pp. 1-21
Author(s):  
Tongxin Zhu ◽  
Jianzhong Li ◽  
Hong Gao ◽  
Yingshu Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Wireless Sensor ◽  
Efficient Data ◽  
Efficient Data Collection

scholarly journals Distributed and morphological operation-based data collection algorithm

2017 ◽  
Vol 13 (7) ◽  
pp. 155014771771759 ◽  
Author(s):  
Yalin Nie ◽  
Haijun Wang ◽  
Yujie Qin ◽  
Zeyu Sun
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Network Lifetime ◽  
Algorithm Analysis ◽  
Wireless Sensor ◽  
Morphological Operation ◽  
Event Monitoring ◽  
Binary Images ◽  
Structuring Element

When monitoring the environment with wireless sensor networks, the data sensed by the nodes within event backbone regions can adequately represent the events. As a result, identifying event backbone regions is a key issue for wireless sensor networks. With this aim, we propose a distributed and morphological operation-based data collection algorithm. Inspired by the use of morphological erosion and dilation on binary images, the proposed distributed and morphological operation-based data collection algorithm calculates the structuring neighbors of each node based on the structuring element, and it produces an event-monitoring map of structuring neighbors with less cost and then determines whether to erode or not. The remaining nodes that are not eroded become the event backbone nodes and send their sensing data. Moreover, according to the event backbone regions, the sink can approximately recover the complete event regions by the dilation operation. The algorithm analysis and experimental results show that the proposed algorithm can lead to lower overhead, decrease the amount of transmitted data, prolong the network lifetime, and rapidly recover event regions.

scholarly journals Capacity of data collection in randomly-deployed wireless sensor networks

2010 ◽  
Vol 17 (2) ◽  
pp. 305-318 ◽  
Author(s):  
Siyuan Chen ◽  
Yu Wang ◽  
Xiang-Yang Li ◽  
Xinghua Shi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Wireless Sensor
Sign in / Sign up

Export Citation Format

Share Document