Self-adaptive risk-aware routing in opportunistic network

被引:2
作者
Arastouie, Narges [1 ]
Sabaei, Masoud [1 ]
机构
[1] Amirkabir Univ Technol, Comp Engn & Informat Technol, Tehran, Iran
关键词
Opportunistic network; Risk assessment; Buffer management; Prediction; TOLERANT; PROTOCOL; SPRAY;
D O I
10.1007/s11227-018-2264-2
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
An opportunistic network is a wireless ad hoc network that has frequently intermittent connectivity due to nodes' mobility. These spare, unpredictable networks aim to solve the prolonged delay paths by a store-carry-forward scheme. It is difficult to determine the appropriate nodes to forward the messages since there are few opportunistic contacts. The nodes might decide based on the obtained data of the network as a guide to reach a destination. The aforementioned technique is not helpful in case the rate of change in the network topology is higher than the rate of data gathering due to usage restrictions and uncertain available information/knowledge of the future contacts. In this paper, to cope with the challenges imposed by the un-deterministic environment, a risk assessment strategy is considered to evaluate the short and long-term impact of each decision to find the optimal node/paths. This routing scheme can take advantage of the unanticipated connection to make the routing more flexible in short time and with less buffer usage. Our proposed risk assessment algorithms that are based on MALP are mixed with the knowledge about buffer management and network capacity. The prioritized messages to be disseminated as well as better decision to take a risk are the main contributions of this paper. Moreover, the self-adaptive threshold, distributed PID controller, is considered to tackle different threshold levels for each node individually. Numerical results prove that the proposed method drastically increases the delivery ratio and also minimizes the risk of exceeding resource consumption and packet loss.
引用
收藏
页码:2385 / 2411
页数:27
相关论文
共 24 条
  • [1] A Performance Comparison of Delay-Tolerant Network Routing Protocols
    Abdelkader, Tamer
    Naik, Kshirasagar
    Nayak, Amiya
    Goel, Nishith
    Srivastava, Vineet
    [J]. IEEE NETWORK, 2016, 30 (02): : 46 - 53
  • [2] TB-SnW: Trust-based Spray-and-Wait routing for delay-tolerant networks
    Al-Hinai, Aysha
    Zhang, Haibo
    Chen, Yawen
    Li, Yidong
    [J]. JOURNAL OF SUPERCOMPUTING, 2014, 69 (02) : 593 - 609
  • [3] [Anonymous], 2012, INT J COMPUTER APPL, DOI DOI 10.5120/8299-1520
  • [4] Arastouie N, 2016, 2016 8TH INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATIONS (IST), P1, DOI 10.1109/ISTEL.2016.7881770
  • [5] Astrom KJ, 2008, Feedback systems: An introduction for scientists and engineers
  • [6] Robust routing in deterministic delay-tolerant networks
    Bocquillon, Ronan
    Jouglet, Antoine
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 92 : 77 - 86
  • [7] MaxProp: Routing for vehicle-based disruption-tolerant networks
    Burgess, John
    Gallagher, Brian
    Jensen, David
    Levine, Brian Neil
    [J]. 25TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-7, PROCEEDINGS IEEE INFOCOM 2006, 2006, : 1688 - 1698
  • [8] Burns B., 2005, P IEEE INFOCOM 2005
  • [9] Impact of human mobility on opportunistic forwarding algorithms
    Chaintreau, Augustin
    Hui, Pan
    Crowcroft, Jon
    Diot, Christophe
    Gass, Richard
    Scott, James
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2007, 6 (06) : 606 - 620
  • [10] Cuka M, 2017, INT C INT NETW COLL, P16