Data forwarding in opportunistic networks

被引：3
作者：
Liu L. [2 ]
Chen Z. [1 ]
机构：
[1] College of Information, Central University of Finance and Economics
[2] College of Informatics and Electronics, Zhejiang Sci-Tech University, Hangzhou, 310018, 5 Second Avenue, Xiasha Higher Education Zone
来源：
Information Technology Journal | 2010年 / 9卷 / 02期
关键词：
Data forwarding; Data routing; Opportunistic networks; Overview;
D O I：
10.3923/itj.2010.215.223
中图分类号：
学科分类号：
摘要：
In this study, state-of-art data forwarding methods in opportunistic networks are profoundly reviewed. Opportunistic networks is one of the most exciting evolutions of the legacy Mobile Ad hoc Networking (MANET) paradigm, in which the assumption of complete paths between data senders and receivers is not required all the time. Opportunistic networks enable users communication in disconnected environments, in which island of connected devices appear, disappear and reconfigure dynamically. As one key and principal problem in any networking, data forwarding and routing play an important role in improving network performance. As present routing protocols are mostly based on one primary assumption that end to end complete route should exist while data need to be transported between source-destination node pair, these protocols do not fit for opportunistic networks. New data forwarding and routing methods and protocols should be proposed for emerging opportunistic networks in order to meet the extensive pervasive networking need from the industry society. Furthermore, in the end of this study, new directions and trends in this area that are worth being studied further are pointed out. © 2010 Asian Network for Scientific Information.
引用
收藏
页码：215 / 223
页数：8
相关论文
共 25 条
  • [11] Lindgren A., Doria A., Schelen O., Probabilistic Routing in Intermittently Connected Networks, LNCS, 3126, pp. 239-254, (2004)
  • [12] Liu L., Feng G., Swarm intelligence based node-disjoint multi-path routing protocol for mobile ad hoc networks, Proceedings of the 5th International Conference on Information, (2005)
  • [13] Liu L., Feng G., A Novel Heuristic Routing Algorithm Using Simulated Annealing in Ad Hoc Networks, LNCS, 3746, pp. 849-857, (2005)
  • [14] Liu L., Keng G., Simulated annealing based multi-constrained QoS routing in mobile ad hoc networks, Wireless Personal Commun, 41, pp. 393-405, (2007)
  • [15] Liu L., Chen Z., Enhanced fisheye state routing using cross-layer optimization. Proceedings of Chinese Control and Decision Conference, Guilin, China, Jun. 17-19, IEEE Industrial Electronics, pp. 4673-4676, (2009)
  • [16] Mundur P., Seligman M., Lee G., Epidemic routing with immunity in delay tolerant networks, Proceedings of IEEE Military Communications Conference, pp. 1-7, (2008)
  • [17] Musolesi M., Hailes S., Mascolo C., Adaptive routing for intermittently connected mobile ad hoc networks, Proceedings of 6th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, Taormina, Giardini Naxos, pp. 183-189, (2005)
  • [18] Shah R.C., Roy S., Jain S., Brunette W., Data MULEs: Modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Networks, 1:215-Data MULEs: Modeling and analysis of a three-tier architecture for sparse sensor networks, Ad Hoe Networks, 1, pp. 215-233, (2003)
  • [19] Small T., Haas Z.J., The shared wireless Infostation model: A new ad hoc networking paradigm (or Where there is a whale, there is a way), Proceedings of the 4th ACM International Symposium on Mobile ad hoc Networking and Computing, pp. 233-244, (2003)
  • [20] Spyropoulos T., Psounis K., Raghavendra C.S., Single-copy routing in intermittently connected mobile networks, Proceedings of 1st Annual IEEE Communications Society Conference on Sensor and Ad hoc Communications and Networks, pp. 235-244, (2004)
123