Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious Interference <s> No No <s> Many wireless standards and protocols today, such as WLAN and Bluetooth, operate on similar frequency bands. While this permits an efficient usage of the limited medium capacity, transmissions of nodes running different protocols can interfere. This paper studies how to design node discovery algorithms for wireless multichannel networks which are robust against contending protocols on the shared medium. We pursue a conservative approach and consider a Byzantine adversary who prevents the communication of our protocol on t channels in a worst-case fashion. Our model also captures disruptions controlled by an adversarial jammer . This paper presents algorithms for scenarios where t is not known. The analytical findings are complemented by simulations providing evidence that the proposed protocols perform well in practice. <s> BIB001 </s> Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious Interference <s> No No <s> The recent increasing interest in ad hoc networks has motivated the study and development of interference models capable of capturing the intrinsic characteristics of this kind of network, such as the lack of a central coordination and the consequent distributed nature of some of the network functions (e.g., medium access control and routing protocols). As a consequence, a myriad of interference models for ad hoc networks can be found in the literature, that describe the effects of interference at different layers and with different levels of detail. Some of these models describe interference as a random process whose statistics depend mainly on physical layer parameters, and are better suited for the analysis of issues related to the physical layer. Other models focus on the effects of interference at higher layers, and are more appropriate when the analysis of network-related issues is of interest. This paper presents a comprehensive survey of interference models for wireless ad hoc networks, emphasizing their domains of application, illustrated with examples. The interference models are presented in this survey from the perspective of the radio capture phenomenon, resulting in a unified view of interference models, which may be helpful when selecting the appropriate model for a given purpose. <s> BIB002
Addresses the problem of node discovery in a multi-channel network when t < C channels can be jammed and t is unknown. Experimental results show promising behavior. Analysis uses the notion of a competitive ratio, but overall communication and listening costs are not reported. in order to ease the analysis; however, it also raises questions about the accuracy of the results. There is a growing literature on the various analytical models of wireless interference and we refer the reader to the survey by Cardieri BIB002 . For example, the popular signal-to-interference-plus-noise (SINR) model incorporates a number of factors that effect the message reception and this model tends to align well with reality. Consequently, it would be of interest to derive results on adversarial interference under such a model. Finally, to the best of our knowledge, with the exception of the work by Meier BIB001 , the protocols we have surveyed have not been implemented and tested either with a simulator or with a testbed. Such an endeavor is likely to be arduous and might be viewed as pedestrian. However, on the contrary, the research community would likely benefit from a validation (or invalidation) of the adversarial models and corresponding algorithms surveyed here. Without such an evaluation, it may become increasingly difficult to justify algorithmic advances, regardless of their mathematical elegance.