A Transmission Scheduling Protocol Using Radios With Multiple Antennas For Ad Hoc Networks

Distributed medium access control (MAC) protocols are essential due to the flexible and self-organizing nature of ad hoc networks. Scheduling protocols have been popular choices, because they guarantee access to the channel for each transceiver. The disadvantage with these scheduled approaches is that they are inefficient when the network has low traffic loads. Consider a time-division multiple access (TDMA) schedule where nodes are assigned time slots in which they are allowed to transmit. If a particular node is scheduled but has no traffic to forward, then the time slot is wasted. Because the channel has been reserved for use by that particular node, other nodes in the network with traffic to forward are unable to do so. We investigate strategies to improve the performance of TDMA scheduling protocols for ad hoc networks using radios with multiple antennas. Multiple antennas at each radio enables the use of a physical layer technique known as multiple-input multiple-output (MIMO) that leverages the spatial dimension. The antennas allow for both spatial multiplexing and interference cancellation. Spatial multiplexing allows for multiple parallel data streams to be transmitted at the same time. Interference cancellation is used to selectively pick neighbors that do not receive interference from a transmission. Our protocol uses both techniques to allow unscheduled nodes to transmit if the slot is not fully utilized. Using a custom simulation, we show that Lyui\u27s scheduling protocol can be extended to support MIMO and time slot sharing. Our new protocol provides performance improvements with regards to end-to-end completion, throughput, and average delay

A Cross-Layer Design for Reducing Packet Loss Caused by Fading in a Mobile Ad Hoc Network

We investigate methods for reducing packet loss in mobile ad hoc networks (MANETs) caused by the presence of fading. The modeled system employs an adaptive transmission protocol. This protocol works well when link performance is consistent and predictable, but system performance deteriorates when link quality begins to vary. A log-normal block fad-ing model is implemented to test system performance with time-varying link performance. We propose two different methods for addressing the effects of fading. First we propose the transmission success probability (TSP) link-rate control protocol, which uses link per-formance measures to modify the existing adaptive transmission protocol and reduce the number of packets lost due to fading. Secondly we show that modifying the routing metric can improve system performance. We show that a cross-layer design for the TSP protocols and routing metrics that jointly considers both link and network performance results in better system performance compared to selecting each protocol separately

Performance Analysis and Design of Mobile Ad-Hoc Networks

We focus on the performance analysis and design of a wireless ad-hoc network using a virtual-circuit or reservation based medium access layer. In a reservation based MAC network, source nodes reserve a session's link capacity end-to-end over the entire path before sending traffic over the established path. An example of a generic reservation based MAC protocol is Unifying Slot Assignment Protocol (USAP). Any reservation based medium access protocol (including USAP) uses a simple set of rules to determine the cells or timeslots available at a node to reserve link capacity along the path to the next node. Given inputs of node locations, traffic pattern between nodes and link propagation matrices, we develop models to estimate blocking probability and throughput for reservation based wireless ad-hoc networks. These models are based on extending reduced load loss network models for a wireless network. For generic USAP with multiple frequency channels, the key effect of multiuser interference on a link is modeled via reduced available link capacity where the effects of transmissions and receptions in the link neighborhood are modeled using USAP reservation rules. We compare our results with simulation and obtain good results using our extended reduced load loss network models but with reduced available link capacity distribution obtained by simulation. For the case of generic USAP using a single frequency channel, we develop models for unicast traffic using reduced load loss network models but with the sharing of the wireless medium between a node and its neighbors modeled by considering cliques of neighboring interfering links around a particular link. We compare results of this model with simulation and show good match. We also develop models to calculate source-destination throughput for the reservation MAC as used in the Joint Tactical Radio System to support both unicast and multicast traffic. These models are based on extending reduced load loss network models for wireless multicast traffic with the sharing of the wireless medium between a node and its (upto 2 hop) neighbors modeled by considering cliques of interfering nodes around a particular node. We compare results of this model with simulation and show good match with simulation. Once we have developed models to estimate throughput and blocking probabilities, we use these models to optimize total network throughput. In order to optimize total throughput, we compute throughput sensitivities of the reduced load loss network model using an implied cost formulation and use these sensitivities to choose the routing probabilities among multiple paths so that total network throughput is maximized. In any network scenario, MANETs can get disconnected into clusters. As part of the MANET design problem, we look at the problem of establishing network connectivity and satisfying required traffic capacity between disconnected clusters by placing a minimum number of advantaged high flying Aerial Platforms (APs) as relay nodes at appropriate places. We also extend the connectivity solution in order to make the network single AP survivable. The problem of providing both connectivity and required capacity between disconnected ground clusters (which contain nodes that can communicate directly with each other) is formulated as a summation-form clustering problem of the ground clusters with the APs along with inter-AP distance constraints that make the AP network connected and with complexity costs that take care of ground cluster to AP capacity constraints. The resultant clustering problem is solved using Deterministic Annealing to find (near) globally optimal solutions for the minimum number and locations of the APs to establish connectivity and provide required traffic capacity between disconnected clusters. The basic connectivity constraints are extended to include conditions that make the resultant network survivable to a single AP failure. In order to make the network single AP survivable, we extend the basic connectivity solution by adding another summation form constraint so that the AP network forms a biconnected network and also by making sure that each ground cluster is connected to atleast two APs. We establish the validity of our algorithms by comparing them with optimal exhaustive search algorithms and show that our algorithms are near-optimal for the problem of establishing connectivity between disconnected clusters

Spectrum Allocation Algorithms for Cognitive Radio Mesh Networks

Empowered by the cognitive radio technology, and motivated by the sporadic channel utilization, both spatially and temporally, dynamic spectrum access networks (also referred to as cognitive radio networks and next generation wireless networks) have emerged as a solution to improve spectrum utilization and provide more flexibility to wireless communication. A cognitive radio network is composed of wireless users, referred to as secondary users, which are allowed to use licensed spectrum bands as long as their are no primary, licensed, users occupying the channel in their vicinity. This restricted spectrum access strategy leads to heterogeneity in channel availability among secondary users. This heterogeneity forms a significant source of performance degradation for cognitive radio networks, and poses a great challenge on protocol design. In this dissertation, we propose spectrum allocation algorithms that take into consideration the heterogeneity property and its effect on the network performance. The spectrum allocation solutions proposed in this dissertation address three major objectives in cognitive radio mesh networks. The first objective is maximizing the network coverage, in terms of the total number of served clients, and at the same time simplifying the communication coordination function. To address this objective, we proposed a received based channel allocation strategy that alleviates the need for a common control channel, thus simplifying the coordination function, and at the same time maximizes the number of clients served with link reliability guarantees. We show the superiority of the proposed allocation strategy over other existing strategies. The second objective is improving the multicast throughput to compensate for the performance degradation caused by channel heterogeneity. We proposed a scheduling algorithm that schedules multicast transmissions over both time and frequency and integrates that with the use of network coding. This algorithm achieves a significant gain, measured as the reduction in the total multicast time, as the simulation results prove. We also proposed a failure recovery algorithm that can adaptively adjust the schedule in response to temporary changes in channel availability. The last objective is minimizing the effect of channel switching on the end-to-end delay and network throughput. Channel switching can be a significant source of delay and bandwidth wastage, especially if the secondary users are utilizing a wide spectrum band. To address this issue, we proposed an on-demand multicast routing algorithm for cognitive radio mesh networks based on dynamic programming. The algorithm finds the best available route in terms of end-to-end delay, taking into consideration the switching latency at individual nodes and the transmission time on different channels. We also presented the extensibility of the proposed algorithm to different routing metric. Furthermore, a route recovery algorithm that takes into consideration the overhead of rerouting and the route cost was also proposed. The gain of these algorithms was proved by simulation

Spectrum handoff strategy for cognitive radio-based Mac in industrial wirless sensor and actuator networks

In this thesis, a Cognitive Radio(CR)-based MAC for Industrial Wireless Sensor and Actuator Network (IWSAN) applications is proposed. IWSANs are typically used for closed-loop control applications, and they demand strict requirements in terms of time and robustness. Low latency and low error rates are required in order not to endanger persons or machinery. Moreover, these applications operate in industrial environments such as factories or transport scenarios (as aeronautics or railway) where multipath fading and shadowing are present due to metal surfaces. Furthermore, interference from other communication systems or industrial machinery is also common in these environments. The proposed MAC, based on the CR paradigm, is capable of ensuring time and robustness requirements in industrial channels. In the process of designing the CR-based MAC for IWSAN applications, a comparison between several non-CR-based MACs and CR-based MACs has been carried out. This comparison, which allows stating the benefits of CR for these applications, is presented in this thesis. The performance of every MAC is determined theoretically using Network Calculus, and it is validated through OPNET simulations. CR solutions, due to their adaptability characteristics, are capable of avoiding interference and ensuring robustness in industrial environments. However, none of the selected MACs are capable of ensuring robustness without comprising time requirements, since interference is avoided but not in a bounded time. On the other hand, the MAC proposed in this thesis is capable of avoiding interference ensuring time and robustness requirements at the same time. This MAC is therefore suitable for IWSAN applications. To ensure a deterministic behavior against interference, a novel handoff algorithm, which detects interference and hops to another channel, has been proposed. This algorithm has been designed to be used jointly with one of the evaluated MACs. The detection of the interference and the hop to another channel is done in a bounded time, because the proposed algorithm detects interference while the system is transmitting. The performance of this proposal is evaluated using Network Calculus and OPNET simulations, and the results are compared with the system without the proposed handoff algorithm. The comparison of the results shows how the evaluated MAC is only capable of ensuring both time and robustness requirements when the proposed handoff strategy is used. Moreover, the spectrum sensing algorithm used to obtain information about the environment is delved and its performance is measured through MATLAB simulations. An energy detector has been chosen due to its simplicity. Also, a cyclostationary Modulation Classifier is presented and a simplification has been carried out allowing its implementation on real hardware. The Modulation Classifier is capable of distinguishing between OFDM, QPSK and GFSK signals. The performance of the algorithm is presented in this thesis for different signals and for different receiver impairments such as frequency offset, DC offset and I/Q imbalance. Finally, a cognitive platform to validate the spectrum sensing algorithms is presented. This platform has been designed using a Xilinx Virtex 6 FPGA by a working group composed of researchers from IK4-Ikerlan and Mondragon Unibertsitatea. The platform, which uses both spectrum sensing algorithms, is an Ethernet-to-RF bridge. It has been designed to replace an Ethernet wired link by a wireless one for IWSAN applications. The proposed platform ensures a reliable communication link against interference. In the proposed implementation, the energy detector is used by the transmitter in order to find a free channel to transmit data, whereas the modulation classifier is used by the receiver in order to distinguish between the signal transmitted by the RF-Ethernet bridge and other signals. In this way the receiver can find the channel where the transmitter is carrying out the communication.En esta tesis se propone una MAC basada en el paradigma de la Radio Cognitiva (RC) para redes de sensores y actuadores inalámbricos industriales. Estas redes se suelen utilizar para aplicaciones de control en lazo cerrado, que exigen requisitos estrictos de tiempo y robustez. Para no poner en peligro la salud de las personas o la maquinaria es necesario que la red asegure una baja latencia y una tasa baja de errores. Además, al trabajar en ambientes industriales como fábricas o transportes (trenes, aviones, etc.), estas redes tienen que hacer frente a canales con mucho desvanecimiento por multitrayecto y efecto sombra debido a las superficies metálicas. También es común en estos entornos que haya interferencias de otros sistemas de comunicaciones o de la propia maquinaria industrial. La MAC propuesta en esta tesis es capaz de asegurar los requisitos temporales y de robustez demandados trabajando en este tipo de entornos. En el proceso de diseño de la MAC basada en RC para redes de sensores y actuadores inalámbricos industriales, se ha llevado a cabo una comparación de diferentes MACs diseñadas para estas redes. Se han evaluado tanto MACs basadas en RC como no basadas en ella, estableciendo las ventajas de la RC para estas aplicaciones. La evaluación se ha llevado a cabo haciendo un estudio teórico mediante Network Calculus, cuyos resultados se han validado mediante simulaciones en OPNET. Los resultados muestran como la RC es capaz de evitar interferencias y asegurar robustez en ambientes industriales. Sin embargo, ninguna de las MACs seleccionadas ha conseguido asegurar ambos requisitos, temporales y de robustez, al mismo tiempo; se puede evitar las interferencias pero no sin comprometer los requisitos temporales de la aplicación. Sin embargo, la MAC propuesta es capaz de evitar interferencias asegurando al mismo tiempo los requisitos temporales y de robustez. Por lo tanto, la MAC propuesta es apropiada para este tipo de redes. Para asegurar el comportamiento determinista del sistema, se ha propuesto un novedoso algoritmo de handoff que es capaz de detectar una interferencia y saltar a otro canal. Este algoritmo se ha diseñado para ser utilizado conjuntamente con una de las MACs previamente evaluadas. La detección de la interferencia y el salto a otro canal se hace en un tiempo determinado de tiempo, ya que es posible detectar interferencias mientras el sistema está transmitiendo. Su rendimiento se ha evaluado mediante Network Calculus y simulaciones en OPNET, y se ha comparado con los resultados obtenidos con la MAC cuando no se utiliza el esquema propuesto. De la comparación se deduce que el esquema de handoff añade a la MAC la capacidad de asegurar a la vez los requisitos temporales y de robustez. Además, en la tesis se explica el algoritmo de spectrum sensing que la MAC utiliza para obtener información del entorno, y su rendimiento se ha estudiado mediante simulaciones en MATLAB. Debido a su simplicidad, se ha optado por un detector de energía para este propósito. También se presenta un clasificador de modulaciones cicloestacionario. Este clasificador ha sido simplificado todo lo posible para posibilitar su implementación en hardware real. El clasificador de modulaciones es capaz de distinguir entre señales OFDM, QPSK y GFSK. Su rendimiento se detalla para diferentes señales y para diferentes deficiencias presentes en el receptor, como son offset de frecuencia, offset de continua o desequilibrios I/Q. Por último, se presenta una plataforma cognitiva que se ha utilizado para validar los algoritmos de spectrum sensing. Un grupo de trabajo compuesto por investigadores de IK4-Ikerlan y Mondragon Unibertsitatea ha diseñado esta plataforma sobre una FPGA Virtex 6 de Xilinx. La plataforma, que utiliza los dos algoritmos de spectrum sensing, es un puente Ethernet-RF. Su objetivo es reemplazar un enlace cableado de Ethernet por uno inalámbrico para aplicaciones de redes de sensores y actuadores industriales. Gracias a los algoritmos de spectrum sensing, la plataforma es capaz de asegurar un enlace robusto ante interferencias. El detector de energía se utiliza en el transmisor para encontrar los posibles canales libres donde transmitir la información. Mientras que el clasificador de modulaciones se utiliza en el receptor para distinguir entre la señal del transmisor y otras posibles señales. Esto permite al receptor saber en qué canal de todos los posibles está el transmisor.Tesi honetan proposatzen da Irrati Kognitiboaren (IK) paradigman oinarritutako MAC bat industriako haririk gabeko sentsore eta eragingailuen sareetarako. Sare horiek begizta itxiko kontrol aplikazioetarako erabili ohi dira, denbora eta sendotasunaren aldetik baldintza ugari eskatzen dute eta. Pertsonen osasuna eta makinak arriskuan ez jartzeko, beharrezkoa da sareak latentzia eta hutsegite tasa txikiak bermatzea. Gainera, industri giroetan lan egiteko direnez, esaterako, lantegietan edo garraioetan (trenak, hegazkinak, etab.), sare horiek gai izan behar dira gainazal metalikoek eragiten dituzten ibilbide aniztunaren eta itzal efektuaren ondorioz asko barreiatzen diren kanalei aurre egiteko. Ingurune horien ohiko ezaugarria da, baita ere, beste komunikazio sistema batzuen edo industriako makinen beraien interferentziak egotea. Tesi honetan proposatzen den MACa gai da honelako inguruetan lan egiteko denborari eta sendotasunari dagokienez eskatzen dituen baldintzak ziurtatzeko. IKan oinarrituta haririk gabeko sentsore eta eragingailu industrialen sareetarako MACa diseinatzeko prozesuan, horrelako sareetarako aurkeztu diren hainbat MAC alderatu dira. IKan oinarritutako MACak zein bestelakoak ebaluatu dira, eta IKak aplikazio hauetarako dituen abantailak ezarri dira. Ebaluaziorako Network Calculus erabili da, zeinaren bidez azterketa teoriko bat egin baita, eta azterketaren emaitzak OPNETen simulazioak eginda baliozkotu dira. Emaitzek erakusten dutenez, IKa gai da industriako inguruneetan interferentziak ekidin eta sendotasuna ziurtatzeko. Halere, aukeratu diren MACetatik batek ere ez du lortu baldintza biak, denborari buruzkoa zein sendotasunari buruzkoa, aldi berean ziurtatzea; interferentziak ekidin daitezke, baina ez aplikazioaren denborari buruzko baldintzak arriskuan jarri gabe. Dena dela, proposatu den MACak portaera determinista bat ziurtatzen du interferentziekiko, eta aldi berean denborari eta sendotasunari buruzko baldintzak ere ziurtatzen ditu. Hortaz, MAC hau egokia da sare mota honetarako. Sistemaren portaera determinista ziurtatzeko, handoff algoritmo berritzailea proposatu da, zeina interferentzia bat antzeman eta beste kanal bat igarotzeko gai den. Algoritmo hori aurretik ebaluatutakoa MACetako batekin batera erabiltzeko diseinatu da. Interferentzia antzeman eta beste kanal batera salto egitea denbora jakin batean egiten da, izan ere, sistema transmititzen ari dela antzeman baitaitezke interferentziak. Network Calculusen bitartez eta OPNETeko simulazioen bitartez ebaluatu da sistemaren errendimendua, eta proposatutako eskema erabiltzen ez denean MACak ematen dituen emaitzekin alderatu da. Alderaketa horretatik ondorioztatzen denez, handoff eskemak denborari eta sendotasunari buruzko baldintzak batera ziurtatzeko ahalmena ematen dio MACari. Gainera, tesiak azaltzen du inguruneari buruzko informazioa eskuratzeko MACak erabiltzen duen spectrum sensing algoritmoa, eta bere errendimendua MATLABen simulazioak eginez aztertu da. Bere sinpletasuna dela eta, energia detektore bat aukeratu da asmo honetarako. Modulazio sailkatzaile zikloegonkor bat ere aurkezten da. Sailkapen hori ahalik eta gehien sinplifikatu da benetako hardwarean inplementatu ahal izateko. Modulazioen sailkatzaileak OFDM, QPSK eta GFSK seinaleak bereizi ditzake. Bere errendimendua hargailuan dauden seinale eta akats desberdinetarako zehazten da, esaterako maiztasunaren offset-a,zuzenaren offset-a edo I/Q desorekak. Bukatzeko, spectrum sensing-eko algoritmoak baliozkotzeko erabili den plataforma kognitibo bat aurkezten da. IK4-Ikerlaneko eta Mondragon Unibertsitateko ikertzailez osatutako lantalde batek diseinatu du plataforma hori Xilinxen Virtex 6 FPGA baten oinarrutz. Plataformak spectrum sensing-eko bi algoritmo erabiltzen ditu eta Ethernet-RF zubi bat da. Bere helburua da Etherneteko kable bidezko lotura bat haririk gabeko batekin ordeztea industriako sentsore eta eragingailuen sareetan aplikatzeko. Spectrum sensing-eko algoritmoei esker, plataformak lotura sendoa bermatu dezake interferentziak gertatzen direnean. Energia detektorea transmisorean erabiltzen da informazioa transmititzeko erabilgarri egon daitezkeen kanalak aurkitzeko. Modulazioen sailkatzailea, berriz, hargailuan erabiltzen da transmisorearen seinalea eta egon daitezkeen beste seinale batzuk bereizteko. Horri esker, hargailuak badaki posible diren kanal guztietatik non dagoen transmisorea

Scheduling algorithms in broadband wireless networks

Scheduling algorithms that support quality of service (QoS) differentiation and guarantees for wireless data networks are crucial to the development of broadband wireless networks. Wireless communication poses special problems that do not exist in wireline networks, such as time-varying channel capacity and location-dependent errors. Although many mature scheduling algorithms are available for wireline networks, they are not directly applicable in wireless networks because of these special problems. This paper provides a comprehensive and in-depth survey on recent research in wireless scheduling. The problems and difficulties in wireless scheduling are discussed. Various representative algorithms are examined. Their themes of thoughts and pros and cons are compared and analyzed. At the end of the paper, some open questions and future research directions are addressed.published_or_final_versio

Long-Term Stable Communication in Centrally Scheduled Low-Power Wireless Networks

With the emergence of the Internet of Things (IoT), more devices are connected than ever before. Most of these communicate wirelessly, forming Wireless Sensor Networks. In recent years, there has been a shift from personal networks, like Smart Home, to industrial networks. Industrial networks monitor pipelines or handle the communication between robots in factories. These new applications form the Industrial Internet of Things (IIoT). Many industrial applications have high requirements for communication, higher than the requirements of common IoT networks. Communications must stick to hard deadlines to avoid harm, and they must be highly reliable as skipping information is not a viable option when communicating critical information. Moreover, communication has to remain reliable over longer periods of time. As many sensor locations do not offer a power source, the devices have to run on battery and thus have to be power efficient. Current systems offer solutions for some of these requirements. However, they especially lack long-term stable communication that can dynamically adapt to changes in the wireless medium.In this thesis, we study the problem of stable and reliable communication in centrally scheduled low-power wireless networks. This communication ought to be stable when it can dynamically adapt to changes in the wireless medium while keeping latency at a minimum. We design and investigate approaches to solve the problem of low to high degrees of interference in the wireless medium. We propose three solutions to overcome interference: MASTER with Sliding Windows brings dynamic numbers of retransmissions to centrally scheduled low-power wireless networks, OVERTAKE allows to skip nodes affected by interference along the path, and AUTOBAHN combines opportunistic routing and synchronous transmissions with the Time-Slotted Channel Hopping (TSCH) MAC protocol to overcome local wide-band interference with the lowest possible latency. We evaluate our approaches in detail on testbed deployments and provide open-source implementations of the protocols to enable others to build their work upon them

Optimizing performance and energy efficiency of group communication and internet of things in cognitive radio networks

Data traffic in the wireless networks has grown at an unprecedented rate. While traditional wireless networks follow fixed spectrum assignment, spectrum scarcity problem becomes a major challenge in the next generations of wireless networks. Cognitive radio is a promising candidate technology that can mitigate this critical challenge by allowing dynamic spectrum access and increasing the spectrum utilization. As users and data traffic demands increases, more efficient communication methods to support communication in general, and group communication in particular, are needed. On the other hand, limited battery for the wireless network device in general makes it a bottleneck for enhancing the performance of wireless networks. In this thesis, the problem of optimizing the performance of group communication in CRNs is studied. Moreover, energy efficient and wireless-powered group communication in CRNs are considered. Additionally, a cognitive mobile base station and a cognitive UAV are proposed for the purpose of optimizing energy transfer and data dissemination, respectively. First, a multi-objective optimization for many-to-many communication in CRNs is considered. Given a many-to-many communication request, the goal is to support message routing from each user in the many-to-many group to each other. The objectives are minimizing the delay and the number of used links and maximizing data rate. The network is modeled using a multi-layer hyper graph, and the secondary users\u27 transmission is scheduled after establishing the conflict graph. Due to the difficulty of solving the problem optimally, a modified version of an Ant Colony meta-heuristic algorithm is employed to solve the problem. Additionally, energy efficient multicast communication in CRNs is introduced while considering directional and omnidirectional antennas. The multicast service is supported such that the total energy consumption of data transmission and channel switching is minimized. The optimization problem is formulated as a Mixed Integer Linear Program (MILP), and a heuristic algorithm is proposed to solve the problem in polynomial time. Second, wireless-powered machine-to-machine multicast communication in cellular networks is studied. To incentivize Internet of Things (IoT) devices to participate in forwarding the multicast messages, each IoT device participates in messages forwarding receives Radio Frequency (RF) energy form Energy Transmitters (ET) not less than the amount of energy used for messages forwarding. The objective is to minimize total transferred energy by the ETs. The problem is formulated mathematically as a Mixed Integer Nonlinear Program (MINLP), and a Generalized Bender Decomposition with Successive Convex Programming (GBD-SCP) algorithm is introduced to get an approximate solution since there is no efficient way in general to solve the problem optimally. Moreover, another algorithm, Constraints Decomposition with SCP and Binary Variable Relaxation (CDR), is proposed to get an approximate solution in a more efficient way. On the other hand, a cognitive mobile station base is proposed to transfer data and energy to a group of IoT devices underlying a primary network. Total energy consumed by the cognitive base station in its mobility, data transmission and energy transfer is minimized. Moreover, the cognitive base station adjusts its location and transmission power and transmission schedule such that data and energy demands are supported within a certain tolerable time and the primary users are protected from harmful interference. Finally, we consider a cognitive Unmanned Aerial Vehicle (UAV) to disseminate data to IoT devices. The UAV senses the spectrum and finds an idle channel, then it predicts when the corresponding primary user of the selected channel becomes active based on the elapsed time of the off period. Accordingly, it starts its transmission at the beginning of the next frame right after finding the channel is idle. Moreover, it decides the number of the consecutive transmission slots that it will use such that the number of interfering slots to the corresponding primary user does not exceed a certain threshold. A mathematical problem is formulated to maximize the minimum number of bits received by the IoT devices. A successive convex programming-based algorithm is used to get a solution for the problem in an efficiency way. It is shown that the used algorithm converges to a Kuhn Tucker point

Reliable machine-to-machine multicast services with multi-radio cooperative retransmissions

The final publication is available at Springer via http://dx.doi.org/10.1007/s11036-015-0575-6The 3GPP is working towards the definition of service requirements and technical solutions to provide support for energy-efficient Machine Type Communications (MTC) in the forthcoming generations of cellular networks. One of the envisioned solutions consists in applying group management policies to clusters of devices in order to reduce control signaling and improve upon energy efficiency, e.g., multicast Over-The-Air (OTA) firmware updates. In this paper, a Multi-Radio Cooperative Retransmission Scheme is proposed to efficiently carry out multicast transmissions in MTC networks, reducing both control signaling and improving energy-efficiency. The proposal can be executed in networks composed by devices equipped with multiple radio interfaces which enable them to connect to both a cellular access network, e.g., LTE, and a short-range MTC area network, e.g., Low-Power Wi-Fi or ZigBee, as foreseen by the MTC architecture defined by ETSI. The main idea is to carry out retransmissions over the M2M area network upon error in the main cellular link. This yields a reduction in both the traffic load over the cellular link and the energy consumption of the devices. Computer-based simulations with ns-3 have been conducted to analyze the performance of the proposed scheme in terms of energy consumption and assess its superior performance compared to non-cooperative retransmission schemes, thus validating its suitability for energy-constrained MTC applications.Peer ReviewedPostprint (author's final draft