Search

In shaft mining, monitoring the deformation of the roadway due to mining pressure is of great significance to the safe production of coal mines. For this reason, a distributed high-density anchor (cable) support force monitoring system was designed by developing a low-cost anchor (cable) stress monitoring device, which consists of an anchor (cable) stress sensor and a data acquisition device. The whole system consists of an anchor bar (cable) stress monitoring device and a mine roadway deformation monitoring substation. The signals collected by the anchor force sensors are processed by the data acquisition device and sent to the self-developed mine roadway deformation monitoring substation through Long Range Radio (LoRa) wireless communication. All data from the monitoring substation are transmitted to the ground control center in real time via the Message Queuing Telemetry Transport (MQTT) network transmission protocol. The distributed high-density arrangement of monitoring nodes reflects the deformation trend of the whole section of the roadway by monitoring the anchor bar (cable) support force data of multiple sections, which effectively ensures the safety of the roadway. [ABSTRACT FROM AUTHOR]

The intersection of cybersecurity and opportunistic networks has ushered in a new era of innovation in the realm of wireless communications. In an increasingly interconnected world, where seamless data exchange is pivotal for both individual users and organizations, the need for efficient, reliable, and sustainable networking solutions has never been more pressing. Opportunistic networks, characterized by intermittent connectivity and dynamic network conditions, present unique challenges that necessitate innovative approaches for optimal performance and sustainability. This paper introduces a groundbreaking paradigm that integrates the principles of cybersecurity with opportunistic networks. At its core, this study presents a novel routing protocol meticulously designed to significantly outperform existing solutions concerning key metrics such as delivery probability, overhead ratio, and communication delay. Leveraging cybersecurity's inherent strengths, our protocol not only fortifies the network's security posture but also provides a foundation for enhancing efficiency and sustainability in opportunistic networks. The overarching goal of this paper is to address the inherent limitations of conventional opportunistic network protocols. By proposing an innovative routing protocol, we aim to optimize data delivery, minimize overhead, and reduce communication latency. These objectives are crucial for ensuring seamless and timely information exchange, especially in scenarios where traditional networking infrastructures fall short. By large-scale simulations, the new model proves its effectiveness in the different scenarios, especially in terms of message delivery probability, while ensuring reasonable overhead and latency. [ABSTRACT FROM AUTHOR]

Fifth-generation (5G) and beyond networks are expected to serve large numbers of user equipments (UEs). Grant-based random access (RA) protocols are efficient when serving human users, typically with large data volumes to transmit. The strongest user collision resolution (SUCRe) is the first protocol that effectively uses the many antennas at the 5G base station (BS) to improve connectivity performance. In this paper, our proposal involves substituting the retransmission rule of the SUCRe protocol with a neural network (NN) to enhance the identification of the strongest user and resolve collisions in a decentralized manner on the UEs' side. The proposed NN-based procedure is trained offline, admitting different congestion levels of the system, aiming to obtain a single setup able to operate with different numbers of UEs. The numerical results indicate that our method attains substantial connectivity performance improvements compared to other protocols without requiring additional complexity or overhead. In addition, the proposed approach is robust regarding variations in the number of BS antennas and transmission power while improving energy efficiency by requiring fewer attempts on the RA stage. [ABSTRACT FROM AUTHOR]

Originating from the concept of cognitive networks (CNs), which are becoming popular in wireless terrestrial communication scenarios, underwater acoustic cognitive networks (UACNs) are drawing more and more attention in the field of the Internet of Underwater Things (IoUT). However, as the implementation of cognitive mechanisms in underwater acoustic networks is different from that of wireless scenarios, it is impossible or difficult for traditional simulation platforms to carry out simulations of UACNs. There is a lack of specialized simulation tools in terms of UACNs. To enable the quantitative evaluation of the effectiveness and performance enhancement of a UACNs in an adverse underwater environment, a simulation platform of acoustic cognitive networks (SPACNet) was designed and investigated in this article. First, based on a state machine-based protocol programming framework, the SPACNet is capable of supporting the implementation of different state-transform types associated with cognitive networking protocols. Moreover, to facilitate the realization of cognitive function at comprehensive levels of signal, information, and link, an underwater acoustic channel model with an environmental parameter input is integrated in SPACNet to generate underwater environment-driven multiple-aspect behaviors. Moreover, a simplified collision model consisting of an environment factor, channel response, and node location is used to reduce the complexity of the simulation of UACNs signal reception. A simulation was carried out to verify the effectiveness of SPACNet in evaluating the cognitive capabilities of UACNs. Finally, a field UACNs experiment was performed to validate the general consistency between the conclusion obtained with the SPACNet-based simulation and that from the field test. [ABSTRACT FROM AUTHOR]

This paper proposes a MAC protocol for ad hoc networks using In-band Full-duplex (IBFD) wireless communications, which are named as AdHoc-FDMAC. To utilize IBFD communications in ad hoc networks, this protocol modifies a number of control frames in the IEEE 802.11 Distributed Coordination Function (DCF) MAC standard. Here, the detailed time sequences for all types of IBFD communications are shown for the data transmission and routing. In this paper, the probability and throughput equations for IBFD communications in different situations have been derived. The performance of the proposed AdHoc-FDMAC has been analysed in terms of probability, throughput, and routing time. The Maximum throughput of AdHoc-FDMAC has been found to be 48.34 Mbps, and it is compared with a recently published ad hoc MAC as well as with the conventional HD MAC. The AdHoc-FDMAC outperforms the recently published ad hoc MAC and conventional HD MAC by 16.80% and 66.50% throughput gain, respectively. AdHoc-FDMAC incorporates the existing Ad hoc On-demand Distance Vector (AODV) routing protocol, but this AODV routing is utilized here using IBFD communications. This paper also compares the routing time of the IBFD-based AODV with the conventional AODV. The result shows that the IBFD-based AODV requires 33.33% less routing time than that of the conventional AODV for 3-hop distance between the transmitter and receiver. This paper suggests that the AdHoc-FDMAC protocol provides much more throughput in ad hoc networks by utilizing IBFD communications. [ABSTRACT FROM AUTHOR]

In today's world of wireless communication, the prime point of concentration lies on data security. This depends mainly on proper authentication of users who are intended to connect to the network. with modern day technology, the credentials (password), which the legitimate user send to the access points for his/her authorization, can be sniffed and used to enter the system, compromising the system security. WPA2/PSK (Wireless Protected Access/Pre-Shared Key) has a vulnerability which allows an attacker to perform Man-in-the-middle attack by capturing the handshake sent by the legitimate user for authentication. The captured handshake can be used to recover the password using dictionary attack or can be brute forced. To overcome the short comings of the current system, the proposed method uses Frequency Hopping Technique to secure the MIC(Message Integrity Code) before transmitting it. This method reduces the possibility of brute forcing the password, even if the handshake is captured. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is being deployed to provide smart solutions for buildings, logistics, hospitals, and many more. It is growing with billions of connected devices. However, with such tremendous growth, maintenance and support are the hidden burdens. The devices deployed for IoT generally have a light microcontroller, low-power, low memory, and lightweight software. The software, which includes firmware and applications, can be managed remotely via a wireless connection. This improves flexibility, installation time, accessibility, effectiveness, and cost. The firmware can be updated constantly to remove known bugs and improve the functionality of the device. This work presents an approach to update firmware over-the-air (OTA) for constrained IoT devices. We used Narrowband IoT (NB-IoT) as the wireless communication standard to communicate between the managing server and devices. NB-IoT is one of the most promising low power wide area (LPWA) network protocols that supports more than 50k devices within a cell using a licensed spectrum. This work is a proof of concept demonstrating the usage of NB-IoT to update firmware for constrained devices. We also calculated the overall power consumption and latency for different sizes of the firmware. [ABSTRACT FROM AUTHOR]

• Automated mechanism for configuring node radio parameters at run-time. • Distributed mechanism, primarily on nodes, reduces communication overhead. • Responds dynamically to both internal and external changes in network environment. • Supports multiple application requirements simultaneously. Advanced wireless communication technologies are leading towards large-scale, geographically distributed systems, which consist of thousands of co-existing devices with potentially conflicting application requirements, such as high data delivery ratio and low power consumption. At the same time, devices are challenged by varying environmental conditions, which can also lead to degradation in network performance. To ensure the overall network performance and service stability offered by individual devices, the devices must co-exist and adapt to changes in their surrounding environment. In this paper, an application-aware adaptive method is proposed to allow individual devices to dynamically and automatically decide and configure its communication parameters according to its application requirements and environmental conditions. The algorithm aims to enhance and maintain the network performance over time, while allowing every device to satisfy its application requirements. The algorithm is realised on the modern LoRaWAN network protocol. Simulated experiments confirm the proposed algorithm's ability to adapt to changing application requirements at runtime while maintaining network performance. They demonstrate an improvement in packet delivery ratio, energy consumption, and the novel ability to respond to an application's individual performance requirements. [ABSTRACT FROM AUTHOR]

In the era of expansion of smart sensing interconnected devices and their growing application in complex systems, the application of wireless communication technology becomes evident. Many wireless technologies are developed to facilitate the growth of systems such as the Internet of Things and Smart Cities. The application of a particular wireless technology in a particular system depends on many factors, such as purpose, requirements, complexity, range, and node deployment. IEEE 802.15.4 is a technical standard that defines the operation of low-rate wireless personal area networks. It is used as the basis for a group of network standards and protocols designed for wireless sensor networks. In this article, the basic features of the emerging IEEE 802.15.4g SUN low-powered wireless network standard, its application scenarios, and performance analyses are presented. [ABSTRACT FROM AUTHOR]

Most existing network communication systems, such as the Internet, are built around the TCP/IP protocol stack. However, TCP/IP cannot effectively support the upcoming network communication systems with more wireless communication links and higher requirements in terms of throughput, latency, and reliability. In this article, we introduce a general network communication protocol design based on batched network coding (BNC), which includes the existing framework as a special case and whose design can be guided by channel coding theory. BNC-based protocols can have significant throughput gain for single-hop or multihop wireless communications and provide better trade-off among throughput, latency and reliability. [ABSTRACT FROM AUTHOR]

The widespread application of wireless communication technology brings great convenience to people, but security and privacy problems also arise. To assess and guarantee the security of wireless networks and user devices, discovering and identifying wireless devices become a foremost task. Currently, effective device identification is still a challenging issue, as device fingerprinting requires huge training datasets and is difficult to expand, and rule-based identification is not accurate and reliable enough. In this paper, we propose WND-Identifier, a universal and extensible framework for the identification of wireless devices, which can generate high-precision device labels (vendor, type, and product model) efficiently without user interaction. We first introduce the concept of device-info-related network protocols. WND-Identifier makes full use of the natural language features in such protocol messages and combines with the device description in the welcome page, thereby utilizing extraction rules to generate concrete device labels. Considering that the device information in the protocol messages may be incomplete or forged, we further take advantage of the application logic independence and stability of the device-info-related protocol, so as to build a multiprotocol text classification model, which maps the device to a known label. We conduct experiments in homes and public networks and present three application scenarios to verify the effectiveness of WND-Identifier. [ABSTRACT FROM AUTHOR]

Low-power wireless communication is a central building block of cyber-physical systems and the Internet of Things. Conventional low-power wireless protocols make avoiding packet collisions a cornerstone design choice. The concept of synchronous transmissions challenges this view. As collisions are not necessarily destructive, under specific circumstances, commodity low-power wireless radios are often able to receive useful information even in the presence of superimposed signals from different transmitters. We survey the growing number of protocols that exploit synchronous transmissions for higher robustness and deficiency as well as unprecedented functionality and versatility compared to conventional designs. The illustration of protocols based on synchronous transmissions is cast in a conceptional framework we establish, with the goal of highlighting differences and similarities among the proposed solutions. We conclude this article with a discussion on open questions and challenges in this research field. [ABSTRACT FROM AUTHOR]

Recently, opportunistic networks (OppNets) are considered as one of the most attractive developments of mobile ad hoc networks that have emerged, thanks to the development of intelligent devices. Owing to the harsh and dynamic topology of these networks, attaining high delivery ratio is a challenging issue. Hence, it is imperative to select which node's attribute must be adjusted to achieve a higher performance in such unpredictable networks. A mutual information‐based weighting scheme (MIWS) that exploits the entropy concept to assess the impact of the nodes' attributes on the network performance was proposed. The weighting procedure aims to figure out the correlative relations between different attributes and delivery ratio performance of the network. The high weight of certain attributes implies a correspondingly high impact in achieving efficient data forwarding. The proposed scheme is proofed conceptually and simulated using the Opportunistic Network Environment simulator. In contrast to previous studies conducted in the context of weight resolution, the proposed approach allows us to address this issue in real‐time stateless non‐social OppNets. Regardless of the deployed routing protocol, experiments show that adjusting nodes' attributes based on the proposed MIWS can improve the performance up to encouraging delivery ratios. [ABSTRACT FROM AUTHOR]

This paper considers a full duplex (FD) cooperative non‐orthogonal multiple access system that employs power splitting relaying (PSR)‐based simultaneous wireless information and power transfer (SWIPT) technique, that is, FD‐PSR‐NOMA system. A single cell network is considered consisting of a base station (BS) and two pre‐paired users, where the near user is configured to act as FD relay to assist the BS for information delivery to the far user. It is assumed that the far user implements maximal ratio combining to combine the direct link signal arriving from the BS and the relayed signal from the near user, to exploit the diversity advantage. Analytical expressions are derived for the outage probabilities of the downlink users, system outage probability, and the throughput of the considered network under imperfect successive interference cancellation (i‐SIC). Analytical expressions are also derived for the outage probabilities and throughput of half duplex (HD) cooperative NOMA system under PSR‐based SWIPT, that is, HD‐PSR‐NOMA system. Further, the asymptotic outage probabilities and diversity orders are derived as well. The optimal power allocation factors at the BS that minimize the system outage probabilities of FD/HD‐PSR‐NOMA networks are determined. Extensive simulation results are provided to corroborate the analytical findings. [ABSTRACT FROM AUTHOR]

In view of the security threats posed inside and outside the network due to the weaknesses of network protocols and systems, power line and wireless converged communications have security problems in communication connections that appear in environments where heterogeneous networks overlap. In order to cope with the problems of network delay and data transmission security in smart grid, this paper proposes an online monitoring security protection method based on edge nodes, which manages user trust under the premise of not leaking grid user data, and establishes a personalized machine learning model. This method not only guarantees users a secure communication experience, but also ensures users' real-time network connection and content acquisition, and can obtain a fast and personalized user experience. [ABSTRACT FROM AUTHOR]

Machine-to-machine (M2M) communication devices communicate and exchange information with each other in an independent manner to perform necessary tasks. The machine communicates with another machine over a wireless network. Wireless communication opens up the environment to huge vulnerabilities, making it very easy for hackers to gain access to sensitive information and carry out malicious actions. This paper proposes an M2M communication system through the internet in Tele-Robotics and provides network performance security. Tele-robotic systems are designed for surgery, treatment and diagnostics to be conducted across short or long distances while utilizing wireless communication networks. The systems also provide a low delay and secure communication system for the tele-robotics community and data security. The system can perform tasks autonomously and intelligently, minimizing the burden on medical staff and improving the quality and system performance of patient care. In the medical field, surgeons and patients are located at different places and connected through public networks. So the design of a medical sensor node network with LEACH protocol for secure and reliable communication ensures through the attack and without attack performance. Finally, the simulation results show low delay and reliable secure network transmission. [ABSTRACT FROM AUTHOR]

Researches in wireless mobile ad hoc networks have an inherent challenge of vulnerable diagnosis due to the diverse behaviour pattern of the vulnerable nodes causing heterogeneous vtype1, vtype2, vtupe3 and vtype4 faults. This paper proposes a protocol for the diagnosis of vulnerability nodes with threephases of clustering, vulnerable detection and vulnerable fault classification in wireless networks. This protocol employs the technique of probabilistic neural network for classification of vulnerable nodes and detects vulnerable nodes through timeout mechanism and vtype3, vtype4, vtype1, vtype2 nodes through the method of analysis variance. Network simulator NS-2.3.35 is employed for performance evaluation of the protocol. [ABSTRACT FROM AUTHOR]

As the use of mobile devices and methods of wireless connectivity continue to increase, seamless mobility becomes more desirable and important. The current IETF Mobile IP standard relies on additional network entities for mobility management, can have poor performance, and has seen little deployment in real networks. We present a host-based mobility solution with a true end-to-end architecture using the Identifier-Locator Network Protocol (ILNP). We show how the TCP code in the Linux kernel can be extended allowing legacy TCP applications that use the standard C sockets API to operate over ILNP without requiring changes or recompilation. Our direct testbed performance comparison shows that ILNP provides better host mobility support than Mobile IPv6 in terms of session continuity, packet loss, and handoff delay for TCP. [ABSTRACT FROM AUTHOR]

Abstract 1 1 Video demonstrations and a video presentation providing a summary of the paper can be found at https://goo.gl/EDvxhk. Low-cost Unmanned Aerial Vehicles (UAVs), also known as drones, are increasingly gaining interest for enabling novel commercial and civil Internet-of-Things (IoT) applications. However, there are still open challenges that restrain their real-world deployment. First, drones typically have limited wireless communication ranges with the ground stations preventing their control over large distances. Second, these low-cost aerial platforms have limited computation and energy resources preventing them from running heavy applications onboard. In this paper, we address this gap and we present Dronemap Planner (DP), a service-oriented cloud-based drone management system that controls, monitors and communicates with drones over the Internet. DP allows seamless communication with the drones over the Internet, which enables their control anywhere and anytime without restriction on distance. In addition, DP provides access to cloud computing resources for drones to offload heavy computations. It virtualizes the access to drones through Web services (SOAP and REST), schedules their missions, and promotes collaboration between drones. DP supports two communication protocols: (i.) the MAVLink protocol, which is a lightweight message marshaling protocol supported by commodities Ardupilot-based drones. (ii.) the ROSLink protocol, which is a communication protocol that we developed to integrate Robot Operating System (ROS)-enabled robots into the IoT. We present several applications and proof-of-concepts that were developed using DP. We demonstrate the effectiveness of DP through a performance evaluation study using a real drone for a real-time tracking application. [ABSTRACT FROM AUTHOR]

Abstract In this paper, we present a finite-block-length comparison between the orthogonal multiple access (OMA) scheme and the non-orthogonal multiple access (NOMA) for the uplink channel. First, we consider the Gaussian channel, and derive the closed form expressions for the rate and outage probability. Then, we extend our results to the quasi-static Rayleigh fading channel. Our analysis is based on the recent results on the characterization of the maximum coding rate at finite block-length and finite block-error probability. The overall system throughput is evaluated as a function of the number of information bits, channel uses and power. We find what would be the respective values of these different parameters that would enable throughput maximization. Furthermore, we analyze the system performance in terms of reliability and throughput when applying the type-I ARQ protocol with limited number of retransmissions. The throughput and outage probability are evaluated for different blocklengths and number of information bits. Our analysis reveals that there is a trade-off between reliability and throughput in the ARQ. While increasing the number of retransmissions boosts reliability by minimizing the probability of reception error, it results in more delay which decreases the throughput. Nevertheless, the results show that NOMA always outperforms OMA in terms of throughput, reliability and latency regardless of the users priority or the number of retransmissions in both Gaussian and fading channels. [ABSTRACT FROM AUTHOR]

Abstract In a globalized world, the mobile user roams frequently from one place to other. Global mobility network provides roaming services to a mobile user when the mobile user is away from his home network and wants to avail the services of the foreign network. Roaming authentication protocol supports authentication between the mobile user and the foreign server in global mobility network so that the malicious user can not get access the roaming services in the foreign network. Moreover, privacy-preserving authentication between the mobile user and the foreign server is an essential technology for the secure access of global mobility network because mobile user's privacy protection has become a major issue due to increasingly misuse of consumer's private data by various organizations and individuals. Many privacy-preserving two-factor authentication protocols have been proposed to provide secure roaming services in global mobility network but they failed to support privacy and security while ensuring efficient typo detection by the smart card. We propose a privacy-preserving secure two-factor authentication protocol for roaming service in global mobility network which not only ensures the privacy of the mobile user but also provides efficient typo detection using fuzzy verifier and honeyword technique. Moreover, the proposed protocol overcomes the problem of desynchronization attack using public key encryption technique based on quadratic residue assumption with low computational load at the mobile user. [ABSTRACT FROM AUTHOR]

Underwater wireless sensor networks (UWSNs) will pave the way for a new era of underwater monitoring and actuation applications. The envisioned landscape of UWSN applications will help us learn more about our oceans, as well as about what lies beneath them. They are expected to change the current reality where no more than 5% of the volume of the oceans has been observed by humans. However, to enable large deployments of UWSNs, networking solutions toward efficient and reliable underwater data collection need to be investigated and proposed. In this context, the use of topology control algorithms for a suit-able, autonomous, and on-the-fly organization of the UWSN topology might mitigate the undesired effects of underwater wireless communications and consequently improve the performance of networking services and protocols designed for UWSNs. This article presents and discusses the intrinsic properties, potentials, and current research challenges of topology control in underwater sensor networks. We propose to classify topology control algorithms based on the principal methodology used to change the network topology. They can be categorized in three major groups: power control, wireless interface mode management, and mobility assisted-based techniques. Using the proposed classification, we survey the current state of the art and present an in-depth discussion of topology control solutions designed for UWSNs. [ABSTRACT FROM AUTHOR]

Fuel utilization efficiency and cost reduction are two major goals in designing in-vehicle networks. Aiming to address these two issues, we investigate in-vehicle networking protocols from both wired and wireless perspectives by first presenting representative solutions in each area, then identifying the challenges to current solutions, and finally advocating the use of the automotive Ethernet. Also, we propose a priority-based scheduler for the automotive Ethernet. Our preliminary experiments show that the proposed scheduler is effective and flexible, and thus is applicable to next-generation in-vehicle networks. We hope that further studies in this area can be inspired by our work and will be forthcoming in years to come. [ABSTRACT FROM AUTHOR]

The portfolio of models offered by car manufacturing groups often includes many variants (i.e., different car models and their versions). With such diversity in car models, variant management becomes a formidable task. Thus, there is an effort to keep the variants as close as possible. This simple requirement forms a big challenge in the area of communication protocols. When several vehicle variants use the same signal, it is often required to simultaneously schedule such a signal in all vehicle variants. Furthermore, new vehicle variants are designed incrementally in such a way as to maintain backward compatibility with the older vehicles. Backward compatibility of time-triggered schedules reduces expenses relating to testing and fine-tuning of the components that interact with physical environment (e.g., electromagnetic compatibility issues). As this requirement provides for using the same platform, it simplifies signal traceability and diagnostics, across different vehicle variants, besides simplifying the reuse of components and tools. This paper proposes an efficient and robust heuristic algorithm, which creates the schedules for internal communication of new vehicle variants. The algorithm provides for variant management by ensuring compatibility among the new variants, besides preserving backward compatibility with the preceding vehicle variants. The proposed method can save about 20% of the bandwidth with respect to the schedule common to all variants. Based on the results of the proposed algorithm, the impact of maintaining compatibility among new variants and of preserving backward compatibility with the preceding variants on the scheduling procedure is examined and discussed. Thanks to the execution time of the algorithm, which is less than one second, the network parameters like the frame length and cycle duration are explored to find their best choice concerning the schedule feasibility. Finally, the algorithm is tested on benchmark sets. [ABSTRACT FROM AUTHOR]

Copyright of Information Sciences / Informacijos Mokslai is the property of Vilnius University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Network latency and reliability are becoming critical performance indicators for future mission critical services based on wireless connectivity. In this article we present a portable and low-cost measurement framework for quantifying the endto- end (E2E) latency and reliability of communication systems based on single or multiple links. The proposed framework is tailored for characterization of access diversity mechanisms, for example, multi-connectivity or hybrid access methods, which are expected to be essential for ultra-reliable wireless communications in 4G and 5G networks. An active-probe measurement approach is adopted, consisting of a client that transmits timestamped packets to a server, and vice versa, via one or multiple communication links under test. The setup allows us to measure the one-way latency performance in uplink and downlink separately, and allows fully synchronized measurements of multiple links in parallel to understand the benefits of multi-connectivity mechanisms. Traffic generation is flexible in terms of packet size, transport protocol (TCP or UDP), and inter-arrival time interval of the generated packets, hence being a powerful tool for benchmarking the performance for different application-specific message flows. Special emphasis is put on the tail of the latency distribution, that is, the latency that can be achieved with a certain probability constraint, for example, 99.9 percent or beyond. Given the challenge of measuring such rare events, we measure and validate the stability of the measurement equipment to ensure that the observed performance is not compromised by undesired behavior or malfunction of the equipment. The system has a measurement error below 400 μs with 99.9 percent confidence and below 3.1 ms with 99.999 percent confidence. The capability and applicability of the measurement framework is illustrated by a measurement test of two simultaneous LTE connections that provide robust communications to an aerial drone. [ABSTRACT FROM AUTHOR]

Recent physical-layer designs capable of decoding multi-packet collisions demonstrate great potential for improving the network performance. Current network protocols, however, tailor the traditional physical layer to avoid collisions and thus cannot fully exploit the benefits of concurrent transmission techniques. In this paper, we propose an innovative generic concurrent transmission aware routing design called mShare. The mShare design exploits the benefits of these techniques by scheduling concurrent senders to utilize co-owned receiver(s) in parallel. This design significantly increases the available number of routing choices and thus improves the network performance. To illustrate the versatility of our design, we test mShare in three settings: unicast, opportunistic routing, and data collection (convergecast). The performance of mShare is evaluated with physical testbed experiments running on USRP and simulations. The experimental results show that compared to conventional designs, mShare: 1) improves 277% of the throughput in unicast; 2) saves 78% of transmissions in opportunistic routing; and 3) reduces 70% of the delivery delay in data collection. [ABSTRACT FROM AUTHOR]

Abstract Offloading data traffic from Infrastructure-to-Device (I2D) to Device-to-Device (D2D) communications is a powerful tool for reducing congestion, energy consumption, and spectrum usage of mobile cellular networks. Prior network-level studies on D2D data offloading focus on high level performance metrics as the offloading efficiency , and take into account the radio propagation aspects by using simplistic wireless channel models. In this work, we consider a D2D data offloading protocol tailored to highly dynamic scenarios as vehicular environments, and evaluate its performance focusing on physical layer aspects, like energy consumption and spectral efficiency. In doing this, we take into account more realistic models of the wireless channel, with respect to the simplistic ones generally used in the previous studies. Our objective is twofold: first, to quantify the performance gain of the considered D2D offloading protocol with respect to a classic cellular network, based on I2D communications, in terms of energy consumption and spectral efficiency. Second, to show that using simplistic channel models may prevent to accurately evaluate the performance gain. Additionally, the use of more elaborated models allows to obtain insightful information on relevant system-level parameters settings, which would not be possible to obtain by using simple models. The considered channel models range from widely used models based on deterministic path loss formulas, to more accurate ones, which include effects like multipath fading and the associated frequency selectivity of wideband channels. These models have been proposed and validated, in the recent years, through large-scale measurements campaigns. Our results show that the considered protocol is able to achieve a reduction in the energy consumption of up to 35%, and an increase in the system spectral efficiency of 50%, with respect to the benchmark cellular system. The use of different channel models in evaluating these metrics may result, in the worst case, in a sixfold underestimation of the achieved improvement. [ABSTRACT FROM AUTHOR]

Energy harvesting (EH) combined with cooperative relying plays a promising role in future wireless communication systems. We consider a wireless multiple EH relay system. All relays are assumed to be EH nodes with simultaneous wireless and information transfer (SWIPT) capabilities, which means the relays are wirelessly powered by harvesting energy from the received signal. Each EH node separates the input RF signal into two parts which are, respectively, for EH and information transmission using the power splitting (PS) protocol. In this paper, a closed-form outage probability expression is derived for the cooperative relaying system based on the characteristic function of the system's probability density function (PDF) with only one relay. With the approximation of the outage probability expression, three optimization problems are built to minimize the outage probability under different constraints. We use the Lagrange method and Karush-Kuhn-Tucker (KKT) condition to solve the optimization problems to jointly optimize the relay's PS factors and the transmit power. Numerical results show that our derived expression of the outage probability is accuracy and gives insights into the effect of various system parameters on the performance of protocols. Meanwhile, compared with the no optimal condition, our proposed optimization algorithms can all offer superior performance under different system constraints. [ABSTRACT FROM AUTHOR]

The world of connected devices has led to the rise of the Internet of Things paradigm, where applications rely on multiple devices, gathering and sharing data across highly heterogeneous networks. The variety of possible mechanisms, protocols, and hardware has become a hindrance in the development of architectures capable of addressing the most common IoT use cases, while abstracting services from the underlying communication subsystem. Moreover, the world is moving toward new strict requirements in terms of timeliness and low latency in combination with ultra-high availability and reliability. Thus, future IoT architectures will also have to support the requirements of these cyber-physical applications. In this regard, edge computing has been presented as one of the most promising solutions, relying on the cooperation of nodes by moving services directly to end devices and caching information locally. Therefore, in this article, we propose a modular and scalable architecture based on lightweight virtualization. The provided modularity, combined with the orchestration supplied by Docker, simplifies management and enables distributed deployments, creating a highly dynamic system. Moreover, characteristics such as fault tolerance and system availability are achieved by distributing the application logic across different layers, where failures of devices and micro-services can be masked by this natively redundant architecture, with minimal impact on the overall system performance. Experimental results have validated the implementation of the proposed architecture for on-demand services deployment across different architecture layers. [ABSTRACT FROM AUTHOR]

We propose a Context-aware Smallworld routing protocol for wireless ad-hoc networks which finds efficient routes to the destination nodes often through a very short chain of intermediate nodes, without using any routing table. This protocol exploits the “small-world” phenomenon of social networks where source-destination pairs typically get connected through few intermediate friends and the individuals can collectively discover such short paths. The key idea behind our routing protocol is that for forwarding an incoming packet to the destination, a node picks the next hop from among the one-hop neighbor from its one-hop neighborhood that is closest to the destination, and multiple randomly selected long-distance neighbor(s), i.e., from outside of its one-hop neighborhood, based on which of these neighbors is closest to the destination. The long-distance neighbors are selected by using their contextual information through a probabilistic mapping. We provide the theoretical foundations behind our protocol. This simple but effective algorithm can meet performance objectives for most scenarios by reducing loss and latency. Simulation results, using synthetic network topologies, have demonstrated that the routing performance of context-aware Smallworld is better than geographical (distance-based) Smallworld and other standard proactive routing protocols (e.g., OLSRv2) when metrics, such as packet losses, end-to-end delays, hop-counts, connectivity drops, and control traffic generated, are used as the key performance indicators. We also show that the proposed protocol is resilient to dynamic topology changes. [ABSTRACT FROM AUTHOR]

The rapid urbanisation has transformed cities to the preferential human settlement and allowed cities to quietly witness all range of human activities. As the key enabler in the information and communications technology industry, cellular networks play a decisive role in delivering communication messages and entertainment content. In particular, cellular network operators respond to human initiated service requests by gradually deploying necessary infrastructure and calibrating transmission protocols. Hence, cellular network records encompass the interesting interaction between human-initiated messages and network-triggered responses. In this study, the authors collect the 'big data' in urban cellular networks and try to dig out the human and urban planning properties. Specifically, they focus on the statistical modelling of three representative scenarios like spatial deployment density of base stations, packet length or traffic volume of mobile services, as well as inter-arrival time and dwell time of human mobility. Through extensive data mining, they validate the heavy-tailed feature universally existing in these scenarios. Afterwards, they discuss the implications of this heavy-tailed feature and talk about its fundamental contribution to intelligent resource adjustment, proactive content caching, and enhanced connection management in cellular networks. Finally, they highlight the applications of this feature towards smarter cellular networks and cities. [ABSTRACT FROM AUTHOR]

Runtime validation of wireless protocol implementations cannot always employ direct instrumentation of the device under test (DUT). The DUT may not implement the required instrumentation, or the instrumentation may alter the DUT’s behavior when enabled. Wireless sniffers can monitor the DUT’s behavior without instrumentation, but they introduce new validation challenges. Losses caused by wireless propagation prevent sniffers from perfectly reconstructing the actual DUT packet trace. As a result, accurate validation requires distinguishing between specification deviations that represent implementation errors and those caused by sniffer uncertainty. We present a new approach enabling sniffer-based validation of wireless protocol implementations. Beginning with the original protocol monitor state machine, we automatically and completely encode sniffer uncertainty by selectively adding non-deterministic transitions. We characterize the NP-completeness of the resulting decision problem and provide an exhaustive algorithm for searching over all mutated traces. We also present practical protocol-oblivious heuristics for searching over the most likely mutated traces. We have implemented our framework and show that it can accurately identify implementation errors in the face of uncertainty. [ABSTRACT FROM AUTHOR]

This paper considers a wireless powered communication network, where a multiantenna power beacon (PB) is employed to assist an energy constrained source to establish secure communications with a destination in the presence of multiple eavesdroppers. We propose a two-phase communication protocol termed as accumulate then transmit to enhance network secrecy. In the energy harvesting phase, the PB transfers radio frequency energy to charge the source; then in the information transmission phase, the PB acts as a friendly jammer to protect the source transmission against eavesdropping. We study the dynamic energy state transitions at the source using an energy discretization method and a finite-state Markov chain. Closed-form expressions are derived for connection outage probability, secrecy outage probability, and effective secrecy throughput, with the aim to evaluate both reliability and security of the proposed protocol. Furthermore, numerical results reveal the impacts of various system parameters on the secrecy performance and demonstrate the superior performance of our proposed protocol over an existing scheme. [ABSTRACT FROM AUTHOR]

An opportunistic network is a wireless ad hoc network that has frequently intermittent connectivity due to nodes’ mobility. These spare, unpredictable networks aim to solve the prolonged delay paths by a store-carry-forward scheme. It is difficult to determine the appropriate nodes to forward the messages since there are few opportunistic contacts. The nodes might decide based on the obtained data of the network as a guide to reach a destination. The aforementioned technique is not helpful in case the rate of change in the network topology is higher than the rate of data gathering due to usage restrictions and uncertain available information/knowledge of the future contacts. In this paper, to cope with the challenges imposed by the un-deterministic environment, a risk assessment strategy is considered to evaluate the short and long-term impact of each decision to find the optimal node/paths. This routing scheme can take advantage of the unanticipated connection to make the routing more flexible in short time and with less buffer usage. Our proposed risk assessment algorithms that are based on MALP are mixed with the knowledge about buffer management and network capacity. The prioritized messages to be disseminated as well as better decision to take a risk are the main contributions of this paper. Moreover, the self-adaptive threshold, distributed PID controller, is considered to tackle different threshold levels for each node individually. Numerical results prove that the proposed method drastically increases the delivery ratio and also minimizes the risk of exceeding resource consumption and packet loss. [ABSTRACT FROM AUTHOR]

Mobility management is classified into two parts such as location management and handoff management. The earlier one concentrates on location update whereas the later one manages continuous Internet connectivity while the Mobile Router (MR) changes its single point of attachment to the network. Therefore, frequent movement of the MR is one of the significant characteristics in Network Mobility (NEMO) environment. Because, in accordance with the standard Network Mobility Basic Support Protocol (NEMO BSP), the MR utilizes single Interface to attach to the access link. MR requires changing its Care of Address (CoA) when it moves among different wireless access networks. As a result, it can directly influence the performance of the mobility management protocols during inter technology handoff of multi-interfaced MR. This paper proposed a multi-interfaced fast handoff scheme in Proxy NEMO (PNEMO) environment. After that, it represents a comparative analysis between the proposed multiinterfaced scheme, NEMO BSP and the PNEMO scheme respectively. The performance disparities of these schemes are estimated and analyzed via both numerical and simulation approaches. The simulation is performed through NS-3 network simulator. The performance metrics estimated for evaluation are mainly handoff delay and packet loss. It has been perceived that, the proposed scheme performs better compared to the PNEMO scheme and NEMO BSP. [ABSTRACT FROM AUTHOR]

Low-Power Wide-Area Networks (LPWANs) have recently emerged as appealing communication systems in the context of the Internet of Things (IoT). Particularly, they proved effective in typical IoT applications such as environmental monitoring and smart metering. Such networks, however, have a great potential also in the industrial scenario and, hence, in the context of the Industrial Internet of Things (IIoT), which represents a dramatically growing field of application. In this paper we focus on a specific LPWAN, namely, LoRaWAN, and provide an assessment of its performance for typical IIoT employments such as those represented by indoor industrial monitoring applications. In detail, after a general description of LoRaWAN, we discuss how to set some of its parameters in order to achieve the best performance in the considered industrial scenario. Subsequently we present the outcomes of a performance assessment, based on realistic simulations, aimed at evaluating the behavior of LoRaWAN for industrial monitoring applications. Moreover, the paper proposes a comparison with the IEEE 802.15.4 network protocol, which is often adopted in similar application contexts. The obtained results confirm that LoRaWAN can be considered as a strongly viable opportunity, since it is able to provide high reliability and timeliness, while ensuring very low energy consumption. [ABSTRACT FROM AUTHOR]

In vehicle-to-vehicle (V2V) communications, achieving reliable physical layer performance is a challenging task due to the highly dynamic nature of V2V propagation channels. Frame timing estimation, as one of the most critical signal processing procedures that rely on channel statistics, has to be appropriately enhanced to tackle this challenge. This study presents a novel frame timing estimation scheme based on both the available periodical preambles in IEEE 802.11p standard. By designing the fourth-order statistics-based correlation and differential normalisation functions, the proposed timing metric not only is capable of possessing an extensible correlation length, but also achieves the robustness to multipath effect and large carrier frequency offset. From the standpoints of hypothesis testing and classification, the proposed approach can effectively increase the distinction between correct and wrong timing indexes in terms of the class-separability criteria, and consequently has a significantly improved timing estimation performance compared with the existing methods. Simulation results consist with theoretical analysis under the typical V2V channel model, and demonstrate that the proposed method can significantly reduce both the probabilities of false alarm and missed detection, and make the selection of a suitable threshold for frame detection much easier. [ABSTRACT FROM AUTHOR]

To provide a tool for performance evaluation of IEEE 802.15.4 with sleep mode enabled, a novel model based on real time queueing analysis is proposed in this paper. A low-rate wireless personal area network (LR-WPAN), composed of multiple nodes which send packets to the coordinator, is considered. The queueing behaviour of IEEE 802.15.4 node with sleep mode enabled differs from others because the packet arrivals in sleep period accumulate at the beginning of the active period, which makes a heavier load in the beginning than at any other time. This model analyses this behaviour by dividing the active portion of the superframe into backoff slots and then using an embedded discrete-time Markov chain model. The concept of virtual service time is introduced into this model which makes the proposed queueing model novel and different from typical ones. The accuracy of the proposed model is validated by Monte Carlo simulations in existing typical application scenarios, which indicates that the proposed queueing model can accurately evaluate the performance of IEEE 802.15.4 in the context of the application scenarios described in the simulations. [ABSTRACT FROM AUTHOR]

Interconnection has a great importance to provide a high bandwidth communication among parallel systems. On multi-core context, Network-on-Chip is the default intra-chip interconnection choice, providing low contention and high bandwidth between the processing elements. However, the communication outside the chip commonly uses high performance links which have the entire communication protocol stack overhead. This paper introduces the Expansible NoC concept and architecture, which is formed by wired and wireless NoC components in order to provide a low overhead interconnection for intra-chip and inter-chip communication. ENoC couples both networks with the same simplified protocol, enabling the transmission of parallel messages directly in the NoC level. The ability of identifying new communicant on-the-fly increases its flexibility, expanding the system boundaries every time a new system is connected. The ENoC inter-chip wireless link reaches short distances working at 60 GHz with Orthogonal Frequency Division Multiplexing with Quadrature Amplitude Modulation, enabling high bandwidth communication for systems inside a single cluster rack. Experimental evaluations were performed using the Noxim simulator executing computational fluid dynamics benchmark applications. Results show that the proposed architecture improves up to 38% the performance when compared to the newest related work. [ABSTRACT FROM AUTHOR]

Global Mobility Networks(GLOMONETs) in wireless communication permits the global roaming services that enable a user to leverage the mobile services in any foreign country. Technological growth in wireless communication is also accompanied by new security threats and challenges. A threat-proof authentication protocol in wireless communication may overcome the security flaws by allowing only legitimate users to access a particular service. Recently, Lee et al. found Mun et al. scheme vulnerable to different attacks and proposed an advanced secure scheme to overcome the security flaws. However, this article points out that Lee et al. scheme lacks user anonymity, inefficient user authentication, vulnerable to replay and DoS attacks and Lack of local password verification. Furthermore, this article presents a more robust anonymous authentication scheme to handle the threats and challenges found in Lee et al.’s protocol. The proposed protocol is formally verified with an automated tool(ProVerif). The proposed protocol has superior efficiency in comparison to the existing protocols. [ABSTRACT FROM AUTHOR]

A cooperative wireless-powered communication network protocol is proposed, in which user far away from a hybrid access point (H-AP) is capable of harvesting wireless powers by overhearing the uplink signals of users that are relatively nearer to the H-AP, in addition to downlink signal broadcast by the H-AP. In this setting, time allocations for the downlink transmission of the H-AP and the uplink transmission for the users are jointly optimized for two different purposes. First, the weighted sum-rate maximization problem is solved for a given total transmission time. Then, the total transmission time is minimized under a minimum rate constraint, and an efficient algorithm is also presented to solve the optimal solution by a line search strategy. Numerical results demonstrate that the proposed schemes significantly increase the far user's rate, which in turn improves user fairness and transmission delay. [ABSTRACT FROM PUBLISHER]

Efficient and scalable media access control (MAC) protocol design is crucial to guarantee the reliable broadcast of safety messages in vehicular ad hoc networks. To devise a MAC for safety message broadcasting with reliability and minimum delay, in this paper, we propose a novel time slot-sharing MAC, referred to as SS-MAC, which can support diverse periodical broadcasting rates. In specific, we first introduce a circular recording queue to online perceive time slot occupying status. We then design a distributed time slot sharing (DTSS) algorithm and random index first fit (RIFF) algorithm, to efficiently share the time slot and make the online vehicle-slot matching, respectively. We prove theoretically the efficacy of DTSS algorithm, and evaluate the efficiency of RIFF algorithm by using MATLAB simulations. Finally, we conduct extensive simulations considering various driving scenarios and resource conditions to demonstrate the SS-MAC performance. [ABSTRACT FROM PUBLISHER]

In this paper, we study simultaneous wireless information and power transfer (SWIPT) in relay interference channels (ICs), where energy-constrained relays harvest energy from sources’ radio-frequency signals and use the harvested energy to forward the information to destinations. We adopt the power splitting (PS) relay protocol and the interference alignment (IA) technique to jointly realize energy transfer and interference management. We propose two novel transmission schemes for the SWIPT in relay IC networks, namely, one-stage PS IA scheme and two-stage PS IA scheme. For both schemes, we investigate the optimal PS ratios that maximize the network sum rate. We obtain the closed-form optimal PS ratios for the two-stage PS IA scheme and develop a distributed and iterative algorithm to derive the optimal PS ratios for the one-stage PS IA scheme. We further study the optimal design of the IA precoding and decoding matrices. Based on the Grassmann manifold approach, we present an algorithm to obtain the optimal IA matrices for both schemes. The optimality of the designs of both the PS ratios and the IA matrices is then verified by simulations. Our results show that the proposed schemes effectively improve the performance of the network and significantly outperform benchmark schemes. [ABSTRACT FROM PUBLISHER]

The popularization of wireless networks and mobile applications has increased the importance of RFID technologies. However, since wireless networks does not guarantee transmission channel security, putting private user information at risk for unintentional disclosure. Previous research has introduced a security mechanism to provide privacy and authentication. This mechanism is based on quadratic residue, does not require a secure channel and fits EPC Class-1 Gen-2 specifications. However, this mechanism cannot resist replay attacks, and lacks an efficient means of its server is not able to find determining validating values, making it difficult to implement. This paper proposes an improvement scheme that uses virtual IDs and time parameters. It does not need a secure channel, fits EPC Class-1 Gen-2 specifications, is resistant to replay attacks, and can efficiently find validation information. The proposed scheme is applied to mobile devices as a proof of concept for use in wireless/mobile RFID systems. [ABSTRACT FROM AUTHOR]

Over the next few years, the Industrial Wireless Sensor Network (IWSN), which is a major part of the Industrial Object Internet (IIoT), will play a crucial role in transforming the industrial world by opening a new era of economic and competitive growth in the Industrial Revolution known as "Industry 4.0". IIoT is able to help organizations achieve better benefits in industrial manufacturing markets by increasing productivity, reducing costs and developing new services and products. In this paper we present a wireless industrial communication system based on Node-RED platform using Modbus protocol for smart factories. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc network (VANET) is a dedicated network to connect vehicles without any centralized administration or infrastructure. The wireless access in vehicular environments (WAVE) protocol leveraging IEEE 1609/802.11p is widely implemented for VANETs. However, in congested traffic situation, the performance of the WAVE system degrades significantly due to serious collision, especially for safety related broadcast services on the control channel (CCH) interval due to the inherent drawback of its collision avoidance mechanisms called carrier sense multiple access with collision avoidance (CSMA/CA). In this paper, we propose a method that can decrease the number of frame collisions in CCH with a few modifications to the IEEE 802.11p protocol. In the paper, vehicles still employ CSMA/CA to compete for the channel access opportunity. However, by taking advantage of periodicity of synchronization interval, a two-state switching scheme introducing two new inter frame space (IFS) is proposed to reduce the number of competing vehicles substantially and as a result, the collision probability is significantly decreased. The simulation results demonstrate the superiority of the proposed method in packet collision rate. [ABSTRACT FROM AUTHOR]

The Internet of Things is a concept that is increasingly present in our lives. The emergence of intelligent devices has led to a paradigm shift in the way technology interacts with the environment, leading society to a smarter planet. Consequently, new advanced telemetry approaches appear to connect all kinds of devices with each other, with companies, or with other networks, such as the Internet. On the road to an increasingly interconnected world, where critical devices rely on communication networks to provide an essential service, there arises the need to ensure the security and reliability of these protocols and applications. In this paper, we discuss a security-based approach for MQTT (Message Queue Telemetry Transport), which stands out as a very lightweight and widely used messaging and information exchange protocol for IoT (Internet of Things) devices throughout the world. To that end, we propose the creation of a framework that allows for performing a novel, template-based fuzzing technique on the MQTT protocol. The first experimental results showed that performance of the fuzzing technique presented here makes it a good candidate for use in network architectures with low processing power sensors, such as Smart Cities. In addition, the use of this fuzzer in widely used applications that implement MQTT has led to the discovery of several new security flaws not hitherto reported, demonstrating its usefulness as a tool for finding security vulnerabilities. [ABSTRACT FROM AUTHOR]

Aiming at the problems of the WPKI certificate verification schemes based on online certificate status protocol (OCSP), this paper proposes a WPKI certificate verification scheme based on the certificate digest signature-online certificate status protocol (CDS_OCSP). Compared with the existing schemes, the proposed scheme optimizes the number of communication connections between the communication entities and the network, reduces the consumption of the wireless network bandwidth in the certificate verification process, and uses the elliptic curves cipher- (ECC-) based encrypting/decrypting functions to sign and verify the certificate digest, which ensures the consistency of the verified certificates among the communication entities. The proposed scheme makes the certificate verification process more efficient and secure. The experimental results show that the proposed scheme effectively reduces the communication consumption of the wireless network and saves the storage space of the wireless entities. [ABSTRACT FROM AUTHOR]

In this article, we propose a novel networking paradigm called Small-world SSDNet, servicing applications such as public safety, proximity based services, and fog computing based on device-todevice multi-hop wireless communications. The "small-world" feature is determined by the service area, whose size is usually within a community level, and the well known small-world properties existing in SSDNets; the "super-dense" feature comes from the fact that the increased direct communication range and the popularity of 5G and IoT devices jointly result in a large number of devices within a single-hop communication range. This article first formally defines SSDNet. Then the challenges and the opportunities brought by the design and the implementation of the SSDNet protocols and applications are addressed. Finally, the broader discussions on issues relevant to modeling, engineering, and dissemination are provided. [ABSTRACT FROM AUTHOR]