The last decade has witnessed the ever-increasing deployment of Wi-Fi networks and the explosion of Bluetooth-based applications. As a result, the coexistence of Bluetooth piconets with highly-dense Wi-Fi networks is a common phenomenon currently. Unlike Wi-Fi that conducts carrier sensing before channel access, Bluetooth adopts frequency hopping based on a predefined hop sequence, which inevitably incurs considerable cross-technology interference to Wi-Fi. While the Adaptive Frequency Hopping technique is standardized for interference reduction, it does not perform well in current practice where densely-deployed Wi-Fi networks commonly cover the whole 2.4 GHz unlicensed spectrum. In this context, this article presents BuSAR, a novel approach to account for the coexistence problem between Bluetooth piconets and dense Wi-Fi networks. BuSAR embodies the first work to aim at mitigating the cross-technology interference between Bluetooth and highly-dense Wi-Fi networks in a distributed manner. At the heart of BuSAR lies a subtle technique called Bluetooth slot availability randomization, which exploits the redundancy of erroneous Bluetooth packets for better Bluetooth/Wi-Fi coexistence. With BuSAR adopted, multiple Bluetooth piconets are guaranteed to operate independently and only a lightweight algorithm is needed to be implemented at each Bluetooth device. Both theoretical analysis and experimental results validate the feasibility and superiority of BuSAR.

With the wide adoption of TLS, malware's use of TLS is also growing fast. However, fine-grained feature selection in existing approaches is too burdensome. To this end, we propose to visualize TLS-encrypted flow metadata as an image for better malware traffic analysis and classification. We discuss its feasibility and show some preliminary classification results with high accuracy.

Radio-frequency identification (RFID) system, successfully adopted in many industrial applications, suffers from security issues due to the inherent weakness of wireless communication, such as eavesdropping, replay attack, impersonation attack, and traceability issues. A lot of research efforts based on cryptographic primitives have been conducted in a decade, however, most of the existing security protocols depending on cryptosystems are not feasible to be applied due to the minimalist design of passive tags. A lightweight cryptographic authentication is one of the practical solutions, but it has traceability issues from physical layer information. The other approach is to use the properties of the physical layer of RFID systems. However, since the physical-layer characteristics cannot be intentionally updated, they are vulnerable to situations where an adversary actively obtains authentic data for traceability attacks or replay attacks. Therefore, to resist the security threats, we propose Tagora, a cross-layer authentication protocol, which is the first integration work of two-layer approaches that harness the unpredictable properties of tag's collision responses at both the physical and application layers. Our protocol design is composed of a collision recovery algorithm with a random offset scheme and phase encryption in the physical layer, and authentication process based on a challenge-response mechanism in the application layer. We evaluate Tagora in terms of the untraceability and reliability, and also provide security analysis on how Tagora can defend against plausible attacks while meeting security requirements.

The prosperity of IEEE 802.11-based Wi-Fi networks aggravates cross-technology interference to IEEE 802.15.4-enabled ZigBee networks widely deployed to enable various Internet-of-Things applications. To make ZigBee communication reliable and robust even in a dense Wi-Fi environment, taming Wi-Fi interference in ZigBee networks especially from the perspective of physical layer is of paramount importance. In this context, this work takes aim to design a novel Wi-Fi interference-resilient ZigBee decoder called PolarScout, which separates collided ZigBee signal samples out of Wi-Fi interference to bootstrap ZigBee data decoding. Unlike several existing solutions which need clear signal preamble, tremendous signal strength difference between ZigBee and Wi-Fi, and Wi-Fi interference recognition in prior to ZigBee decoding, PolarScout aims at direct ZigBee decoding in a more generic and challenging case where Wi-Fi interference features a wide range of power levels and arises within a ZigBee packet at an arbitrary position. At the heart of PolarScout lies a subtle shell-shaping technique which harnesses a customized sample sequence to smooth the shell of corrupted signal samples. PolarScout then refers to the resulting shell to recover each contaminated ZigBee sample. Experimental results validate the superiority of PolarScout and its resilience to a wide range of Wi-Fi interference types.

Cloud computing enables larger classes of application service providers to distribute their services to world-wide users in multiple regions without their own private data centers. Heterogeneity and resource limitation of geo-graphically distributed cloud data centers impose application service providers to have incentives to optimize their computing resource usage while guaranteeing some level of quality of service. Recent studies proposed various techniques for optimization of computing resource usage from cloud users (or application service providers) perspective with little consideration of competition. In addition, optimization efforts of application service providers motivate cloud service providers owning multiple geo-distributed clouds to decide their computing resource prices considering their efforts. In this context, we formulate this problem for cloud service providers as a game of resource pricing in geo-distributed clouds. One of the main challenges in this problem is how to model the best responses of application service providers, given resource price information of clouds in non-overlapped regions. We propose a novel concave game to describe the quantity competition among application service providers reducing payment while guaranteeing fair service delay to end users. Furthermore, we optimize the prices of computing resources to converge to the equilibrium. In addition, we show several characteristics of the equilibrium point and discuss their implications to design computing resource markets for geo-distributed clouds.

ABSTRACT In wireless communications research, a number of literature assume that every node knows all of its neighbor nodes. To this end, neighbor discovery research has been conducted, but it still has room for improvement in terms of discovery delay. Furthermore, prior work has overlooked energy efficiency, which is considered as the critical factor in wireless devices or appliances. For better performance with respect to the discovery delay and energy efficiency, we proposed a novel p‐persistent‐based neighbor discovery protocol and devised a simple and light algorithm estimating the number of neighbor nodes to support the proposed protocol. Our protocol requires a lower delay and a smaller number of messages for the discovery process than the existing protocols. For extensive performance evaluation, we adopted extra comparison targets from other research areas within the same context. Copyright © 2011 John Wiley & Sons, Ltd.

Topology control is to determine the transmission power of each node so as to maintain network connectivity and consume the minimum transmission power. Cooperative Communication (CC) is a new technology that allows multiple nodes to simultaneously transmit the same data. It can save transmission power and extend transmission coverage. However, prior research work on topology control considers CC only in the aspect of energy saving, not that of coverage extension. We observe that CC can bridge (link) disconnected networks and therefore identify the challenges in the development of a centralized topology control scheme, named shape Cooperative Bridges, which reduces transmission power of nodes as well as increases network connectivity. We propose three algorithms that select energy efficient neighbor nodes, which assist a source node to communicate with a destination node: an optimal method and two greedy heuristics. In addition, we consider a distributed version of the proposed topology control scheme. Our findings are substantiated by an extensive simulation study, through which we show that the shape Cooperative Bridges scheme substantially increases the connectivity with tolerable increase of transmission power compared to other existing topology control schemes, which means that it outperforms in terms of a connectivity-to-power ratio.

Cooperative Communication (CC) is a technology that allows multiple nodes to simultaneously transmit the same data. It can save power and extend transmission coverage. However, prior research work on topology control considers CC only in the aspect of energy saving, not that of coverage extension. We identify the challenges in the development of a centralized topology control scheme, named Cooperative Bridges, which reduces transmission power of nodes as well as increases network connectivity. We observe that CC can bridge (link) disconnected networks. We propose two algorithms that select the most energy efficient neighbor nodes, which assist a source to communicate with a destination node; an optimal method and a greedy heuristic. In addition we consider a distributed version of the proposed topology control scheme. Our findings are substantiated by an extensive simulation study, through which we show that the Cooperative Bridges scheme substantially increases the connectivity while consuming a similar amount of transmission power compared to other existing topology control schemes.