Leader election algorithms for mobile ad hoc networks
We present two new leader election algorithms for mobile ad hoc networks. The algorithms
ensure that eventually each connected component of the topology graph has exactly one …
ensure that eventually each connected component of the topology graph has exactly one …
Design and analysis of a leader election algorithm for mobile ad hoc networks
Leader election is a very important problem, not only in wired networks, but in mobile, ad
hoc networks as well. Existing solutions to leader election do not handle frequent topology …
hoc networks as well. Existing solutions to leader election do not handle frequent topology …
A proxy signature-based swarm drone authentication with leader selection in 5G networks
Drones are imperative for the 5G architecture as a mobile source to expand network
coverage and support seamless services, particularly through enabling device-to-device …
coverage and support seamless services, particularly through enabling device-to-device …
Leader election algorithms for wireless ad hoc networks
S Vasudevan, B DeCleene… - Proceedings DARPA …, 2003 - ieeexplore.ieee.org
We consider the problem of secure leader election and propose two cheat-proof election
algorithms: Secure Extrema Finding Algorithm (SEFA) and Secure Preference-based Leader …
algorithms: Secure Extrema Finding Algorithm (SEFA) and Secure Preference-based Leader …
Random walk for self-stabilizing group communication in ad hoc networks
We introduce a self-stabilizing group communication system for ad hoc networks. The
system design is based on a mobile agent, collecting and distributing information, during a …
system design is based on a mobile agent, collecting and distributing information, during a …
Virtual Mobile Nodes for Mobile Ad Hoc Networks
One of the most significant challenges introduced by mobile networks is co** with the
unpredictable motion and the unreliable behavior of mobile nodes. In this paper, we define …
unpredictable motion and the unreliable behavior of mobile nodes. In this paper, we define …
An asynchronous leader election algorithm for dynamic networks
R Ingram, P Shields, JE Walter… - 2009 IEEE International …, 2009 - ieeexplore.ieee.org
An algorithm for electing a leader in an asynchronous network with dynamically changing
communication topology is presented. The algorithm ensures that, no matter what pattern of …
communication topology is presented. The algorithm ensures that, no matter what pattern of …
Nonblocking k-compare-single-swap
V Luchangco, M Moir, N Shavit - … of the fifteenth annual ACM symposium …, 2003 - dl.acm.org
The current literature o. ers two extremes of nonblocking software synchronization support
for concurrent data structure design: intricate designs of specific structures based on single …
for concurrent data structure design: intricate designs of specific structures based on single …
[PDF][PDF] A survey of dependability issues in mobile wireless networks
C Basile, MO Killijian, D Powell - 2003 - Citeseer
Mobile wireless networks can be classified in two major categories: cellular networks (also
known as infrastructured networks) and ad hoc networks. While cellular networks are …
known as infrastructured networks) and ad hoc networks. While cellular networks are …
Optimization of regular expression pattern matching circuits on FPGA
CH Lin, CT Huang, CP Jiang… - Proceedings of the …, 2006 - ieeexplore.ieee.org
Regular expressions are widely used in network intrusion detection system (NIDS) to
represent patterns of network attacks. Since traditional software-only NIDS cannot catch up …
represent patterns of network attacks. Since traditional software-only NIDS cannot catch up …