Molecular communication is a promising nanoscale communication paradigm that enables nanomachines to exchange information by using molecules as communication carrier. Up to now, the molecular communication channel between a transmitter nanomachine (TN) and a receiver nanomachine (RN) has been modeled as either concentration channel or timing channel. However, these channel models necessitate exact time synchronization of the nanomachines and provide a relatively low communication bandwidth. In this paper, the Molecular ARray-based COmmunication (MARCO) scheme is proposed, in which the transmission order of different molecules is used to convey molecular information without any need for time synchronization. The MARCO channel model is first theoretically derived, and the intersymbol interference and error probabilities are obtained. Based on the error probability, achievable communication rates are analytically obtained. Numerical results and performance comparisons reveal that MARCO provides significantly higher communication rate, i.e., on the scale of 100 Kbps, than the previously proposed molecular communication models without any need for synchronization. More specifically, MARCO can provide more than 250 Kbps of molecular communication rate if intersymbol time and internode distance are set to 2 μs and 2 nm, respectively.
A technology drift is currently taking place from traditional battery-powered sensor networks, which exhibit limited lifetime, to the new Energy-Harvesting Wireless Sensor Networks (EH-WSN), which open the way towards self-sustained operation. However, this emergent modality also brings up new challenges, especially due to the time-varying nature and unpredictability of ambient energy sources. Most proposals for implementing EH-WSN rely on heuristic approaches to redesign the duty-cycling mechanism at the MAC layer, with the ultimate goal of optimizing network performance while preserving self-sustained and continuous operation. In contrast to the common system-wide reduced duty cycle of battery-powered sensor networks, the duty cycle in EH-WSN is much larger and adapted to the energy harvesting rate and traffic load of each node in the network. In this paper, we focus on solar-based EH-WSN devoted to environmental monitoring. In contrast to current works, we follow an analytical approach, which results into closed-form expressions for the duty cycle and initial energy storage that guarantee self-sustained operation to any node in a solar-based EH-WSN. To center the analysis, we consider TinyOS sensor nodes, though we postulate that the essential components of the obtained formulation will contribute to further develop duty cycle adaptation schemes for TinyOS and other software platforms.
18 June 2013 in IEEE Transactions on Wireless Communications
To perform spectrum handoff, cognitive radio (CR) nodes communicating with each other need to exchange licensed user detection information, i.e., perform spectrum coordination, over a common control channel. The spectrum coordination can be fulfilled either via existing cognitive radio interface with time division or via a separate dedicated radio, i.e., a common control interface (CCI), continuously. CR nodes with CCI can instantly exchange licensed user detection information and cease frame transmission, while spectrum coordination can only be performed after the frame transmission period without CCI. Nevertheless, the impact of CCI incorporation into CR nodes in terms of common performance metrics must be thoroughly assessed to evaluate the worthiness of additional radio cost. In this paper, an analytical framework is presented to assess the impact of CCI incorporation into CR nodes for spectrum handoff. The developed framework enables analyzing potential benefits and disadvantages of employing CCI for spectrum handoff, in terms of achievable delay, energy consumption, spectrum utilization and event estimation performance. Extensive performance evaluations are presented to illustrate the impact of CCI utilization on efficiency of spectrum handoff. The network and communication regimes that would yield having CCI favorable are characterized in terms of spectrum conditions and CR parameters.
20 July 2016 in IEEE Transactions on Communications
In this paper, the comprehensive delay and performance analyses of the M-ary molecular communications with memory are presented. By taking into account any level of channel memory, the type-based and concentration-based modulation schemes are introduced and analyzed. In the type-based modulation, information symbols are encoded through different molecule types. In the concentration-based modulation, various concentration levels of one molecule type are used to encode information symbols. For both modulation schemes, the delay distributions of the molecular symbols are derived, and then, the symbol error probabilities are developed. The given distributions and the error probability expressions are validated through extensive simulation experiments. After showing that the derived expressions are valid, the performance of the modulation schemes is evaluated. The performance evaluations reveal that by properly selecting the parameters such as slot time and number of emitted molecules, the performance can be improved in both type and concentration-based molecular communication as the channel memory is increased. Furthermore, it is shown that the type-based molecular communication outperforms the concentration-based molecular communication.
Technological evolution and the current situation in the world have given rise to new emerging realities in medicine, such as point-of-care diagnosis and individualized health service without limitations such as time and place. Thanks to IoMT, new forms of contact between healthcare providers and patients have been developed using the Internet. This research aims to analyze the security of IoMT communication protocols and their limitations. For this purpose, an exhaustive review of the literature on intelligent healthcare is performed because there are many articles published in indexed journals that have addressed these issues in recent years. This review involves a bibliometric analysis of the variables Protocols, Communication, and IoMT, which bases its search on Scopus to fulfill the objective. A total of 27 documents published during the period 2015–2020 were identified as 2019, the year in which the most significant record was achieved with 11 publications; it is also established that 51.9% of the identified documents are of type Journal Article 33.3 % Conference Articles. Next, this literature is analyzed, particularly those publications emphasizing the security measures of the protocols, their vulnerabilities, and the attacks to which IoMT implementations are subjected, to make known the position of different authors regarding the subject proposed in this document. Finally, future research directions are provided to further progress in constructing theories related to the topic studied.
Time-driven sensor networks are devoted to the continuous reporting of ambient data to the base station. In many cases, these data are provided by nodes that have been deployed in a structured manner, either by selecting strategic locations or by adopting some regular sampling pattern. In either case, the resulting inter-node distances may not be small, and thus additional supporting nodes may be necessary. This suggests that the problem could be better addressed from a network planning perspective. In this sense, a particular approach is proposed and, as part of it, the paper focuses on optimizing the lifetime that can be predicted from the network topology, which is assumed to be a static data gathering tree. It is shown that this problem requires the exploration of all possible spanning trees, since the energy consumed by a node depends on its workload, which in turn depends on how this node is connected to its neighborhood. Because this is an NP-hard problem, the use of a heuristic approach is required. Then, an algorithm based on simulated annealing is proposed, which converges asymptotically to the global optimum. This algorithm is tested on different scenarios and its computational complexity is proved to be linearly dependent on the number of nodes.