Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN): A new paradigm for pervasive information gathering
Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN): A new paradigm for pervasive information gathering
复制标题
DOI：
10.1109/tmc2007.1006
复制
发表时间：
2007-09-01
影响因子：
7.9
通讯作者：
Wu, Hongyi
中科院分区：
文献类型：
--
作者：
Wang, Yu;Wu, Hongyi
本文重点关注用于普适信息采集的延迟/容错移动传感器网络（DFT - MSN）。我们针对DFT - MSN开发了简单高效的数据传输方案，该网络具有若干独特特性，例如传感器移动性、松散连接性、容错性、延迟容忍性以及缓冲区限制。我们首先研究了两种基本方法，即直接传输和泛洪。我们利用排队论和统计学分析了它们的性能。基于分析结果所显示的数据传输延迟/比率与传输开销之间的权衡，我们引入了一种优化的泛洪方案，该方案使泛洪中的传输开销最小化。然后，我们提出了两种简单有效的DFT - MSN数据传输方案，即基于复制的高效数据传输方案（RED）和基于消息容错的自适应数据传输方案（FAD）。RED方案利用纠删编码技术，以最小的开销实现期望的数据传输比率。它由数据传输和消息管理两个关键部分组成。前者根据传输概率（即传感器将数据消息传输到汇聚节点的可能性）决定何时何地传输数据消息。后者根据其当前的传输概率确定最佳的纠删编码参数（包括数据块数量和所需的冗余）。FAD方案采用消息容错，它表明了消息的重要性。基于容错来决定消息的传输和丢弃，以使传输开销最小化。在全面分析的基础上仔细调整系统参数以优化网络性能。进行了大量的模拟以评估性能。我们的结果表明，这两种方案都在可接受的延迟下实现了较高的消息传输比率。RED方案在消息和队列管理方面复杂度较低，而FAD方案具有较低的消息传输开销。
This paper focuses on the Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN) for pervasive information gathering. We develop simple and efficient data delivery schemes tailored for DFT-MSN, which has several unique characteristics, such as sensor mobility, loose connectivity, fault tolerability, delay tolerability, and buffer limit. We first study two basic approaches, namely, direct transmission and flooding. We analyze their performance by using queuing theory and statistics. Based on the analytic results that show the trade-off between data delivery delay/ratio and transmission overhead, we introduce an optimized flooding scheme that minimizes transmission overhead in flooding. Then, we propose two simple and effective DFT-MSN data delivery schemes, namely, the Replication-Based Efficient Data Delivery Scheme (RED) and the Message Fault Tolerance-Based Adaptive Data Delivery Scheme (FAD). The RED scheme utilizes the erasure coding technology in order to achieve the desired data delivery ratio with minimum overhead. It consists of two key components for data transmission and message management. The former makes the decision on when and where to transmit data messages according to the delivery probability, which is the likelihood that a sensor can deliver data messages to the sink. The latter decides the optimal erasure coding parameters (including the number of data blocks and the needed redundancy) based on its current delivery probability. The FAD scheme employs the message fault tolerance, which indicates the importance of the messages. The decisions on message transmission and dropping are made based on fault tolerance for minimizing transmission overhead. The system parameters are carefully tuned on the basis of thorough analyses to optimize network performance. Extensive simulations are carried out for performance evaluation. Our results show that both schemes achieve a high message delivery ratio with acceptable delay. The RED scheme results in lower complexity in message and queue management, while the FAD scheme has a lower message transmission overhead.