Swarm-Based Routing Protocol Assisted by Weakly Connected Dominating Sets for Mobile Ad-Hoc Networks

被引:0
|
作者
Li, Kuen-Han [1 ,2 ]
Leu, Jenq-Shiou [2 ]
Hosek, Jiri [3 ]
机构
[1] Inst Informat Ind, Smart Network Syst Inst, Taipei, Taiwan
[2] Natl Taiwan Univ Sci & Technol, Dept Elect & Comp Engn, Taipei, Taiwan
[3] Brno Univ Technol, Dept Telecommun, CS-61090 Brno, Czech Republic
来源
JOURNAL OF INTERNET TECHNOLOGY | 2016年 / 17卷 / 04期
关键词
Weakly Connected Dominating Set (WCDS); Ant Colony Optimization (ACO); Mobile Ad-hoc Network (MANET); On-demand routing; ALGORITHMS;
D O I
10.6138/JIT.2016.17.4.20140403
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the advancement of the mobile ad-hoc network (MANET), many researches were proposed to increase the efficiency of networks. The important factor affects the performance in MANET is discovering and maintaining paths since the node's mobility causes topology change, which needs to be observed for effective communication. One of the popular studies for routing in the networks in recent years is the swarm intelligence which imitates the collective behavior of biological species to solve routing problems in the networks. Another efficient method is clustering scheme which can be auxiliary structure to cluster nodes in the network. In this paper, we use weakly connected dominating sets (WCDS) which clusters network by node's maximum degree or minimum ID to propose an improved ant-based on-demand clustering routing (AOCR) protocol. AOCR uses ant-like agents inspired by the foraging behavior of ant colonies to explore networks and discover a route which fulfills several Quailty of Service (QoS) requirements including minimal traffic overhead or energy-efficiency for MANET.
引用
收藏
页码:671 / 681
页数:11
相关论文
共 50 条
  • [1] Weakly connected dominating set-assisted ant-based routing protocol for wireless ad-hoc networks
    Li, Kuen-Han
    Leu, Jenq-Shiou
    [J]. COMPUTERS & ELECTRICAL ENGINEERING, 2015, 48 : 62 - 76
  • [2] Routing in ad-hoc networks using minimum connected dominating sets
    Das, B
    Bharghavan, V
    [J]. ICC'97: 1997 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - TOWARDS THE KNOWLEDGE MILLENNIUM, CONFERENCE RECORD - VOLS 1-3, 1997, : 376 - 380
  • [3] Compromising Ad-hoc Networks by Attacking Weakly Connected Dominating Set
    Lin, Chi
    Wu, Guowei
    Yim, Kangbin
    Yao, Lin
    Hou, Gang
    [J]. 2015 9TH INTERNATIONAL CONFERENCE ON INNOVATIVE MOBILE AND INTERNET SERVICES IN UBIQUITOUS COMPUTING IMIS 2015, 2015, : 213 - 220
  • [4] Angular routing protocol for mobile ad-hoc networks
    Giruka, VC
    Singhal, M
    [J]. 25TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS, PROCEEDINGS, 2005, : 551 - 557
  • [5] A secure routing protocol for mobile ad-hoc networks
    Jiang, TY
    Li, QH
    [J]. PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 2825 - 2829
  • [6] Routing protocol for mobile ad-hoc wireless networks
    Nogales, Ivris Marcelo Bacarreza
    [J]. RADIOENGINEERING, 2007, 16 (03) : 86 - 90
  • [7] Routing Protocol Design Based on Location in Incompletely Connected Ad-hoc Networks
    Jiang, Hong
    Li, Chunju
    [J]. 2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 8785 - 8789
  • [8] CGM: A multicast routing protocol for mobile ad-hoc networks
    Lin, CR
    Sia, MJ
    Huang, YS
    [J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 2003, E86B (12) : 3569 - 3579
  • [9] An anonymous distributed routing protocol in mobile ad-hoc networks
    Ren-Junn Hwang
    Yu-Kai Hsiao
    [J]. The Journal of Supercomputing, 2013, 66 : 888 - 906
  • [10] LQ-routing protocol for mobile ad-hoc networks
    Tao, T
    Tagashira, S
    Fujita, S
    [J]. FOURTH ANNUAL ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE, PROCEEDINGS, 2005, : 441 - 446