Network

High-precision indoor positioning is essential for various applications, such as the Internet of Things, robotics, and smart manufacturing, requiring accuracy better than 1 m. Conventional indoor positioning methods, like Wi-Fi or Bluetooth fingerprinting, typically provide low accuracy within a range of several meters, while techniques such as laser or visual odometry often require fusion with absolute positioning methods. Ultra-wideband (UWB) and Wi-Fi Round-Trip Time (RTT) are emerging radio positioning technologies supported by industry leaders like Apple and Google, respectively, both capable of achieving high-precision indoor positioning. This paper offers a comprehensive survey of UWB and Wi-Fi positioning, beginning with an overview of UWB and Wi-Fi RTT ranging, followed by an explanation of the fundamental principles of UWB and Wi-Fi RTT-based geometric positioning. Additionally, it compares the strengths and limitations of UWB and Wi-Fi RTT technologies and reviews advanced studies that address practical challenges in UWB and Wi-Fi RTT positioning, such as accuracy, reliability, continuity, and base station coordinate calibration issues. These challenges are primarily addressed through a multi-sensor fusion approach that integrates relative and absolute positioning. Finally, this paper highlights future directions for the development of UWB- and Wi-Fi RTT-based indoor positioning technologies. Full article

Currently, more studies are focusing on traffic classification in software-defined networks (SDNs). Accurate classification and selecting the appropriate controller have benefited from the application of machine learning (ML) in practice. In this research, we study different classification models to see which one best classifies the generated dataset and goes on to be implemented for real-time classification. In our case, the classification and regression tree (CART) classifier produces the best classification results for the generated dataset, and logistic regression is also considerable. Based on the evaluation of various algorithmic outputs for the training and validation datasets, and also when execution time is taken into account, the CART is found to be the best algorithm. While testing the impact of load balancing in a multi-controller SDN environment, in different load case scenarios, we observe network performance parameters like bit rate, packet rate, and jitter. Here, the use of traffic classification-based load balancing improves the bit rate as well as the packet rate of traffic flow on a network and thus considerably enhances throughput. Finally, the reduction in jitter while increasing the controllers confirms the improvement in QoS in a balanced multi-controller SDN environment. Full article

Edge computing has emerged as a critical technology for meeting the needs of latency-sensitive applications and reducing network congestion. This goal is achieved mainly by distributing computational resources closer to end users and away from traditional data centers. Optimizing the utilization of limited edge cloud resources and improving the performance of edge computing systems requires efficient resource-management techniques. In this paper, we primarily discuss the use of simulation tools—EdgeSimPy in particular—to assess edge cloud resource management methods. We give a summary of the main difficulties in managing a limited pool of resources in edge cloud computing, and we go over how simulation programs like EdgeSimPy work and evaluate resource management algorithms. The scenarios we consider for this evaluation involve edge computing while taking into account variables like user location, resource availability, and network structure. We evaluate four resource management algorithms in a fixed, simulated edge computing environment to determine their performance regarding their CPU usage, memory usage, disk usage, power consumption, and latency performance metrics to determine which method performs better in a fixed scenario. This allows us to determine the optimal algorithm for tasks that prioritize minimal resource use, low latency, or a combination of the two. Furthermore, we outline areas of unfilled research needs and potential paths forward for improving the reliability and realism of edge cloud simulation tools. Full article

Batched network coding (BNC) is a practical realization of random linear network coding (RLNC) designed for reliable network transmission in multi-hop networks with packet loss. By grouping coded packets into batches and restricting the use of RLNC within the same batch, BNC resolves the issue of RLNC that has high computational and storage costs at the intermediate nodes. A simple and common way to apply BNC is to fire and forget the recoded packets at the intermediate nodes, as BNC can act as an erasure code for data recovery. Due to the finiteness of batch size, the recoding strategy is a critical design that affects the throughput, the storage requirements, and the computational cost of BNC. The gain of the recoding strategy can be enhanced with the aid of a feedback mechanism, however the utilization and development of this mechanism is not yet standardized. In this paper, we investigate a multi-phase recoding mechanism for BNC. In each phase, recoding depends on the amount of innovative information remained at the current node after the transmission of the previous phases was completed. Relevant information can be obtained via hop-by-hop feedback; then, a more precise recoding scheme that allocates networking resources can be established. Unlike hop-by-hop retransmission schemes, the reception status of individual packets does not need to be known and packets to be sent in the next phase may not be the lost packets in the previous phase. Further, due to the loss-tolerance feature of BNC, it is unnecessary to pass all innovative information to the next node. This study illustrates that multi-phase recoding can significantly boost the throughput and reduce the decoding time as compared with the traditional single-phase recoding approach This opens a new window in developing better strategies for designing BNC rather than sending more batches in a blind manner. Full article

This paper presents an advanced framework for securing 6G communication by integrating deep learning and physical layer security (PLS). The proposed model incorporates multi-stage detection mechanisms to enhance security against various attacks on the 6G air interface. Deep neural networks and a hybrid model are employed for sequential learning to improve classification accuracy and handle complex data patterns. Additionally, spoofing, jamming, and eavesdropping attacks are simulated to refine detection mechanisms. An anomaly detection system is developed to identify unusual signal patterns indicating potential attacks. The results demonstrate that machine learning (ML) and hybrid models outperform conventional approaches, showing improvements of up to 85% in bit error rate (BER) and 24% in accuracy, especially under attack conditions. This research contributes to the advancement of secure 6G communication systems, offering details on effective defence mechanisms against physical layer attacks. Full article

It is well known that simulation tools are essential for the design and optimization of wireless communication systems. This paper proposes a Python script that can be used for planning and predicting a connection link budget by analyzing its basic parameters. Our proposal consists of an application that calculates the connection budget for point-to-point links operating at 5 GHz and 11 GHz, taking into account all the necessary microwave parameters. For validating the efficiency of the proposed tool, this paper presents comprehensive simulation results derived from comparing our tool to a couple of other simulation tools by means of calculating the same parameters. Full article

Advancements in blockchain technology and network technology are bringing in a new era in electronic voting systems. These systems are characterized by enhanced security, efficiency, and accessibility. In this paper, we compose a comparative analysis of blockchain-based electronic voting (e-voting) systems using blockchain technology, cryptographic techniques, counting methods, and security requirements. The core of the analysis involves a detailed examination of blockchain-based electronic voting systems, focusing on the variations in architecture, cryptographic techniques, vote counting methods, and security. We also introduce a novel blockchain-based e-voting system, which integrates advanced methodologies, including the Borda count and Condorcet method, into e-voting systems for improved accuracy and representation in vote tallying. The system’s design features a flexible and amendable blockchain structure, ensuring robustness and security. Practical implementation on a Raspberry Pi 3 Model B+ demonstrates the system’s feasibility and adaptability in diverse environments. Our study of the evolution of e-voting systems and the incorporation of blockchain technology contributes to the development of secure, transparent, and efficient solutions for modern democratic governance. Full article

This paper tackles the challenge of secure and reliable data transmission in diamond network configurations featuring two untrusted relays with low-security clearance. We propose an innovative approach that employs lossy-decode and -forward relaying at these untrusted relays to boost transmission reliability while safeguarding the source information from potential eavesdroppers. An essential contribution of this work is the introduction of the reliable and secure probability (RSP) metric. This metric assesses the likelihood of the destination successfully retrieving the original information while maintaining its confidentiality from untrusted relays. Our analysis shows that the integration of cooperative jamming signals markedly enhances the RSP, resulting in superior security and reliability. Simulation results confirm that optimal power distribution among the source, relays, and destination further maximizes the RSP. These findings underscore the effectiveness of our proposed scheme in ensuring secure and reliable communication in environments with untrusted relays, suggesting its potential as a robust solution for secure communications in diamond network configurations. Full article

Internet of Vehicles applications are known to be critical and time-sensitive. The value proposition of edge computing comprises its lower latency, advantageous bandwidth consumption, privacy, management, efficiency of treatments, and mobility, which aim to improve vehicular and traffic services. Successful stories have been observed between IoV and edge computing to support smooth mobility and the use of local resources. However, vehicle travel, especially due to high-speed movement and intersections, can result in IoV devices losing connection and/or processing with high latency. This paper proposes a Cluster Collaboration Vehicular Edge Computing (CCVEC) framework that aims to guarantee and enhance the connectivity between vehicle sensors and the cloud by utilizing the edge computing paradigm in the middle. The objectives are achieved by utilizing the cluster management strategies deployed between cloud and edge computing servers. The framework is implemented in OpenStack cloud servers and evaluated by measuring the throughput, latency, and memory parameters in two different scenarios. The results obtained show promising indications in terms of latency (approximately 390 ms of the ideal status) and throughput (30 kB/s) values, and thus appears acceptable in terms of performance as well as memory. Full article

Ensuring high reliability and low latency poses challenges for numerous applications that require rigid performance guarantees, such as industrial automation and autonomous vehicles. Our research primarily concentrates on addressing the real-time requirements of ultra-reliable low-latency communication (URLLC). Specifically, we tackle the challenge of hard delay constraints in real-time transmission systems, overcoming this obstacle through a finite blocklength coding scheme. In the physical layer, we encode randomly arriving packets using a variable-length coding scheme and transmit the encoded symbols by truncated channel inversion over parallel channels. In the network layer, we model the encoding and transmission processes as tandem queues. These queues backlog the data bits waiting to be encoded and the encoded symbols to be transmitted, respectively. This way, we represent the system as a two-dimensional Markov chain. By focusing on instances when the symbol queue is empty, we simplify the Markov chain into a one-dimensional Markov chain, with the packet queue being the system state. This approach allows us to analytically express power consumption and formulate a power minimization problem under hard delay constraints. Finally, we propose a heuristic algorithm to solve the problem and provide an extensive evaluation of the trade-offs between the hard delay constraint and power consumption. Full article

The majority of local IPv6 networks continue to remain insecure and vulnerable to neighbor spoofing attacks. The Secure Neighbor Discovery (SEND) standard and its concomitant Cryptographically Generated Addressing (CGA) scheme were accepted by large standard bodies to codify practical mitigations. SEND and CGA have never seen widespread adoption due to their complexities, obscurity, costs, compatibility issues, and continued lack of mature implementations. In light of their poor adoption, research since their standardization has continued to find new perspectives and proffer new ideas. The orthodox solutions for securing Neighbor Discovery have historically struggled to successfully harmonize three core ideals: simplicity, flexibility, and privacy preservation. This research introduces Voucher-Based Addressing, a low-configuration, low-cost, and high-impact alternative to IPv6 address generation methods. It secures the Neighbor Discovery address resolution process while remaining simple, highly adaptable, indistinguishable, and privacy-focused. Applying a unique concoction of cryptographic key derivation functions, link-layer address binding, and neighbor consensus on the parameters of address generation, the resolved address bindings are verifiable without the need for complex techniques that have hindered the adoption of canonical specifications. Full article

Relaying with network coding forms a basis for a variety of collaborative communication systems. A linear block coding framework for multi-way relaying using network codes introduced in the literature shows great promise for understanding, analyzing, and designing such systems. So far, this technique has been used with low-density parity check (LDPC) codes and belief propagation (BP) decoding. Polar codes have drawn significant interest in recent years because of their low decoding complexity and good performance. Our paper considers the use of polar codes also as network codes with differential binary phase shift keying (DBPSK), bypassing the need for channel state estimation in multi-way selective detect-and-forward (DetF) cooperative relaying. We demonstrate that polar codes are suitable for such applications. The encoding and decoding complexity of such systems for linear block codes is analyzed using maximum likelihood (ML) decoding for LDPC codes with log-BP decoding and polar codes with successive cancellation (SC) as well as successive cancellation list (SCL) decoding. We present Monte-Carlo simulation results for the performance of such a multi-way relaying system, employing polar codes with different lengths and code rates. The results demonstrate a significant performance gain compared to an uncoded scheme. The simulation results show that the error performance of such a system employing polar codes is comparable to LDPC codes with log-BP decoding, while the decoding complexity is much lower. Furthermore, we consider a hard threshold technique at user terminals for determining whether a relay transmits or not. This technique makes the system practical without increasing the complexity and can significantly reduce the degradation from intermittent relay transmissions that is associated with such a multi-way relaying protocol. Full article

To enhance user experiences of reaching destinations in large, complex buildings, we have developed a indoor navigation system using Unity and a smartphone called INSUS. It can reset the user location using a quick response (QR) code to reduce the loss of direction of the user during navigation. However, this approach needs a number of QR code sheets to be prepared in the field, causing extra loads at implementation. In this paper, we propose another reset method to reduce loads by recognizing information of naturally installed signs in the field using object detection and Optical Character Recognition (OCR) technologies. A lot of signs exist in a building, containing texts such as room numbers, room names, and floor numbers. In the proposal, the Sign Image is taken with a smartphone, the sign is detected by YOLOv8, the text inside the sign is recognized by PaddleOCR, and it is compared with each record in the Room Database using Levenshtein distance. For evaluations, we applied the proposal in two buildings in Okayama University, Japan. The results show that YOLOv8 achieved [email protected] $0.995$ and [email protected]:0.95 $0.978$, and PaddleOCR could extract text in the sign image accurately with an averaged CER% lower than 10%. The combination of both YOLOv8 and PaddleOCR decreases the execution time by $6.71s$ compared to the previous method. The results confirmed the effectiveness of the proposal. Full article

Persistent security challenges in Industry 4.0 due to the limited resources of IoT devices necessitate innovative solutions. Addressing this, this study introduces the ASCON algorithm for lightweight authenticated encryption with associated data, enhancing confidentiality, integrity, and authenticity within IoT limitations. By integrating Digital Twins, the framework emphasizes the need for robust security in Industry 4.0, with ASCON ensuring secure data transmission and bolstering system resilience against cyber threats. Practical validation using the MQTT protocol confirms ASCON’s efficacy over AES-GCM, highlighting its potential for enhanced security in Industry 4.0. Future research should focus on optimizing ASCON for microprocessors and developing secure remote access tailored to resource-constrained devices, ensuring adaptability in the digital era. Full article

Delay and Disruption Tolerant Networking (DTN) is a network architecture created basically to overcome non-continuing connectivity. There has been a great deal of research on this topic, from space communication to terrestrial applications. Since there are still many places on earth where there is no means of communication, the focus of this work is on the latest. A systematic literature review (SLR) was performed to know the main issues and advances related to the implementation of DTN for terrestrial and TCP/IP applications, especially in places where telecommunication infrastructure is lacking. The result is a classification of papers based on key aspects, such as architecture, performance, routing, and applications. A matrix of all the papers about these aspects is included to help researchers find the missing piece and concrete terrestrial solutions. The matrix uses three colors, green, yellow, and red according to the focus, either high, medium, or low, so that it is easy to identify specific papers. Full article

Radio Frequency Identification (RFID) technology plays a crucial role in various Internet of Things (IoT) applications, necessitating the integration of RFID systems into dense networks. However, the presence of numerous readers leads to collisions, degrading communication between readers and tags and compromising system performance. To tackle this challenge, researchers have proposed Medium Access Control (MAC) layer protocols employing different channel access methods. In this paper, we present a novel solution, the Distributed Time Slot Anti-Collision protocol (DTS-AC), which employs a new TDMA notification system to address Reader-to-Reader Interference (RRI), while incorporating FDMA-based frequency resource management to resolve Reader-to-Tag Interference (RTI) collision issues. Simulation results demonstrate that DTS-AC significantly improves performance in dense RFID networks by enhancing read rates, with scalability benefits based on the number of readers, channels, and Time Slots (TSs). Moreover, the cost-effectiveness of DTS-AC facilitates efficient deployment in RFID networks, emphasizing considerations of time delay and data sensitivity. Full article

Indoor location services often use Bluetooth low energy (BLE) devices for their low energy consumption and easy implementation. Applications like device monitoring, ranging, and asset tracking utilize the received signal strength (RSS) of the BLE signal to estimate the proximity of a device from the receiver. However, in multipath environments, RSS-based solutions may not provide an accurate estimation. In such environments, receivers with antenna arrays are used to calculate the difference in time of flight (ToF) and therefore calculate the direction of arrival (DoA) of the Bluetooth signal. Other techniques like triangulation have also been used, such as having multiple transmitters or receivers as a network of sensors. To find a lost item, devices like Tile^© use an onboard beeper to notify users of their presence. In this paper, we present a system that uses a single-measurement device and describe the method of measurement to estimate the location of a BLE device using RSS. A BLE device is configured as an Eddystone beacon for periodic transmission of advertising packets with RSS information. We developed a smartphone application to read RSS information from the beacon, designed an algorithm to estimate the DoA, and used the phone’s internal sensors to evaluate the DoA with respect to true north. The proposed measurement method allows for asset tracking by iterative measurements that provide the direction of the beacon and take the user closer at every step. The receiver application is easily deployable on a smartphone, and the algorithm provides direction of the beacon within a 30° range, as suggested by the provided results. Full article

The escalating demand for high-quality video streaming poses a major challenge for communication networks today. Catering to these bandwidth-hungry video streaming services places a huge burden on the limited spectral resources of communication networks, limiting the resources available for other services as well. Large volumes of video traffic can lead to severe network congestion, particularly during live streaming events, which require sending the same content to a large number of users simultaneously. For such applications, multicast transmission can effectively combat network congestion while meeting the demands of all the users by serving groups of users requesting the same content over shared spectral resources. Streaming services can further benefit from multi-connectivity, which allows users to receive content from multiple base stations simultaneously. Integrating multi-connectivity within multicast streaming can improve the system resource utilization while also providing seamless connectivity to multicast users. Toward this end, this work studied the impact of using multi-connectivity (MC) alongside wireless multicast for meeting the resource requirements of video streaming. Our findings show that MC substantially enhances the performance of multicast streaming, particularly benefiting cell-edge users who often experience poor channel conditions. We especially considered the number of users that can be simultaneously served by multi-connected multicast systems. It was observed that about $60\%$ of the users that are left unserved under single-connectivity multicast are successfully served using the same resources by employing multi-connectivity in multicast transmissions. We prove that the optimal resource allocation problem for MC multicast is NP-hard. As a solution, we present a greedy approximation algorithm with an approximation factor of $(1-1/e)$. Furthermore, we establish that no other polynomial-time algorithm can offer a superior approximation. To generate realistic video traffic patterns in our simulations, we made use of traces from actual videos. Our results clearly demonstrate that multi-connectivity leads to significant enhancements in the performance of multicast streaming. Full article