Recent developments in nanotechnology herald nanometer-sized devices expected to bring light to a number of groundbreaking applications. Communication with and among nanodevices will be needed for unlocking the full potential of such applications. As the traditional communication approaches cannot be directly applied in nanocommunication, several alternative paradigms have emerged. Among them, electromagnetic nanocommunication in the terahertz (THz) frequency band is particularly promising, mainly due to the breakthrough of novel materials such as graphene. For this reason, numerous research efforts are nowadays targeting THz band nanocommunication and consequently nanonetworking. As it is expected that these trends will continue in the future, we see it beneficial to summarize the current status in these research domains. In this survey, we therefore aim to provide an overview of the current THz nanocommunication and nanonetworking research. Specifically, we discuss the applications envisioned to be supported by nanonetworks operating in the THz band, together with the requirements such applications pose on the underlying nanonetworks. Subsequently, we provide an overview of the current contributions on the different layers of the protocol stack, as well as the available channel models and experimentation tools. Finally, we identify a number of open research challenges and outline several future research directions.
We propose graph representations for reconfigurable photonic mesh circuits. Waveguide mesh circuits are abstracted into a graph to highlight the connectivity and topology. We model the optical ports as graph nodes. Performance metrics for each connection are incorporated into the edge attributes in categories such as propagation loss, crosstalk penalty, power consumption, phase accumulation and so on. We use three types of graph representations for tunable couplers to model the flow of light and create a circuit graph representation. The representation should respect the physics of waveguide circuits (e.g. directional flow of light). Of the three types, the directed graph with eight artificial nodes performs best for solving light distributions with feedback paths. This graph representation is demonstrated in four distribution cases: a single pair input-output, multi-pair inputs and outputs without collisions, a single input to multiple outputs (distribution), and multiple distributions without collisions. The programming tolerance against malfunctioning tunable elements is also demonstrated. With this circuit representation, we can reduce all these distribution cases to different graph problems and leverage a wealth of existing algorithms developed in graph theory to program the photonic mesh. Thus we provide a systematical strategy to design and program complex reconfigurable photonic circuits, especially in photonic meshes with feedback paths.
The paper presents a topology-agnostic greedy protocol for network-on-chip routing. The proposed routing algorithm can tolerate any number of permanent faults, and is proven to be deadlock-free. We introduce a specialized variant of the algorithm, which is optimized for 2D mesh networks, both flat and wireless. The adaptiveness and minimality of several variants this algorithm are analyzed through graph-based simulations.