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 …

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 …

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 …

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 …

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 …

One of the most significant challenges introduced by mobile networks is coping with the
unpredictable motion and the unreliable behavior of mobile nodes. In this paper, we define …

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 …

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 …

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 …

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 …