Hierarchical search-based routing protocol for infrastructure-based opportunistic networks

被引:2
|
作者
Sharma D.K. [1 ,2 ]
Dhurandher S.K. [1 ,2 ]
Kumar S. [1 ,2 ]
机构
[1] Department of Information Technology, Netaji Subhas University of Technology, New Delhi
关键词
Incentive scheme; ONE; OppNets; Opportunistic networks; Selfish nodes; Simulator; The opportunistic network environment; Wireless charging;
D O I
10.1504/IJICA.2021.113752
中图分类号
学科分类号
摘要
Opportunistic networks (OppNets) consist of intermittently connected devices where there is no guarantee that a predefined path from source to destination for message transmission exists. In such a sparsely connected network where nodes relay messages in an opportunistic manner, designing a routing protocol is a challenging task. In this paper, a novel routing protocol for infrastructure-based OppNets called the hierarchical search-based routing protocol (HSBRP) has been proposed. This protocol combines the benefits of both fixed and mobile routing techniques, combating the disadvantages posed by each, to give better performance on a multitude of performance metrics like, no single point of failure, fault detection and communication capacity, etc. In the proposed protocol, nodes are arranged in a hierarchical fashion and interactions between different levels of nodes are only allowed through well-defined rules that boost message delivery probability and reduce the overhead of the network. © 2021 Inderscience Enterprises Ltd.
引用
收藏
页码:134 / 145
页数:11
相关论文
共 50 条
  • [1] Cloud Computing Based Routing Protocol for Infrastructure-based Opportunistic Networks
    Sharma, Deepak Kumar
    Dhurandher, Sanjay K.
    Kumar, Akshay
    Kumar, Anil
    Jha, Ankit Kumar
    2016 1ST INDIA INTERNATIONAL CONFERENCE ON INFORMATION PROCESSING (IICIP), 2016,
  • [2] Hierarchical Cuckoo Search-based Routing in Wireless Sensor Networks
    Boucetta, Cherifa
    Idoudi, Hanen
    Saidane, Leila Azouz
    2016 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATION (ISCC), 2016, : 996 - 998
  • [3] Infrastructure-based routing in wireless mobile ad hoc networks
    Safwat, A
    Hassanein, H
    COMPUTER COMMUNICATIONS, 2002, 25 (03) : 210 - 224
  • [4] Time Routing: a community based routing protocol for Opportunistic Networks
    Ma, Xuebin
    Ouyang, Zhenchao
    Bai, Jing
    Zhan, Xin
    2014 IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (CIT), 2014, : 20 - 25
  • [5] Routing protocol based on social characteristics for opportunistic networks
    CHENG Gang
    SONG Mei
    ZHANG Yong
    XING Yihai
    BAO Xuyan
    TheJournalofChinaUniversitiesofPostsandTelecommunications, 2014, 21 (01) : 67 - 73+103
  • [6] HiBOp: a history based routing protocol for opportunistic networks
    Boldrini, Chiara
    Conti, Marco
    Iacopini, Iacopo
    Passarella, Andrea
    2007 IEEE INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS, MOBILE AND MULTIMEDIA NETWORKS, VOL 1, 2007, : 78 - 89
  • [7] Routing protocol based on social characteristics for opportunistic networks
    CHENG Gang
    SONG Mei
    ZHANG Yong
    XING Yi-hai
    BAO Xu-yan
    The Journal of China Universities of Posts and Telecommunications, 2014, (01) : 67 - 73
  • [8] Routing protocol based on social characteristics for opportunistic networks
    Cheng, Gang
    Song, Mei
    Zhang, Yong
    Xing, Yi-Hai
    Bao, Xu-Yan
    Journal of China Universities of Posts and Telecommunications, 2014, 21 (01): : 67 - 73
  • [9] A Survey on Infrastructure-Based Vehicular Networks
    Silva, Cristiano M.
    Masini, Barbara M.
    Ferrari, Gianluigi
    Thibault, Ilaria
    MOBILE INFORMATION SYSTEMS, 2017, 2017
  • [10] Using peer-to-peer data routing for infrastructure-based wireless networks
    Kodeswaran, SB
    Ratsimor, O
    Joshi, A
    Finin, T
    Yesha, Y
    PROCEEDINGS OF THE FIRST IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS (PERCOM 2003), 2003, : 305 - 312