Parallel Architectures, Algorithms and Programming, International Symposium on (2010)
Dalian, Liaoning China
Dec. 18, 2010 to Dec. 20, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2010.17
The content dissemination among mobile users can be solved by self-facilitated mobile ad hoc networks (MANET) in an infrastructure environment. But the devices used to make up the mobile ad hoc networks usually have a limited radio transmission range, sporadic node density and power limitation, which makes MANET become intermittently connected. In this paper we focus on the content delivery problem in intermittently connected ad hoc networks (ICMANET). We propose an efficient model for this problem in ICMANET to maximize the total number of requests to be met. We have proposed a distributed algorithm based on the model which can be implemented by each node in ICMANET. We compare our algorithm with the existing ones and the simulation results demonstrate that our algorithm outperforms other algorithms significantly.
Hui Tian, Fenghang Yin, Xianchao Zhang, "An Efficient Content Delivery Algorithm for Intermittently Connected Mobile Ad Hoc Networks", Parallel Architectures, Algorithms and Programming, International Symposium on, vol. 00, no. , pp. 10-14, 2010, doi:10.1109/PAAP.2010.17