A comprehensive-integrated buffer management strategy for opportunistic networks

Daru Pan,Xiong Liu,Nian Zhou,Zhaohui Song,Zhaohua Ruan

doi:10.1186/1687-1499-2013-103

Abstract

Opportunistic networks aim to provide reliable communications in an intermittently connected environment. The research in cache management of opportunistic networks has been done a lot in those aspects, such as queue strategy, cache replace, redundancy delete, etc. But most of the existing studies only focus on a subdivision of the buffer management. To deal with such case, this article proposes a comprehensive integration buffer management strategy, called comprehensive-integrated buffer management (CIM), which takes all information relevant to message delivery and network resources into consideration. The simulation experiments show that the CIM strategy improved the performance in terms of delivery ratio, overhead ratio, and average delivery delay.

Highlights

Opportunistic network has captured much attention from researchers in recent years as a natural evolution from mobile ad-hoc network [1]
We integrate the different parts of buffer management, and take all information relevant to message delivery and the network resources into account
The existing studies of buffer management for opportunistic networks have focused on a subdivision of the field, such as queuing strategy, cache replacement, or redundancy removal

Summary

Introduction

Opportunistic network has captured much attention from researchers in recent years as a natural evolution from mobile ad-hoc network [1]. Problem statement In opportunistic networks, nodes forward data, and store data in the cache and keep the data for a long time (store–carry–forward) Several factors, such as the mobility of nodes, the number of copies of the messages and buffer space of each node, etc., should be considered [13,14,15,16,17,18,19]. The excessive flooding will inevitably leads that the buffer space of nodes are filled up by the copies in very short of time, and the buffer utilization rate is relatively low, and it consumes a lot of transmission resources of the network To deal with this problem, the proposed congestion control function introduces a mechanism to prevent excessive flooding based on the number of forwarding hops of the message and the relay time of relaying the message. The redundant message will be cleaned up and the buffer space will be released soon

Simulation and analysis

Findings

Conclusion