TY - GEN
T1 - Replication-based Efficient Data delivery scheme (RED) for Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN)
AU - Wang, Yu
AU - Wu, Hongyi
PY - 2006
Y1 - 2006
N2 - The Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN) has been proposed recently for pervasive information gathering. DFT-MSN distinguishes Itself from conventional sensor networks by several unique characteristics such as sensor mobility, loose connectivity, and delay/fault tolerability. The mainstream approaches for sensor networking/communication cannot be applied in DFT-MSN directly. In this paper we propose a Replication-based Efficient Data Delivery (RED) scheme based on erasure coding technology tailored for DFT-MSN. RED consists of two key components for data transmission and message management, respectively. The former makes decision on when and where to transmit data messages according to the delivery probability. The latter decides the optimal erasure coding parameters (including the number of data blocks and the needed redundancy) based on its current delivery probability, in order to achieve the desired data delivery ratio while minimizing overhead at the same time. Extensive simulation has been carried out for performance evaluation. Compared with other approaches, the proposed RED data delivery scheme achieves high message delivery ratio with low transmission overhead and data management complexity.
AB - The Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN) has been proposed recently for pervasive information gathering. DFT-MSN distinguishes Itself from conventional sensor networks by several unique characteristics such as sensor mobility, loose connectivity, and delay/fault tolerability. The mainstream approaches for sensor networking/communication cannot be applied in DFT-MSN directly. In this paper we propose a Replication-based Efficient Data Delivery (RED) scheme based on erasure coding technology tailored for DFT-MSN. RED consists of two key components for data transmission and message management, respectively. The former makes decision on when and where to transmit data messages according to the delivery probability. The latter decides the optimal erasure coding parameters (including the number of data blocks and the needed redundancy) based on its current delivery probability, in order to achieve the desired data delivery ratio while minimizing overhead at the same time. Extensive simulation has been carried out for performance evaluation. Compared with other approaches, the proposed RED data delivery scheme achieves high message delivery ratio with low transmission overhead and data management complexity.
UR - https://www.scopus.com/pages/publications/33750306215
UR - https://www.scopus.com/pages/publications/33750306215#tab=citedBy
U2 - 10.1109/PERCOMW.2006.118
DO - 10.1109/PERCOMW.2006.118
M3 - Conference contribution
AN - SCOPUS:33750306215
SN - 0769525202
SN - 9780769525204
T3 - Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
SP - 485
EP - 489
BT - Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
PB - IEEE Computer Society
T2 - 4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006
Y2 - 13 March 2006 through 17 March 2006
ER -