Research of opportunistic networks routing based on countryside community model

被引：0
作者：
机构：
[1] Chongqing University of Post and Telecommunications
[2] The key lab of OptoElectronics Technology and System, Ministry of Education, Chongqing University
来源：
Liu, Q. (liuql@cqupt.edu.cn) | 1600年 / Advanced Institute of Convergence Information Technology, Myoungbo Bldg 3F,, Bumin-dong 1-ga, Seo-gu, Busan, 602-816, Korea, Republic of卷 / 06期
关键词：
Countryside community model; First contact routing; MADM; Opportunistic network; W-MDUP algorithm;
D O I：
10.4156/jdcta.vol6.issue21.53
中图分类号：
学科分类号：
摘要：
In opportunistic network, the traditional routing protocols are hard to meet all the demands due to intermittent connectivity, buffers and energy limit. To this end, the paper proposes a Weights-Minimum Distance with Utopia Point (W-MDUP) algorithm that applies Multi-Attribute Decision Making (MADM) concept to optimize the opportunistic network performance based on the countryside community model. According to the W-MDUP algorithm, relay notes can choose the next hop dynamically and then transmit the message by the First Contact routing protocol. Simulation results show that this algorithm can improve the message delivery ratio effectively, decline the message delivery delay and network overhead ratio.
引用
收藏
页码：462 / 471
页数：9
相关论文
共 16 条
  • [1] Fall K.A., Delay-Tolerant Network Architecture for Challenged Internets, Proceeding of ACM SIGCOMM'03, pp. 27-34, (2003)
  • [2] Ivancic W.D., Delay/disruption-tolerant networking: Flight test results from the international space station, Proceeding of 2010 IEEE Aerospace Conference, pp. 1-8, (2010)
  • [3] Yang W.-D., Liu J.-Z., Modeling the Sociological Characteristic of Vehicle Mobility in Vehicular Sensor Network, Applied Mechanics and Materials, 48-49, pp. 715-718, (2011)
  • [4] Jie W., Yang S.-H., Dai F., Logarithmic store-carry-forward routing in mobile Ad hoc networks, IEEE Trans On Parallel and Distributed Systems, 18, 6, pp. 735-748, (2007)
  • [5] Cai H., Eun D.Y., Crossing over the bounded domain: From exponential to power-law intermeeting time in mobile ad hoc networks, IEEE/ACM Trans. Netw, 17, 5, pp. 1578-1591, (2009)
  • [6] He T., Vicaire P., Yan T., Luo L., Gu L., Zhou G., Stoleru R., Cao Q., Stankovic J., Abdelzaher T., Real-Time Analysis of Tracking Performance in Wireless Sensor Networks, IEEE Real-Time Applications Symposium, (2006)
  • [7] Wu D.-P., Huang K., Analyzing and comparing the performance of routing mechanism for Opportunistic Networks, Digital Communication, 5, pp. 30-33, (2011)
  • [8] Ayub Q., Rashid S., Zahid M.S.M., Optimization of Epidemic router by new forwarding queue mode TSMF, International Journal of Computer Applications, 7, 11, pp. 5-8, (2010)
  • [9] Liu Q.-S., Zhou J.-E., Zhang P.-N., Adaptive cache management method for opportunistic network based on number of message copies, Journal of Chongqing University of Post and Telecommunications, 23, 4, pp. 394-399, (2011)
  • [10] Shah H., Kosta Y.P., Evolution of routing techniques, routing protocols and routing efficiencies for Delay Tolerant Network, International Journal of Computer Applications, 1, pp. 46-53, (2010)
12