In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
—Wireless sensor networks have been used to gather data and information in many diverse application settings. The capacity of such networks remains a fundamental obstacle toward ...
Emad Felemban, Serdar Vural, Robert Murawski, Eyle...
The evolution and existence of stable trust relations have been studied extensively in the context of social theory. However, reputation systems or trust schemes have only been re...
Sameer Pai, Tanya Roosta, Stephen B. Wicker, Shank...
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
Abstract. The fact that security is a critical problem when implementing mobile ad hoc networks (MANETs) is widely acknowledged. One of the different kinds of misbehavior a node ma...
Frank Kargl, Andreas Klenk, Stefan Schlott, Michae...