2,067 research outputs found
A critical analysis of research potential, challenges and future directives in industrial wireless sensor networks
In recent years, Industrial Wireless Sensor Networks (IWSNs) have emerged as an important research theme with applications spanning a wide range of industries including automation, monitoring, process control, feedback systems and automotive. Wide scope of IWSNs applications ranging from small production units, large oil and gas industries to nuclear fission control, enables a fast-paced research in this field. Though IWSNs offer advantages of low cost, flexibility, scalability, self-healing, easy deployment and reformation, yet they pose certain limitations on available potential and introduce challenges on multiple fronts due to their susceptibility to highly complex and uncertain industrial environments. In this paper a detailed discussion on design objectives, challenges and solutions, for IWSNs, are presented. A careful evaluation of industrial systems, deadlines and possible hazards in industrial atmosphere are discussed. The paper also presents a thorough review of the existing standards and industrial protocols and gives a critical evaluation of potential of these standards and protocols along with a detailed discussion on available hardware platforms, specific industrial energy harvesting techniques and their capabilities. The paper lists main service providers for IWSNs solutions and gives insight of future trends and research gaps in the field of IWSNs
Survey of Inter-satellite Communication for Small Satellite Systems: Physical Layer to Network Layer View
Small satellite systems enable whole new class of missions for navigation,
communications, remote sensing and scientific research for both civilian and
military purposes. As individual spacecraft are limited by the size, mass and
power constraints, mass-produced small satellites in large constellations or
clusters could be useful in many science missions such as gravity mapping,
tracking of forest fires, finding water resources, etc. Constellation of
satellites provide improved spatial and temporal resolution of the target.
Small satellite constellations contribute innovative applications by replacing
a single asset with several very capable spacecraft which opens the door to new
applications. With increasing levels of autonomy, there will be a need for
remote communication networks to enable communication between spacecraft. These
space based networks will need to configure and maintain dynamic routes, manage
intermediate nodes, and reconfigure themselves to achieve mission objectives.
Hence, inter-satellite communication is a key aspect when satellites fly in
formation. In this paper, we present the various researches being conducted in
the small satellite community for implementing inter-satellite communications
based on the Open System Interconnection (OSI) model. This paper also reviews
the various design parameters applicable to the first three layers of the OSI
model, i.e., physical, data link and network layer. Based on the survey, we
also present a comprehensive list of design parameters useful for achieving
inter-satellite communications for multiple small satellite missions. Specific
topics include proposed solutions for some of the challenges faced by small
satellite systems, enabling operations using a network of small satellites, and
some examples of small satellite missions involving formation flying aspects.Comment: 51 pages, 21 Figures, 11 Tables, accepted in IEEE Communications
Surveys and Tutorial
An Invulnerability Algorithm for Wireless Sensor Network\u27s Topology Based on Distance and Energy
To improve the topological stability of wireless sensor networks, an anti-destructive algorithm based on energy-aware weighting is proposed. The algorithm takes the Weighted Dynamic Topology Control (WDTC) algorithm as a reference, and calculates the weight of nodes by using the distance between nodes and the residual energy of nodes. Then chooses optimal weights and constructs a stable balanced topological network with multiple-connectivity paths using the K-connection idea. The simulation results show that the proposed algorithm improves the average connectivity of the topological network, enhances the robustness of the network, ensures the stable transmission of network information, and optimizes the betweenness centrality of the network nodes, making the network has a good invulnerability
Spectrum and transmission range aware clustering for cognitive radio ad hoc networks
Cognitive radio network (CRN) is a promising technology to overcome the problem of spectrum shortage by enabling the unlicensed users to access the underutilization spectrum bands in an opportunistic manner. On the other hand, the hardness of establishing a fixed infrastructure in specific situations such as disaster recovery, and battlefield communication imposes the network to have an ad hoc structure. Thus, the emerging of Cognitive Radio Ad Hoc Network (CRAHN) has accordingly become imperative. However, the practical implementation of CRAHN faced many challenges such as control channel establishment and the scalability problems. Clustering that divides the network into virtual groups is a reliable solution to handle these issues. However, previous clustering methods for CRAHNs seem to be impractical due to issues regarding the high number of constructed clusters and unfair load distribution among the clusters. Additionally, the homogeneous channel model was considered in the previous work despite channel heterogeneity is the CRN features. This thesis addressed these issues by proposing two clustering schemes, where the heterogeneous channel is considered in the clustering process. First, a distributed clustering algorithm called Spectrum and Transmission Range Aware Clustering (STRAC) which exploits the heterogeneous channel concept is proposed. Here, a novel cluster head selection function is formulated. An analytical model is derived to validate the STRAC outcomes. Second, in order to improve the bandwidth utilization, a Load Balanced Spectrum and Transmission Range Aware Clustering (LB-STRAC) is proposed. This algorithm jointly considers the channel heterogeneity and load balancing concepts. Simulation results show that on average, STRAC reduces the number of constructed clusters up to 51% compared to conventional clustering technique, Spectrum Opportunity based Clustering (SOC). In addition, STRAC significantly reduces the one-member cluster ratio and re-affiliation ratio in comparison to non-heterogeneity channel consideration schemes. LB-STRAC further improved the clustering performance by outperforming STRAC in terms of uniformity and equality of the traffic load distribution among all clusters with fair spectrum allocation. Moreover, LB-STRAC has been shown to be very effective in improving the bandwidth utilization. For equal traffic load scenario, LB-STRAC on average improves the bandwidth utilization by 24.3% compared to STRAC. Additionally, for varied traffic load scenario, LB-STRAC improves the bandwidth utilization by 31.9% and 25.4% on average compared with STRAC for non-uniform slot allocation and for uniform slot allocation respectively. Thus, LB-STRAC is highly recommended for multi-source scenarios such as continuous monitoring applications or situation awareness applications
Energy efficient in cluster head and relay node selection for wireless sensor networks
Wireless Sensor Networks (WSNs) are defined as networks of nodes that work in a cooperative way to sense and control the surrounding environment. However, nodes contain limited energy which is the key limiting factor of the sensor network operation. In WSN architecture, the nodes are typically grouped into clusters where one node from each cluster is selected as the Cluster Head (CH) and relays utilisation to minimise energy consumption. Currently, the selection of CH based on a different combination of input variables. Example of these variables includes residual energy, communication cost, node density, mobility, cluster size and many others. Improper selection of sensor node (i.e. weak signal strength) as CH can cause an increase in energy consumption. Additionally, a direct transmission in dual-hop communication between sensor nodes (e.g. CH) with the base station (BS) uses high energy consumption. A proper selection of the relay node can assist in communication while minimising energy consumption. Therefore, the research aim is to prolong the network lifetime (i.e. reduce energy consumption) by improving the selection of CHs and relay nodes through a new combination of input variables and distance threshold approach. In CH selection, the Received Signal Strength Indicator (RSSI) scheme, residual energy, and centrality variable were proposed. Fuzzy logic was utilized in selecting the appropriate CHs based on these variables in the MATLAB. In relay node selection, the selection is based on the distance threshold according to the nearest distance with the BS. The selection of the optimal number of relay nodes is performed using K-Optimal and K-Means techniques. This ensures that all CHs are connected to at least one corresponding relay node (i.e. a 2-tier network) to execute the routing process and send the data to BS. To evaluate the proposal, the performance of Multi-Tier Protocol (MAP) and Stable Election Protocol (SEP) was compared based on 100, 200, and 800 nodes with 1 J and random energy. The simulation results showed that our proposed approach, refer to as Energy Efficient Cluster Heads and Relay Nodes (EECR) selection approach, extended the network lifetime of the wireless sensor network by 43% and 33% longer than SEP and MAP, respectively. This thesis concluded that with effective combinations of variables for CHs and relay nodes selection in static environment for data routing, EECR can effectively improve the energy efficiency of WSNs
Analysis and Ad-hoc Networking Solutions for Cooperative Relaying Systems
Users of mobile networks are increasingly demanding higher data rates from
their service providers. To cater to this demand, various signal processing
and networking algorithms have been proposed. Amongst them the multiple
input multiple output (MIMO) scheme of wireless communications is one of
the most promising options. However, due to certain physical restrictions,
e.g., size, it is not possible for many devices to have multiple antennas
on them. Also, most of the devices currently in use are single-antenna
devices. Such devices can make use of the MIMO scheme by employing
cooperative MIMO methods. This involves nearby nodes utilizing the antennas
of each other to form virtual antenna arrays (VAAs). Nodes with limited
communication ranges can further employ multi-hopping to be able to
communicate with far away nodes. However, an ad-hoc communications scheme
with cooperative MIMO multi-hopping can be challenging to implement because
of its de-centralized nature and lack of a centralized controling entity
such as a base-station. This thesis looks at methods to alleviate the
problems faced by such networks.In the first part of this thesis, we look,
analytically, at the relaying scheme under consideration and derive closed
form expressions for certain performance measures (signal to noise ratio
(SNR), symbol error rate (SER), bit error rate (BER), and capacity) for the
co-located and cooperative multiple antenna schemes in different relaying
configurations (amplify-and-forward and decode-and-forward) and different
antenna configurations (single input single output (SISO), single input
multiple output (SIMO) and MIMO). These expressions show the importance of
reducing the number of hops in multi-hop communications to achieve a better
performance. We can also see the impact of different antenna configurations
and different transmit powers on the number of hops through these
simplified expressions.We also look at the impact of synchronization errors
on the cooperative MIMO communications scheme and derive a lower bound of
the SINR and an expression for the BER in the high SNR regime. These
expressions can help the network designers to ensure that the quality of
service (QoS) is satisfied even in the worst-case scenarios. In the second
part of the thesis we present some algorithms developed by us to help the
set-up and functioning of cluster-based ad-hoc networks that employ
cooperative relaying. We present a clustering algorithm that takes into
account the battery status of nodes in order to ensure a longer network
life-time. We also present a routing mechanism that is tailored for use in
cooperative MIMO multi-hop relaying. The benefits of both schemes are shown
through simulations.A method to handle data in ad-hoc networks using
distributed hash tables (DHTs) is also presented. Moreover, we also present
a physical layer security mechanism for multi-hop relaying. We also analyze
the physical layer security mechanism for the cooperative MIMO scheme. This
analysis shows that the cooperative MIMO scheme is more beneficial than
co-located MIMO in terms of the information theoretic limits of the
physical layer security.Nutzer mobiler Netzwerke fordern zunehmend höhere Datenraten von ihren
Dienstleistern. Um diesem Bedarf gerecht zu werden, wurden verschiedene
Signalverarbeitungsalgorithmen entwickelt. Dabei ist das "Multiple input
multiple output" (MIMO)-Verfahren für die drahtlose Kommunikation eine der
vielversprechendsten Techniken. Jedoch ist aufgrund bestimmter
physikalischer Beschränkungen, wie zum Beispiel die Baugröße, die
Verwendung von mehreren Antennen für viele Endgeräte nicht möglich. Dennoch
können solche Ein-Antennen-Geräte durch den Einsatz kooperativer
MIMO-Verfahren von den Vorteilen des MIMO-Prinzips profitieren.
Dabei schließen sich naheliegende Knoten zusammen um ein sogenanntes
virtuelles Antennen-Array zu bilden. Weiterhin können Knoten mit
beschränktem Kommunikationsbereich durch mehrere Hops mit weiter
entfernten Knoten kommunizieren. Allerdings stellt der Aufbau eines solchen
Ad-hoc-Netzwerks mit kooperativen MIMO-Fähigkeiten aufgrund der dezentralen
Natur und das Fehlen einer zentral-steuernden Einheit, wie einer
Basisstation, eine große Herausforderung dar. Diese Arbeit befasst sich mit
den Problemstellungen dieser Netzwerke und bietet verschiedene
Lösungsansätze.Im ersten Teil dieser Arbeit werden analytisch in
sich geschlossene Ausdrücke für ein kooperatives
Relaying-System bezüglicher verschiedener Metriken, wie das
Signal-Rausch-Verhältnis, die Symbolfehlerrate, die Bitfehlerrate und die
Kapazität, hergeleitet. Dabei werden die "Amplify-and forward" und
"Decode-and-forward" Relaying-Protokolle, sowie unterschiedliche
Mehrantennen-Konfigurationen, wie "Single input single output" (SISO),
"Single input multiple output" (SIMO) und MIMO betrachtet. Diese Ausdrücke
zeigen die Bedeutung der Reduzierung der Hop-Anzahl in Mehr-Hop-Systemen,
um eine höhere Leistung zu erzielen. Zudem werden die Auswirkungen
verschiedener Antennen-Konfigurationen und Sendeleistungen auf die Anzahl
der Hops analysiert. Weiterhin wird der Einfluss von
Synchronisationsfehlern auf das kooperative MIMO-Verfahren herausgestellt
und daraus eine untere Grenze für das
Signal-zu-Interferenz-und-Rausch-Verhältnis, sowie ein Ausdruck für die
Bitfehlerrate bei hohem Signal-Rausch-Verhältnis entwickelt.
Diese Zusammenhänge sollen Netzwerk-Designern helfen die Qualität des
Services auch in den Worst-Case-Szenarien sicherzustellen.
Im zweiten Teil der Arbeit werden einige innovative
Algorithmen vorgestellt, die die Einrichtung und die Funktionsweise von
Cluster-basierten Ad-hoc-Netzwerken, die kooperative Relays verwenden,
erleichtern und verbessern. Darunter befinden sich ein
Clustering-Algorithmus, der den Batteriestatus der Knoten berücksichtigt,
um eine längere Lebensdauer des Netzwerks zu gewährleisten und ein
Routing-Mechanismus, der auf den Einsatz in kooperativen MIMO
Mehr-Hop-Systemen zugeschnitten ist. Die Vorteile beider Algorithmen werden
durch Simulationen veranschaulicht.
Eine Methode, die Daten in Ad-hoc-Netzwerken mit verteilten Hash-Tabellen
behandelt wird ebenfalls vorgestellt. Darüber hinaus wird auch
ein Sicherheitsmechanismus für die physikalische Schicht in
Multi-Hop-Systemen und kooperativen MIMO-Systemen präsentiert. Eine Analyse
zeigt, dass das kooperative MIMO-Verfahren deutliche Vorteile gegenüber dem
konventionellen MIMO-Verfahren hinsichtlich der informationstheoretischen
Grenzen der Sicherheit auf der physikalischen Schicht aufweist
Optimization and Communication in UAV Networks
UAVs are becoming a reality and attract increasing attention. They can be remotely controlled or completely autonomous and be used alone or as a fleet and in a large set of applications. They are constrained by hardware since they cannot be too heavy and rely on batteries. Their use still raises a large set of exciting new challenges in terms of trajectory optimization and positioning when they are used alone or in cooperation, and communication when they evolve in swarm, to name but a few examples. This book presents some new original contributions regarding UAV or UAV swarm optimization and communication aspects
A Study of Wireless Sensor Networks to Comprehend their Relevance to Different Applications, Journal of Telecommunications and Information Technology, 2020, nr 2
Wireless sensor networks (WSNs) have experienced enormous growth, both in terms of the technology used and their practical applications. In order to understand the features of WSNs that make the solution suitable for a specific purpose, one needs to be aware of the theoretical concepts behind and technological aspects of WSNs. In this paper, the significance of WSNs is illustrated, with a particular emphasis placed on their demands and on understanding researchrelated problems. A review of the literature available is presented as well. Detailed discussions concerning sensor node architecture, different types of sensors used and their relevance for various types of WSNs is presented, highlighting the need to achieve application-specific requirements without degrading service quality. Multipath and cluster-based routing protocols are compared in order to analyze QoS requirements they are capable of satisfying, and their suitability for different application areas is reviewed. This survey highlights the performance of different routing protocols, therefore providing guidelines enabling each of the routing techniques to be used, in an efficient manner, with factors such as specific network structure, protocol operation and routing path construction taken into consideration in order to achieve better performanc
Internet of Underwater Things and Big Marine Data Analytics -- A Comprehensive Survey
The Internet of Underwater Things (IoUT) is an emerging communication
ecosystem developed for connecting underwater objects in maritime and
underwater environments. The IoUT technology is intricately linked with
intelligent boats and ships, smart shores and oceans, automatic marine
transportations, positioning and navigation, underwater exploration, disaster
prediction and prevention, as well as with intelligent monitoring and security.
The IoUT has an influence at various scales ranging from a small scientific
observatory, to a midsized harbor, and to covering global oceanic trade. The
network architecture of IoUT is intrinsically heterogeneous and should be
sufficiently resilient to operate in harsh environments. This creates major
challenges in terms of underwater communications, whilst relying on limited
energy resources. Additionally, the volume, velocity, and variety of data
produced by sensors, hydrophones, and cameras in IoUT is enormous, giving rise
to the concept of Big Marine Data (BMD), which has its own processing
challenges. Hence, conventional data processing techniques will falter, and
bespoke Machine Learning (ML) solutions have to be employed for automatically
learning the specific BMD behavior and features facilitating knowledge
extraction and decision support. The motivation of this paper is to
comprehensively survey the IoUT, BMD, and their synthesis. It also aims for
exploring the nexus of BMD with ML. We set out from underwater data collection
and then discuss the family of IoUT data communication techniques with an
emphasis on the state-of-the-art research challenges. We then review the suite
of ML solutions suitable for BMD handling and analytics. We treat the subject
deductively from an educational perspective, critically appraising the material
surveyed.Comment: 54 pages, 11 figures, 19 tables, IEEE Communications Surveys &
Tutorials, peer-reviewed academic journa
- …