Leader election in ad hoc radio networks: A keen ear helps
نویسندگان
چکیده
منابع مشابه
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
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 ...
متن کاملAdversary Immune Leader Election in ad hoc Radio Networks
Recently, efficient leader election algorithms for ad hoc radio networks with low time complexity and energy cost have been designed even for the no-collision detection, (no-CD), model. However, these algorithms are fragile in the sense that an adversary may disturb communication at low energy cost so that more than one station may regard itself as a leader. This is a severe fault since the lea...
متن کاملRandomized Leader Election Protocols Ad-hoc Networks
Unlike the well-studied cellular networks that assume the existence of robust infrastructure, Ad-hoc Networks (AHN, for short) are rapidly deplo able, self-organizing, and do not rely on an existing infrastructure. These networks find applications to disaster-relief, search-and-rescue, law-enforcement, and collaborative computing, among others. The main contribution of this work is to propose a...
متن کاملA Hierarchical Leader Election Protocol for Mobile Ad Hoc Networks
Leader Election is an important problem in mobile ad hoc networks and in distributed computing systems. In this study, we propose a hierarchical, cluster based protocol to elect a leader in a mobile ad hoc network. The initial phase of the protocol employs a clustering algorithm to group nodes of the network after which a leader for a cluster(clusterhead) is elected. The second phase is perform...
متن کاملTop K-leader election in mobile ad hoc networks
Many applications in mobile ad hoc networks (MANETs) require multiple nodes to act as leaders. Given the resource constraints of mobile nodes, it is desirable to elect resourcerich nodes with higher energy or computational capabilities as leaders. In this paper, we propose a novel distributed algorithm to elect top-K weighted leaders in MANETs where weight indicates available node resources. Fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2013
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2013.04.003