Search

Graphene is enabling a plethora of applications in a wide range of fields due to its unique electrical, mechanical, and optical properties. In the realm of wireless communications, graphene shows great promise for the implementation of miniaturized and tunable antennas in the terahertz band. These unique advantages open the door to new reconfigurable antenna structures which, in turn, enable novel communication protocols at different levels of the stack. This paper explores both aspects by, first, presenting a terahertz Yagi-Uda-like antenna concept that achieves reconfiguration both in frequency and beam direction simultaneously. Then, a programmable antenna controller design is proposed to expose the reconfigurability to the PHY and MAC layers, and several examples of its applicability are given. The performance and cost of the proposed scheme is evaluated through full-wave simulations and comparative analysis, demonstrating reconfigurability at nanosecond granularity with overheads below 0.02 mm$^{2}$ and 0.2 mW., Comment: Accepted for presentation in IEEE WCNC '18

This paper presents an efficient approach for exciting a dielectric resonator antenna (DRA) in the terahertz frequencies by means of a graphene plasmonic dipole. Design and analysis are performed in two steps. First, the propagation properties of hybrid plasmonic onedimensional and two-dimensional structures are obtained by using transfer matrix theory and the finite-element method. The coupling amount between the plasmonic graphene mode and the dielectric wave mode is explored based on different parameters. These results, together with DRA and plasmonic antenna theory, are then used to design a DRA antenna that supports the $TE_{y}^{112}$ mode at 2.4 THz and achieves a gain (IEEE) of up to 7 dBi and a radiation efficiency of up 70%. This gain is 6.5 dB higher than that of the graphene dipole alone and achieved with a moderate area overhead, demonstrating the value of the proposed structure., Comment: Accepted for presentation at EuCAP 2018

Terahertz technology has made significant advances in the fields of spectroscopy, imaging and, more recently, wireless communications. In the latter, the use of this frequency band between 0.1 and 10 THz becomes extremely attractive due to the abundance of bandwidth and the potential for low area and power footprints, yet challenging given the large propagation losses and the lack of mature devices and circuits for terahertz operation. Maturity issues aside, this combination of features renders terahertz wireless communications desirable for highly integrated applications where area may be a decisive metric.

Wireless RF power transmission promises battery-less, resilient, and perpetual wireless sensor networks. Through the action of controllable Energy Transmitters (ETs) that operate at-a-distance, the sensors can be re-charged by harvesting the radiated RF energy. However, both the charging rate and effective charging range of the ETs are limited, and thus multiple ETs are required to cover large areas. While this action increases the amount of wireless energy injected into the network, there are certain areas where the RF energy combines destructively. To address this problem, we propose a duty-cycled random-phase multiple access (DRAMA). Non-intuitively, our approach relies on deliberately generating random interferences, both destructive and constructive, at the destination nodes. We demonstrate that DRAMA optimizes the power conversion efficiency, and the total amount of energy harvested. Through real-testbed experiments, we prove that our proposed scheme provides significant advantages over the current state of the art in our considered scenario, as it requires up to 70\% less input RF power to recharge the energy buffer of the sensor in the same time., Comment: IEEE GLOBECOM 2015

The Locator/ID Separation Protocol (LISP) limits the growth of the Default-Free Zone routing tables by creating a highly aggregatable and quasi-static Internet core. However, LISP pushes the forwarding state to edge routers whose timely operation relies on caching of location to identity bindings. In this paper we develop an analytical model to study the asymptotic scalability of the LISP cache. Under the assumptions that (i) long-term popularity can be modeled as a constant Generalized Zipf distribution and (ii) temporal locality is predominantly determined by long-term popularity, we find that the scalability of the LISP cache is O(1) with respect to the amount of prefixes (Internet growth) and users (growth of the LISP site). We validate the model and discuss the accuracy of our assumptions using several one-day-long packet traces.

Concerns regarding the scalability of the inter-domain routing have encouraged researchers to start elaborating a more robust Internet architecture. While consensus on the exact form of the solution is yet to be found, the need for a semantic decoupling of a node's location and identity is generally accepted as a promising way forward. However, this typically requires the use of caches that store temporal bindings between the two namespaces, to avoid hampering router packet forwarding speeds. In this article, we propose a methodology for an analytical analysis of cache performance that relies on the working-set theory. We first identify the conditions that network traffic must comply with for the theory to be applicable and then develop a model that predicts average cache miss rates relying on easily measurable traffic parameters. We validate the result by emulation, using real packet traces collected at the egress points of a campus and an academic network. To prove its versatility, we extend the model to consider cache polluting user traffic and observe that simple, low intensity attacks drastically reduce performance, whereby manufacturers should either overprovision router memory or implement more complex cache eviction policies.

WLAN devices have become a fundamental component of nowadays network deployments. However, even though traditional networking applications run mostly unchanged over wireless links, the actual interaction between these applications and the dynamics of wireless transmissions is not yet fully understood. An important example of such applications are bandwidth estimation tools. This area has become a mature research topic with well-developed results. Unfortunately recent studies have shown that the application of these results to WLAN links is not straightforward. The main reasons for this is that the assumptions taken to develop bandwidth measurements tools do not hold any longer in the presence of wireless links (e.g. non-FIFO scheduling). This paper builds from these observations and its main goal is to analyze the interaction between probe packets and WLAN transmissions in bandwidth estimation processes. The paper proposes an analytical model that better accounts for the particularities of WLAN links. The model is validated through extensive experimentation and simulation and reveals that (1) the distribution of the delay to transmit probing packets is not the same for the whole probing sequence, this biases the measurements process and (2) existing tools and techniques point at the achievable throughput rather than the available bandwidth or the capacity, as previously assumed., Comment: 14 pages, 17 figures