Group-based discovery in low-duty-cycle mobile sensor networks
Group-based discovery in low-duty-cycle mobile sensor networks
复制标题
DOI：
10.1109/secon.2012.6275824
复制
发表时间：
2012-06
期刊：
影响因子：
--
通讯作者：
Liangyin Chen;Yu Gu;Shuo Guo;T. He;Yuanchao Shu;Fan Zhang;Jiming Chen
中科院分区：
文献类型：
--
作者：
Liangyin Chen;Yu Gu;Shuo Guo;T. He;Yuanchao Shu;Fan Zhang;Jiming Chen
无线传感器网络已被用于许多移动的应用，如野生动物跟踪和参与式城市传感。由于高移动性和低占空比操作的组合，减少移动的节点之间的发现延迟，使得移动的节点一旦在彼此的附近就可以快速建立连接是一个具有挑战性的问题。现有的发现设计基本上是基于成对的，其中，当两个节点被预先调度为同时唤醒时，被动地实现发现。相比之下，第一次，这项工作减少了发现延迟显着主动参考唤醒一组节点之间的时间表。由于主动引用会产生额外的开销，我们引入了一种新的选择性引用机制的基础上的时空属性的邻居和节点的移动性。我们的定量分析表明，我们的基于组的机制的发现延迟是显着小于成对的。在40个传感器节点上进行的实验验证了理论分析，与传统的成对方法相比，发现延迟降低了一个数量级，而能量消耗仅增加0.5%~8.8%。
Wireless Sensor Networks have been used in many mobile applications such as wildlife tracking and participatory urban sensing. Because of the combination of high mobility and low-duty-cycle operations, it is a challenging issue to reduce discovery delay among mobile nodes, so that mobile nodes can establish connection quickly once they are within each other's vicinity. Existing discovery designs are essentially pair-wise based, in which discovery is passively achieved when two nodes are pre-scheduled to wake-up at the same time. In contrast, for the first time, this work reduces discovery delay significantly by proactively referring wake-up schedules among a group of nodes. Because proactive references incur additional overhead, we introduce a novel selective reference mechanism based on spatiotemporal properties of neighborhood and the mobility of the nodes. Our quantitative analysis indicates that the discovery delay of our group-based mechanism is significantly smaller than that of the pair-wise one. Our testbed experiments using 40 sensor nodes confirm our theoretical analysis, showing one order of magnitude reduction in discovery delay compared with traditional pair-wise methods with only 0.5%~8.8% increase in energy consumption.