Search

In the contemporary era, Vehicular Ad Hoc Networks (VANETs) have emerged as a vital technology in intelligent transportation systems, substantially enhancing the overall travel experience by providing advanced services to vehicles while ensuring driver safety. Despite the notable improvements, the inherent complexity of VANETs presents persistent security challenges, encompassing issues such as privacy preservation for vehicles, message authentication, and constraints in computational power and network bandwidth. Various authentication protocols have been designed for VANETs. However, many of these protocols exhibit significant vulnerabilities, rendering them insecure and unreliable in the face of diverse security threats, such as denial of service, replay, forgery, and impersonation attacks. Moreover, some existing schemes encounter limitations, including high computational complexity and the introduction of additional communication overhead and computational costs. To tackle these concerns, we designed a lightweight and secure identity authentication protocol based on elliptic curve cryptography with the objective of furnishing an effective and secure data transmission mechanism across a public communication channel for the Internet of Vehicles. In addition, we introduce Physically Unclonable Functions (PUFs) to ensure physical layer security during the communication process. A detailed security analysis demonstrates that the proposed protocol is resilient against various attacks. Through a comparative analysis with existing relevant protocols, in scenarios with a high density of vehicles, the algorithm demonstrates significantly lower computational costs and communication overhead than the related protocols, indicating that the proposed protocol is lightweight and efficient. Consequently, the empirical findings indicate that our protocol surpasses others in terms of reliability, user convenience, and practicality for ensuring secure data transmission within VANETs. [ABSTRACT FROM AUTHOR]

Vehicle Ad-hoc network (VANET) can provide technical support and solutions for the construction of intelligent and efficient transportation systems, and the routing protocol directly affects the efficiency of VANET. The rapid movement of nodes and uneven density distribution affect the routing stability and data transmission efficiency in VANET. To improve the local optimality and routing loops of the path-aware greedy perimeter stateless routing protocol (PA-GPSR) in urban sparse networks, a weight-based path-aware greedy perimeter stateless routing protocol (W-PAGPSR) is proposed. The protocol is divided into two stages. Firstly, in the routing establishment stage, the node distance, reliable node density, cumulative communication duration, and node movement direction are integrated to indicate the communication reliability of the node, and the next hop node is selected using the weight greedy forwarding strategy to achieve reliable transmission of data packets. Secondly, in the routing maintenance stage, based on the data packet delivery angle and reliable node density, the next hop node is selected for forwarding using the weight perimeter forwarding strategy to achieve routing repair. The simulation results show that compared to the greedy peripheral stateless routing protocol (GPSR), for the maximum distance–minimum angle greedy peripheral stateless routing (MM-GPSR) and PA-GPSR protocols, the packet loss rate of the protocol is reduced by an average of 24.47%, 25.02%, and 14.12%, respectively; the average end-to-end delay is reduced by an average of 48.34%, 79.96%, and 21.45%, respectively; and the network throughput is increased by an average of 47.68%, 58.39%, and 20.33%, respectively. This protocol improves network throughput while reducing the average end-to-end delay and packet loss rate. [ABSTRACT FROM AUTHOR]

With the dense deployment of basic service set (BSS) in the next generation Wireless Local Access Network (WLAN). The overlapping coverage of multiple BSSs leads to intensified contention conflicts, low efficiency of buffer state reports (BSR) collection and a sharp decline in system throughput. To solve this problem, this paper proposes an access point (AP) cooperation based multi-BSS multi-user full duplex multiple access protocol (CMMFD). Firstly, access control (AC) divides the STAs in the cooperative network area into overlapping STA and non-overlapping STA. A bi-level channel resource allocation algorithm is designed. The first level is channel resource allocation in the collection stage of BSR and inter-node interference information (BI), and the second level is channel resource allocation in full duplex data transmission. Secondly, a protocol framework for parallel BI information collection of cooperative APs is designed. AC schedules cooperative APs to send trigger frame at the same time, and triggers STAs in each BSS to report BI information on the assigned channel resource with p -probability access mode. Finally, AP forwards the collected BI information to AC, and AC assigns the STAs in the multi-BSS to perform multi-user full-duplex transmission on the resource unit (RU). Theoretical analysis gives the closed form expressions of the mean number of STAs successfully collected by AC in the cooperation area and saturated network throughput. Simulation results show that compared with MU-FuPlex and EnFD-OMAX protocol, CMMFD protocol improves the network throughput by 29.6% and 31.2% respectively. [ABSTRACT FROM AUTHOR]

The Internet of Things in 5G and next-generation data communication networks have relied heavily on Wireless Sensor Networks (WSNs). Data aggregation, Energy consumption, bandwidth utilization, and dynamic traffic routing play a significant role and impose challenges in achieving QoS in a sensor network. Therefore, it is crucial to concentrate on these factors in order to increase the network's lifetime and quality of service. The research's goal is to analyse IoT WSNs in terms of their architecture, framework, security, data aggregation, and routing techniques. In IoT WSNs, the data aggregation technique reduces the energy consumption of the network's nodes. This improves the network's energy and other QoS parameter's efficiency. The network layer hybrid data aggregation and routing protocol proposed in this study is new and efficient. In this work, a novel method for data aggregation based on anchor-based routing and matrix filling theory is proposed. It is suggested to use improved Anchor-based Routing protocol for Event Reporting (ARER), an anchor-based routing technique that includes dynamic clustering and constrained flooding. In order to achieve QoS in IoT WSN, the proposed hybrid network layer protocol has outperformed. The proposed protocol has performed better in terms of QoS metrics like throughput, end-to-end delay, routing overhead, packet delivery ratio, and energy consumption. [ABSTRACT FROM AUTHOR]

Stimulated by the increase in user demands and the development of intelligent driving, the automotive industry is pursuing high-bandwidth techniques, low-cost network deployment and deterministic data transmission. Time-sensitive networking (TSN) based on Ethernet provides a possible solution to these targets, which is arousing extensive attention from both academia and industry. We review TSN-related academic research papers published by major academic publishers and analyze research trends in TSN. This paper provides an up-to-date comprehensive survey of TSN-related standards, from the perspective of the physical layer, data link layer, network layer and protocol test. Then we classify intelligent driving products with TSN characteristics. With the consideration of more of the latest specified TSN protocols, we further analyze the minimum complete set of specifications and give the corresponding demo setup for the realization of TSN on automobiles. Open issues to be solved and trends of TSN are identified and analyzed, followed by possible solutions. Therefore, this paper can be an investigating basis and reference of TSN, especially for the TSN on automotive applications. [ABSTRACT FROM AUTHOR]

In Wireless Sensor Network (WSN), the consumption of energy is high due to the data transmission in the sensing region. The Optimized Distributed Voronoi-based Collaboration (ODVOC) optimizes data delivery and it suffers from huge energy consumption. To overcome this drawback, a data aggregation scheme is introduced to expand the lifetime of the network and to minimize the energy utilization. Data aggregation is a significant approach that preserves the unwanted usage of energy during data transmission. In this paper, the Optimized Distributed Voronoi-based Cooperation scheme with Energy-aware Dual-path Geographic Routing (DAOHS-ODVOC-EDGR) is proposed which incorporates the polydisperse aggregation scheme and it aggregates the indispensable data in the intermediary nodes. The effective data aggregation is achieved by the estimation of the waiting time of the data at every intermediary node and cost function that is used for electing the next-hop node. In the proposed protocol, the buffer value of every node is divided to retain diversified kinds of flow for effective and fair delivery of data. The rate of transmission at the source and intermediary node is altered during the congestion. The proposed DAOHS- ODVOC-EDGR protocol is tested via simulation scheme. The result of the simulation exposes that DAOHS-ODVOC-EDGR outperforms the TESDA and DVOC protocol in terms of network lifetime, energy efficiency, and hop count delay. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is a system of machines, computing devices, electronic equipment, and different sensors. It forms a network, where the transmission of device-related data can be accomplished. The devices in the IoT are connected to each other through wireless links and form ad-hoc networks. In IoT based applications, the lifetime of the communicating nodes is a greater concern. The network lifetime can be maximized by introducing energy efficient data transmission in the network. Therefore, a traffic and delay-aware energy-efficient routing (TADEER) protocol for IoT-based networks are proposed in this work. The proposed technique assigns delay for transmitting data based on the criticality level of data and traffic rate at the forwarding nodes. Fixing delays for data transmission helps to avoid unnecessary transmissions. The route selection process is implemented using an optimization algorithm. A Fuzzy logic (FL) based biogeography-based optimization (BBO) algorithm is presented in this work. Thus, the number of data transmission and energy consumption can be reduced. The performance of the proposed method is evaluated by analyzing transmission delay, network lifetime, and energy consumption. By comparing the simulation results to the existing methods TEAR and ETASA, the simulation results are validated. [ABSTRACT FROM AUTHOR]

Information-Centric Networking (ICN) essentially supports multipath transmission. However, current multipath schemes in ICN either necessitate major network infrastructure updates or necessitate specific network settings for terminal devices. To solve these problems, we propose MPTS-ICN, a multipath transmission system for ICN that realizes end-to-end multipath transmission. Taking the ICN architecture based on the standalone name resolution approach as a basis, MPTS-ICN is easier to implement and deploy than other ICN multipath schemes. Moreover, we have extended the original network layer protocol to support multipath data transmission in ICN. To set up concurrent transmission multipath efficiently, we propose a heuristic algorithm for the selection of multipath service nodes. Extensive experimental comparisons with existing data transmission methods show that in bandwidth-constrained scenarios, MPTS-ICN outperforms the best-route method by 83.6% and the ECMP method by 79.7% in average flow completion time. [ABSTRACT FROM AUTHOR]

Underwater Internet-of-Things (UIoT) is an extension of Internet-of-Things technology in underwater. The underwater acoustic network with WiFi architecture (UW-WiFi), as a specific deployment of UIoT, has been proved to be a promising technique for wide-ranging marine applications. However, due to the unique features of underwater acoustic channel, such as long and variable propagation delay, low available bandwidth and high bit error rate, conventional medium access control (MAC) protocols designed for terrestrial WiFi networks need an overhaul to work efficiently for UW-WiFi networks. In consideration of the aforementioned channel features, different demands of nodes to occupy channel resources and the reliability of data transmission, a time sequence-based dynamic on-demand assignment (SDDA) MAC protocol for UW-WiFi networks is proposed in this paper. In SDDA, the collision-free scheduling is integrated with the reservation mechanism, aiming to address the issue of various access requirements of diverse task nodes on channel resources in the UW-WiFi network system. The designed protocol employs propagation delays and the amount of data to be sent by terminal nodes to achieve non-conflict transmissions of control packets and on-demand scheduling of data packets. Additionally, the scheme does not require extra overhead for time synchronization. Comparison simulations demonstrate that SDDA provides considerable benefits in terms of channel utilization, end-to-end delay and packet delivery ratio. At last, the SDDA protocol is implemented and a UW-WiFi network system is set up in the marine environment. The ocean field experiment results agree well with the simulated ones and also verify that the proposed protocol achieve conflict-free on-demand scheduling, fairness among terminal nodes at different ranges and the practicability in actual environments. [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]

Since several Internet of Things (IoT) applications have been widely deployed on unstable wireless networks, such as the Delay Tolerant Network (DTN), data communication efficiency in DTN remains a challenge for IoT applications. Vehicular Delay Tolerant Network (VDTN) has become one of DTN's potential applications, in which the network experiences connectivity interruption due to the lack of an end-to-end relay route. VDTNs focus on node cooperation to achieve this goal. As a result, it is essential to ensure that almost all network nodes adopt the protocol to preserve network performance. This is a challenging task since nodes may diverge from the basic protocol to optimize their effectiveness. This article presents an Efficient Monitoring System (EMS) to detect and respond to just selfish nodes to minimize their entire network and data communication efficacy. The scheme is based on a network-wide cooperative sharing of node reputation. It is also necessary to increase overall network efficiency by tracking selfish nodes. The NS-2 simulator is used to run this experimental setup. Simulation results indicate that the proposed scheme performs better in terms of probability of package delivery, package delivery delay, energy consumption, and amount of packet drops. For 80% selfish nodes in the network, the packet delivery of EMS is 37% and 31% better than SOS and IPS. Similarly, the average delivery delay of EMS is 22% and 18% lower than SOS and IPS when 80% selfish nodes are incorporated in the network. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) are considerably used for various environmental sensing applications. The architecture and internal specifications of WSNs have been chosen based on the requirements of particular applications. On this basis, WSNs consist of resource (energy and memory)-limited wireless sensor nodes. WSNs initiate data communication from source to destination via physical layer management principles, channel slot scheduling principles (time division multiple access), wireless medium access control (WMAC) protocols, wireless routing protocols and application protocols. In this environment, the development of WMAC principles, routing protocols and channel allotment schemes play crucial roles in network communication phases. Consequently, these layering functions consume more energy at each sensor node, which leads to minimal network lifetime. Even though the channel management schemes, medium control protocols and routing protocols are functionally suitable, the excessive energy consumption affects the overall network performance. In this situation, energy optimization algorithms are advised to minimize the resource wastage of WSNs during regular operations (medium control and routing process). Many research works struggle to identify the optimal energy-efficient load balancing strategies to improve WSN functions. With this in mind, the proposed article has conducted a detailed literature review and notable experimental comparisons on energy-efficient MAC protocols, channel scheduling policies and energy-efficient routing protocols. To an extent, the detailed analysis over these wireless network operations helps to understand the benefits and limitations of recent research works. In the experimental section of this article, eight existing techniques are evaluated under energy optimization strategies (WMAC, channel allocation, sleep/wake protocols, integrated routing and WMAC policies, balanced routing and cooperative routing). The proposed review and the classified technical observations collected from notable recent works have been recognized as crucial contributions. The results infer the suggestions for feasible WSN communication strategies with optimal channel management policies and routing policies. Notably, the simulation results show that cross-layer or multi-layer energy optimization policies perform better than homogeneous energy optimization models. [ABSTRACT FROM AUTHOR]

Copyright of Railway Signalling & Communication Engineering is the property of Railway Signalling & Communication Engineering 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.)

Secure data communication is an essential requirement for an Internet of Things (IoT) system. Especially in Industrial Internet of Things (IIoT) and Internet of Medical Things (IoMT) systems, when important data are hacked, it may induce property loss or life hazard. Even thoughmany IoTrelated communication protocols are equipped with secure policies, they still have some security weaknesses in their IoT systems. LoRaWAN is one of the low power wide-area network protocols, and it adopts Advanced Encryption Standard (AES) to provide message integrity and confidentiality. However, LoRaWAN's encryption key update scheme can be further improved. In this paper, a Two-stage High-efficiency LoRaWAN encryption key Update Scheme (THUS for short) is proposed to update LoRaWAN's root keys and session keys in a secure and efficientway. The THUSconsists of two stages, i.e., the Root Key Update (RKU) stage and the Session Key Update (SKU) stage, and with different update frequencies, the RKU and SKU provide higher security level than the normal LoRaWANspecification does. Amodified AES encryption/decryption process is also utilized in the THUS for enhancing the security of the THUS. The security analyses demonstrate that the THUS not only protects important parameter during key update stages, but also satisfies confidentiality, integrity, and mutual authentication. Moreover, The THUS can further resist replay and eavesdropping attacks. [ABSTRACT FROM AUTHOR]

In order to apply wireless sensor networks to mechanical vibration monitoring, the author proposes a wireless network topology with multiple data collection points for mechanical vibration monitoring. This structure reduces the transmission load of the data collection point, increases the data transmission rate of the network, balances the energy dissipation in the network, and utilizes the general wireless sensor network hardware platform. The network transmission protocol and related auxiliary mechanisms are designed and implemented, and a wireless vibration monitoring test platform is constructed. The transmission performance of the network structure with multiple data collection points is evaluated through the actual test. The experimental results show that by using the wireless sensor network topology with multiple data collection points, it can meet the requirements of continuous transmission of vibration data obtained by 1 kHz sampling. Conclusion. The system performance of the wireless sensor network based on this network structure has been improved under the condition of general hardware, and the network structure of multiple data collection points shows good performance in the process of high-speed data transmission. [ABSTRACT FROM AUTHOR]

Link quality prediction is a fundamental component of the wireless network protocols and is essential for routing protocols in wireless sensor networks (WSNs). Effective link quality prediction can select high-quality links for communication and improve the reliability of data transmission. In order to improve the accuracy of the link quality prediction model and reduce the model complexity, the link quality prediction model based on the light gradient boosting machine (LightGBM-LQP) is proposed in this paper. Specifically, agglomerative hierarchical clustering and manual division are combined to grade the link quality and obtain the labels of samples. Then, light gradient boosting machine (LightGBM) classification algorithm and Focal Loss are used to estimate the link quality grades. In order to reduce the impact of data imbalance, Borderline-SMOTE is employed to oversample the minority link quality samples. Finally, LightGBM-LQP predicts link quality grade at the next moment with historical link quality information. The experimental results on data collected from a real-world WSNs show that the proposed model has better prediction accuracy and shorter predicting time compared to related models. [ABSTRACT FROM AUTHOR]

As one of the main data transport protocols of delay/disruption-tolerant networking (DTN), Licklider transmission protocol (LTP) is designed to provide reliable data delivery in an interplanetary Internet environment characterized by frequent and lengthy link disruptions and extremely long signal propagation delays. Some studies have been done on the performance of LTP in cislunar and Mars communications. However, to date the effect of link disruption on LTP for Mars communications has received little attention. In this paper, an analytical framework is presented for the effect of link disruption on reliable data delivery and performance of LTP in Mars communications. The analysis focuses on how various link disruptions affect the number of transmission attempts, the consequent round-trip time (RTT) of data exchange, and the resulting goodput performance of LTP for reliable data block delivery in Mars communications. The analytical framework is validated by means of realistic data block transmission experiments using a PC-based experimental infrastructure, and it can be used to predict the performance of LTP over a deep-space vehicle communication channel in presence of link disruption. [ABSTRACT FROM AUTHOR]

Filtered Smith predictors are well established for controlling linear plants with constant time delays. Apart from this classical application scenario, they are also employed within networked control loops, where the measurements are sent in separate packets over transmission channels that are subject to time-varying delays. Consequently, classical tools for the stability analysis, e.g., for time delay systems, have to be extended to facilitate an explicit consideration of network-induced effects such as packet skipping and disordering of sent packets. The present paper illustrates that the time-varying delays and, particularly important, the packetized character of the transmissions have to be explicitly taken into account for the stability analysis. Three network protocols, which use different packet selection and hold mechanisms, are considered to state criteria for the robust stability of the networked feedback loops with filtered Smith predictors. They are based on the small gain theorem and allow a computationally inexpensive way to check stability for the case with uncertain plant models and bounded time-varying packet delays in the communication channels. • Filtered Smith predictor for packet-based networked systems. • Communication network with bounded and time-varying packet delays. • Three different network protocols (different packet skipping and hold mechanisms). • Easy-to-use stability analysis for uncertain plants and time-varying packet delays. [ABSTRACT FROM AUTHOR]

A large amount of data would be generated during the process of microseismic monitoring, and data transmission with the cable has some shortcomings such as poor anti-interference, time-consuming, laborious, high cost, and low construction efficiency. On the other hand, the influence of signal diffraction and the multipath effect will greatly cut down the energy of the signal during the wireless transmission in the complex mountainous area. The wireless transmission system based on Wi-Fi is designed in this paper, which includes the base station and data transceiver. The maximum distance and transmission rate at point-to-point communication of the base station are up to 1000 m and 150 Mbps, respectively, and it provides the communication backbone line for the network. The data transceiver adopts the network protocol based on Ad Hoc, and the transmission distance is up to 200 m at the condition of complex topography and lush mountains. We have applied the system to in-site microseismic monitoring with 28 geophones of the coalbed methane fracturing in South Chongqing. It achieved a good performance with a transmission rate of 1.2 Mbps, a time delay of 1.95 ms, and a signal strength of up to −52.3 dBm for real-time data transmission in the field. The results show that the system has the advantages of low BER, fast transmission speed, long communication distance, and stable and safety hardware and has a great value for more applications of microseismicity in complex topography. [ABSTRACT FROM AUTHOR]

Copyright of Coal Science & Technology (0253-2336) is the property of Coal Science & Technology 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.)

Copyright of B&H Electrical Engineering is the property of Sciendo 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.)

This article is concerned with the consensus‐based distributed filtering problem for a class of general nonlinear systems over sensor networks with communication protocols. In order to avoid data collisions, the stochastic protocol and the Round‐Robin protocol are respectively introduced to schedule the data transmission between each node and its neighboring ones. A consensus‐based unscented Kalman filtering (UKF) algorithm is developed for the purpose of estimating the system states over sensor networks subject to communication protocols. Moreover, the exponential boundedness of estimation error in mean square is proved for the proposed algorithm. Finally, compared with the extended Kalman filtering, an experimental simulation example is provided to validate the effectiveness of the consensus‐based UKF algorithm. [ABSTRACT FROM AUTHOR]

Today, the wireless sensor network (WSN) plays an important role in our daily life. In addition, it is used in many applications such as military, medical, greenhouse, and transport. Due to the sending data between its nodes or to the base station requires a connection link, the sensor nodes can be exposed to the many attacks that exploit the weaknesses of the network. One of the most important types of these attacks is the denial of service (DoS). DoS attack exhausts the system's resources that lead the system to be out of service. In this paper, a cyber-security algorithm is proposed for physical level of WSN that adopts message queuing telemetry transport (MQTT) protocol for data transmission and networking. This algorithm predicts the DoS attacks at the first time of happening to be isolated from the WSN. It includes three stages of detecting the attack, predicting the effects of this attack and preventing the attacks by excluding the predicted nodes from the WSN. We applied a type of DoS attack that is a DoS injection attack (DoSIA) on the network protocol. The proposed algorithm is tested by adopting three case studies to cover the most common cases of attacks. The experiment results show the superior of the proposed algorithm in detecting and solving the cyber-attacks. [ABSTRACT FROM AUTHOR]

Upgraded network technology presents an advanced technological platform for telecare medicine information systems (TMIS) for patients. However, TMIS generally suffers various attacks since the information being shared through the insecure channel. Recently, many authentication techniques have been proposed relying on the chaotic map. However, many of these designs are not secure against the known attacks. In spite of the fact that some of the constructions attain low computation overhead, they cannot establish an anonymous communication and many of them fail to ensure forward secrecy. In this work, our aim is to present authentication and key agreement protocol for TMIS utilizing a chaotic map to achieve both security and efficiency. The underlying security assumptions are chaotic theory assumptions. This scheme supports forward secrecy and a secure session is established with just two messages of exchange. Moreover, we present a comparative analysis of related authentication techniques. [ABSTRACT FROM AUTHOR]

In the networks, a transport layer is responsible for reliable data with guaranteed Quality of Service. A Modified‐QUIC protocol provides improved throughput and reduced latency of the network. This work proposes a modification in handshaking mechanism for QUIC protocol to minimize overhead due to control signals and time required to update the congestion‐window size. This modification fine‐tunes the window update mechanism with the acknowledgment frame, which results in a smooth variation in the congestion‐window size. This leads to the control congestion by regulating traffic in the network. In the proposed mechanism, unnecessary time out events are avoided by updating the congestion‐window on receipt of the acknowledgment frame. This work has been carried out using two different testbed setups to verify the transport layer and a browser network performance. It has been observed that a Modified‐QUIC protocol is easy to deploy, improves the throughput and data rate by 35% and 3.43%, respectively, over the QUIC protocol. The average fairness index is increased with a file size and for the long live traffic. [ABSTRACT FROM AUTHOR]

Blockchain is a mainstream technology in which many untrustworthy nodes work together to maintain a distributed ledger with advantages such as decentralization, traceability, and tamper-proof. The network layer communication mechanism in its architecture is the core of the networking method, message propagation, and data verification among blockchain nodes, which is the basis to ensure blockchain's performance and key features. When blocks are propagated in peer-to-peer (P2P) networks with gossip protocol, the high propagation delay of the protocol itself reduces the propagation speed of the blocks, which is prone to the chain forking phenomenon and causes double payment attacks. To accelerate the propagation speed and reduce the fork probability, this paper proposes a blockchain network propagation mechanism based on proactive network provider participation for P2P (P4P) architecture. This mechanism first obtains the information of network topology and link status in a region based on the internet service provider (ISP), then it calculates the shortest path and link overhead of peer nodes using P4P technology, prioritizes the nodes with good local bandwidth conditions for transmission, realizes the optimization of node connections, improves the quality of service (QoS) and quality of experience (QoE) of blockchain networks, and enables blockchain nodes to exchange blocks and transactions through the secure propagation path. Simulation experiments show that the proposed propagation mechanism outperforms the original propagation mechanism of the blockchain network in terms of system overhead, rate of data success transmission, routing hops, and propagation delay. [ABSTRACT FROM AUTHOR]

The wireless sensor networks (WSN) research is emerging fast in the areas of agriculture, industry, smart grid communication, smart monitoring, and smart metering. The Zigbee is a wireless network protocol under IEEE 802.15.4 standard, that provides low cost, low power, and lesser delay in data communication over a PAN network. Several sensor nodes are deployed in WSN geospatial domain to communicate with each other. The sensor nodes are the embedded devices used to perform specific applications by sending information in the network through the coordinator node. The coordinator gathers the data, stores into memory, processes it, and route it to the destination node. The Zigbee protocol supports peer-to-peer, star, mesh and cluster tree topology. In the research paper, the hardware chip design for mesh, star, and cluster Zigbee topology is proposed in which 64 nodes are communicating with each other. The chip simulation is performed on Xilinx ISE 14.7 software for 64-bit internode communication and pre-synthesized on Virtex-5 FPGA. The comparative performance of the chip is analyzed with the help of the FPGA device and timing parameters. [ABSTRACT FROM AUTHOR]

Multi-channel ad hoc networks are promising technology to alleviate the spectrum scarcity in dense networks. The main challenge for channel access in distributed multi-channel ad hoc networks is channel synchronization and competition with neither common control channel nor dedicated control transceiver. In this paper, a Tight Synchronized MAC protocol with distributed synchronization and competition process without any dedicated control channel is proposed. The protocol uses a simple handshaking mechanism to create a channel table for each node, which contains its neighbors and channels' status. By this, any node knows the priority of its channels and also the priority of neighbors' channels. By assigning priorities, a sender node starts synchronization. If sender and receiver nodes have a common channel, the proposed method finds it directly or indirectly using the common neighbor mechanism. The other feature of the proposed scheme is using a fair preemptive data transmission phase, which reduces the number of switchings along data transmission. The fair preemptive mechanism is achieved by an analytical solution to estimate the number of competing nodes and thus, estimates the number of assigned data slots. Simulation results show the performance improvements in terms of synchronization delay and packet delivery ratio over HMMAC and MSRMMAC protocols. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) plays a prominent role in health-care of patients, which assist the physicians and patients through the assistance in effective decision-making and additionally, in the medical field, IoT plays a significant role in real-time monitoring of the patients. Even though the data provided by the IoT devices ensure the effective decision-making, the data is susceptible to the network attacks. Thus, the paper proposes an authentication protocol for enabling the secure data transmission in IoT based on three functions, such as encryption function, hashing function, and adaptive XOR function. The proposed authentication protocol is named as, Adaptive XOR, hashing and Encryption Key Exchange (AXHE) protocol, which is the combination of the functions, such as encryption function, hashing function, and adaptive XOR function. The protocol ensures the security in the communication through two successive phases, such as registration and authentication of the user, where the user name, password, public keys, private keys, and security factor are employed. The authentication is progressed as seven levels and whenever the security factor matches, the user is authenticated and the communication continues. The analysis of the proposed AXHE is performed using 50 and 100 nodes in the presence of DOS and black hole attacks, which acquires the detection rate, throughput, and detection delay of 0.3859, 0.32, and 6.535 s, respectively. [ABSTRACT FROM AUTHOR]

An effort to minimize illegal logging by utilizing advanced technology such as Wireless Sensor Network (WSN) are highly required. WSN is a communication solution between remote sensors located in isolated wide forest areas. However, the WSN challenge in a remote and wide-area has the energy resources limitation. This research proposed a weights-based energy-efficient WSN data communication protocol with firefly synchronization, namely Firefly Synchronization Multi-hop - Geographical Energy-Aware Routing (FSM-GEAR) Protocol. This protocol aimed to increase the network lifetime of each node by shortening the transmission distance. Firefly synchronization between sensors is conducted to reduce the data transmission waiting time. A weights-based approach in cluster head (CH) selection phases and energy consumption analysis are formulated according to the comparison between nearest distance to Gateway and the maximum residual energy of each node based on received signal strength indicator (RSSI). Weights-based FSM-GEAR performance analysis is carried out based on the parameters of network lifetime, residual energy, and throughput with the Modified-GEAR and enhanced Modified-GEAR protocols as a comparison. The simulation result stated that FSM-GEAR protocol showed better network lifetime, residual energy, and throughput than both protocols. [ABSTRACT FROM AUTHOR]

The control and transmission of huge data constitute an immense challenge in various types of networks (wired and wireless). Congestion caused by the high traffic and low throughput of huge data continues to be major problems in a heterogeneous platforms such as internet of things (IoT) technology and internet-of-robotic-things (IoRT). The heterogeneous network requires new models and mechanisms to deal with the increased challenges posed by IoT and IoRT. Accordingly, eliminating the issues that emerge has compelled finding improved solutions as a new strategy. This study proposed a new strategy called routing information and distance vector (RIDV) to create the best improvement of a heterogeneous network. The RIDV strategy activates the routing information protocol (RIPv2) on a router in wire network parallel with the ad-hoc on-demand distance vector (AODV) protocol on the wireless network. The RIDV strategy is used to solve the problems of the diversity of heterogeneous networks as the basis of the infrastructure IoRT technology. Hence, this strategy can reduce or avoid congestion through the use of enhanced and effective best routing protocols. Simulation results using OPNET show that the proposed method improved the quality of service (QoS) compared with other related strategies and AODV and RIPvl protocols in terms of data drop, traffic drop, queue delay, and throughput. [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]

In recent years, vehicle networks require high bandwidth due to the increasing complexity of electronic control devices for vehicles due to the demand for advanced driving aids, infotainment and V2X communication. Therefore, Ethernet protocol was introduced and vehicle gateway system was newly introduced in vehicle system. The vehicle gateway system provides an interface for continuously connecting and exchanging vehicle data in different communication environments between the Controller Area Network (CAN) protocol and the Ethernet network protocol. There are two types of data exchange in the vehicle gateway. These are direct routing and indirect routing. Vehicle gateways are connected to external networks, which can lead to security vulnerabilities. So it needs security function to ensure message integrity. Recently, vehicle manufacturers have introduced gateway systems with security features that operate to verify the integrity of messages using cipher-based message authentication codes (CMAC). But applying security functions to a gateway system introduces delays in performing security functions. Therefore, in this paper, to design stable and efficient the vehicle gateway system with security function, we have tested and evaluated the latency time that can occur according to the routing methods which are direct routing and indirect routing. [ABSTRACT FROM AUTHOR]

Domain knowledge: Today, Wireless Sensor Network (WSN) is widely used for general purposes. With the propagation of the Internet of Things (IoT), security issues arise wherever the healthcare devices are used exclusively for data transfer protocols. These network protocols are easily susceptible to attack. Although it is problematic to save sensing information from the body sensors, the loss of signal messages will often occur in an IoT environment. Thus security is a supreme requirement in health care applications, especially in the case of patient privacy. Methodology: In this paper, an IoT health care communication system is designed to implement the integration using CoAP based Secure-aware Mobility Management Protocol (CoSMP) in Wireless Body Area Network (WBAN) based IoT environment. The proposed protocol is extremely effective to secure the sensing information of the device node wherever they are moving and additionally, it is accustomed to offer secure data transmission between the node and web client. Our protocol establishes a pairwise key between the networks according to an exact algorithm, namely Advanced Encryption Standard Cipher Feedback Message Authentication Code (AES-CFMAC) algorithm, and handover operation could be authenticated by Elliptic Curve Digital Signature Algorithm (ECDSA). Numerical analysis and performance result imposes the proposed scheme is simulated in terms of network delay and handover delay. Result: Experimental results depict that the proposed protocol has been compared with the previous protocol in terms of security and mobility management. Hence, the numerical result would be evaluated based on the measures of Total Transmission Delay (TTD) on the variation of wireless link delay, sensor node delay, link failure probability delay, hop count between the gateway and WMMS in the network delay with the low delay of 303.55, 1.6, 700 and 80 in ms respectively and also performance measures of Handover Delay (HD) achieves 1212.5, 1.212, 49.46 and 1453.8 in ms respectively. The percentage in terms of using performance measures of TTD and HD is compared between proposed and existing schemes resulted in (COMP = 0.3632%, COMP-G = 0.2712 % and COSMP = 0.2532%) and (COMP = 0.3188%, COMP-G = 0.2421 % and COSMP = 0.2133%) respectively. [ABSTRACT FROM AUTHOR]

Data aggregation plays a vital role in the Internet of Things (IoT), and it aggregates the collected sensor data from devices to suppress redundant data transmissions. Many-to-one traffic pattern in the IoT induces hotspot problem and inefficient data aggregation. The Routing protocol for low-power and lossy networks (RPL) in the network layer impacts the hotspot problem due to the frequent usage of forwarding nodes and load imbalance. The processes of network layer protocol, such as trickle algorithm and Objective Functions (OF) for Destination Oriented Directed Acyclic Graph (DODAG) construction, need more attention to avoid hotspot for efficient data aggregation. This work proposes a Load Balanced RPL (LoB-RPL) protocol to avoid hotspot creation using a composite metric based parent selection, DODAG construction, and local topology adaptive decision on trickle parameters. The LoB-RPL improves the Minimum Hop with Hysteresis Objective Function(MRHOF) using the composite metric based parent selection and tunes the parameters of the Trickle algorithm. It ensures efficient maintenance of DODAG structure, hotspot avoidance, and unnecessary DIO transmissions. Beyond the advantages of composite metric based parent selection, consideration of dynamic parameters may induce frequent parent switching in RPL. To avoid frequent changes in the DODAG structure, the LoB-RPL optimally decides the parent switching threshold. Thus, the proposed work ensures a load-balanced and an energy-efficient RPL routing as well as data aggregation in the IoT environment. The LoB-RPL delivers outperforming results compared to the base RPL under various inter-packet interval time over 50 node topologies. [ABSTRACT FROM AUTHOR]

Most of the communication protocols in the Industrial Control System (ICS) are vulnerable to cyber-attacks. Initially, the network protocol was designed for reliable performance, and thus did not incorporate data transmission security features. Therefore, ICS requires adequate data transmission security. This paper suggests improving the security of data transmission through a dynamic symmetric four-key-generators system, wherein the system anticipates cyberattacks by generating four keys before encryption. It involves four generators: a random initial key generator, a keystream generator, a key scheduling algorithm generator, and a pseudo-random number algorithm generator. In the receiver section, the system generates three keys before decryption to ensure data confidentiality and to avoid cyberattacks. The test results show that the proposed system keyspace is ≈22048 bits, meaning that the key is more secure from brute force attacks. As a result, the cipher data have a correlation value of 0.00007. The entropy value is 7.99, indicating that the cipher data is more secure. Also, speed tests show that the processing time still qualifies as real-time. [ABSTRACT FROM AUTHOR]

Load balancing in datacenter networks (DCNs) is an important and challenging task for datacenter managers. A number of sophisticated technologies have been proposed to improve load balancing performance in a complicated circumstance, i.e., with various traffic characteristics. Many approaches need a high cost to implement, such as changing switch hardware. The efficiency problem has not been well addressed. MPTCP was proposed as a low-cost approach to improve data transmission in DCNs, which uses subflows to balance workloads across multiple paths. However, current MPTCP is not satisfying, especially when there are rack-local flows or many-to-one short flows. In this article, we propose DCMPTCP to improve the efficacy of MPTCP. We gradually develop three mechanisms. First, DCMPTCP identifies rack-local traffic and eliminates unnecessary subflows to reduce the overhead. Second, DCMPTCP estimates flow length and establishes subflows in a smarter way. Third, DCMPTCP strengthens explicit congestion notification to improve the congestion control performance on inter-rack many-to-one short flows. We have implemented DCMPTCP in both the Linux kernel and ns-3 simulator. Our comprehensive testbed experiments and simulations show that DCMPTCP outperforms MPTCP in both 1 Gbps testbed, and 10 Gbps large-scale simulation network. [ABSTRACT FROM AUTHOR]

Leach (low energy adaptive clustering hierarchy) algorithm is a self-clustering topology algorithm. Its execution process is cyclical. Each cycle is divided into two phases: cluster building phase and stable data communication phase. In the stage of cluster building, the adjacent nodes cluster dynamically and randomly generate cluster heads. In the data communication phase, the nodes in the cluster send the data to the cluster head, and the cluster head performs data fusion and sends the results to the aggregation node. Because the cluster head needs to complete data fusion, communication with the convergence node and other works, the energy consumption is large. Leach algorithm can ensure that each node acts as cluster head with equal probability, so that the nodes in the network consume energy relatively evenly. The basic idea of Leach algorithm is to randomly select cluster head nodes in a circular way. It evenly distributes the energy load of the whole network to each sensor node in the network. It can reduce network energy consumption and improve network life cycle. Leach repeatedly performs cluster refactoring during its operation. This paper studies the parameter detection of wireless sensor network based on Leach algorithm on the on-chip embedded debugging system. Because the classical low-power adaptive clustering layered protocol (Leach) has the problem of energy imbalance and short node life cycle, this paper uses embedded debugging technology based on Leach algorithm and the residual energy and position of nodes in wireless sensor networks were tested for research. This Leach algorithm uses the concept of wheel. Each round consists of two phases: initialization and stabilization. In the initialization stage, each node generates a random number between 0 and 1. If the random number generated by a node is less than the set threshold T (n), the node publishes a message that it is a cluster head. Through the research on the parameter detection, the simulation results show that the research in this paper has good feasibility and rationality. [ABSTRACT FROM AUTHOR]

Wireless sensor network comprises several small nodes distributed randomly in an area under observation. These nodes sense the assigned physical phenomenon occurring around it and reports back to the base station. WSN is increasingly applied in defense, industrial, health care applications etc. Some applications envisage movement of the nodes. This results in frequent alteration of network topology leading to dynamic network partitioning. Hence, the routing of data from source to sink faces more routing disruptions. Maintaining application specific quality of service (QoS) in terms of Packet delivery ratio in such Mobile wireless sensor network (MWSN) environment is a daunting task. This cannot be achieved by focusing on a solution in only a single layer of sensor network protocol stack. Instead, by incorporating different techniques in each layered OSI protocol stack, a single coherent framework is proposed in this paper. This paper proposes prediction based coding in application layer, opportunistic routing in network layer, Laplacian scaling based on round trip time measurement in session layer. The proposed cross layer solution ensures application specific QoS guaranteed fault tolerance in MWSN. [ABSTRACT FROM AUTHOR]

The utilization of wireless sensor networks (WSNs) is proliferating in our daily life. It depends on the environmental monitoring such as weather tracking, battled field, etc. However, the main challenge of WSNs is energy management. Generally, traditional nodes of the sensor network were powered by non-rechargeable batteries with limited energy capacity. The alternative solution has been discovered to resolve the limitation of the sensor battery called energy harvesting (EH). EH offers effective and an alternative solution to recharge the battery of the sensor node. It assists with the environment, and EH technique can be possible different kinds such as solar, wind, thermal and mechanical. In this paper, we propose a novel energy harvesting clustering protocol (NEHCP). The NEHCP is based on the hierarchical clustering routing algorithm, and this protocol uses solar EH. The collection of information from the sensor nodes is sent to the base station through the cluster head. The NEHCP algorithm is categorized into three sections, such as the initial phase, set-up phase and data transmission phase. Moreover, the unique feature of EH-WSNs is giving more efficient result in term of network lifetime. The simulation part of this method shows a strong ability to balance energy consumption and increases the network efficiency for the EH-WSNs. [ABSTRACT FROM AUTHOR]

During the last two decades, the IEEE 8201.11 family has multiplied data rate transmissions in wireless local area networks (WLANs). This progress is based on the adoption of new technologies concerning physical layer (PHY), combined with the enhancements in the medium access control (MAC) layer. Radio over Fiber (RoF) is a technology which can further extend this progress, combining the benefits of optical fiber and wireless networks. The current IEEE 802.11 MAC protocol is contention based, which leads to low utilization of the RoF PHY data rate and on the other hand cannot handle the effects of long propagation delays in RoF networks. In this paper, we present a new Hybrid Link Time Division Multiple Access (HL-TDMA) MAC protocol which addresses the above shortcomings and enhances the performance of both conventional and RoF WLANs. Then, through simulation, we evaluate the performance of the proposed protocol, which is shown to be superior to relevant RoF WLAN protocols in the literature. [ABSTRACT FROM AUTHOR]

With the increasing number of vehicles, the management of parking spaces in cities is becoming increasingly important in improving the quality of life and combating air pollution. Indeed, finding a parking space at peak times and in congested areas of the population becomes a huge challenge for drivers. To remedy this problem, most modern cities have smart parking. The equipment of these smart parking is mainly based on the implementation of wireless sensor networks (WSN) to monitor, track, and collect real-time information on the occupancy status of each parking space. This information is then made available to drivers who are looking for an available parking space. However, sensor nodes have limitations in terms of energy and communication that affect the performance and quality of the wireless sensor network. Therefore, the design of a self-organization protocol for WSN that minimizes power consumption and maximizes the longevity of the WSN network must be taken into account when implementing and developing a sustainable and viable intelligent parking system. In this paper, we propose a protocol for self-organization of wireless sensor networks (WSN) for the management of parking spaces in outdoor and urban car parks. This protocol is based on building clusters using ZigBee transmission technology for multihop communication. Each sensor node will be installed in the ground of each parking space to monitor its availability by sending the empty or busy state of that space to the gateway using cluster head nodes (CHs). This approach has a robust and efficient self-organizing algorithm that minimizes energy dissipation and increases the lifetime of sensor nodes and the WSN network. The simulation results show that parking management systems in outdoor and urban car parks using the self-organization protocol presented are efficient and sustainable in terms of energy consumption, reliability of data transmission, and the longevity of the WSN network compared to other existing parking systems that use different self-organizing protocols for wireless sensor networks. [ABSTRACT FROM AUTHOR]

Efficient energy consumption is a major problem in Wireless Sensor Network. The sink can be static or dynamic. In case of static sink, the node that is placed near the sink is utilized more than other nodes in the network due to frequent packet forwarding. This causes the node near the sink to die very soon, also further communication between the sink and other nodes in the network is disconnected. When dynamic or mobile sinks are used, the energy consumption is distributed among other nodes in the network, which increases the lifetime of the network. In this paper to know the latest position of the sink, we introduce Dynamic Hexagonal Grid Routing Protocol (DHGRP). In the first phase, the protocol divides the network by several hexagonal virtual grids to share the current position of the sink among the nodes. In the second phase, the dynamic path is selected, in case congestion occurs during data transmission or if the mobile sink is moved to a new location. The performance is evaluated by comparing with the existing ring routing protocol, Query-Driven Virtual Grid-based Data Dissemination, and Grid-Cycle Routing Protocol. The results show that the proposed DHGRP protocol has better performance in terms of energy consumption, delay, network lifetime, throughput and Packet Delivery Ratio. [ABSTRACT FROM AUTHOR]

At present, embedded devices have become a part of people's lives, so detecting security vulnerabilities contained in devices becomes imperative. There are three challenges in detecting embedded device vulnerabilities: (1) Most network protocols are stateful; (2) the communication between the web front-end and the device is encrypted or encoded; and (3) the conditional constraints of programs in the device reduce the depth and breadth of fuzz testing. To address these challenges, we propose a new type of gray-box fuzz testing framework in this paper, called EWVHunter, which is mainly used to find authentication bypass and command injection vulnerabilities in embedded devices. The key idea in this paper is based on the observation that most embedded devices are controlled through the web front-end. Such embedded devices often contain rich information in the communication protocol between the web front-end and device. Therefore, by filling data at the input source on the web front-end and reusing web front-end program logic, we can effectively solve the impact of the stateful network protocol and communication data encryption on fuzzing without relying on any knowledge about the communication protocol. Additionally, we use firmware information extraction to enhance EWVHunter so that it can detect vulnerabilities in deep layer codes and hidden interfaces. In our research, we implemented EWVHunter and evaluated 8 real-world embedded devices, and our approach identified 12 vulnerabilities (including 7 zero-days), which affect a total of 31,996 online devices. [ABSTRACT FROM AUTHOR]

The Internet of Things is changing the approach to data transmission, protocol design and network services. The challenge faced by designers of IoT solutions is to determine the scalability of a given technology, with a particular empha- sis placed on unlicensed frequency bandwidth (ISM) transmis- sion in highly urbanized areas. Because the design and im- plementation of a wireless network for the Internet of Things, relying on each of the presented technologies, is expensive and time consuming, it must be preceded by a performance assess- ment based on computer simulations. The literature contains various approaches to modeling the mechanisms of the MAC layer of LoRa technology and to its implementation in Lo- RaWAN networks. The article provides an overview of major LoRa MAC network simulators. It presents and comments on the most important research results obtained by the authors of the aforementioned software. [ABSTRACT FROM AUTHOR]