Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012, Article ID 817528, 14 pages
http://dx.doi.org/10.1155/2012/817528
Research Article

Buffer Management and Hybrid Probability Choice Routing for Packet Delivery in Opportunistic Networks

School of Physics and Telecommunication Engineering, South China Normal University, Guangzhou 510006, China

Received 8 April 2012; Accepted 20 May 2012

Academic Editor: Carlo Cattani

Copyright © 2012 Daru Pan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. L. Pelusi, A. Passarella, and M. Conti, “Opportunistic networking: data forwarding in disconnected mobile ad hoc networks,” IEEE Communications Magazine, vol. 44, no. 11, pp. 134–141, 2006. View at Publisher · View at Google Scholar · View at Scopus
  2. K. Fall, “A delay-tolerant network architecture for challenged internets,” in Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM '03), pp. 27–34, August 2003. View at Scopus
  3. I. F. Akyildiz, B. Akan, C. Chen, J. Fang, and W. Su, “InterPlaNetary Internet: state-of-the-art and research challenges,” Computer Networks, vol. 43, no. 2, pp. 75–112, 2003. View at Publisher · View at Google Scholar · View at Scopus
  4. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Multiple-copy routing in intermittently connected mobile networks,” Tech. Rep. CENG-2004-12, University of Southern California, Los Angeles, Calif, USA, 2004. View at Google Scholar
  5. W. Huang and S. Chen, “Epidemic metapopulation model with traffic routing in scale-free networks,” Journal of Statistical Mechanics, vol. 2011, Article ID P12004, 12 pages, 2011. View at Publisher · View at Google Scholar
  6. S. Chen, W. Huang, C. Cattani, and G. Altieri, “Traffic dynamics on complex networks: a survey,” Mathematical Problems in Engineering, vol. 2012, Article ID 732698, 23 pages, 2012. View at Publisher · View at Google Scholar
  7. A. Vahdat and D. Becker, “Epidemic routing for partially-connected ad hoc networks,” Tech. Rep. CS-2000-06, Duke University Durham, Durham, NC, USA, 2000. View at Google Scholar
  8. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Single-copy routing in intermittently connected mobile networks,” in Proceedings of the 1st Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON '04), pp. 235–244, October 2004. View at Scopus
  9. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and wait: efficient routing in intermittently connected mobile networks,” in Proceedings of ACMSIGCOMM workshop on Delay Tolerant Networking (WDTN '05), 2005.
  10. M. Li, “Approximating ideal filters by systems of fractional order,” Computational and Mathematical Methods in Medicine, vol. 2012, Article ID 365054, 6 pages, 2012. View at Publisher · View at Google Scholar
  11. H. A. Nguyen, S. GiordanoS, and A. Puiatti, “Probabilistic routing protocol for intermittently connected mobile ad hoc network,” in Proceedings of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, Espoo, Finland, 2007.
  12. J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, “MaxProp: routing for vehicle-based disruption-tolerant networks,” in Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM '06), Barcelona, Spain, April 2006. View at Publisher · View at Google Scholar · View at Scopus
  13. T. Anindya, D. Rajkumar, K. Humayun, and C. S. Gholamali, “TTL based routing in opportunistic networks,” Journal of Network and Computer Applications, vol. 34, no. 5, pp. 1660–1670, 2011. View at Publisher · View at Google Scholar · View at Scopus
  14. A. Krifa and C. Barakat, “An optimal joint scheduling and drop policy for delay tolerant networks,” in Proceeding of the International Symposium on World of Wireless, Mobile and Multimedia Networks (WoWMoM '08), Newport Beach, Calif, USA, 2008.
  15. S. C. Nelson, M. Bakht, and R. Kravets, “Encounter-based routing in DTNs,” in Proceedings of the 28th Conference on Computer Communications (INFOCOM '09), pp. 846–854, Rio de Janeiro, Brazil, April 2009. View at Publisher · View at Google Scholar · View at Scopus
  16. R. Santos, J. Orozco, and F. Sergio, “A real-time analysis approach in opportunistic networks,” ACM SIGBED Review, vol. 8, no. 3, pp. 40–43, 2011. View at Publisher · View at Google Scholar
  17. M. Li, C. Cattani, and S. Y. Chen, “Viewing sea level by a one-dimensional random function with long memory,” Mathematical Problems in Engineering, vol. 2011, Article ID 654284, 13 pages, 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. M. Li and W. Zhao, “Visiting power laws in cyber-physical networking systems,” Mathematical Problems in Engineering, vol. 2012, Article ID 302786, 13 pages, 2012. View at Publisher · View at Google Scholar
  19. M. Li and W. Zhao, “Representation of a stochastic traffic bound,” IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 9, Article ID 5342414, pp. 1368–1372, 2010. View at Publisher · View at Google Scholar · View at Scopus
  20. J. Karvo and J. Ott, “Time scales and delay-tolerant routing protocols,” in Proceedings of the 3rd ACM workshop on Challenged networks (CHANTS '08), San Francisco, Calif, USA, 2008.