Cognitive radio (CR) is a promising technology that can alleviate the spectrum shortage problem by enabling unlicensed users equipped with CRs to coexist with incumbent users in licensed spectrum bands while causing no interference to incumbent communications. Spectrum sensing is one of the essential mechanisms of CRs and its operational aspects are being investigated actively. However, the security aspects of spectrum sensing have garnered little attention. In this paper, we identify a threat to spectrum sensing, which we call the primary user emulation (PUE) attack. In this attack, an adversary's CR transmits signals whose characteristics emulate those of incumbent signals. The highly flexible, software-based air interface of CRs makes such an attack possible. Our investigation shows that a PUE attack can severely interfere with the spectrum sensing process and significantly reduce the channel resources available to legitimate unlicensed users. To counter this threat, we propose a transmitter verification scheme, called LocDef (localization-based defense), which verifies whether a given signal is that of an incumbent transmitter by estimating its location and observing its signal characteristics. To estimate the location of the signal transmitter, LocDef employs a non-interactive localization scheme. Our security analysis and simulation results suggest that LocDef is effective in identifying PUE attacks under certain conditions.

Defense against Primary User Emulation Attacks in Cognitive Radio Networks

We characterize the fundamental limits of localization using signal strength in indoor environments. Signal strength approaches are attractive because they are widely applicable to wireless sensor networks and do not require additional localization hardware. We show that although a broad spectrum of algorithms can trade accuracy for precision, none has a significant advantage in localization performance. We found that using commodity 802.11 technology over a range of algorithms, approaches and environments, one can expect a median localization error of 10 ft and 97th percentile of 30 ft. We present strong evidence that these limitations are fundamental and that they are unlikely to transcend without a fundamentally more complex environmental models or additional localization infrastructure.

/pdf/the-limits-of-localization-using-signal-strength-a-50ohjf0d3k.pdf

The limits of localization using signal strength: a comparative study

Wireless positioning has attracted much research attention and has become increasingly important in recent years. Wireless positioning has been found very useful for other applications besides E911 service, ranging from vehicle navigation and network optimization to resource management and automated billing. Although many positioning devices and services are currently available, it is necessary to develop an integrated and seamless positioning platform to provide a uniform solution for different network configurations. This article surveys the state-of-the-art positioning designs, focusing specifically on signal processing techniques in network-aided positioning. It serves as a tutorial for researchers and engineers interested in this rapidly growing field. It also provides new directions for future research for those who have been working in this field for many years.

Signal processing techniques in network-aided positioning: a survey of state-of-the-art positioning designs

We provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly.

/pdf/rigidity-computation-and-randomization-in-network-1q9ik92020.pdf

Rigidity, computation, and randomization in network localization

For many sensor network applications such as military surveillance, it is necessary to provide full sensing coverage to a security-sensitive area while at the same time minimizing energy consumption and extending system lifetime by leveraging the redundant deployment of sensor nodes. It is also preferable for the sensor network to provide differentiated surveillance service for various target areas with different degrees of security requirements. In this paper, we propose a differentiated surveillance service for sensor networks based on an adaptable energy-efficient sensing coverage protocol. In the protocol, each node is able to dynamically decide a schedule for itself to guarantee a certain degree of coverage (DOC) with average energy consumption inversely proportional to the node density. Several optimizations and extensions are proposed to provide even better performance. Simulation shows that our protocol accomplishes differentiated surveillance with low energy consumption. It outperforms other state-of-the-art schemes by as much as 50% reduction in energy consumption and as much as 130% increase in the half-life of the network.

Chia-mao Huang

Papers

Range-free localization schemes in large scale sensor network