Packet Latency Research Articles

Analysis and Implementation of Raspberry Pi Based Wireless Access Point and User Access Notification Using Telegram

Internet network technology has become a human need in almost every activity. Communities in areas experiencing a lack of fiber optic network infrastructure need a tool to access the internet that can be used together in an affordable and efficient manner. This study tries to provide a solution to these problems. Raspberry Pi-based Wireless Access Point uses a USB modem which functions to build a Wireless Local Area Network. Then, a network quality test is carried out by calculating QoS on network traffic including packet loss, throughput and latency with scenarios based on a distance of 0 meter, 4 meter and 8 meter between the Wireless Access Point and the client by conducting online meetings and video streaming. Furthermore, to make it easier to monitor the Raspberry Pi device that acts as a Wireless Access Point, it will send user information that is connected via the Telegram bot.

Using Pattern of On-Off Routers and Links and Router Delays to Protect Network-on-Chip Intellectual Property

Intellectual Property (IP) reuse is a well known practice in chip design processes. Nowadays, network-on-chips (NoCs) are increasingly used as IP and sold by various vendors to be integrated in a multiprocessor system-on-chip (MPSoC). However, IP reuse exposes the design to IP theft, and an attacker can launch IP stealing attacks against NoC IPs. With the growing adoption of MPSoC, such attacks can result in huge financial losses. In this article, we propose four NoC IP protection techniques using fingerprint embedding: ON-OFF router-based fingerprinting (ORF), ON-OFF link-based fingerprinting (OLF), Router delay-based fingerprinting (RTDF), and Row delay-based fingerprinting (RWDF). ORF and OLF techniques use patterns of ON-OFF routers and links, respectively, while RTDF and RWDF techniques use router delays to embed fingerprints. We show that all of our proposed techniques require much less hardware overhead compared to an existing NoC IP security solution (square spiral routing) and also provide better security from removal and masking attacks. In particular, our proposed techniques require between 40.75% and 48.43% less router area compared to the existing solution. We also show that our solutions do not affect the normal packet latency and hence do not degrade the NoC performance.

Decentralized Dynamic Scheduling of TCPS Flows and a Simulator for Time-sensitive Networking

Cybersickness and control-loop instabilities are two main concerns in Tactile Cyber-Physical Systems (TCPS). TCPS applications demand stringent bounds on end-to-end latencies to avoid their occurrences. Traditional best-effort networks cannot guarantee packet latencies in the presence of external traffic. However, emerging deterministic networks such as IEEE 802.1 Time-Sensitive Networking (TSN) can isolate time-critical flows from external traffic using IEEE 802.1Qbv Time-Aware Shaper (TAS) to guarantee bounded end-to-end packet latencies. In this work, we develop eDDSCH-TSN, a decentralized dynamic scheduling protocol to configure non-overlapping gate slots in TAS-enabled TSN switches to support TCPS flows. eDDSCH-TSN supports plug-and-play operation of compatible TCPS terminals with guaranteed minimal end-to-end packet latencies. Compared to the state-of-the-art, eDDSCH-TSN provides three orders lower end-to-end packet latencies for TCPS flows in mid-size networks with 10 hops between source and destination terminals. Further, we also present PYTSN, an open-source discrete-event TSN simulator that we use for evaluating eDDSCH-TSN. In particular, we use PYTSN to show the isolation of TCPS flows from external traffic and plug-and-play operation of TCPS terminals.

Special issue on International Conference on Computing and Communication Networks

Special issue on International Conference on Computing and Communication Networks

RETRACTED: Optimized shortest path algorithm for on-chip board processor in large scale networks

In this paper, we present TriBA (Triplet based) NoC (network on-chip) architecture with 40 nodes referred as TriBA-NoC. TriBA-NoC is implemented in a multi-core 40 tile DDR-3 hardware. The nodes in the TriBA-NoC are connected through recursive triplets. We carried out the performance analysis in network simulator (NS-3) using several perspectives. We adopted TR-132 shortest routing path algorithm with novel router architecture for TriBA-NoC systems. The results of average packet latency for various patterns of traffic of a 40-core TriBA-NoC model are demonstrated. The results of the proposed 40-core TriBA-NoC model achieved better performances while compared to the TriBA.

PERFORMANCE ANALYSIS OF IEEE 802.15.4 CHANNEL ACCESS MECHANISMS DURING EVENT DETECTIONS IN WIRELESS SENSOR NETWORKS

The IEEE 802.15.4 protocol defines the medium access control layer of Zigbee, a widely implemented WSN technology. This protocol implements both the guaranteed time slot (GTS) scheme, where note request for slot(s) to transmit their packets collision-free and the contention-based scheme where nodes randomly draw a back-off counter to win channel access. This paper analyzes the performance of both schemes in WSNs when an event is detected and the packet arrival rate of the network increases using packet delivery ratio(PDR), network throughput and packet latency as the quality of service parameters. We consider various network densities (4, 9 and 16 nodes within a common transmission range). Simulations using Castalia 3.2 shows the GTS scheme has better PDR and latency than the contention-based scheme in the 4 and 9 nodes network. However, in a dense network (16 nodes), when the packet arrival rate increases, the contention-based scheme outperforms the GTS scheme.

A Traffic Density-Based Congestion Control Method for VANETs

This research presents a vehicle ID-based congestion aware message (CAM) for beacon signals on the vehicle environment. At the MAC protocol of the vehicle environment, enhanced vehicle ID-based analysis model is given first. With the automobile ID embedded in their separate CAMs, the model weights the randomized back-off numbers chosen by cars engaging in the back-off procedure. This leads to identifying a car ID-based randomized back-off code, which reduces the likelihood of a collision due to the identical back-off number. A traffic density based-congestion control algorithm (TDCCA) is suggested in this research. The revised mathematical approach surpasses previous work’s overall packet latency because just one-fourth of the congestion window is employed during the experiment. The research includes a congestion management method that adjusts the rate of CAM transmitted over the host controller to improve the efficiency of the model parameters. The method considers various circumstances, from nonsaturated to substantially saturated networks (in terms of congestion probability) and sparsely dispersed and teemed networks (in the form of vehicular intensity). The technique is run across various automobile ID-based back-off values for high-standard results analysis. The simulation outcomes in terms of packet delivery ratio, energy consumption, delay, success rate, and collision ensure the effectiveness of the TDCCA method. Even at high traffic densities, the automobile ID-based CAM following information method outperforms the typical fixed CAM frequency IEEE 802.11p, according to simulation findings for all back-off figures.

A Novel Hybrid Hexagonal Star Topology for On-Chip Interconnection Networks

Network-on-Chip (NoC) is an emerging and efficient on-chip interconnection network. NoC is expected to be the communication backbone of next-generation Multi-processor System-on-Chip (MPSoC) architectures. Topology is a crucial design aspect of NoC, as it affects the performance of the interconnection network. This paper proposes a novel, scalable, hybrid Hexagonal Star (HS) topology for on-chip interconnection networks. Properties of the proposed topology have been explored and compared with those of Mesh, Torus and Honeycomb Mesh topologies. The performance of the Hexagonal Star topology has been evaluated and compared with that of Mesh topology for different scenarios. The comparative studies of topological properties have indicated that the proposed topology can be a potential choice for on-chip interconnection networks. The simulation results have shown that the proposed topology outperforms Mesh topology in terms of latency for low traffic loads. For different traffic patterns and traffic loads, HS topology has registered a reduction of packet latency ranging from 15% to 50% and from 9% to 23% for 18 nodes and 32 nodes, respectively, compared to Mesh topology.

An Enhanced Software Framework for Improving QoS in IoT

Internet of Things (IoT) and Artificial Intelligence (AI) with its subcomponents are the latest emerging technologies that make our daily lives easier. Quality of Service (QoS) plays a very important role in IoT due to the large number of interconnected nodes. QoS is inversely dependent on the node count, i.e. the increment of nodes causes hampering to QoS, as increasing the number of nodes increases the number of requests to the IoT server. An enhanced framework is strongly needed to control QoS in IoT applications. This study proposes and implements an enhanced framework using Matlab, to control the number of requests. The proposed model can improve QoS parameters like throughput, latency, and packet loss by reducing the number of requests generated by the end nodes without compromising the services to the end user. The results showed that QoS parameters improved in terms of throughput by 5-10%, packet loss by up to 6%, and packet latency by 4%. This model can also be tested in hardware and may provide a better QoS solution.

Using Software-Defined Networking for Data Traffic Control in Smart Cities with WiFi Coverage

The growth of smart cities is fueled by the vast rise in wireless smart gadgets and uninterrupted connectivity. WiFi is the dominant wireless technology, enabling Internet-of-Things (IoT) connectivity in smart cities due to its ubiquitous access points and low deployment cost. However, smart city applications offer a wide range of services with different quality-of-service (QoS) demands. This paper addresses packet delivery latency as one of the QoS metrics affecting many time-sensitive smart city services. Thus, the paper proposes employing software-defined networking (SDN) to control the traffic load of WiFi access points (APs), preserving its symmetry in a city-wide coverage of WiFi-connected IoT gateways or fog nodes. These gateways receive data packets from smart city/IoT devices via wireless links and forward them over a city-deployed WiFi network to their management entities or servers. Three SDN-based algorithms are devised to reduce the gateways’ packet-forwarding delay and keep a symmetric traffic load at the WiFi network APs. The algorithms are developed and tested using a real hardware setup constituting WiFi devices without additional requirements on the IoT gateways (WiFi clients) or the APs, such as support for a specific roaming protocol or bandwidth-consuming signaling such as sending probe packets. Extensive hardware experimentation shows that the SDN controller, via the proposed algorithms, can effectively reduce the packet forwarding latency of IoT gateways by carefully selecting the IoT gateway with the highest packet latency and seamlessly handing it over to the least-loaded covering AP.

Non-line-of-sight outdoor channel identifcation for wireless sensor networks based on impluse radio ultra wide band

Wireless sensor networks (WSN) have become increasingly popular in a variety of fields in recent years. This is due to the development of their capabilities, which include remote environmental monitoring, process automation, telemedicine, and many other domains. Besides, among the widely used modern WSN radio technologies, we find impluse radio ultra wide band (IR-UWB) that is recognized by their advantages regarding low power consumption, low cost, low complexity and high resistance to multipath fading in outdoor wireless networks. Energy consumption minimization, packet delivery ratio improvement and latency minimization are the main objectives in this work. The chosen performance metrics (energy consumption, packet delivery ratio and latency) are justified by the direct impact of these three parameters on the network’s efficiency. Accordingly, we proposed and introduced an outdoor non-line-of-sight (NLOS) packet delivery ratio using broadband radio access network (BRAN) channel to improve WSN’s based on IR-UWB performance in terms of energy consumption, packets delivery ratio (PDR) and latency.

Simulation Test Research on Typical Simulator NS-2 in Urban Vehicle Ad Hoc Network Based on Big Data

Abstract Vehicle ad hoc network (VANET) has gradually become a prominent research topic in the fields of wireless networks and intelligent vehicles. VANETs are unique mobile ad hoc networks with vehicles as their mobile nodes, presenting distinctive performance characteristics compared to traditional wireless self-organizing networks. In recent years, VANETs have gained significant attention in the wireless network and intelligent transportation domain. As an integral aspect of autonomous driving technology, vehicle-to-everything (V2X) communication spans multiple disciplines and is closely related to intelligent transportation, assisted driving, active safety, and smart vehicles. Evaluating VANET protocols and applications in real-world settings can be challenging. Therefore, utilizing simulation tools for VANET research is an effective approach. In this paper, we have designed and developed an optimized platform that uses IEEE 802.11a and IEEE 802.11p protocols for communication within a simulated urban traffic environment created with NS-2. The simulation results confirm the feasibility and rationale of applying the IEEE 802.11p protocol to wireless vehicular ad hoc networks. Within a distance of 300 m, at 0.0000 s, 14 key packets have not arrived in IEEE 802.11a, and 8 packets have not arrived in IEEE 802.11p; at 8.0000 s, 38 key packets have not arrived in IEEE802.11a, and 6 packets have not arrived in IEEE802.11p. Comparing the performance of IEEE 802.11a and IEEE 802.11p, the study concluded that the use of the 802.11p protocol in urban mobile environments can improve reliability and reduce average packet latency.

Experimental evaluation of multi-PHY 6TiSCH networks

The architectural design of Wireless Sensor Networks (WSNs) for the Industrial Internet of Things (IIoT) applications requires the careful planning and selection of an appropriate operational strategy. Harmonization of standards is crucial to ensure easier certification and commercialization of IIoT solutions. The ongoing research activities are directed toward designing agile, reliable, and secure transmission technologies and protocols. Recently, Time Slotted Channel Hopping (TSCH) standardization bodies have started to consider support for multiple physical layers thus accommodating a wide range of applications. This paper presents the results of the extensive experimental measurement campaign to study the performance of the 6TiSCH (IPv6 over the TSCH mode of IEEE 802.15.4e) network while supporting multiple physical layers (PHYs). For measurement purposes, all experiments were performed on OpenMote-B hardware. These devices are equipped with an Atmel AT86RF215 dual radio transceiver implementing IEEE 802.15.4g. The performance evaluation is provided for the following metrics: network formation time, Packet Delivery Ratio (PDR), latency, and duty cycle. Results are encouraging, particularly in terms of high PDR for all tested PHYs. Performance evaluation indicates the importance of proper node positioning, link quality estimation and careful selection of network parameters. Moreover, collected experimental results create a dataset that provides insights into the tested PHYs' performance and their potential for indoor 6TiSCH networking.

EEM-MAC: Enhanced energy efficient mobility aware MAC protocol for mobile internet of things

Mobile wireless sensor networks (MWSNs) have become a foremost solution in many emerging applications both in industry and academia. Moreover, considering the mobile node in WSN is a challenging task to designing efficient communication protocols, specifically at a medium access control (MAC) layer. Most of the existing protocols consider only for static and slow mobility. To meet with future MIoT applications, in this paper we propose Enhanced Energy Efficient Mobility aware MAC (EEM-MAC) protocol. Our EEM-MAC protocol consists of 3 contributions i) static synchronization and mobility handling phase to support both environments, ii) By using queue length-based channel access priority for static nodes, and iii) the combined highest signal strength and node status-based channel access priority for mobile nodes without any control packet overhead. The simulation results verify that EEM-MAC yields a notable improvement in the average power consumption, packet latency, and packet delivery ratio performances against the well-known mobility-aware MAC protocols under different mobility models and environments.

Design and implementation of congestion aware router for network-on-chip

Network-on-Chip (NoC) is the state of the art on-chip interconnection network for packet based communication. NoCs can offer low packet latency, high bandwidth, high throughput with minimum area, better energy efficiency and fault tolerance. Routers are the basic building blocks of the NoCs. In this paper, we present the design of a Congestion Aware Router for NoC which is then implemented using Vivado HLS. The router is then used to develop a scalable NoC based on mesh topology. Using the NoC as a test bed we carry out simulations and estimate performance metrics like latency, waiting time and total packets handled for various configurations of NoC. Provisions to alter parameters like buffer depth, packet size, packet injection interval and traffic are also added. Further, we propose a simple mechanism for detecting congestion at the router. The congestion metric is then used to adapt the XY dimension order routing into a Congestion Aware minimal adaptive X/Y routing strategy with very low hardware overhead. The proposed routing method is compared against conventional XY DOR, GCA routing and RCS based routing algorithms for different parameter variations. The results show that the proposed routing method can reduce packet latency for different traffic patterns at medium packet injection rates.

Full-Duplex Multiple Access Mechanism for Connected Vehicles Operating at Different Autonomous Levels in NR eV2X VANETs

Future connected and autonomous vehicles (CAVs) will operate at different autonomous levels for decades. Therefore, we propose a novel prioritisation scheme according to the autonomous levels of CAVs, and a corresponding multiple access mechanism, to be named full-duplex prioritised scheduling (FDPS) protocol, to enhance the delivery of high-priority packets in future New Radio (NR) enhanced vehicle-to-everything communication (eV2X) vehicular ad hoc networks (VANETs). Comparing to the standardised sensing-based semi-persistent scheduling (SB-SPS) protocol, this paper presents how collision detection is enabled during the broadcast, how collisions are resolved, how the priority of a packet from a colliding CAV is recognised, and how the broadcast of high-priority packets is enhanced. Both protocols are evaluated through mathematical formulations and simulations in terms of average successful packet delivery rate (PDR), collision duration, and latency. Simulation results have firstly validated the mathematical analysis, they have also shown the enhancement of packets delivery in future NR eV2X VANETs when the self-interference suppression (SIS) factor is better than 16%, which is achievable by deploying the existing SIS technologies.

Artificial neural network and symmetric key cryptography based verification protocol for 5G enabled Internet of Things

AbstractDriven by the requirements for entirely low communication latencies, high bandwidths, reliability and capacities, the Fifth Generation (5G) networks has been deployed in a number of countries. One of the most prevalent application scenarios of 5G networks is the Internet of Things (IoT) that can potentially boost convenience and energy savings. However, the information exchanged over the open wireless 5G networks is susceptible to numerous attacks such as malicious modifications. Although many protocols have been developed to protect against these attacks, the provision of optimum security and privacy issues in 5G networks is still an open challenge. This is attributed to the high device density, frequent handovers and resource constrained nature the 5G IoT nodes. In this article, a network selection and authentication protocol that securely verifies the authenticity of all the communicating entities is presented. The network selection is accomplished using Artificial Neural Network (ANN) for increased efficiency. In addition, all the security tokens are independently derived at the end devices without the involvement of any central authority. Formal security analysis based on the Burrows–Abadi–Needham (BAN) logic shows that all the terminals securely authenticate each other before the onset of packet exchanges. In addition, it is shown that this protocol thwarts majority of the conventional 5G attack vectors and is robust under the Dolev–Yao (DY) threat model. Moreover, a comparison with other related schemes shows that the proposed protocol offers many adorable security features at relatively low communication and computation costs. The simulation results show that the deployed ANN yields low packet loss ratio and latency variations.

ReSAW: a reconfigurable and picosecond-synchronized optical data center network based on an AWGR and the WR protocol

The explosive growth of data center (DC) traffic imposes unprecedented challenges on the current electrical switch-based data center networks (DCNs) with the bottleneck of limited bandwidth and high latency. Benefitting from transparency to the data rate and format, optical switching with theoretically infinite bandwidth could overcome the bandwidth bottleneck of electrical switching DCNs. However, DCNs normally deploy multitenant applications with a variety of DC traffic. It is hard to reconfigure the optical interconnections in real-time to provide adaptable bandwidth to the traffic with heterogeneous characteristics. Moreover, to improve the bandwidth utilization, statistical multiplexing is generally deployed in optical DCNs to forward the traffic flow in a time slot, which requires the network time to be precisely synchronized to all network nodes. For fast optical switches with a nanosecond switching configuration time, overall end node times must be synchronized at subnanosecond magnitude. In this paper, we propose and experimentally investigate a reconfigurable and picosecond-synchronized optical DCN (ReSAW) based on an arrayed waveguide grating router (AWGR) and the White Rabbit (WR) protocol. A scheduler based on a distributed field-programmable gate array is implemented in the proposed ReSAW to realize flexible wavelength configuration by controlling the fast laser array based on semiconductor optical amplifiers (SOAs) according to time slot and traffic priority. Moreover, the WR protocol is implemented in optical DCNs for what we believe is the first time to synchronize the time of the distributed top of racks (ToRs). The experimental demonstration validates that ReSAW achieves an average end-to-end latency of 317.44 ns and a precise synchronized time with an average 386 ps skew. When the load is 0.4, the packet loss after ReSAW reconfiguration is less than 1.83 × 10 − 6 , and the network latency is less than 1.73 µs. Based on the experimental parameters and results, the OMNeT++ simulation model is built to further verify the reconfigurability and scalability of the ReSAW network. Results show that the packet loss rate and latency performance increase 8.24% and 12.47%, respectively, at a load of 0.6 as the ReSAW network scales from 2560 to 40,960 servers compared to before the reconfiguration.

A Framework of Deploying Blockchain in Wireless Sensor Networks

The most critical needs for wireless sensor networks (WSNs) are security, privacy, dependability, and autonomy. The networks might be vulnerable to hostile users and harmful usage if these problems are not ensured. Attacks and hazards are higher with centralized WSNs, particularly when data is shared with other businesses and sent between devices. In this paper, a WSN model with integrated blockchain security technology is proposed. Blockchains store the identity of each node. The validation is done by public blockchains and private blockchains. For sensor nodes, the authentication is implemented on the private blockchain. The public blockchain is used to authenticate cluster heads. Performing network attacks can easily be performed by unregistered nodes to access resources in the network. Broadcasting false information on the path of malicious nodes can increase packet latency and reduce packet delivery rate. In this paper, the model recommends the most secure nodes in the network to be used for secure routing. The main purpose is to reduce the attack of hackers from outside the network, improve the efficiency of detecting malicious nodes.

RURAL TELESURGERY NETWORK CHARACTERIZATION FOR FUTURE REMOTE CARDIAC CATHETER ABLATION

BackgroundTelesurgery involves a remote surgeon operating on a patient over distance using the internet to control a surgical robot. Telesurgery could allow rural patients more equitable access to lifesaving specialty procedures such as cardiac catheter ablation. Advances in telehealth adoption and surgical robotics are lowering the conceptual and technical hurdles for this future method of healthcare delivery. Despite this, important questions remain regarding the safe implementation of telesurgery in rural community hospitals. In particular, it is critical to understand the spatial, temporal, and content dependent variations in network performance between urban and rural hospitals. Presently, no one has meaningfully characterized internet performance for telesurgical procedures in rural areas.ObjectiveThe purpose of this research is to measure real-world internet performance and characterize the risk and severity of network disruptions during simulated telesurgeries between urban and rural hospitals over a long duration.MethodsWe developed a python application to generate and receive simulated telesurgery data between an urban center and small servers that are physically located in rural hospital operating rooms (Figure 1). Simulated telesurgeries were performed daily and nightly for 90min at approximately 2 packets per second.ResultsThe packet latency distribution for 108 simulated surgeries (54 daytime; 54 nighttime) is shown in Figure 2. We found that 99.99% of the packets had a network latency of less than 250ms and only 10% of operations had at one or more packets delayed by 250ms or more.ConclusionFigure 2. Network latency vs. percent of packets for all simulated telesurgeriesView Large Image Figure ViewerDownload Hi-res image Download (PPT) BackgroundTelesurgery involves a remote surgeon operating on a patient over distance using the internet to control a surgical robot. Telesurgery could allow rural patients more equitable access to lifesaving specialty procedures such as cardiac catheter ablation. Advances in telehealth adoption and surgical robotics are lowering the conceptual and technical hurdles for this future method of healthcare delivery. Despite this, important questions remain regarding the safe implementation of telesurgery in rural community hospitals. In particular, it is critical to understand the spatial, temporal, and content dependent variations in network performance between urban and rural hospitals. Presently, no one has meaningfully characterized internet performance for telesurgical procedures in rural areas. Telesurgery involves a remote surgeon operating on a patient over distance using the internet to control a surgical robot. Telesurgery could allow rural patients more equitable access to lifesaving specialty procedures such as cardiac catheter ablation. Advances in telehealth adoption and surgical robotics are lowering the conceptual and technical hurdles for this future method of healthcare delivery. Despite this, important questions remain regarding the safe implementation of telesurgery in rural community hospitals. In particular, it is critical to understand the spatial, temporal, and content dependent variations in network performance between urban and rural hospitals. Presently, no one has meaningfully characterized internet performance for telesurgical procedures in rural areas. ObjectiveThe purpose of this research is to measure real-world internet performance and characterize the risk and severity of network disruptions during simulated telesurgeries between urban and rural hospitals over a long duration. The purpose of this research is to measure real-world internet performance and characterize the risk and severity of network disruptions during simulated telesurgeries between urban and rural hospitals over a long duration. MethodsWe developed a python application to generate and receive simulated telesurgery data between an urban center and small servers that are physically located in rural hospital operating rooms (Figure 1). Simulated telesurgeries were performed daily and nightly for 90min at approximately 2 packets per second. We developed a python application to generate and receive simulated telesurgery data between an urban center and small servers that are physically located in rural hospital operating rooms (Figure 1). Simulated telesurgeries were performed daily and nightly for 90min at approximately 2 packets per second. ResultsThe packet latency distribution for 108 simulated surgeries (54 daytime; 54 nighttime) is shown in Figure 2. We found that 99.99% of the packets had a network latency of less than 250ms and only 10% of operations had at one or more packets delayed by 250ms or more. The packet latency distribution for 108 simulated surgeries (54 daytime; 54 nighttime) is shown in Figure 2. We found that 99.99% of the packets had a network latency of less than 250ms and only 10% of operations had at one or more packets delayed by 250ms or more. Conclusion