Applying simulated annealing for domain generation in ad hoc networks

被引:1
|
作者
Manousakis, K [1 ]
McAuley, AJ [1 ]
Morera, R [1 ]
机构
[1] Univ Maryland, Syst Res Inst, College Pk, MD 20740 USA
来源
2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7 | 2004年
关键词
ad hoc networks; mobile networks; dynamic clustering; simulated annealing;
D O I
10.1109/ICC.2004.1313276
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
If heterogeneous ad hoc battlefield networks are to scale to hundreds or thousands of nodes, then they must be automatically split into separate network domains. Domains allow routing, QoS and other networking protocols to operate on fewer nodes. This division greatly reduces overall overhead (e.g., routing overhead with n nodes goes from O(n(2)) to O(nlogn)) and allows protocols to be tuned to more homogenous conditions [1]. Domain generation (or clustering) can be done using either local or global information. The two approaches are complementary since local domain generation reacts faster, requires less overhead, and is more robust; while global domain generation provides better overall domains. While most existing work has concentrated on local distributed solutions, this paper reports on new global domain generation techniques. In particular we concentrate on the design of good cost functions and efficient optimization algorithms. We show that simple "intuitive" cost functions do not produce good domains; rather we need complex functions with multiple parameters depending on the design goals (e.g., low overhead or low delay). Although existing optimization algorithms are too slow to be useful in a large dynamic network, we show that a modified simulated annealing algorithm, with well chosen cooling schedule, state transition probabilities and stop criteria, produces good quality domains in acceptable time.
引用
收藏
页码:3864 / 3868
页数:5
相关论文
共 50 条
  • [1] Simulated annealing algorithms for optimal packet scheduling in ad hoc networks
    Belchior, Marcos Aurelio Valenca
    Wulffert, Kyra
    Zipf, Peter
    Glesner, Manfred
    SOFTCOM 2006: INTERNATIONAL CONFERENCE ON SOFTWARE, TELECOMMUNICATIONS AND COMPUTER NETWORKS, 2006, : 142 - +
  • [2] Optimizing clustering algorithm in mobile ad hoc networks using simulated annealing
    Turgut, D
    Turgut, B
    Elmasri, R
    Le, TV
    WCNC 2003: IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE RECORD, VOLS 1-3, 2003, : 1492 - 1497
  • [3] A novel heuristic routing algorithm using simulated annealing in ad hoc networks
    Liu, LG
    Feng, GZ
    ADVANCES IN INFORMATICS, PROCEEDINGS, 2005, 3746 : 849 - 857
  • [4] A routing protocol for vehicular ad hoc networks using simulated annealing algorithm and neural networks
    Hosein Bagherlou
    Ali Ghaffari
    The Journal of Supercomputing, 2018, 74 : 2528 - 2552
  • [5] A routing protocol for vehicular ad hoc networks using simulated annealing algorithm and neural networks
    Bagherlou, Hosein
    Ghaffari, Ali
    JOURNAL OF SUPERCOMPUTING, 2018, 74 (06): : 2528 - 2552
  • [6] Simulated Annealing Based Multi-constrained QoS Routing in Mobile ad hoc Networks
    Lianggui Liu
    Guangzeng Feng
    Wireless Personal Communications, 2007, 41 : 393 - 405
  • [7] Simulated annealing based multi-constrained QoS routing in mobile ad hoc networks
    Liu, Lianggui
    Feng, Guangzeng
    WIRELESS PERSONAL COMMUNICATIONS, 2007, 41 (03) : 393 - 405
  • [8] Performance Enhancement of Dynamic Source Routing using Simulated Annealing in Mobile Ad hoc Networks
    Asokan, R.
    Chandrasekar, S.
    ICCN: 2008 INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND NETWORKING, 2008, : 171 - 175
  • [9] Applying mobile agent to intrusion response for ad hoc networks
    Yi, P
    Zhong, YP
    Zhang, SY
    COMPUTATIONAL SCIENCE - ICCS 2005, PT 2, 2005, 3515 : 593 - 600
  • [10] Applying Egocentric Betweenness Measure in Vehicular ad hoc Networks
    Akabane, Ademar T.
    Pazzi, Richard W.
    Madeira, Edmundo R. M.
    Villas, Leandro A.
    2017 IEEE 16TH INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS (NCA), 2017, : 65 - 68