Search

The increasing demand for Internet of Things (IoT) applications has resulted in vast amounts of data, requiring the utilization of big data analytics. The integration of big data analytics in IoT-based smart cities can greatly benefit from the development of wireless communication protocols, among which the Thread protocol has emerged as a promising option. Thread is IEEE 802.15.4 based and has advanced capabilities like mesh networking, IPv6 support, and multiple gateways providing no single point of failure. This paper presents the design and evaluation of a low-cost mesh network using Raspberry Pi, nRF52840 dongle, and OpenThread 1.2 (i.e., an open-source software implementation of the Thread protocol stack). The research elaborates on the hardware and software solutions used, as well as the network topologies adopted. To evaluate the performance of the developed system, extensive real-time tests are performed, considering parameters, such as jitter, packet loss, and round trip time. These tests effectively demonstrate the effectiveness of the Thread network. Furthermore, the impact of varying payload size and bitrate on the network is analyzed to understand its influence. The behavior of the multi-hop network is also examined under link failure scenarios, providing insights into the network’s robustness. Our findings provide valuable insights for researchers interested in designing low-cost and efficient mesh networks for various IoT applications, including home automation, building/campus monitoring systems, distributed industrial IoT applications, and smart city infrastructure.

In recent years, low-power wide-area network (LPWAN) has received widespread popularity with long-range and wide-area communication at low power for the Internet of Things (IoT) systems. Among many vendors of LPWAN, long-range low-power wireless communications, also called LoRa, is one of the competing standards and is well known in both academia and industrial communities as an emerging research area. Among the LoRa applications, unmanned aerial vehicles (UAV) systems are emerging with the benefits of extended battery life and a long communication range. In this paper, we investigate the network capacity with the mixture of concurrent and sequential transmission (MCST) scheme over LoRa networks. From the simulation results, it can be seen that MCST is suitable for implementation in the LoRa network. Specifically, MCST can achieve higher throughput with low transmission latency and energy consumption compared to the existing CSMA approach LoRa MAC. Besides, we also propose a modified MCST over the LoRa (mMCST/LoRa) scheme to mitigate the transmission latency further. The simulation results reveal a better performance in terms of throughput, latency and energy consumption, regardless of the frame payload size and the number of nodes in the network.

Security-related data collection is an essential part for attack detection and security measurement in Mobile Ad Hoc Networks (MANETs). A detection node (i.e., collector) should discover available routes to a collection node for data collection and collect security-related data during route discovery for determining reliable routes. However, few studies provide incentives for security-related data collection in MANETs. In this paper, we propose B4SDC, a blockchain system for security-related data collection in MANETs. Through controlling the scale of Route REQuest (RREQ) forwarding in route discovery, the collector can constrain its payment and simultaneously make each forwarder of control information (namely RREQs and Route REPlies, in short RREPs) obtain rewards as much as possible to ensure fairness. At the same time, B4SDC avoids collusion attacks with cooperative receipt reporting, and spoofing attacks by adopting a secure digital signature. Based on a novel Proof-of-Stake consensus mechanism by accumulating stakes through message forwarding, B4SDC not only provides incentives for all participating nodes, but also avoids forking and ensures high efficiency and real decentralization. We analyze B4SDC in terms of incentives and security, and evaluate its performance through simulations. The thorough analysis and experimental results show the efficacy and effectiveness of B4SDC.

Mobile ad hoc networks (MANETs) are now key in today’s new world. They are critically needed in many situations when it is crucial to form a network on the fly while not having the luxury of time or resources to configure devices, build infrastructure, or even have human interventions. Ad hoc networks have many applications. For instance, they can be used in battlefields, education, rescue missions, and many other applications. Such networks are characterized by high mobility, low resources of power, storage, and processing. They are infrastructure-less; this means that they don’t use infrastructure equipment for communication. These networks rely instead on each other for routing and communication. MANETs use a hopping mechanism where each node in a network finds another node within its communication range and use it as a hop for delivering the message through another node and so on. In standard networks, there is dedicated equipment for specific functions such as routers, servers, firewalls, etc., while in ad hoc networks, every node performs multiple functions. For example, the routing function is performed by nodes. Hence, they are more vulnerable to attacks than standard networks. The main goal of this paper is to propose a solution for detecting black hole attacks using anomaly detection based on a support vector machine (SVM). This detection system aims at analyzing the traffic of the network and identifying anomalies by checking node behaviors. In the case of black hole attacks, the attacking nodes have some behavioral characteristics that are different from normal nodes. These characteristics can be effectively detected using our lightweight detection system. To experiment with the effectiveness of this solution, an OMNET++ simulator is used to generate traffic under a black hole attack. The traffic is then classified into malicious and non-malicious based on which the malicious node is identified. The results of the proposed solution showed very high accuracy in detecting black hole attacks.

Microservice platforms have brought many advantages to support the deployment of light-weight applications at both near the edge and data centers. Still, their suitability to support telecommunication and vertical services beyond the network edge is far from being a reality. On one hand, their flat networking approach does not support the establishment of link-layer connectivity among the different components of telecommunication and vertical services (e.g., access points, routers, specific-purpose servers, etc.) due to their reliance on high-level APIs. On the other hand, their networking approach has not been designed to operate over ad hoc networks built by the resource-constrained devices that may be available beyond the network edge. This can lead to suboptimal behaviors for the delivery of data traffic between microservices. This article presents the results of a research collaboration between Universidad Carlos III of Madrid and Telefónica: L2S-M. Our solution provides a programmable data plane that enables the establishment of on-demand link layer connectivity between microservices on ad hoc networks. This solution has the flexibility to execute different algorithms to build traffic paths between microservices, as well as to react against temporary link breakdowns, which could be present in these types of networks. The article presents a proof of concept for a functional validation of L2S-M, using an aerial ad hoc network deployed at 5TONIC Laboratory in collaboration with Telefonica. The validation results showcase the proper operation of L2S-M as a networking service for microservice platforms in ad hoc networks, including its ability to reconfigure the programmable data plane when link disruptions occur. This article has been supported by the TRUE5G (PID2019-108713RB681) project funded by the Spanish National Research Agency (MCIN/AEI/10.13039/5011000110) and by the H2020 FISHY Project (Grant agreement ID: 952644).

R1C2Random geometric graphs can be used in constructing topology formations for wireless ad-hoc networks (WANETs), including wireless sensor networks, flying ad-hoc networks, and others. They are useful for energy-saving schemes where a randomly alternating subset of deployed nodes is turned off temporarily (without compromising the network connectivity). This also improves network security by periodically re-routing the data flow, which makes it harder for third parties to run a traffic analysis. In the area and target coverage scenarios, a WANET deployment is desired to have maximal area coverage efficiency, which implies covering the largest possible area using the fewest number of nodes by maintaining the connectivity as well. Although deterministic topology formations offering optimal area coverage are known, a random node deployment method that grants connectivity and area coverage maximality has not been presented, to the best of our knowledge. This study introduces a novel topology formation method, called CoRMAC, that consistently yields tree-formed random geometric graphs that are guaranteed to be connected and offer maximal area coverage for any given area size and node cardinality. The area coverage maximality of CoRMAC is formally proven. Extensive theoretical and computational analyses have been provided to demonstrate its graph-theoretic, Euclidean, and networking features. Moreover, comparisons were made with other approaches to show the effectiveness of the proposed method. IEEE

Medium access control (MAC) protocols in ad hoc networks have evolved from single-channel independent transmission mechanisms to multi-channel concurrent mechanisms to efficiently manage the demands placed on modern networks. The primary aim of this study is to compare the performance of popular multi-channel MAC (MMAC) protocols under saturated network traffic conditions and propose improvements to the protocols under these conditions. A novel, dynamically adaptive MMAC protocol was devised to take advantage of the performance capabilities of the evaluated protocols in changing wireless ad hoc network conditions. A simulation of the familiar MAC protocols was developed based on a validated simulation of the IEEE 802.11 standard. Further, the behaviors and performances of these protocols are compared against the proposed MMAC protocols with a varying number of ad hoc stations and concurrent wireless channels in terms of throughput, Jain’s fairness index, and channel access delay. The results show that the proposed MMAC protocol, labeled E-SA-MMAC, outperforms the existing protocols in throughput by up to 11.9% under a constrained number of channels and in channel access delays by up to 18.3%. It can be asserted from these observations that the proposed approach provides performance benefits against its peers under saturated traffic conditions and other factors, such as the number of available wireless channels, and is suitable for dynamic ad hoc network deployments.

The object of research is the military radio communication system. Effective operation of routing protocols is possible only if there is reliable information about the network topology for network nodes, given that the mobility of individual nodes is insignificant in special purpose wireless networks. Because nodes in the network demonstrate the mobility property of the node groups. This paper solves the problem of the analysis (decomposition) of methods of protocols efficiency increase of dynamic routing in telecommunication networks with a possibility to self-organization. In the course of the research, the authors used the main provisions of the queuing theory, the theory of automation, the theory of complex technical systems and general scientific methods of cognition, namely analysis and synthesis. This research analyzes various methods to increase the efficiency of dynamic routing protocols. Energy efficiency methods focus on three main components in energy management: battery management, transmission energy management and system energy management methods. Reliable multicast has become indispensable for the successful deployment of special purpose wireless networks, such as in tactical military operations and emergency operations. The results of the research will be useful in: –development of new routing algorithms; –substantiation of recommendations for improving the efficiency of the route selection process in networks with the possibility of self-organization; –analysis of the electronic situation during hostilities (operations); –while creating promising technologies to increase the efficiency of mobile radio networks. Areas of further research will focus on the development of a methodology for the operational management of interference protection of intelligent military radio communication systems.

The object of research is the military radio communication system. Effective operation of routing protocols is possible only if there is reliable information about the network topology for each of the network nodes. Construction of special purpose radio networks with the possibility of self-organization is possible only in the presence of adequate and reliable models of their work in different applications and the impact nature. It necessitates the development of new and adequate algorithms (methods, techniques) for modeling routing algorithms in special purpose radio networks with the possibility of self-organization. This work solves the problem of developing a simulation model of a mobile radio network for special purposes with the possibility of self-organization. In the course of the research, the authors used the main provisions of the queuing theory, the theory of automation, the theory of complex technical systems and general scientific methods of cognition, namely analysis and synthesis. This simulation model was developed to assess the effectiveness and adequacy of the developed scientific and methodological apparatus for routing management in special purpose radio networks with the possibility of self-organization. The research results will be useful in: ‒development of new routing algorithms; ‒substantiation of recommendations for improving the efficiency of the route selection process in networks with the possibility of self-organization; ‒analysis of the electronic situation during hostilities (operations); ‒while creating promising technologies to increase the efficiency of mobile radio networks; ‒assessment of adequacy, reliability, sensitivity of routing algorithms; ‒ development of new and improvement of existing simulation routing models. Areas of further research will focus on the development of a methodology for the operational management of interference protection of intelligent military radio communication systems.

Ad Hoc networks have been widely used in emergency communication tasks. For dynamic characteristics of Ad Hoc networks, problems of node energy limited and unbalanced energy consumption during deployment, we propose a strategy based on game theory and deep reinforcement learning (GDR) to improve the balance of network capabilities and enhance the autonomy of the network topology. The model uses game theory to generate an adaptive topology, adjusts its power according to the average life of the node, helps the node with the shortest life to decrease the power, and prolongs the survival time of the entire network. When the state of the node changes, reinforcement learning is used to automatically generate routing policies to improve the average end-to-end latency of the network. Experiments show that, under the condition of ensuring connectivity, GDR has smaller residual energy variance, longer network lifetime, and lower network delay. The delay of the GDR model is 10.5% higher than that of existing methods on average.

The object of research is the military radio communication system.One of the problems in improving the effectiveness of military radio communication systems is the correct description of the movement process in them.Efficient routing protocols are only possible if reliable information on network topology for network nodes is available.Thus, with this information, packets can be forwarded correctly between the sender and the recipient.Given that the mobility of individual nodes is insignificant in special wireless networks, nodes in the network show the mobility properties of a group of nodes.This observation is directly related to the very existence of military wireless networks with the ability to organize themselves, that is, to support group cooperation and group activities.In this work the problem of analysis (decomposition) of the mobility models of military radio communication networks with the possibility of self-organization is solved.The classification of mobility patterns, the description of individual mobility models and the analysis of various aspects currently available, as well as those properties lacking in the attempt to simulate the movement of individual nodes, have been carried out.During the research, the analysis of random, semi-deterministic and deterministic models was carried out.The advantages and disadvantages of the above models have been identified. In the course of the research, the authors of the work used the main principles of the theory of mass service, the theory of automation, the theory of complex technical systems, as well as general scientific methods of knowledge, namely analysis and synthesis. The research results will be useful in: ‒synthesis of mathematical models of node mobility; ‒evaluation of the effectiveness of the science-based tool for assessing the mobility of nodes; ‒validation of recommendations to improve the efficiency of mobile radio networks; ‒analysis of the radio-electronic situation during the conduct of military operations (operations); ‒creating advanced technologies to improve the efficiency of mobile radio networks.

Routing is a crucial component in the design of Flying Ad-Hoc Networks (FANETs). State of the art routing solutions exploit the position of Unmanned Aerial Vehicles (UAVs) and their mobility information to determine the existence of links between them, but this information is often unreliable, as the topology of FANETs can change quickly and unpredictably. In order to improve the tracking performance, the uncertainty introduced by imperfect measurements and tracking algorithms needs to be accounted for in the routing. Another important element to consider is beamforming, which can reduce interference, but requires accurate channel and position information to work. In this work, we present the Beam Aware Stochastic Multihop Routing for FANETs (BA-SMURF), a Software-Defined Networking (SDN) routing scheme that takes into account the positioning uncertainty and beamforming design to find the most reliable routes in a FANET. Our simulation results show that joint consideration of the beamforming and routing can provide a 5% throughput improvement with respect to the state of the art., This project has received funding from the European Union's Horizon 2020 research and innovation program under the Marie SklodowskaCurie Grant agreement No. 813999. The work of A. Pastore and X. Mestre was supported by Grant RTI2018-099722-B-I00 funded by MCIN/AEI/10.13039/501100011033 and by "ERDF A way of making Europe". The author affiliations and emails are as follows: © 2022, IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other work.

The communication infrastructure is most likely to be damaged after a major disaster occurred, which would lead to further chaos in the disaster stricken area. Modern rescue activities heavily rely on the wireless communications, such as safety status report, disrupted area monitoring, evacuation instruction, rescue coordination, etc. Large amount of data generated from victims, sensors and responders must be delivered and processed in a fast and reliable way, even when the normal communication infrastructure is degraded or destroyed. To this end, reconstructing the post-disaster network by deploying MDRU (Movable and Deployable Resource Unit) and relay unit at edge is a very promising solution. However, the optimal wireless access control in this heterogeneous hastily formed network is extremely challenging, due to the frequent varying environment and the lack of statistics information in advance in post-disaster scenarios. In this paper, we propose a learning based wireless access control approach for edge-aided disaster response network. More specifically, we model the wireless access control procedure as a discrete-time single agent Markov decision process, and solve the problem by exploiting deep reinforcement learning technique. By extensive simulation results, we show that the proposed mechanism significantly outperforms the baseline schemes in terms of delay and packet drop rate.

Emerging surveillance applications of UAV teams rely on secure communication to exchange information, coordinate their movements, and fulfill mission objectives. Protecting the network by identifying malicious nodes that are trying to disturb the system is an important task, particularly in the military domain. This paper presents the design and evaluation of UAVouch, an identity and location validation scheme that combines a public-key based authentication mechanism with a movement plausibility check for groups of UAVs. The key idea of UAVouch is to supplement the authentication mechanism by periodically checking the plausibility of the locations of neighboring UAVs, allowing the detection of intruders that are unable to follow expected trajectories. The proposed solution was evaluated in a simulated military surveillance scenario in which it detected malicious nodes position falsification attacks with an average accuracy of above 85%. Funding Agencies|Knowledge Foundation (KKS); Swedish Innovation Agency [Verket For Innovationssystem (VINNOVA)]; Excellence Center Linkoping-Lund in Information Technology (ELLIIT) Strategic Research Network; Coordenacao de Aperfeicoamento de Pessoal de Nivel Superior-Brazil (CAPES)Coordenacao de Aperfeicoamento de Pessoal de Nivel Superior (CAPES) [001]; Conselho Nacional de Desenvolvimento Cientifico e Tecnologico-Brazil (CNPq)Conselho Nacional de Desenvolvimento Cientifico e Tecnologico (CNPQ) [309505/2020-8, 420109/2018-8]

Drone technology is developing very rapidly. Flying devices accomplishing various applications are becoming an integral part of our daily life undoubtedly. Drones are characterized by extreme mobility, decent computing power, scalability, and a very short lifetime due to energy constraints. The rise of drones inevitably enabled swarms and drone networking applications. Drone networks is a path-breaking subclass of flying ad-hoc networks with unique capabilities and specific requirements. One very important challenge with swarms is the device authentication problem, in other words, proving the identity of a single or a group of drones that request to join the swarm. In this paper, we tackle this emerging problem and propose a novel context-aware mutual authentication protocol. The proposed protocol provides authentication for groups of drones and supports recovering a swarm in case of network separation. Likewise, the protocol can handle drone joins and leaves. Moreover, the protocol is not dependent on network infrastructure, secure storage, and secure channels. We tested the protocol using an automated formal security protocol verification tool, called Scyther. The tests resulted in the complete verification of the authentication and secrecy claims for arbitrary network instances and all defined use-cases. The protocol is also shown to have proven performance advantages over the existing schemes.

This article aims to theorize and explore the distribution problem in the context of self-organizing open systems when they exhibit social behaviors that can be modeled and formalized, applying the interactive decision theory. In this context, the whole system structure is trying to achieve a stable cooperative state at the same time they aim to satisfy the interests of each individual and reach a certain level of social welfare. We analyze these scenarios evaluating the system stability through a formal analysis of coalitional and non-cooperative games and the notions of collective actions and robustness. We used socially inspired computing to propose a negotiation method that allows the members of the system to cooperate and manage common-pool resources without any central controller or other orchestration forms. The model was evaluated using four quantitative moral metrics through simulation techniques. The result showed how a system influenced by ethical behaviors exhibited higher efficiency, symmetry, and invariance over time.

Generalized area spectral efficiency (GASE) was introduced as a metric to quantify the spectral utilization efficiency of wireless transmissions. Unlike other performance metrics, GASE takes into account the spatial property of wireless transmissions. In this paper, we extend the research on GASE from link level to network level. In particular, we consider a wireless ad-hoc network with Poisson distributed nodes. We take into account the co-channel interference and derive the generic closed-form moment generating function (MGF) expression of aggregate interference in such network. With the interference statistics, we calculate the ergodic capacity, affected area, and GASE of the network over Rayleigh fading channels. Furthermore, we analyze the effect of carrier sense multiple access with collision avoidance (CSMA/CA) mechanism on the GASE performance of such network. Finally, we propose a new cognitive paradigm that allows the secondary transmitters that are located outside the primary affected area to transmit. With this paradigm, we can achieve high ergodic capacity while effectively utilizing the space-spectrum resource of primary network. Besides, through mathematical analysis and numerical examples, we show that GASE provides a new perspective on transmission power selection and secondary network optimization. Natural Sciences and Engineering Research Council of Canada Scopus

CALL FOR BOOK CHAPTERS INTELLIGENT HEALTHCARE SYSTEMS Scopus-indexed, Free of charges, published by CRC Press/Taylor & Francis Keywords: Health 4.0, Internet of Medical Things, Public Health, Disaster Mitigation, Vehicular Communications, Wireless Networks, Wearables, Artificial Intelligence in Healthcare, Cyber-Physical Systems, Smart Designs, Blockchain, Digital Twins, Telemedicine, 5G, Medical Imaging, Cloud Computing. Editor: Vania V. Estrela vania.estrela.phd@ieee.org Federal Fluminense University, RJ, Brazil Book Content Description Information is paramount to the healthcare sector, entailing intense data, medical epidemiologic sets, Internet browsing records, surveys, complex engineering models, and so on via the Cloud. This quest for knowledge prompts the data dimensionality, which calls for more sophisticated and efficient information strategies. Health science and biology are very complex fields fully embedded in information technology, but the associated processes are much too intricate to be faithfully modeled. It is not easy to extract knowledge starting from raw data, and it is also expensive. Artificial intelligence (AI) in healthcare (AIH) has been the primary concern to develop expert systems aimed for diagnostic and decision-making in knowledge acquisition, representation, reasoning, and explanation. Many healthcare facilities (HFs) have data acquisition, monitoring, and storage systems integrated into larger-scale information systems. This vast amount of information and databases stemming from medical applications cause hinder analysis and decision making. Hence, there is a need to develop better tools for accessing/storing/analyzing knowledge while effectively using multimodal data. These necessities become essential in the healthcare realm as decision-making relies on knowledge from multidisciplinary areas. This book intends to provide computational methods for intelligent health data analysis to narrow the gap between data gathering and data comprehension with applications in medicine, health care, biology, pharmacology, and related areas. Intelligent Data Analysis (IDA) expedites healthcare analyses and applications. IDA employs specialized statistical, pattern recognition, machine learning (ML), data abstraction, and visualization tools for analysis of data and discovery of mechanisms that created them. Healthcare data typically involve many records/variables, subtle interactions between entities, or a combination of all factors. Engineering, computing science, and ML empower data analysis tasks. The IDA extracts knowledge from too much data, with a vast amount of variables, data that represents very complex, nonlinear, real-life problems. IDA can help raw data analysis, coping with prediction tasks without knowing the theoretical description of the underlying process, classification tasks of new events, or modeling unknown processes. Classification, prediction, and modeling are the cornerstones brought in by IDA. This book focuses on AIH methods and tools to bridge data gathering and data comprehension. Emphasis will also be given to problem solving within HFs to handle patient records, data warehousing, intelligent alarming, competent monitoring, etc. In medicine, overcoming this gap is particularly crucial since medical decision-making needs comprehension of healthcare data regularities and trends. This book tackles different IDA approaches. Submission Schedule One-page abstract submission: May 20, 2021 Structured Abstract Template in Word Manuscript submission due: May 31, 2021 Manuscript Template in Word Manuscript Template in pdf Review notification with acceptance/rejection: June 30, 2021 Revised paper submission: July 31, 2021 Camera-Ready Submission: August 31, 2021 &nbsp

Vehicular ad hoc network (VANET) is a specialized form of wireless network that is solely intended for collaboration between vehicles. Several studies have shown that standard routing protocols cannot be implemented in VANETs because of their unique characteristics such as their significant count of vehicles on the network and the rapid evolution of the network’s design. Because VANET communication links are broken very frequently, it is necessary to address the routing consistency of these highly dynamic networks. The transmission of VANET data may result in a substantial amount of overhead in the routing process; thus, it is vital to address the issue of overhead to enhance the overall network performance. The proposed protocol named compacted area with effective links (CAEL) is designed to focus on decreasing overhead to achieve an enhancement in PDR performance inside the network. The communication between selected nodes that have been judged to be dependable in terms of geographical location and appropriate existing links between vehicles is focused on achieving this goal. With the inclusion of the reliability factor, it is possible to complete the important step of removing extraneous nodes, with the selection of the trustworthy nodes being made based on the link expiration time during the whole routing procedure. When compared to our previously published protocols, i.e., Dynamic Trilateral Enrollment (DyTE) and Reliable Group of Vehicles (RGoV), the results of the simulations demonstrate that CAEL has achieved an overall improvement in the performance of the network.

This paper presents a solution for building awareness of the electromagnetic situation in cognitive mobile ad hoc networks (MANET) using the cooperative spectrum sensing method. Signal detection is performed using energy detectors with noise level estimation. Based on the evidence theory, the fusion center decides on the particular channel occupancy, which can process incomplete and unambiguous input data. Next, a reinforced machine learning algorithm estimates the usefulness of particular channels for the MANET transmission and creates backup channels list that could be used in case of interferences. Initial simulations were performed using the MATLAB environment, and next an OMNET-based MAENA high fidelity simulator was used. Performed simulations showed a significant increase in sensing efficiency compared to sensing performed using simple data fusion rules.

For many wireless ad-hoc network (WANET) applications, including wireless sensor, robotic, and flying ad-hoc networks, area coverage is a major challenge. This challenge, which may include the number of required nodes, cumulative energy consumption, or total distance travelled, involves covering the largest possible area with the least cost. Whatever the scenario and cost functions, efficiently deploying the nodes throughout their entire missions is an important factor. For larger networks, this can best be performed using proper topology formations that are essentially designated geometric graph patterns. As a network topology formation and node deployment strategy, this study presents a unique tree-formed geometric graph pattern. With any given number of nodes, it guarantees the maximum possible combined area coverage. Considering its graph theory and Euclidean characteristics, the pattern is then described as both algebraic and algorithmic relations. The formation is remarkably scalable because it may include an unlimited number of nodes while ensuring connectivity in a tree topology. In addition to presenting a breakdown of multiple features and attributes, including symmetry and fractality, we will make a comparative analysis with six known regular lattices and a line formation. Our analyses then show that MAX-Tree covers up to twice as much area compared to all other regular lattices of the same node cardinalities while being more robust and reliable than a line formation. MAX-Tree can be extremely beneficial for drone networks, smart industry and agriculture applications, ocean-bed monitoring systems, and many other WANET scenarios.

Previous work has demonstrated the feasibility of Bluetooth Low Energy (BLE) as an alternative technology for data transfers in inter-vehicular communication (IVC) scenarios. Bluetooth 5.x core specifications enhance the trade-off between energy requirements, communication range and flexibility. In this paper, we aim to analyse the potential of Bluetooth 5 features for VANET applications, proposing a connectionless communication system. By means of field experiments, we evaluate long range and 2 × speed features, defining a set of communication scenarios. This allows us to test both Bluetooth 5.x range and application throughput. The evaluation includes experiments of V2I communications carried out under real highway traffic conditions. The experiments conducted demonstrate that communication ranges up to 300 m may be achieved depending on the communications scenario. The results also show how throughput degrades as the distance between devices increases. The results obtained are used to discuss future work, aimed at deeper analysing Bluetooth 5 features for VANET applications, completing the development of our prototype and evaluating VANET connectionless communications with the features included in the latest Bluetooth 5.2 specification.

International audience; In this paper, we investigate and present how to generate application traces of IoT (Internet of Things) Applications in an automated, repeatable and reproducible manner. By using the FIT IoT-Lab large scale testbed and relying on state-of-the-art software engineering techniques, we are able to produce, collect and share artifacts and datasets in an automated way. This makes it easy to track the impact of software updates or changes in the radio environment both on a small scale, e.g. during a single day, and on a large scale, e.g. during several weeks. By providing both the source code for the trace generation as well as the resulting datasets, we hope to reduce the learning curve to develop such applications and encourage reusability as well as pave the way for the replication of our results. While we focus in this work on IoT networks, we believe such an approach could be of used in many other networking domains.

Positions of unmanned aerial vehicles (UAVs) are typically obtained using the global positioning system (GPS). However, in GPS-denied or GPS-degraded environments, ad hoc networks with flying sensor nodes are used for UAV localization. In this study, we propose a novel three-dimensional (3D) localization algorithm for UAVs in flying ad hoc sensor networks. Interacting multiple model probability data association and finite impulse response filters are integrated in our hybrid localization algorithm. The non-line-of-sight condition can be overcome using the proposed algorithm, which is demonstrated through 3D localization simulations based on flying ad hoc networks.

Delay-tolerant networks (DTNs) are networks where there is no immediate connection between the source and the destination. Instead, nodes in these networks use a store–carry–forward method to route traffic. However, approaches that rely on flooding the network with unlimited copies of messages may not be effective if network resources are limited. On the other hand, quota-based approaches are more resource-efficient but can have low delivery rates and high delivery delays. This paper introduces the Enhanced Message Replication Technique (EMRT), which dynamically adjusts the number of message replicas based on a node’s ability to quickly disseminate the message. This decision is based on factors such as current connections, encounter history, buffer size history, time-to-live values, and energy. The EMRT is applied to three different quota-based protocols: Spray and Wait, Encounter-Based Routing (EBR), and the Destination-Based Routing Protocol (DBRP). The simulation results show that applying the EMRT to these protocols improves the delivery ratio, overhead ratio, and latency average. For example, when combined with Spray and Wait, EBR, and DBRP, the delivery probability is improved by 13%, 8%, and 10%, respectively, while the latency average is reduced by 51%, 14%, and 13%, respectively.

Various routing protocols have been proposed for ad hoc networks such as the Internet of Things (IoT). Most of the routing protocols introduced for IoT are specific to applications and networks. In the current literature, it is essential to configure all the network nodes with a single proposed protocol. Moreover, it is also possible for a single IoT network to consist of different kinds of nodes. Two or more IoT networks can also be connected to create a bigger heterogeneous network. Such networks may need various routing protocols with some gateway nodes installed. The role of gateway nodes should not be limited to the interconnection of different nodes. In this paper, a multi-mode hybrid routing mechanism is proposed that can be installed on all or a limited number of nodes in a heterogenous IoT network. The nodes configured with the proposed protocols are termed smart nodes. These nodes can be used to connect multiple IoT networks into one. Furthermore, a game-theory-based model is proposed that is used for intercommunication among the smart nodes to gain optimal efficiency. Various performance matrices are assessed under different network scenarios. The simulation results show that the proposed mechanism outperforms in broader heterogeneous IoT networks with diverse nodes.

This thesis is at the crossroad of verification and synthesis of parameterized concurrent systems. The parameterized model checking problem asks whether a system satisfies a given specification independently of the number of its components, whereas synthesis requires an algorithmic design of protocols for its components so that the specification is satisfied.We study a parameterized model of networks where processes are distributed over an undirected graph, running the same broadcast protocol, and communicating via selective broadcasts of messages. The coverability problem asks whether a given state of the protocol is coverable. We show that for positive instances of the coverability problem in reconfigurable semantics, the size (cutoff) and the length (covering length) of a minimal covering execution is linearly and quadratically bounded, respectively. We introduce loss-on-broadcast semantics, and show similar bounds for the cutoff and the covering length.The interactions between agents can be modelled using games. We introduce and study two different settings of the so-called parameterized concurrent games, a model of concurrent games with arbitrarily many agents. First, we consider a scenario of a distinguished player Eve trying to achieve a goal against arbitrarily many opponents, irrespective of their strategies. We prove the existence of a winning strategy for Eve is decidable, and show tight complexity bounds for reachability objectives. Second, we consider a coalition game where all players collectively try to achieve a common goal. We consider safety objectives and show the existence of a winning coalition strategy is decidable, and prove complexity bounds for the same.; Cette thèse se situe au croisement de la vérification et de la synthèse des systèmes concurrents paramétrés. Le problème de la vérification de modèles paramétrés demande si un système satisfait une spécification donnée indépendamment du nombre de ses composants, alors que la synthèse vise la conception de protocoles pour ses composants afin que la spécification soit satisfaite.Nous étudions un modèle paramétré de réseaux où les processus sont distribués sur un graphe non orienté; ils exécutent le même protocole et communiquent par des diffusions sélectives de messages. Le problème de couverture demande si un état donné du protocole est peut être atteint. Nous montrons que pour les instances positives du problème de couverture, en supposant que la topologie de communication est reconfigurable, la taille et la longueur d'une exécution couvrante minimale sont bornées linéairement et quadratiquement, respectivement. Nous introduisons une sémantique de perte à l'envoi et montrons des bornes similaires pour la taille et la longueur d'une exécution couvrante.Les interactions entre différents agents peuvent être modélisées par des jeux. Nous introduisons et étudions deux cadres de ce que l'on appelle les jeux concurrents paramétrés, un modèle de jeux concurrents avec un nombre arbitraire d'agents. Tout d'abord, nous considérons le scénario où un joueur distingué Eve tente d'atteindre un objectif contre un nombre arbitraire d'adversaires, quelles que soient leurs stratégies. Nous prouvons que l'existence d'une stratégie gagnante pour Eve est décidable, et nous fournissons des bornes de complexité exactes pour ces jeux d'accessibilité. Deuxièmement, nous considérons un jeu de coalition où tous les joueurs essaient collectivement d'atteindre un objectif commun. Dans ce cadre, nous considérons des objectifs de sûreté et montrons que l'existence d'une stratégie de coalition gagnante est décidable, et nous établissons des bornes de complexité pour ce même problème.

The object of research is the military radio communication system. Effective operation of routing protocols is possible only if there is reliable information about the network topology for each of the network nodes. Construction of special purpose radio networks with the possibility of self-organization is possible only in the presence of adequate and reliable models of their work in different applications and the impact nature. It necessitates the development of new and adequate algorithms (methods, techniques) for modeling routing algorithms in special purpose radio networks with the possibility of self-organization. This work solves the problem of developing a simulation model of a mobile radio network for special purposes with the possibility of self-organization. In the course of the research, the authors used the main provisions of the queuing theory, the theory of automation, the theory of complex technical systems and general scientific methods of cognition, namely analysis and synthesis. This simulation model was developed to assess the effectiveness and adequacy of the developed scientific and methodological apparatus for routing management in special purpose radio networks with the possibility of self-organization. The research results will be useful in: ‒ development of new routing algorithms; ‒ substantiation of recommendations for improving the efficiency of the route selection process in networks with the possibility of self-organization; ‒ analysis of the electronic situation during hostilities (operations); ‒ while creating promising technologies to increase the efficiency of mobile radio networks; ‒ assessment of adequacy, reliability, sensitivity of routing algorithms; ‒ development of new and improvement of existing simulation routing models. Areas of further research will focus on the development of a methodology for the operational management of interference protection of intelligent military radio communication systems., Объектом исследования является система военной радиосвязи. Эффективная работа протоколов маршрутизации возможна только при наличии достоверной информации о топологии сети для каждого из узлов сети. Построение радиосетей специального назначения, с возможностью к самоорганизации, возможна только при наличии адекватных и достоверных моделей их работы в различных вариантах применения и характера воздействия. Это обусловливает необходимость разработки новых и адекватных алгоритмов (методов, методик) моделирования алгоритмов маршрутизации в сетях радиосвязи специального назначения с возможностью к самоорганизации. В данной работе решена задача разработка имитационной модели мобильной радиосети специального назначения с возможностью к самоорганизации. В ходе проведенного исследования авторами работы были использованы основные положения теории массового обслуживания, теории автоматизации, теории сложных технических систем, а также общенаучные методы познания, а именно анализа и синтеза. Указанная имитационная модель была разработана для оценки эффективности и адекватности разработанного научно-методического аппарата управления маршрутизацией в радиосетях специального назначения, с возможностью к самоорганизации. Результаты исследования будут полезны при: ‒разработке новых алгоритмов маршрутизации; ‒обосновании рекомендаций по повышению эффективности процесса выбора маршрута в сетях с возможностью к самоорганизации; ‒анализе радиоэлектронной обстановки в ходе ведения боевых действий (операций); ‒при создании перспективных технологий повышения эффективности мобильных радиосетей; ‒оценке адекватности, достоверности, чувствительности алгоритмов маршрутизации; ‒разработке новых и совершенствовании существующих имитационных моделей маршрутизации. Направления дальнейших исследований будут направлены на разработку методологии оперативного управления средствами помехозащищённости интеллектуальных систем военной радиосвязи., Об'єктом дослідження є система військового радіозв’язку. Ефективна робота протоколів маршрутизації можлива лише за умови наявності достовірної інформації про топологію мережі для кожного з вузлів мережі. Побудова радіомереж спеціального призначення, з можливістю до самоорганізації, можлива тільки за наявності адекватних та достовірних моделей їх роботи в різних варіантах застосування та характеру впливу. Це обумовлює необхідність розробки нових та адекватних алгоритмів (методів, методик) моделювання алгоритмів маршрутизації в мережах радіозв’язку спеціального призначення з можливістю до самоорганізації. У даній роботі вирішено завдання розробки імітаційної моделі мобільної радіомережі спеціального призначення з можливістю до самоорганізації. В ході проведеного дослідження авторами роботи були використані основні положення теорії масового обслуговування, теорії автоматизації, теорії складних технічних систем, а також загальнонаукові методи пізнання, а саме аналізу та синтезу. Зазначена імітаційна модель була розроблена для оцінки ефективності та адекватності розробленого науково-методичного апарату управління маршрутизацією в радіомережах спеціального призначення, з можливістю до самоорганізації. Результати дослідження стануть у нагоді при: –розробці нових алгоритмів маршрутизації; –обґрунтуванні рекомендацій щодо підвищення ефективності процесу вибору маршруту в мережах з можливістю до самоорганізації; –аналізі радіоелектронної обстановки в ході ведення бойових дій (операцій); –при створенні перспективних технологій підвищення ефективності мобільних радіомереж; –оцінці адекватності, достовірності, чутливості алгоритмів маршрутизації; –розробці нових та удосконаленні існуючих імітаційних моделей маршрутизації. Напрямки подальших досліджень будуть спрямовані на розробку методології оперативного управління засобами завадозахисту інтелектуальних систем військового радіозв’язку.

The object of research is the military radio communication system. Effective operation of routing protocols is possible only if there is reliable information about the network topology for network nodes, given that the mobility of individual nodes is insignificant in special purpose wireless networks. Because nodes in the network demonstrate the mobility property of the node groups. This paper solves the problem of the analysis (decomposition) of methods of protocols efficiency increase of dynamic routing in telecommunication networks with a possibility to self-organization. In the course of the research, the authors used the main provisions of the queuing theory, the theory of automation, the theory of complex technical systems and general scientific methods of cognition, namely analysis and synthesis. This research analyzes various methods to increase the efficiency of dynamic routing protocols. Energy efficiency methods focus on three main components in energy management: battery management, transmission energy management and system energy management methods. Reliable multicast has become indispensable for the successful deployment of special purpose wireless networks, such as in tactical military operations and emergency operations. The results of the research will be useful in: – development of new routing algorithms; – substantiation of recommendations for improving the efficiency of the route selection process in networks with the possibility of self-organization; – analysis of the electronic situation during hostilities (operations); – while creating promising technologies to increase the efficiency of mobile radio networks. Areas of further research will focus on the development of a methodology for the operational management of interference protection of intelligent military radio communication systems., Объектом исследования является система военной радиосвязи. Эффективная работа протоколов маршрутизации возможна только при наличии достоверной информации о топологии сети для узлов сети, учитывая, что мобильность отдельных узлов имеет незначительное значение в беспроводных сетях специального назначения. Поскольку узлы в сети демонстрируют свойство подвижности группы узлов. В данной работе решена задача анализа (декомпозиции) методов повышения эффективности протоколов динамической маршрутизации в телекоммуникационных сетях с возможностью к самоорганизации. В ходе проведенного исследования авторами работы были использованы основные положения теории массового обслуживания, теории автоматизации, теории сложных технических систем, а также общенаучные методы познания, а именно анализа и синтеза. В этом исследовании проанализированы различные методы повышения эффективности протоколов динамической маршрутизации. Методы повышения энергетической эффективности сосредоточиваются на трех основных составляющих в управлении энергией: управление аккумулятором, управление энергией передачи и методы управления энергией системы. Надежная многоадресная передача стала незаменимой для успешного развертывания беспроводных сетей специального назначения, таких как в тактических военных операциях и чрезвычайных операциях. Результаты исследования будут полезны при: –разработке новых алгоритмов маршрутизации; –обосновании рекомендаций по повышению эффективности процесса выбора маршрута в сетях с возможностью к самоорганизации; –анализе радиоэлектронной обстановки в ходе ведения боевых действий (операций); –при создании перспективных технологий повышения эффективности мобильных радиосетей. Направления дальнейших исследований будут направлены на разработку методологии оперативного управления средствами помехозащиты интеллектуальных систем военной радиосвязи., Об'єктом дослідження є система військового радіозв’язку. Ефективна робота протоколів маршрутизації можлива лише за умови наявності достовірної інформації про топологію мережі для вузлів мережі, враховуючи, що мобільність окремих вузлів має незначне значення в бездротових мережах спеціального призначення. Оскільки вузли в мережі демонструють властивість рухливості групи вузлів. У даній роботі вирішено завдання аналізу (декомпозиції) методів підвищення ефективності протоколів динамічної маршрутизації в телекомунікаційних мережах з можливістю до самоорганізації. В ході проведеного дослідження авторами роботи були використані основні положення теорії масового обслуговування, теорії автоматизації, теорії складних технічних систем, а також загальнонаукові методи пізнання, а саме аналізу та синтезу. У цьому дослідженні проаналізовані різні методи підвищення ефективності протоколів динамічної маршрутизації. Методи підвищення енергетичної ефективності зосереджуються на трьох основних складових в управлінні енергією: управління акумулятором, управління енергією передачі та методи управління енергією системи. Надійна багатоадресна передача стала незамінною для успішного розгортання бездротових мереж спеціального призначення, таких як у тактичних військових операціях та надзвичайних операціях. Результати дослідження стануть у нагоді при: –розробці нових алгоритмів маршрутизації; –обґрунтуванні рекомендацій щодо підвищення ефективності процесу вибору маршруту в мережах з можливістю до самоорганізації; –аналізі радіоелектронної обстановки в ході ведення бойових дій (операцій); –при створенні перспективних технологій підвищення ефективності мобільних радіомереж. Напрямки подальших досліджень будуть спрямовані на розробку методології оперативного управління засобами завадозахисту інтелектуальних систем військового радіозв’язку.

Orientador: Paulo Cardieri Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e Computação Resumo: As redes de sensores sem fio têm merecido atenção especial nos últimos anos graças às suas características intrínsecas que as tornam atrativas em diversas aplicações, como em atividades industriais, de monitoramento de meio ambientes e segurança, entre outros. As mesmas características que tornam atrativas as redes de sensores sem fio fazem a análise do seu desempenho dificultoso. Diversos conceitos de medida da capacidade de redes ad hoc em geral têm sido propostos, incluindo a capacidade de transporte e a eficiência de informação. Nesta dissertação é introduzida uma variação do conceito de eficiência de informação, denominada eficiência de informação agregada, que leva em conta a habilidade da rede em reutilizar o canal de comunicação espacialmente. É apresentada uma análise da eficiência de informação agregada de uma rede de sensores sem fio em diversos cenários, utilizando-se diferentes modelagens da rede sem fio. Os resultados mostram que o meio em que a rede é empregada tem grande importância no seu desempenho, podendo ser decisivo na escolha do esquema de modulação a ser empregado. Também foi observado que transmitir em curtas distâncias é mais vantajoso que transmitir em longas distâncias na maioria dos casos Abstract: Wireless sensor networks have deserved special attention in the last years due to their intrinsic characteristics that become them attractive in various applications, such as in the industrial activities, in the environment monitoring and security, among others. The same characteristics that become the wireless sensor networks attractive make hard the analysis of their performance. Many concepts of measure of capacities of ad hoc networks have been proposed, including the transport capacity and the information efficiency. In this dissertation is introduced a variation of the concept of information efficiency, called aggregated information efficiency, that takes into account the ability of the network in reusing spatially the communication channel. It is presented an analysis of the aggregated information efficiency of a wireless ad hoc network in many scenarios, where are used different models of the wireless network. The results show that the environment where the network is employed has a big importance in its performance, and it can be decisive in the choice of the modulation scheme to be used. Also was observed that to transmit in short distances is better than do it in longer ones in the majority of the cases Mestrado Telecomunicações e Telemática Mestre em Engenharia Elétrica

Routing protocols are responsible for providing reliable communication between the source and destination nodes. The performance of these protocols in the ad hoc network family is influenced by several factors such as mobility model, traffic load, transmission range, and the number of mobile nodes which represents a great issue. Several simulation studies have explored routing protocol with performance parameters, but few relate to various protocols concerning routing and quality of service (QoS) metrics. This paper presents a simulation-based comparison of proactive, reactive, and multipath routing protocols in mobile adhoc networks (MANETs). Specifically, the performance of AODV, DSDV, and AOMDV protocols are evaluated and analyzed in the presence of varying the number of mobile nodes, pause time, and traffic connection numbers. Moreover, Routing and QoS performance metrics such as normalized routing load, routing packet, packet delivery ratio, packet drop, end-to-end delay, and throughput are measured to conduct a performance comparison between three routing protocols. Simulation results indicate that AODV outperforms the DSDV and AOMDV protocols in most of the metrics. AOMDV is better than DSDV in terms of end-to-end delay. DSDV provides lower throughput performance results. Network topology parameters have a slight impact on AODV performance.

Content-Centric Networking (CCN) is now a research hotspot aiming at building up a new network architecture compared with the traditional IP-based, host-centric one. In this paper, after leaning that CCN's content naming and content-based properties make it suitable for fast network organizing in disaster recovery, we propose methods on access point placement and routing to fast connect users in a middle-scale post-disaster scenario model. Our work includes the design of a placement algorithm using graphic union coverage and a CCN routing strategy based on Breadth-First Searching, both extracting the social attributes of user node distribution. We use real-world maps for simulation and carry out comparative analysis with existing Ad Hoc methods under the same experimental conditions. The simulation results show that CCN can bring more efficient routing and robust framework to fulfill the urgent demands of post-disaster recovery.

A flooding algorithm aims to distribute messages to all nodes within the mobile environment. In a simple flooding scheme, every node broadcasts a newly received message. However, this simple mechanism generates massive redundant messages, which is referred to as the broadcast storm problem. To ease the negative effect of the broadcast storm problem, we proposed a novel scheme, Probabilistic Second-chance broadcasting with/without Global positioning system information (PSG) in wireless ad hoc networks, which amalgamates the merits of probability-based and location-based flooding algorithms. PSG eases the broadcast storm problem by reducing the total number of transmissions and does not require hello messages from neighboring nodes, yet achieves better results than Multipoint Relaying Flooding (MPR), a neighbor-knowledge-based flooding scheme, by accurately determining whether subsequent forwarding is advantageous while a node receives a broadcasting message. We also discuss the advantages of a two-phase/second-time algorithm and utilize a simplified topology to further explain and demonstrate the merits of second-time broadcasting. We compare our PSG scheme with the simple flooding scheme, the probabilistic schemes with different pre-assigned probabilities, and the MPR schemes with or without the overhead of hello messages. The simulation results show that our scheme demands fewer forwarding nodes to rebroadcast messages and therefore lowers the total number of transmissions. PSG scales down a large number of collisions and attains high delivery ratios compared to other flooding algorithms.

Over the recent years, the proliferation of smart devices and their applications has led to a rapid evolution of the concept of the Internet of Things (IoT), advancing large scale machine type networks which are characterized by sporadic transmissions of short packets. In contrast to typical communication models and in order to capture a realistic IoT environment, we study an asynchronous channel access performed by a primary ad hoc network underlaid with a cognitive secondary wireless-powered ad hoc network. Specifically, we consider that the primary transmitters are connected to the power grid and employ asynchronous transmissions. On the other hand, the cognitive secondary transmitters have radio frequency energy harvesting capabilities, and their asynchronous channel access is established based on certain energy and interference based criteria. We model this sporadic channel traffic with time-space Poisson point processes and by using tools from stochastic geometry, we provide an analytical framework for the performance of this asynchronous system. In particular, we provide closed-form expressions for the information coverage probability and the spatial throughput for both networks and we derive the meta distribution of the signal-to-interference-plus-noise ratio. Finally, we present numerical results and provide important insights behind the main system parameters., IEEE Transactions on Cognitive Communications and Networking (accepted for publication)

The messages in vehicular ad hoc networks (VANET) are vulnerable to attack in the open wireless environment. Group communication in VANET is receiving more attention, which confronts many security issues. First, only users who have passed legal authentication can communicate in the group. The ring signature is an effective solution. In addition, the group membership in the vehicular self-organising network changes rapidly, which leads to dynamic adjustment of group members. It is necessary to consider the computing power and communication capability of each node in the group members. To speed up the authentication process, a roadside unit with more computing power and communication capability than vehicles is selected as the signature agent, which effectively reduces the computational load of vehicles and accelerates the communication throughput. Meanwhile, the computational task and communication overhead have not been well-solved. To address these issues, this paper proposed an efficient proxy ring signature scheme for VANET to achieve higher signature efficiency and lower transmission overhead. The scheme allows both privacy protection and original signer tracing. Security analysis shows that the proposed scheme meets the security requirements of VANET.

Mobile Ad hoc Networks (MANETs) are intended to work without a fixed framework and provide dependable interchanges to ground vehicles, boats, airplanes, or people and structure a self-mending process that will empower persistent correspondences in any event, when at least one of its nodes are debilitated or briefly expelled from the system. Notwithstanding, MANETs demonstrate themselves to be progressively harder to create for enormous systems with hundreds or thousands more nodes than initially envisioned. In our proposed technique, the node switches its communication mode depending on the connectivity of the adjacent nodes. The transmission power of each node will be calculated with the help of two major scenarios i.e., tree scenario and zone scenario. The autonomous clustering of the nodes among the tree and the zone scenario will be channelized by a comparison of the transmission power (residual energy) among the nodes. The inter and the intra communication of the node is also discussed in the paper. The result will be carried out by the simulation work in various perspectives, such as checking the percentage level of malicious nodes, traffic density, transmission power, and the longevity of nodes.

The object of research is the military radio communication system. One of the problems in improving the effectiveness of military radio communication systems is the correct description of the movement process in them. Efficient routing protocols are only possible if reliable information on network topology for network nodes is available. Thus, with this information, packets can be forwarded correctly between the sender and the recipient. Given that the mobility of individual nodes is insignificant in special wireless networks, nodes in the network show the mobility properties of a group of nodes. This observation is directly related to the very existence of military wireless networks with the ability to organize themselves, that is, to support group cooperation and group activities. In this work the problem of analysis (decomposition) of the mobility models of military radio communication networks with the possibility of self-organization is solved. The classification of mobility patterns, the description of individual mobility models and the analysis of various aspects currently available, as well as those properties lacking in the attempt to simulate the movement of individual nodes, have been carried out. During the research, the analysis of random, semi-deterministic and deterministic models was carried out. The advantages and disadvantages of the above models have been identified. In the course of the research, the authors of the work used the main principles of the theory of mass service, the theory of automation, the theory of complex technical systems, as well as general scientific methods of knowledge, namely analysis and synthesis. The research results will be useful in: ‒ synthesis of mathematical models of node mobility; ‒ evaluation of the effectiveness of the science-based tool for assessing the mobility of nodes; ‒ validation of recommendations to improve the efficiency of mobile radio networks; ‒ analysis of the radio-electronic situation during the conduct of military operations (operations); ‒ creating advanced technologies to improve the efficiency of mobile radio networks., Объектом исследования является система военной радиосвязи. Одним из проблемных мест в части повышения эффективности систем военной радиосвязи является корректное описание процесса движения в них. Эффективная работа протоколов маршрутизации возможна только при наличии достоверной информации о топологии сети для узлов сети. Таким образом, с этой информацией пакеты могут быть перенаправлены корректно между отправителем и получателем. Учитывая, что мобильность отдельных узлов имеет незначительное значение в беспроводных сетях специального назначения, поскольку узлы в сети демонстрируют свойство подвижности группы узлов. Это наблюдение непосредственно связано с самим существованием беспроводных сетей военного назначения с возможностью к самоорганизации, то есть для поддержки групповой сотрудничества и групповой деятельности. В данной работе решена задача анализа (декомпозиции) моделей мобильности сетей военной радиосвязи с возможностью к самоорганизации. Проведена классификация моделей мобильности, описание отдельных моделей мобильности и проанализированы различные имеющиеся на сегодняшний день аспекты, а также те свойства, которых не хватает при попытке моделировать движение отдельных узлов. В ходе исследования проведен анализ случайных, полудетерминованных и детерминированных моделей. Определены преимущества и недостатки перечисленных выше моделей. В ходе проведенного исследования были использованы основные положения теории массового обслуживания, теории автоматизации, теории сложных технических систем, а также общенаучные методы познания, а именно анализа и синтеза. Результаты исследования будут полезны при: ‒синтезе математических моделей мобильности узлов ‒оценке эффективности научно-методического аппарата оценки мобильности узлов; ‒обосновании рекомендаций по повышению эффективности мобильных радиосетей; ‒анализе радиоэлектронной обстановки в ходе ведения боевых действий (операций); ‒при создании перспективных технологий повышения эффективности мобильных радиосетей., Об'єктом дослідження є система військового радіозв’язку. Одним з проблемних місць в частині підвищення ефективності систем військового радіозв’язку є коректний опис процесу руху в них. Ефективна робота протоколів маршрутизації можлива лише за умови наявності достовірної інформації про топологію мережі для вузлів мережі. Таким чином, з цією інформацією пакети можуть бути перенаправлені коректно між відправником та одержувачем. Враховуючи, що мобільність окремих вузлів має незначне значення в бездротових мережах спеціального призначення, оскільки вузли в мережі демонструють властивість рухливості групи вузлів. Це спостереження безпосередньо пов'язане з самим існуванням бездротових мереж військового призначення з можливістю до самоорганізації, тобто для підтримки групової співпраці та групової діяльності. У даній роботі вирішено завдання аналізу (декомпозиції) моделей мобільності мереж військового радіозв’язку з можливістю до самоорганізації. Проведено класифікацію моделей мобільності, опис окремих моделей мобільності та проаналізовано різні наявні на сьогоднішній день аспекти, а також ті властивості, яких бракує при спробі моделювати рух окремих вузлів. Під час дослідження проведено аналіз випадкових, напівдетермінованих та детермінованих моделей. Визначено переваги та недоліки перелічених вище моделей. В ході проведеного дослідження були використані основні положення теорії масового обслуговування, теорії автоматизації, теорії складних технічних систем, а також загальнонаукові методи пізнання, а саме аналізу та синтезу. Результати дослідження стануть у нагоді при: –синтезі математичних моделей мобільності вузлів; –оцінці ефективності науково-методичного апарату оцінки мобільності вузлів; –обґрунтуванні рекомендацій щодо підвищення ефективності мобільних радіомереж; –аналізі радіоелектронної обстановки в ході ведення бойових дій (операцій); –при створенні перспективних технологій підвищення ефективності мобільних радіомереж.

Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector(AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes.

Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet delivery.

Use of game theory and mechanism design in cloud security is a well-studied topic. When applicable, it has the advantages of being efficient and simple compared to cryptography alone. Most analyses consider two-party settings, or multi-party settings where coalitions are not allowed. However, many cloud security problems that we face are in the multi-party setting and the involved parties can almost freely collaborate with each other. To formalize the study of disincentivizing coalitions from deviating strategies, a well-known definition named k-resiliency has been proposed by Abraham et al. (ACM PODC '06). Since its proposal, k-resiliency and related definitions are used extensively for mechanism design. However, in this work we observe the shortcoming of k-resiliency. That is, although this definition is secure, it is too strict to use for many cases and rule out secure mechanisms as insecure. To overcome this issue, we propose a new definition named ?.,""-repellence against the presence of a single coalition to replace k-resiliency. Our definition incorporates transferable utility in game theory as it is realistic in many distributed and multi-party computing settings. We also propose m-stability definition against the presence of multiple coalitions, which is inspired by threshold security in cryptography. We then show the advantages of our novel definitions on three mechanisms, none of which were previously analyzed against coalitions: incentivized cloud computation, forwarding data packages in ad hoc networks, and connectivity in ad hoc networks. Regarding the former, our concepts improve the proposal by Küpçü (IEEE TDSC '17), by ensuring a coalition-proof mechanism., Scientific and Technological Research Council of Turkey (TÜBİTAK)

This book collects the proceedings of the International Congress on Health Sciences and Medical Technologies (ICHSMT), held in Tlemcen, Algeria, from December 5 to 7, 2019. The proceedings present a forum for the latest projects and research in scientific and technological development with an emphasis on smart healthcare system design and future technologies. ICHSMT brings together researchers, students, and professionals from the healthcare, corporate, and academic sectors. It includes a far-reaching program supported by a variety of technical tracks that seek to promote medical technologies and innovation at a nationwide level. Presents the proceedings of the International Congress on Health Sciences and Medical Technologies (ICHSMT 2019) Offers technology-driven solutions to overcome obstacles in the research and development of medical technologies Includes multidisciplinary society sectors and knowledge reflecting a humanistic and inclusive approach to medical technology&nbsp

Topology control, consisting of construction and maintenance phases, is a crucial conception for wireless ad-hoc networks of any type, expressly the wireless sensor networks. Topology maintenance, the latter phase, concerns several problems, such as optimizing the energy consumption, increasing the data rate, making clusters, and sustaining the connectivity. A disconnected network, among other strategies, can efficiently be connected again using a Movement-based Connectivity Restoration (MCR) method, where a commensurate number of nodes move (or are moved) to the desired positions. However, finding an optimal route for the nodes to be moved can be a formidable problem. As a matter of fact, this paper presents details regarding a direct proof of the NP-Completeness of the MCR Problem by a reduction from the well-studied Steiner Tree Problem with the Minimum number of Steiner Points and Bounded Edge Length. © 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.

With the emergence of new technologies and standards for wireless communications and an increase in application and user requirements, the number and density of deployed wireless ad hoc networks is increasing. For deterministic ad hoc networks, Time-Division Multiple Access (TDMA) is a popular medium access scheme, with many distributed TDMA scheduling algorithms being proposed. However, with increasing traffic demands and the number of wireless devices, proposed protocols are facing scalability issues. Besides, these protocols are achieving suboptimal spatial spectrum reuse as a result of the unsolved exposed node problem. Due to a shortage of available spectrum, a shift from fixed spectrum allocation to more dynamic spectrum sharing is anticipated. For dynamic spectrum sharing, improved distributed scheduling protocols are needed to increase spectral efficiency and support the coexistence of multiple co-located networks. Hence, in this paper, we propose a dynamic distributed multi-channel TDMA (DDMC-TDMA) slot management protocol based on control messages exchanged between one-hop network neighbors and execution of slot allocation and removal procedures between sender and receiver nodes. DDMC-TDMA is a topology-agnostic slot management protocol suitable for large-scale and high-density ad hoc networks. The performance of DDMC-TDMA has been evaluated for various topologies and scenarios in the ns-3 simulator. Simulation results indicate that DDMC-TDMA offers near-optimal spectrum utilization by solving both hidden and exposed node problems. Moreover, it proves to be a highly scalable protocol, showing no performance degradation for large-scale and high-density networks and achieving coexistence with unknown wireless networks operating in the same wireless domain.

Vehicular Ad hoc Networks (VANETs) become a very crucial addition in the Intelligent Transportation System (ITS). It is challenging for a VANET system to provide security services and parallelly maintain high throughput by utilizing limited resources. To overcome these challenges, we propose a blockchain-based Secured Cluster-based MAC (SCB-MAC) protocol. The nearby vehicles heading towards the same direction will form a cluster and each of the clusters has its blockchain to store and distribute the safety messages. The message which contains emergency information and requires Strict Delay Requirement (SDR) for transmission are called safety messages (SM). Cluster Members (CMs) sign SMs with their private keys while sending them to the blockchain to confirm authentication, integrity, and confidentiality of the message. A Certificate Authority (CA) is responsible for physical verification, key generation, and privacy preservation of the vehicles. We implemented a test scenario as proof of concept and tested the safety message transmission (SMT) protocol in a real-world platform. Computational and storage overhead analysis shows that the proposed protocol for SMT implements security, authentication, integrity, robustness, non-repudiation, etc. while maintaining the SDR. Messages that are less important compared to the SMs are called non-safety messages (NSM) and vehicles use RTS/CTS mechanism for NSM transmission. Numerical studies show that the proposed NSM transmission method maintains 6 times more throughput, 2 times less delay and 125% less Packet Dropping Rate (PDR) than traditional MAC protocols. These results prove that the proposed protocol outperforms the traditional MAC protocols.

In this study, Internet of Things (IoT) based firing zone monitoring and firefighter surveillance system (IoT-FFM) is developed with IEEE 802.15.6 standard and Ad hoc On-Demand Distance Vector (AODV) routing protocol. Fireground coordinates, fire temperature, and gas type in the environment are collected, and also, respiration rate, heart rate, pulse oximeter of the firefighter, and nearest firefighter number are gathered with the proposed IoT-FFM wireless communication system. The gathered data are saved in InfluxDB database with Node-RED programming tool and monitored in real-time with Grafana monitoring system at the remote control center. End-to-end delay, throughput, and energy consumption parameters are considered for performance evaluation of the IoT-FFM. The Nakagami channel model is used for a more realistic wireless environment and compared with the Free Path Loss model. Thanks to the IoT-FFM, the health conditions of firefighters can be kept under control, and information about the fire zone can be mapped, and the fire can be intervened appropriately. WOS:000597216600067 2-s2.0-85097714002

Two-ray ground reflection model has been widely used as the propagation model to investigate the performance of an ad hoc network. But two-ray model is too simple to represent a real world network. A more realistic model namely shadowing propagation model has been used in this investigation. Under shadowing propagation model, a mobile node may receive a packet at a signal level that is below a required threshold level. This low signal level affects the routing protocol as well as the medium access control protocol of a network. An analytical model has been presented in this paper to investigate the shadowing effects on the network performance. The analytical model has been verified via simulation results. Simulation results show that the performance of a network becomes very poor if shadowing propagation model is used in compare to the simple two-ray model. Two solutions have also been proposed in this paper to overcome the effects of shadowing. One solution is a physical layer solution and the other one is a Medium Access Control (MAC) layer solution. Simulation results show that these two solutions reduce the shadowing effect and improve network performance., 16 Pages

Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Non- mobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet delivery.