This Article 
 Bibliographic References 
 Add to: 
Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN): A New Paradigm for Pervasive Information Gathering
September 2007 (vol. 6 no. 9)
pp. 1021-1034
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 tradeoff 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 DFTMSN data delivery schemes, namely Replication-Based Efficient Data Delivery Scheme (RED) and 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 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 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.

[1] I. Akyildiz, W. Su, and Y. Sankarasubramaniam, “A Survey on Sensor Networks,” IEEE Comm. Magazine, vol. 40, no. 8, pp. 102-114, 2002.
[2] O.B. Akan and I.F. Akyildiz, “Event-to-Sink Reliable Transport in Wireless Sensor Networks,” IEEE/ACM Trans. Networking, vol. 13, no. 5, pp. 1003-1016, 2005.
[3] W.K. Lin, D.M. Chiu, and Y.B. Lee, “Erasure Code Replication Revisited,” Proc. Fourth Int'l Conf. Peer-to-Peer Computing, pp. 90-97, 2004.
[4] V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, and H. Weiss, “Delay Tolerant Network Architecture,” IETF Internet draft, work in progress.
[5] K. Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,” Proc. ACM SIGCOMM, pp. 27-34, 2003.
[6] S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf, B. Durst, K. Scott, and H. Weiss, “Delay-Tolerant Networking—An Approach to Interplanetary Internet,” IEEE Comm. Magazine, vol. 41, no. 6, pp. 128-136, 2003.
[7] K. Fall, W. Hong, and S. Madden, “Custody Transfer for Reliable Delivery in Delay Tolerant Networks,” Technical Report IRB-TR-03-030, Intel Research, Berkeley, California, 2003.
[8] http:/, 2006.
[9] A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, and J. Anderson, “Wireless Sensor Networks for Habitat Monitoring,” Proc. ACM Int'l Workshop Wireless Sensor Networks and Applications (WSNA '02), pp. 88-97, 2002.
[10] http://down.dsg.cs.tcd.iesendt/, 2006.
[11], 2005.
[12] M. Ho and K. Fall, “Poster: Delay Tolerant Networking for Sensor Networks,” Proc. IEEE Conf. Sensor and Ad Hoc Comm. and Networks, 2004.
[13] R.C. Shah, S. Roy, S. Jain, and W. Brunette, “Data MULEs: Modeling a Three-Tier Architecture for Sparse Sensor Networks,” Proc. First Int'l Workshop Sensor Network Protocols and Applications, pp. 30-41, 2003.
[14] , 2006.
[15] T. Small and Z.J. Haas, “The Shared Wireless Infostation Model—A New Ad Hoc Networking Paradigm (or Where There Is a Whale, There Is a Way),” Proc. MobiHoc, pp. 233-244, 2003.
[16] T. Small and Z.J. Haas, “Resource and Performance Tradeoffs in Delay-Tolerant Wireless Networks,” Proc. ACM SIGCOMM Workshop Delay Tolerant Networking and Related Topics, 2005.
[17] Y. Wang, S. Jain, M. Martonosi, and K. Fall, “Erasure-Coding Based Routing for Opportunistic Networks,” Proc. ACM SIGCOMM Workshop Delay Tolerant Networking, 2005.
[18] M. Musolesi, S. Hailes, and C. Mascolo, “Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks,” Proc. IEEE Sixth Int'l Symp. World of Wireless, Mobile and Multimedia Networks (WOWMOM), pp. 1-7, 2005.
[19] J. LeBrun, C.-N. Chuah, and D. Ghosal, “Knowledge Based Opportunistic Forwarding in Vehicular Wireless Ad Hoc Networks,” Proc. IEEE Vehicular Technology Conf. (VTC) Spring, pp. 1-5, 2005.
[20] W. Zhao, M. Ammar, and E. Zegura, “A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks,” Proc. MobiHoc, pp. 187-198, 2004.
[21] A. Lindgren, A. Doria, and O. Schelén, “Probabilistic Routing in Intermittently Connected Networks,” Proc. First Int'l Workshop Service Assurance with Partial and Intermittent Resources (SAPIR '04), Aug. 2004.
[22] P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot, “Pocket Switched Networks and Human Mobility in Conference Environments,” Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking, pp. 244-251, 2005.
[23] J. Ghosh, S. Yoon, H. Ngo, and C. Qiao, “Sociological Orbits for Efficient Routing in Intermittently Connected Mobile Ad Hoc Networks,” technical report, Dept. of Computer Science and Eng., State Univ. of New York at Buffalo, 2005.

Index Terms:
Delay/fault-tolerant mobile sensor network, delivery delay, delivery probability, DFT-MSN, erasure coding, pervasive information gathering, queuing theory, replication, transmission overhead
Yu Wang, Hongyi Wu, "Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN): A New Paradigm for Pervasive Information Gathering," IEEE Transactions on Mobile Computing, vol. 6, no. 9, pp. 1021-1034, Sept. 2007, doi:10.1109/TMC.2007.1006
Usage of this product signifies your acceptance of the Terms of Use.