Defeating jamming with the power of silence: a game-theoretic analysis

The timing channel is a logical communication channel in which information is encoded in the timing between events. Recently, the use of the timing channel has been proposed as a countermeasure to reactive jamming attacks performed by an energy-constrained malicious node. In fact, whilst a jammer is able to disrupt the information contained in the attacked packets, timing information cannot be jammed and, therefore, timing channels can be exploited to deliver information to the receiver even on a jammed channel. Since the nodes under attack and the jammer have conflicting interests, their interactions can be modeled by means of game theory. Accordingly, in this paper a game-theoretic model of the interactions between nodes exploiting the timing channel to achieve resilience to jamming attacks and a jammer is derived and analyzed. More specifically, the Nash equilibrium is studied in the terms of existence, uniqueness, and convergence under best response dynamics. Furthermore, the case in which the communication nodes set their strategy and the jammer reacts accordingly is modeled and analyzed as a Stackelberg game, by considering both perfect and imperfect knowledge of the jammer's utility function. Extensive numerical results are presented, showing the impact of network parameters on the system performance.Comment: Anti-jamming, Timing Channel, Game-Theoretic Models, Nash Equilibriu

orchestrating softwarized networks with a marketplace approach

Abstract In the last years, network softwarization is gaining increasing popularity since it allows to achieve dinamicity and flexibility in network management, stimulating a lot of interest by both academia and industry. Cloud computing paradigm together with the new networking paradigms of Software Defined Networking (SDN) and Network Function Virtualization (NFV) are supporting this evolution, by providing network services as single Virtual Network Functions (VNFs) or chains of them. The main problem is scalability of both infrastructure and management. In fact, in order to support the SDN/NFV paradigm, the Telco Operator should deploy huge data centers, which have to be geographically distributed to guarantee low latencies to time-constrained flows, and implement complex orchestration policies. To this purpose, this paper proposes to extend the SDN/NFV framework with a marketplace where Telco Operator customers behave as third-party sellers with their hardware and software resources providing VNF as a service (VNFaaS), so helping the Telco Operator in providing network services in an efficient and scalable way

Trade-Offs between Energy Saving and Reliability in Low Duty Cycle Wireless Sensor Networks Using a Packet Splitting Forwarding Technique

One of the challenging topics and design constraints in Wireless Sensor Networks (WSNs) is the reduction of energy consumption because, in most application scenarios, replacement of power resources in sensor devices might be unfeasible. In order to minimize the power consumption, some nodes can be put to sleep during idle times and wake up only when needed. Although it seems the best way to limit the consumption of energy, other performance parameters such as network reliability have to be considered. In a recent paper, we introduced a new forwarding algorithm for WSNs based on a simple splitting procedure able to increase the network lifetime. The forwarding technique is based on the Chinese Remainder Theorem and exhibits very good results in terms of energy efficiency and complexity. In this paper, we intend to investigate a trade-off between energy efficiency and reliability of the proposed forwarding scheme when duty-cycling techniques are considered too

A Learning Approach for Low-Complexity Optimization of Energy Efficiency in Multi-Carrier Wireless Networks

This paper proposes computationally efficient algorithms to maximize the energy efficiency in multi-carrier wireless interference networks, by a suitable allocation of the system radio resources, namely the transmit powers and subcarrier assignment. The problem is formulated as the maximization of the system Global Energy-Efficiency subject to both maximum power and minimum rate constraints. This leads to a challenging non-convex fractional problem, which is tackled through an interplay of fractional programming, learning, and game theory. The proposed algorithmic framework is provably convergent and has a complexity linear in both the number of users and subcarriers, whereas other available solutions can only guarantee a polynomial complexity in the number of users and subcarriers. Numerical results show that the proposed method performs similarly as other, more complex, algorithms

Analysis of Location Privacy/Energy Eciency Tradeos in Wireless Sensor Networks

Abstract. In this paper an analytical framework is proposed for the evaluation of the tradeos between location privacy and energy eciency in wireless sensor networks. We assume that random routing is utilized to improve privacy. However, this involves an increase in the average path length and thus an increase in energy consumption. The privacy loss is measured using information theory concepts; indeed, it is calculated as the dierence between the uncertainties on the target location before and after the attack. To evaluate both privacy loss and average energy consumption the behavior of the routing protocol is modeled through a Markov chain in which states represent the nodes traversed by a packet in its way to the sink. The analytical framework can be used by designers to evaluate the most appropriate setting of the random routing parameters depending on the privacy and/or energy eciency requirements

SDR-LoRa, an open-source, full-fledged implementation of LoRa on Software-Defined-Radios: Design and potential exploitation

In this paper, we present SDR-LoRa, an open-source, full-fledged Software Defined Radio (SDR) implementation of a LoRa transceiver. First, we conduct a thorough analysis of the LoRa physical layer (PHY) functionalities, encompassing processes such as packet modulation, demodulation, and preamble detection. Then, we leverage on this analysis to create a pioneering SDR-based LoRa PHY implementation. Accordingly, we thoroughly describe all the implementation details. Moreover, we illustrate how SDR-LoRa can help boost research on the LoRa protocol by presenting three exemplary key applications that can be built on top of our implementation, namely fine-grained localization, interference cancellation, and enhanced link reliability. To validate SDR-LoRa and its applications, we test it on two different platforms: (i) a physical setup involving USRP radios and off-the-shelf commercial devices, and (ii) the Colosseum wireless channel emulator. Our experimental findings reveal that (i) SDR-LoRa performs comparably to conventional commercial LoRa systems, and (ii) all the aforementioned applications can be successfully implemented on top of SDR-LoRa with remarkable results. The complete details of the SDR-LoRa implementation code have been publicly shared online, together with a plug-and-play Colosseum container