37 research outputs found
Data Collection in Two-Tier IoT Networks with Radio Frequency (RF) Energy Harvesting Devices and Tags
The Internet of things (IoT) is expected to connect physical objects and end-users using technologies such as wireless sensor networks and radio frequency identification (RFID). In addition, it will employ a wireless multi-hop backhaul to transfer data collected by a myriad of devices to users or applications such as digital twins operating in a Metaverse. A critical issue is that the number of packets collected and transferred to the Internet is bounded by limited network resources such as bandwidth and energy. In this respect, IoT networks have adopted technologies such as time division multiple access (TDMA), signal interference cancellation (SIC) and multiple-input multiple-output (MIMO) in order to increase network capacity. Another fundamental issue is energy. To this end, researchers have exploited radio frequency (RF) energy-harvesting technologies to prolong the lifetime of energy constrained sensors and smart devices. Specifically, devices with RF energy harvesting capabilities can rely on ambient RF sources such as access points, television towers, and base stations. Further, an operator may deploy dedicated power beacons that serve as RF-energy sources. Apart from that, in order to reduce energy consumption, devices can adopt ambient backscattering communication technologies. Advantageously, backscattering allows devices to communicate using negligible amount of energy by modulating ambient RF signals.
To address the aforementioned issues, this thesis first considers data collection in a two-tier MIMO ambient RF energy-harvesting network. The first tier consists of routers with MIMO capability and a set of source-destination pairs/flows. The second tier consists of energy harvesting devices that rely on RF transmissions from routers for energy supply. The problem is to determine a minimum-length TDMA link schedule that satisfies the traffic demand of source-destination pairs and energy demand of energy harvesting devices. It formulates the problem as a linear program (LP), and outlines a heuristic to construct transmission sets that are then used by the said LP. In addition, it outlines a new routing metric that considers the energy demand of energy harvesting devices to cope with routing requirements of IoT networks. The simulation results show that the proposed algorithm on average achieves 31.25% shorter schedules as compared to competing schemes. In addition, the said routing metric results in link schedules that are at most 24.75% longer than those computed by the LP
Integrated Data and Energy Communication Network: A Comprehensive Survey
OAPA In order to satisfy the power thirsty of communication devices in the imminent 5G era, wireless charging techniques have attracted much attention both from the academic and industrial communities. Although the inductive coupling and magnetic resonance based charging techniques are indeed capable of supplying energy in a wireless manner, they tend to restrict the freedom of movement. By contrast, RF signals are capable of supplying energy over distances, which are gradually inclining closer to our ultimate goal – charging anytime and anywhere. Furthermore, transmitters capable of emitting RF signals have been widely deployed, such as TV towers, cellular base stations and Wi-Fi access points. This communication infrastructure may indeed be employed also for wireless energy transfer (WET). Therefore, no extra investment in dedicated WET infrastructure is required. However, allowing RF signal based WET may impair the wireless information transfer (WIT) operating in the same spectrum. Hence, it is crucial to coordinate and balance WET and WIT for simultaneous wireless information and power transfer (SWIPT), which evolves to Integrated Data and Energy communication Networks (IDENs). To this end, a ubiquitous IDEN architecture is introduced by summarising its natural heterogeneity and by synthesising a diverse range of integrated WET and WIT scenarios. Then the inherent relationship between WET and WIT is revealed from an information theoretical perspective, which is followed by the critical appraisal of the hardware enabling techniques extracting energy from RF signals. Furthermore, the transceiver design, resource allocation and user scheduling as well as networking aspects are elaborated on. In a nutshell, this treatise can be used as a handbook for researchers and engineers, who are interested in enriching their knowledge base of IDENs and in putting this vision into practice
Energy efficiency in LEO satellite and terrestrial wired environments
To meet an ever-growing demand for advanced multimedia services and to support electronic connectivity anywhere on the planet, development of ubiquitous broadband multimedia systems is gaining a huge interest at both academic and industry levels. Satellite networks in general and LEO satellite constellations in particular will play an essential role in the deployment of such systems. Therefore, as LEO satellite constellations like Iridium or IridiumNEXT are extremely expensive to deploy and maintain, extending their service lifetimes is of crucial importance. In the main part of this thesis, we propose different techniques for extending satellite service life in LEO satellite constellations. Satellites in such constellations can spend over 30% of their time under the earth’s umbra, time during which they are powered by batteries. While the batteries are recharged by solar energy, the Depth of Discharge (DoD) they reach during eclipse significantly affects their lifetime – and by extension, the service life of the satellites themselves. For batteries of the type that power Iridium and Iridium-NEXT satellites, a 15% increase to the DoD can practically cut their service lives in half. We first focus on routing and propose two new routing metrics – LASER and SLIM – that try to strike a balance between performance and battery DoD in LEO satellite constellations. Our basic approach is to leverage the deterministic movement of satellites for favoring routing traffic over satellites exposed to the sun as opposed to the eclipsed satellites, thereby decreasing the average battery DoD– all without taking a significant penalty in performance. Then, we deal with resource consolidation – a new paradigm for the reduction of the power consumption. It consists in having a carefully selected subset of network links entering a sleep state, and use the rest to transport the required amount of traffic. This possible without causing major disruptions to network activities. Since communication networks are designed over the peak traffic periods, and with redundancy and over-provisioned in mind. As a remedy to these issues, we propose two different methods to perform resource consolidation in LEO networks. First, we propose trafficaware metric for quantifiying the quality of a frugal topology, the Maximum Link Utilization (MLU). With the problem being NP-hard subject to a given MLU threshold, we introduce two heuristics, BASIC and SNAP, which represent different tradeoffs in terms of performance and simplicity. Second, we propose a new lightweight traffic-agnostic metric for quantifiying the quality of a frugal topology, the Adequacy Index (ADI). After showing that the problem of minimizing the power consumption of a LEO network subject to a given ADI threshold is NP-hard, we propose a heuristc named AvOId to solve it. We evaluate both forms of resource consolidation using realistic LEO topologies and traffic requests. The results show that the simple schemes we develop are almost double the satellite batteries lifetime. Following the green networking in LEO systems, the second part of this thesis focuses on extending the resource consolidation schemes to current wired networks. Indeed, the energy consumption of wired networks has been traditionally overlooked. Several studies exhibit that the traffic load of the routers only has a small influence on their energy consumption. Hence, the power consumption in networks is strongly related to the number of active network elements. In this context, we extend the traffic-agnostic metric, ADI, to the wired networks. We model the problem subject to ADI threshold as NP-hard. Then, we propose two polynomial time heuristics – ABStAIn and CuTBAck. Although ABStAIn and CuTBAck are traffic unaware, we assess their behavior under real traffic loads from 3 networks, demonstrating that their performance are comparable to the more complex traffic-aware solutions proposed in the literature
Wireless Sensor Networks
The aim of this book is to present few important issues of WSNs, from the application, design and technology points of view. The book highlights power efficient design issues related to wireless sensor networks, the existing WSN applications, and discusses the research efforts being undertaken in this field which put the reader in good pace to be able to understand more advanced research and make a contribution in this field for themselves. It is believed that this book serves as a comprehensive reference for graduate and undergraduate senior students who seek to learn latest development in wireless sensor networks
Machine Learning for Unmanned Aerial System (UAS) Networking
Fueled by the advancement of 5G new radio (5G NR), rapid development has occurred in many fields. Compared with the conventional approaches, beamforming and network slicing enable 5G NR to have ten times decrease in latency, connection density, and experienced throughput than 4G long term evolution (4G LTE). These advantages pave the way for the evolution of Cyber-physical Systems (CPS) on a large scale. The reduction of consumption, the advancement of control engineering, and the simplification of Unmanned Aircraft System (UAS) enable the UAS networking deployment on a large scale to become feasible. The UAS networking can finish multiple complex missions simultaneously. However, the limitations of the conventional approaches are still a big challenge to make a trade-off between the massive management and efficient networking on a large scale.
With 5G NR and machine learning, in this dissertation, my contributions can be summarized as the following: I proposed a novel Optimized Ad-hoc On-demand Distance Vector (OAODV) routing protocol to improve the throughput of Intra UAS networking. The novel routing protocol can reduce the system overhead and be efficient. To improve the security, I proposed a blockchain scheme to mitigate the malicious basestations for cellular connected UAS networking and a proof-of-traffic (PoT) to improve the efficiency of blockchain for UAS networking on a large scale. Inspired by the biological cell paradigm, I proposed the cell wall routing protocols for heterogeneous UAS networking. With 5G NR, the inter connections between UAS networking can strengthen the throughput and elasticity of UAS networking. With machine learning, the routing schedulings for intra- and inter- UAS networking can enhance the throughput of UAS networking on a large scale. The inter UAS networking can achieve the max-min throughput globally edge coloring. I leveraged the upper and lower bound to accelerate the optimization of edge coloring.
This dissertation paves a way regarding UAS networking in the integration of CPS and machine learning. The UAS networking can achieve outstanding performance in a decentralized architecture. Concurrently, this dissertation gives insights into UAS networking on a large scale. These are fundamental to integrating UAS and National Aerial System (NAS), critical to aviation in the operated and unmanned fields. The dissertation provides novel approaches for the promotion of UAS networking on a large scale. The proposed approaches extend the state-of-the-art of UAS networking in a decentralized architecture. All the alterations can contribute to the establishment of UAS networking with CPS
Flexi-WVSNP-DASH: A Wireless Video Sensor Network Platform for the Internet of Things
abstract: Video capture, storage, and distribution in wireless video sensor networks
(WVSNs) critically depends on the resources of the nodes forming the sensor
networks. In the era of big data, Internet of Things (IoT), and distributed
demand and solutions, there is a need for multi-dimensional data to be part of
the Sensor Network data that is easily accessible and consumable by humanity as
well as machinery. Images and video are expected to become as ubiquitous as is
the scalar data in traditional sensor networks. The inception of video-streaming
over the Internet, heralded a relentless research for effective ways of
distributing video in a scalable and cost effective way. There has been novel
implementation attempts across several network layers. Due to the inherent
complications of backward compatibility and need for standardization across
network layers, there has been a refocused attention to address most of the
video distribution over the application layer. As a result, a few video
streaming solutions over the Hypertext Transfer Protocol (HTTP) have been
proposed. Most notable are Apple’s HTTP Live Streaming (HLS) and the Motion
Picture Experts Groups Dynamic Adaptive Streaming over HTTP (MPEG-DASH). These
frameworks, do not address the typical and future WVSN use cases. A highly
flexible Wireless Video Sensor Network Platform and compatible DASH (WVSNP-DASH)
are introduced. The platform's goal is to usher video as a data element that
can be integrated into traditional and non-Internet networks. A low cost,
scalable node is built from the ground up to be fully compatible with the
Internet of Things Machine to Machine (M2M) concept, as well as the ability to
be easily re-targeted to new applications in a short time. Flexi-WVSNP design
includes a multi-radio node, a middle-ware for sensor operation and
communication, a cross platform client facing data retriever/player framework,
scalable security as well as a cohesive but decoupled hardware and software
design.Dissertation/ThesisDoctoral Dissertation Electrical Engineering 201
A self-healing framework for WSNs : detection and recovery of faulty sensor nodes and unreliable wireless links
Proponemos un marco conceptual para acoplar técnicas de auto-organización y técnicas de autocuración.
A este marco se le llama de auto-curación y es capaz de hacer frente a enlaces
inalámbricos inestables y nodos defectuosos. Dividimos el marco en dos componentes
principales: la auto-organización y auto-curación. En el componente de auto-organización,
nosotros construimos una topologÃa de árbol que determine las rutas hacia el sumidero. En el
componente de auto-curación, la topologÃa del árbol se adapta a ambos tipos de fallas siguiendo
tres pasos: recopilación de información, detección de fallas, y la recuperación de fallos. En el
paso de recopilación de información, los nodos determinan el estado actual de la red mediante
la recopilación de información de la capa MAC. En el paso de detección de fallas, los nodos
analizan la información recopilada y detectan nodos/enlaces defectuosos. En el paso de
recuperación de fallos, los nodos recuperan la topologÃa del árbol mediante la sustitución de
componentes defectuosos con redundantes (es decir, componentes de respaldo). Este marco
permite una red con resiliencia que se recupera sin agotar los recursos de la red.We propose a conceptual framework for putting together self-organizing and self-healing
techniques. This framework is called the self-healing framework and it is capable of coping with
unstable wireless links and faulty nodes. We divide the framework into two major components:
selforganization and self-healing. In the self-organization component, we build a tree topology
that determines routing paths towards the sink. In the self-healing component, the tree
topology copes with both types of failures by following three steps: information collection, fault
detection, and fault recovery. In the information collection step, the nodes determine the
current status of the network by gathering information from the MAC layer. In the fault
detection step, the nodes analyze the collected information and detect faulty nodes/links. In
the fault recovery step, the nodes recover the tree topology by replacing the faulty components
with redundant ones (i.e., backup components). This framework allows a resilient network that
recovers itself without depleting the network resources.Doctor en IngenierÃaDoctorad
Redes em malha sem fios baseadas em contexto
Doutoramento em Engenharia ElectrotécnicaIn the modern society, new devices, applications and technologies, with sophisticated
capabilities, are converging in the same network infrastructure.
Users are also increasingly demanding in personal preferences and expectations,
desiring Internet connectivity anytime and everywhere. These aspects
have triggered many research efforts, since the current Internet is reaching
a breaking point trying to provide enough flexibility for users and profits for
operators, while dealing with the complex requirements raised by the recent
evolution.
Fully aligned with the future Internet research, many solutions have been
proposed to enhance the current Internet-based architectures and protocols,
in order to become context-aware, that is, to be dynamically adapted to
the change of the information characterizing any network entity. In this
sense, the presented Thesis proposes a new architecture that allows to create
several networks with different characteristics according to their context, on
the top of a single Wireless Mesh Network (WMN), which infrastructure
and protocols are very flexible and self-adaptable.
More specifically, this Thesis models the context of users, which can span
from their security, cost and mobility preferences, devices’ capabilities or
services’ quality requirements, in order to turn a WMN into a set of logical
networks. Each logical network is configured to meet a set of user context
needs (for instance, support of high mobility and low security). To
implement this user-centric architecture, this Thesis uses the network virtualization,
which has often been advocated as a mean to deploy independent
network architectures and services towards the future Internet, while allowing
a dynamic resource management. This way, network virtualization can
allow a flexible and programmable configuration of a WMN, in order to be
shared by multiple logical networks (or virtual networks - VNs). Moreover,
the high level of isolation introduced by network virtualization can be used
to differentiate the protocols and mechanisms of each context-aware VN.
This architecture raises several challenges to control and manage the VNs
on-demand, in response to user and WMN dynamics. In this context, we
target the mechanisms to: (i) discover and select the VN to assign to an
user; (ii) create, adapt and remove the VN topologies and routes. We
also explore how the rate of variation of the user context requirements can
be considered to improve the performance and reduce the complexity of
the VN control and management. Finally, due to the scalability limitations
of centralized control solutions, we propose a mechanism to distribute the
control functionalities along the architectural entities, which can cooperate
to control and manage the VNs in a distributed way.Na sociedade actual, novos dispositivos, aplicações e tecnologias, com capacidades
sofisticadas, estão a convergir na mesma infra-estrutura de rede.
Os utilizadores são também cada vez mais exigentes nas suas preferências e
expectativas pessoais, desejando conetividade `a Internet em qualquer hora
e lugar. Estes aspectos têm desencadeado muitos esforços de investigação,
dado que a Internet atual está a atingir um ponto de rutura ao tentar promover
flexibilidade para os utilizadores e lucros para os operadores, enquanto
lida com as exigências complexas associadas `a recente evolução.
Em sintonia com a linha de investigação para a Internet do futuro, muitas
soluções têm sido propostas para melhorar as arquiteturas e protocolos da
Internet atual, de forma a torná-los sensÃveis ao contexto, isto é, adaptá-los
dinamicamente `a alteração da informação que caracteriza qualquer entidade
de rede. Neste sentido, a presente Tese propõe uma nova arquitetura que
permite criar várias redes com diferentes caracterÃsticas de acordo com o
contexto das mesmas, sobre uma única rede em malha sem fios (WMN),
cuja infra-estructura e protocolos são muito flexÃveis e auto-adaptáveis.
Mais especificamente, esta Tese modela o contexto dos utilizadores, que
pode abranger as suas preferências de segurança, custo e mobilidade, capacidades
dos seus dispositivos ou requisitos de qualidade dos seus serviços,
de forma a transformar uma WMN num conjunto de redes lógicas. Cada
rede lógica ´e configurada para satisfazer um conjunto de necessidades de
contexto do utilizador (como exemplo, suporte de mobilidade elevada e
de baixa seguran¸ca). Para implementar esta arquitetura centrada no utilizador,
esta Tese utiliza a virtualização de redes, que tem muitas vezes
sido defendida como um meio para implementar arquiteturas e serviços de
rede de uma forma independente, enquanto permite uma gestão dinâmica
dos recursos. Desta forma, a virtualização de redes pode permitir uma
configuração flexÃvel e programável de uma WMN, a fim de ser partilhada
por várias redes lógicas (ou redes virtuais - VNs). Além disso, o grau de
isolamento introduzido pela virtualização de redes pode ser utilizado para
diferenciar os protocolos e mecanismos de cada VN baseada em contexto.
Esta arquitetura levanta vários desafios para controlar e gerir as VNs em
tempo real, e em resposta `a dinâmica dos utilizadores e da WMN. Neste
contexto, abordamos os mecanismos para: (i) descobrir e selecionar a VN
a atribuir a um utilizador; (ii) criar, adaptar e remover as topologias e
rotas das VNs. Também exploramos a possibilidade de considerar a taxa
de variação dos requisitos de contexto dos utilizadores de forma a melhorar
o desempenho e reduzir a complexidade do controlo e gestão das VNs.
Finalmente, devido ´as limitações de escalabilidade das soluções de controlo
centralizadas, propomos um mecanismo para distribuir as funcionalidades
de controlo ao longo das entidades da arquitectura, que podem cooperar
para controlar e gerir as VNs de uma forma distribuÃda