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 条
  • [21] Applying tabu search and simulated annealing to the optimal design of sewer networks
    Yeh, Shung-Fu
    Chu, Chien-Wei
    Chang, Yao-Jen
    Lin, Min-Der
    ENGINEERING OPTIMIZATION, 2011, 43 (02) : 159 - 174
  • [22] Ad hoc networks: not an ad hoc field anymore
    Ephremides, A
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2002, 2 (05): : 441 - 448
  • [23] On the Use of OFDMA for Next Generation Vehicular Ad Hoc Networks
    Bazzi, Alessandro
    Masini, Barbara M.
    Zanella, Alberto
    Pasolini, Gianni
    2013 IEEE 24TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2013, : 2223 - 2228
  • [24] Design of the Next Generation Cognitive Mobile Ad Hoc Networks
    Ali, Amjad
    Wang Huiqiang
    Chen Xiaoming
    PIAGENG 2013: IMAGE PROCESSING AND PHOTONICS FOR AGRICULTURAL ENGINEERING, 2013, 8761
  • [25] An automated policy generation system for mobile ad hoc networks
    Chiang, Cho-Yu J.
    Levin, Gary
    Gottlieb, Yitzchak M.
    Chadha, Ritu
    Li, Shihwei
    Poylisher, Alex
    Newman, Scott
    Lo, Richard
    Izzo, William
    2007 IEEE MILITARY COMMUNICATIONS CONFERENCE, VOLS 1-8, 2007, : 146 - +
  • [26] Ad hoc networks
    Wu, J
    Stojmenovic, I
    COMPUTER, 2004, 37 (02) : 29 - 31
  • [27] Applying trust enhancements to reactive routing protocols in mobile ad hoc networks
    Xia, Hui
    Yu, Jia
    Pan, Zhen-kuan
    Cheng, Xiang-guo
    Sha, Edwin H. -M.
    WIRELESS NETWORKS, 2016, 22 (07) : 2239 - 2257
  • [28] Applying emergence to the design of routing protocols for the security of wireless ad hoc networks
    Pavlosoglou, I
    Leeson, M
    Green, R
    FIRST INTERNATIONAL CONFERENCE ON SECURITY AND PRIVACY FOR EMERGING AREAS IN COMMUNICATIONS NETWORKS, PROCEEDINGS, 2005, : 303 - 314
  • [29] Applying trust enhancements to reactive routing protocols in mobile ad hoc networks
    Hui Xia
    Jia Yu
    Zhen-kuan Pan
    Xiang-guo Cheng
    Edwin H. -M. Sha
    Wireless Networks, 2016, 22 : 2239 - 2257
  • [30] MOTION: An Application of ASMETA to Mobile Ad-hoc NETworks Domain
    Bevilacqua, Gianluca Gennaro
    Bianchi, Alessandro
    ECSA 2018: PROCEEDINGS OF THE 12TH EUROPEAN CONFERENCE ON SOFTWARE ARCHITECTURE: COMPANION PROCEEDINGS, 2018,