Of Malicious Motes and Suspicious Sensors

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

With technological advances, the sources of available information have become more and more diverse. Recently, a new source of information has gained growing importance: sensor data. Sensors are devices sensing their environment in various ways and reporti ...

The aim of information-theoretic secrecy is to ensure that an eavesdropper who listens to the wireless transmission of a message can only collect an arbitrarily small number of information bits about this message. In contrast to cryptography, there are no ...

Rate and diversity impose a fundamental trade-off in wireless communication. High-rate space-time codes come at a cost of lower reliability (diversity), and high reliability (diversity) implies a lower rate. However, wireless networks need to support appli ...

Due to their very nature, wireless sensor networks are probably the category of wireless networks most vulnerable to “radio channel jamming”-based Denial-of-Service (DoS) attacks. An adversary can easily mask the events that the sensor network should detec ...

Channel allocation was extensively studied in the framework of cellular networks. But the emergence of new system concepts, such as cognitive radio systems, has brought this topic into the focus of research again. In this paper, we study in detail the prob ...

We present an architecture for implementing a wireless physical layer in a packet-based network simulator. We integrate this architecture in the popular ns-2 network simulator and use it to implement an impulse-radio ultra-wide band (IR-UWB) physical layer ...

n source and destination pairs randomly located in an area extending linearly with n want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power attenuation of r^{-alpha} and random phase cha ...

The capacity scaling of extended two-dimensional wireless networks is known in the high attenuation regime, i.e. when the power path loss exponent alpha is greater than 4. This has been accomplished by deriving information theoretic upper bounds for this r ...

Vehicular networks are very likely to be deployed in the coming years and thus become the most relevant form of mobile ad hoc networks. In this paper, we address the security of these networks. We provide a detailed threat analysis and devise an appropriat ...

So far, the problem of positioning in wireless networks has been studied mainly in a nonadversarial setting. In this paper, we analyze the resistance of positioning techniques to position and distance spoofing attacks. We propose a mechanism for secure pos ...

We study analytically and experimentally the throughput of the packetized time-varying discrete erasure channel with feedback, which closely captures the behavior of many practical physical layers. We observe that the channel variability at different time ...

In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair ...

We derive an information-theoretic upper bound on the rate per communication pair in a large ad hoc wireless network. We show that under minimal conditions on the attenuation due to the environment and for networks with a constant density of users, this ra ...

Of Malicious Motes and Suspicious Sensors

Chat with Graph Search

A Publish/Subscribe Approach to Processing Continuous Queries over Sensor Streams

Information-theoretic secrecy for wireless networks

Diversity Embedded Space-Time Codes

Wormhole-Based Anti-Jamming Techniques in Sensor Networks

Non-cooperative Multi-radio Channel Allocation in Wireless Networks

An Architecture for Wireless Simulation in NS-2 Applied to Impulse-Radio Ultra-Wide Band Networks

Exact Capacity Scaling of Extended Wireless Networks

Scaling Laws for One and Two-Dimensional Random Wireless Networks in the Low Attenuation Regime

Securing Vehicular Ad Hoc Networks

Secure Positioning in Wireless Networks

Impacts of Channel Variability on Link-Level Throughput in Wireless Networks

On conditions for constant throughput in wireless networks

Information-Theoretic Upper Bounds on the Capacity of Large Extended Ad Hoc Wireless Networks