Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps

被引:0
|
作者
Kowalski, Dariusz R. [1 ]
Pelc, Andrzej [2 ]
机构
[1] Univ Liverpool, Dept Comp Sci, Liverpool L69 3BX, Merseyside, England
[2] Univ Quebec, Dept Informat, Hull, PQ J8X 3X7, Canada
基金
英国工程与自然科学研究理事会; 加拿大自然科学与工程研究理事会;
关键词
BROADCAST; TIME; PROTOCOLS; CHANNELS;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We address the fundamental distributed problem of leader election in ad hoc radio networks modeled as undirected graphs. Nodes are stations having distinct integer labels, and each node knows only its own label and a polynomial upper bound on all labels. A signal from a transmitting node reaches all neighbors. What distinguishes radio networks from message-passing networks is that a message is received Successfully by a node, if and only if, exactly one of its neighbors transmits in this round. If two neighbors of a node transmit simultaneously ously in a given round, none of the messages is heard by the receiving node. in this case we say that a collision occurred at this node. An important capability of nodes of a radio network is collision detection: the ability of nodes to distinguish a collision from the background noise occurring when no neighbor transmits. (This ability is the "keen ear" of the nodes.) Can collision detection speed Lip leader election in arbitrary radio networks? We give I positive answer to this question. More precisely, Our main result is a deterministic leader election algorithm working in time O(n) in all n-node networks, if collision detection is available, while it is known that deterministic leader election requires time Omega(n log n), even for complete networks, if there is no collision detection. This is the first computational task whose execution for arbitrary radio networks is shown to be faster with collision detection than without it.
引用
收藏
页码:521 / +
页数:3
相关论文
共 50 条
  • [1] Leader election in ad hoc radio networks: A keen ear helps
    Kowalski, Dariusz R.
    Pelc, Andrzej
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2013, 79 (07) : 1164 - 1180
  • [2] Adversary immune leader election in ad hoc radio networks
    Kutylowski, M
    Rutkowski, W
    [J]. ALGORITHMS - ESA 2003, PROCEEDINGS, 2003, 2832 : 397 - 408
  • [3] An Enhanced Leader Election for Cognitive Radio Ad-Hoc Networks
    Kumar, Pranav
    Murmu, Mahendra Kumar
    [J]. 2015 1ST INTERNATIONAL CONFERENCE ON NEXT GENERATION COMPUTING TECHNOLOGIES (NGCT), 2015, : 192 - 197
  • [4] Leader Election Algorithm for Distributed Ad-Hoc Cognitive Radio Networks
    Olabiyi, O.
    Annamalai, A.
    Qian, L.
    [J]. 2012 IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE (CCNC), 2012, : 859 - 863
  • [5] Design Issues of Leader Election Protocol in Cognitive Radio Ad-Hoc Networks
    Kumar, Pranav
    Murmu, Mahendra Kumar
    [J]. 2015 FIFTH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS AND NETWORK TECHNOLOGIES (CSNT2015), 2015, : 169 - 172
  • [6] Asynchronous leader election in mobile ad hoc networks
    Masum, Salahuddin Mohammad
    Ali, Amin Ahsan
    Bhuiyan, Mohammad Touhid-youl Islam
    [J]. 20TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS, VOL 2, PROCEEDINGS, 2006, : 827 - 831
  • [7] Leader election algorithms for wireless ad hoc networks
    Vasudevan, S
    DeCleene, B
    Immerman, N
    Kurose, J
    Towsley, D
    [J]. DARPA INFORMATION SURVIVABILITY CONFERENCE AND EXPOSITION, VOL I, PROCEEDINGS, 2003, : 261 - 272
  • [8] A hierarchical Leader Election protocol for mobile ad hoc networks
    Dagdeviren, Orhan
    Erciyes, Kayhan
    [J]. COMPUTATIONAL SCIENCE - ICCS 2008, PT 1, 2008, 5101 : 509 - +
  • [9] An efficient leader election algorithm for mobile ad hoc networks
    Parvathipuram, P
    Kumar, V
    Yang, GC
    [J]. DISTRIBUTED COMPUTING AND INTERNET TECHNOLOGY, PROCEEDINGS, 2004, 3347 : 32 - 41
  • [10] Leader Election Based on Centrality and Connectivity Measurements in Ad Hoc Networks
    Wu, Mary
    Kim, Chonggun
    Jung, Jason J.
    [J]. AGENT AND MULTI-AGENT SYSTEMS: TECHNOLOGIES AND APPLICATIONS, PT I, PROCEEDINGS, 2010, 6070 : 401 - 410