Double-Blind Data Discovery Using Double Cross for Large-Scale Wireless Sensor Networks With Mobile Sinks

Large-scale wireless sensor networks (WSNs) with mobile sinks present new challenges on data discovery because the locations of the mobile sinks cannot be predetermined. In this paper, we study the double-blind data discovery problem in a WSN, where the mobile sink(s) and the sensed data do not know...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology 2012-06, Vol.61 (5), p.2294-2304
Main Authors: Shi, Gaotao, Zheng, Jun, Yang, Jinfeng, Zhao, Zenghua
Format: Article
Language:English
Subjects:
Applied sciences
Data discovery
Detection, estimation, filtering, equalization, prediction
double cross
Energy consumption
Exact sciences and technology
Floods
Information, signal and communications theory
Joining
Mathematical analysis
Messages
Mobile communication
Mobile computing
Networks
Online analytical processing
Protocols
Random Line Walk (RLW)
Sensors
Services and terminals of telecommunications
Signal and communications theory
Signal, noise
Simulation
Studies
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Telemetry. Remote supervision. Telewarning. Remote control
Trajectory
Transmission and modulation (techniques and equipments)
wireless sensor network (WSN)
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Large-scale wireless sensor networks (WSNs) with mobile sinks present new challenges on data discovery because the locations of the mobile sinks cannot be predetermined. In this paper, we study the double-blind data discovery problem in a WSN, where the mobile sink(s) and the sensed data do not know the locations of each other a priori. To address this problem, we first propose a Random Line Walk (RLW) mechanism for message forwarding, and based on this forwarding mechanism, we further propose an efficient data discovery mechanism called Double Cross. Double Cross exploits a simple geometric property of a planar, i.e., for a couple of pairs of orthogonal lines in a planar, the probability that they intersect within the planar is larger than 99%. However, it does not depend on the geographic location or directional information on a node, which is difficult to obtain in such networks. Instead, each sensor node only needs to know the distances between the neighbor nodes within its transmission range. Analytical and simulation results show that Double Cross can achieve a higher successful discovery rate with lower energy consumption, compared existing work.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2012.2194310