Ant-based distributed topology control algorithms for mobile ad hoc networks

被引:19
作者
Shen, CC [1 ]
Huang, ZC [1 ]
Jaikaeo, C [1 ]
机构
[1] Univ Delaware, Newark, DE 19716 USA
基金
美国国家科学基金会;
关键词
topology control; swarm intelligence; mobile ad hoc networks; power assignment;
D O I
10.1007/s11276-005-6613-8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
By adjusting the transmission power of mobile nodes, topology control aims to reduce wireless interference, reduce energy consumption, and increase effective network capacity, subject to connectivity constraints. In this paper, we introduce the Ant-Based Topology Control (ABTC) algorithm that adapts the biological metaphor of Swarm Intelligence to control topology of mobile ad hoc networks. ABTC is a distributed algorithm where each node asynchronously collects local information from nearby nodes, via sending and receiving ant packets, to determine its appropriate transmission power. The operations of ABTC do not require any geographical location, angle-of-arrival, topology, or routing information, and are scalable. In particular, ABTC attempts to minimize the maximum power used by any node in the network, or minimize the total power used by all of the nodes in the network. By adapting swarm intelligence as an adaptive search mechanism, ABTC converges quickly to a good power assignment with respect to minimization objectives, and adapts well to mobility. In addition, ABTC may achieve common power, or properly assign power to nodes with non-uniform distribution. Results from a thorough comparative simulation study demonstrate the effectiveness of ABTC for different mobility speed, various density, and diverse node distributions.
引用
收藏
页码:299 / 317
页数:19
相关论文
共 50 条
  • [41] Topology Properties of Ad-Hoc Networks with Topology Control
    Piechowiak, Maciej
    Zwierzykowski, Piotr
    COMPUTER NETWORKS, CN 2014, 2014, 431 : 89 - 98
  • [42] Topology Properties of Ad-Hoc Networks with Topology Control
    Piechowiak, Maciej
    Zwierzykowski, Piotr
    Communications in Computer and Information Science, 2014, 431 : 89 - 98
  • [43] Graph Theory Algorithms for Mobile Ad Hoc Networks
    Meghanathan, Natarajan
    INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2012, 36 (02): : 185 - 199
  • [44] Analysis of clustering algorithms in mobile ad hoc networks
    Denko, MK
    ICWN'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS, 2003, : 98 - 105
  • [45] Randomized routing algorithms in mobile ad hoc networks
    Fevens, I
    Haque, IT
    Narayanan, L
    MOBILE AND WIRELESS COMMUNICATION NETWORKS, 2005, 162 : 347 - 357
  • [46] Energy Efficient Algorithms for Mobile Ad Hoc Networks
    Agrawal, Abhishek M.
    Dalu, S. S.
    2018 IEEE INTERNATIONAL CONFERENCE ON RESEARCH IN INTELLIGENT AND COMPUTING IN ENGINEERING (RICE III), 2018,
  • [47] Survey on Broadcast Algorithms for Mobile Ad Hoc Networks
    Ruiz, Patricia
    Bouvry, Pascal
    ACM COMPUTING SURVEYS, 2015, 48 (01)
  • [48] Distributed token circulation in mobile ad hoc networks
    Malpani, N
    Chen, Y
    Vaidya, NH
    Welch, JL
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2005, 4 (02) : 154 - 165
  • [49] Distributed intrusion detection for mobile ad hoc networks
    Yi Ping
    Jiang Xinghao
    Wu Yue
    Liu Ning
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2008, 19 (04) : 851 - 859
  • [50] A distributed clustering framework in mobile ad hoc networks
    Garg, W
    Shyamasundar, RK
    ICWN'04 & PCC'04, VOLS, 1 AND 2, PROCEEDINGS, 2004, : 32 - 38