The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
Performance analysis of mobility-assisted routing
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A new networking model for biological applications of ad hoc sensor networks
IEEE/ACM Transactions on Networking (TON)
Opportunistic content distribution in an urban setting
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Opportunistic Content-Based Dissemination in Disconnected Mobile Ad Hoc Networks
UBICOMM '07 Proceedings of the International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies
IEEE Communications Surveys & Tutorials
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks
IEEE Communications Magazine
| Hi-index | 0.00 |
Over the last few years, the popularity of multimedia content sharing among the Internet users has promoted a new kind of networking where the content dissemination is determined by the interests of users rather than pre-specified destinations. Development of wireless mobile devices has further enhanced the trend of content exchange among the mobile users. However, such mobile nodes based content dissemination may suffer the underlying intermittent connectivity due to the inherent limitations such as short radio transmission range, sporadic node densities and constrained power. To this effect, some solutions have been proposed in the literature that exploit the mobility and storage space of the nodes to distribute contents even if a route never exists. In all these mechanisms, whenever two mobile nodes encounter each other, each node only focuses on making independent disseminating decisions to improve the overall performance. However, even though each node can get its own optimized decisions, it may not be an optimized decision between the two encountering nodes. With this in mind, this paper presents a cooperative content dissemination framework (CCDF) with an analytical model to select and store the contents that maximizes the overall content delivery probability in the future. Simulation results demonstrate the enhanced delivery performance offered by the proposed CCDF over existing schemes.