In-network query processing in mobile P2P databases
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Featherlight information network with delay-endurable RFID support (FINDERS)
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
DTIPN: delay tolerant IP networking for opportunistic network applications
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
A motion tendency-based adaptive data delivery scheme for delay tolerant mobile sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Clustering and cluster-based routing protocol for delay-tolerant mobile networks
IEEE Transactions on Wireless Communications
Fast track article: Impact of source counter on routing performance in resource constrained DTNs
Pervasive and Mobile Computing
Buffer dimensioning of delay-tolerant network nodes - a large deviations approach
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Using request queues for enhancing the performance of operations in smart homes
Proceedings of the 7th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Routing protocols for delay tolerant networks: a quantitative evaluation
Proceedings of the 7th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Data delivery scheme for intermittently connected mobile sensor networks
Computer Communications
Continuous range k-nearest neighbor queries in vehicular ad hoc networks
Journal of Systems and Software
Leader Based Group Routing in Disconnected Mobile Ad Hoc Networks with Group Mobility
Wireless Personal Communications: An International Journal
Proceedings of the 8th ACM MobiCom workshop on Challenged networks
Social group detection based routing in Delay Tolerant Networks
Wireless Networks
| Hi-index | 0.00 |
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.