Broadcast Packets Research Articles

Movable Antenna-Aided Broadcast Packet Erasure Channels: Capacity with Dynamic Position Plan

Movable Antenna-Aided Broadcast Packet Erasure Channels: Capacity with Dynamic Position Plan

ViWise: Fusing Visual and Wireless Sensing Data for Trajectory Relationship Recognition

People usually form a social structure (e.g., a leader-follower, companion, or independent group) for better interactions among them and thus share similar perceptions of visible scenes and invisible wireless signals encountered while moving. Many mobility-driven applications have paid much attention to recognizing trajectory relationships among people. This work models visual and wireless data to quantify the trajectory similarity between a pair of users. We design a visual and wireless sensor fusion system, called ViWise, which incorporates the first-person video frames collected by a wearable visual device and the wireless packets broadcast by a personal mobile device for recognizing finer-grained trajectory relationships within a mobility group. When people take similar trajectories, they usually share similar visual scenes. Their wireless packets observed by ambient wireless base stations (called wireless scanners in this work) usually contain similar patterns. We model the visual characteristics of physical objects seen by a user from two perspectives: micro-scale image structure with pixel-wise features and macro-scale semantic context. However, we model characteristics of wireless packets based on the encountered wireless scanners along the user’s trajectory. Given two users’ trajectories, their trajectory characteristics behind the visible video frames and invisible wireless packets are fused together to compute the visual-wireless data similarity that quantifies the correlation between trajectories taken by them. We exploit modeled visual-wireless data similarity to recognize the social structure within user trajectories. Comprehensive experimental results in indoor and outdoor environments show that the proposed ViWise is robust in trajectory relationship recognition with an accuracy of above 90%.

Fuzzy-based optimization of AODV routing for efficient route in wireless mesh networks

The performance of any communication system heavily relies on the efficient routing of interventions. This article addresses the significant issue of routing protocol selection for optimal path determination in networks. Particularly, when wireless communication occurs among mobile nodes with limited resources, such as batteries, the routing problem becomes even more challenging. This article proposes the Fuzzy Control Energy Efficient (FCEE) routing protocol to overcome these challenges. The FCEE protocol combines the Ad-Hoc On-Demand Distance Vector (AODV) protocol with fuzzy logic techniques to enhance network lifetime and performance. The proposed approach introduces a memory-based channel integrated with fuzzy logic methodologies, which effectively restricts the forwarding of unnecessary broadcast packets based on the energy availability of the operating node. Through extensive simulations, demonstrate the promising capabilities of FCEE as a routing protocol for wireless mesh networks. To further assess the effectiveness of the FCEE protocol, the proposed article compares it with two existing routing protocols: AODV and Intelligent Routing AODV (IRAODV). The simulation results shows that the FCEE routing protocol significantly enhances the reliability of the conventional AODV, providing improved link connectivity and longer route lifetimes. Additionally, our proposed protocol enhances the quality of service (QoS) for mesh routing, with an average throughput of 351.374 (Kbps) compared to 90 (Kbps) for IRAODV and 39 (Kbps) for AODV. Moreover, FCEE exhibits superior energy efficiency with an average energy consumption of 14, while IRAODV and AODV consume 40 and 90 joules, respectively. In conclusion, the FCEE routing protocol demonstrates its potential to address the challenges of efficient routing in wireless mesh networks. By leveraging fuzzy logic and integrating it with AODV, FCEE enhances network lifetime, performance, and energy efficiency, making it a promising solution for future wireless communication systems.

Bluetooth Low Energy Device Identification Based on Link Layer Broadcast Packet Fingerprinting

With the rapid development of the Internet of Things (IoT), wireless technology has become an indispensable part of modern computing platforms and embedded systems. Wireless device fingerprint identification is deemed as a promising solution towards enhancing the security of device access authentication and communication process in the IoT scenario. However, the extraction of features from the network layer and its upper layers often confront restrictions from specific devices: the association with a certain wireless network and the access to the plaintext of the payload. Meanwhile, Bluetooth Low Energy (BLE) packets have been encrypted above the link layer, which makes those features difficult to extract. To tackle these problems, we introduce a novel method to identify BLE devices based on the fingerprint features in the data link layer. Initially, the BLE packets are collected through a receiver based on software-defined radio technology. Then, fields that reflect device differences in BLE broadcast packets are extracted through traffic analysis. Finally, a MultiLayer Perceptron (MLP) model is employed to recognize the category of BLE devices. An experimental result on a dataset with 15 types of BLE devices shows that the identification accuracy of the proposed method can reach 99.8%, which accomplishes better performance over previous work.

Exploring the tradeoff between energy dissipation, delay, and the number of backbones for broadcasting in wireless sensor networks through goal programming

Broadcasting, which is an essential mode of operation in wireless sensor networks (WSNs), dissipates a non-negligible portion of the energy budget of a sensor node. Broadcasting is achieved by the dissemination of broadcast packets (originated at the BS) by a set of relay nodes, which constitute a backbone so that all sensor nodes receive broadcast packets. Utilization of multiple backbones is necessary to achieve balanced energy dissipation of sensor nodes in broadcasting. In this study, we propose two mixed integer programming (MIP) models (i.e., the flow-based model and the node-based model), which minimize the energy dissipation of the highest energy-consuming node for broadcasting by utilizing multiple backbones. Balanced energy minimization and delay minimization objectives are integrated through a goal programming (GP) framework built upon the foundation provided by the scalable node-based model. Performance evaluations based on the optimal solutions of our models reveal that maximum energy dissipation and delay in WSN broadcasting can be significantly reduced, simultaneously, by utilizing multiple backbones (e.g., with two backbones maximum energy dissipation and delay can be, concurrently, reduced by more than 2% and 22%, respectively, in comparison to the single backbone case, likewise, it is also possible to simultaneously reduce maximum energy dissipation and delay more than 8% and 13%, respectively, depending on the priorities assigned to the objectives). Nevertheless, employing more than two backbones does not provide any significant performance improvements.

Asynchronous broadcast‐based event‐triggered control for discrete‐time clock synchronization

AbstractPrecise timing plays a key role in the time‐sensitive industrial Internet of Things (IIoT). However, precise time synchronization requires more frequent packet exchange, which consumes more communication bandwidth and energy. This is a particular challenge in battery‐powered wireless nodes, and low communication costs have become an important factor in clock synchronization. To address the challenge of achieving low communication cost clock synchronization in distributed wireless sensor networks, this paper proposes an improved event‐triggered control and synchronization scheme with a novel asynchronous broadcast packet exchange protocol. Unlike the traditional event‐triggered control scheme which is based on synchronous polling packet exchange, this proposed asynchronous broadcast packet exchange is more communication efficient and requires fewer number of packet exchanges. And it is worth noting that the proposed algorithm in this paper is a distributed algorithm and does not require real‐time acquisition of information from neighbouring nodes. Finally, a numerical example is given to illustrate the effectiveness of the proposed event‐triggered control strategy. The efficiency and precision of the proposed clock synchronization method is evaluated by intensive simulations, which show that the number of packet exchange is reduced by 60% for a moderate IIoT network and is particularly useful for large scale network.

PERFORMANCE ANALYSIS OF ROUTING PROTOCOL IN MOBILE AD-HOC NETWORKS

Routing in a mobile ad hoc network (MANET) is a difficult task due to the constantly changing network topology and the absence of a fixed infrastructure. In such a scenario, mobile hosts can act as both hosts and routers, forwarding packets for other mobile nodes in the network. Routing protocols used in MANETs must be able to adapt to frequent changes in topology, while minimizing the impact on wireless resources. The AODV, DSR, ZRP and DYMO protocol are specifically designed for mobile nodes in wireless multihop ad hoc networks. It is capable of adapting to the changing network topology and determining unicast routes between nodes within the network. This paper presents a comparative analysis of commonly used routing protocols in terms of key performance metrics, including Broadcast sent packets, CTS packets sent, Packet drops due to re-transmission,RTS re-transmission the timeout , Unicast packet received ,RTS packets sent,Packet due to ACK timeout, ACK packet sent, Unicast sent packet and Broadcast Packet Received. The study's findings demonstrate that the routing protocols' performance is influenced by the network's size, node density, and mobility patterns. These routing protocols showing the simulation performance using random waypoint model on qualnet simulator.

An Enhanced Explicit Port Forwarding Solution for Improving Video Delivery over Software-Defined Networks

<p>In order to improve video delivery, an Enhanced Explicit Port Forwarding (EEPF) solution is proposed. Data are divided into ordinary packets and video packets using a packet identification mechanism. Traditional mechanisms transmit packets through routing table lookup. As the size of the routing table often becomes excessively large, this lookup can be time-consuming. While the EEPF solution directly includes the transmission path in the video packet, which can reduce the transmission time. And by setting header flags/fields in video packets, the transmission can be further optimized. For example, to reduce the amount of duplicate data to be transmitted for broadcast packets are not replicated until they arrive at the destination switch; to avoid packet loss caused by disconnection, the transmission path can be monitored and rerouting can be initiated immediately in the event of disconnection; to increase the chance of successful delivery, packets can be replicated before they are transmitted via a path with high packet loss risk; and to prevent video packets from being discarded, the switch queue status can be monitored and managed. The testing results have shown that the EEPF solution can effectively shorten the time of video packet transmission and improve the quality of transmitted video.</p> <p> </p>

On the Buffer Size of Perfect RLNC in Full-Duplex Relay Networks

In the next-generation wireless networks, full-duplex, relaying, and random linear network coding (RLNC) are popular techniques to enhance the network performance such as efficiency and reliability. For full-duplex relay networks, a perfect RLNC scheme known as FBPF (Fewest Broadcast Packet First) was recently proposed and demonstrated a better throughput, or equivalently, expected completion delay performance than the Automatic Repeat Request scheme. However, the original FBPF scheme assumes unlimited buffer and does not take the buffer size into consideration. In this paper, we generalize the FBPF scheme to consider the buffer size as a new parameter. Based on a novel Markov chain model, explicit formulae to characterize the expected completion delay are deduced. Moreover, we present a criterion on the optimal selection of the buffer size under a quality of service constraint, so that the selected buffer size is significantly reduced while the completion delay performance is comparable to the original FBPF scheme with unlimited buffer.

A Novel Cross-Layer Adaptive Fuzzy-Based Ad Hoc On-Demand Distance Vector Routing Protocol for MANETs

One of the essential processes in Mobile Ad hoc Networks (MANETs) is blind flooding to discover routes between source and destination mobile nodes. As the density of nodes in the network increases, the number of broadcast packets increases exponentially. This can lead to broadcast storms, a drain on the device’s battery, and reduced network efficiency. We propose a Cross-layer Adaptive Fuzzy-based Ad hoc On-Demand Distance Vector routing protocol (CLAF-AODV) to minimize the routing broadcast traffic by considering the quality of service (QoS) (e.g. delay, throughput, packet loss), stability, and adaptability of the network. The suggested method employs two-level fuzzy logic and a cross-layer design approach to select the appropriate nodes with a higher probability of participating in broadcasting by considering parameters from the three first layers of the Open Systems Interconnection (OSI) model to achieve a quality of service, stability, and adaptability. It not only investigates the quality of the node and the network density around the node to make a decision but also investigates the path that the broadcast packet traveled to reach this node. Simulation results reveal that our proposed protocol reduces the number of broadcast packets and significantly improves network performance with respect to throughput, packet loss, normalized routing load, collision rate, and average energy consumption compared to the standard AODV and the Fixed Probability AODV (FP-AODV) algorithms.

PARouting: Prediction-supported adaptive routing protocol for FANETs with deep reinforcement learning

Flying Ad-hoc Networks (FANETs) are becoming increasingly popular for various applications. Effective routing protocols for FANETs are essential yet challenging due to the high dynamic nature of Unmanned Aerial Vehicles (UAVs). Most existing routing protocols require the periodic broadcast of Hello packets to maintain neighbor tables that store the locations of neighbors, mobility patterns, etc. However, the frequent exchange of Hello packets leads to a large routing overhead in FANETs. This paper proposes PARouting, a prediction-supported adaptive routing protocol with Deep Reinforcement Learning, which introduces a novel UAV mobility prediction algorithm using Deep Learning (DL-UMP) to estimate the locations of UAVs. Based on DL-UMP, we design an adaptive Hello packet mechanism to realize on-demand broadcasting of Hello packets, which reduces routing overhead. The routing process is formulated as a Partially Observable Markov Decision Process, and a new Q-network structure is proposed to select the optimal next hop. Simulation results confirm the accuracy of the DL-UMP and show that PARouting outperforms benchmark routing protocols in terms of packet delivery rate, end-to-end delay, and routing overhead.

6WPSN: Reliable and efficient IPv6 packet broadcast protocol for IEEE 802.15.4-based wireless powered sensor networks

6WPSN: Reliable and efficient IPv6 packet broadcast protocol for IEEE 802.15.4-based wireless powered sensor networks

Performance Study and Optimization of 3D-MANET: A New Analytical Perspective Based on Zipf’s Law

This paper studies the throughput capacity and delay scaling laws in a three-dimensional mobile ad hoc network (3D-MANET) under different routing schemes. Previous work generally assumed that nodes follow a uniform distribution or a power-law distribution to move in the network. From the perspective of the entire network, it is difficult for this network model to reflect communication entities’ distribution in real 3D space. Moreover, the research results of analyzing network performance using different routing schemes are limited, and the research work is insufficient. With formerly related studies different,we propose a cell-gridded network model that considers the actual environment with cells of the node aggregation degree, which follows Zipf’s law with exponent γ . And our model can cover a variety of distribution scenarios with changes in the γ value. The packet delivery rate, network capacity, and delay performance of 3D-MANET adopting the traditional two-hop nonredundant and redundant relay routing scheme are examined utilizing theoretical tools such as probability theory, random process, and queuing theory. We propose a wireless access point- (WAP-) enabled multihop relay routing scheme. By deploying WAP in cells with a high γ , nodes can access WAP and broadcast packets, which accelerates the delivery of packets, and the results obtained by applying this scheme indicate that compared with the two-hop relay scheme, the WAP multihop relay effectively improves the delay performance and the transmission efficiency with less loss of capacity performance. Additionally, a better delay-capacity trade-off performance is achieved. Finally, we discuss the influence of parameters such as the number of network nodes n , the number of network cells m , the redundancy r , and γ on the capacity and delay. The analysis results confirm that exploiting the users’ distribution status information and dividing the cells reasonably will save deployment costs and further improve network performance.

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.

Intertwine Connection-Based Routing Path Selection for Data Transmission in Mobile Cellular Networks and Wireless Sensor Networks

In a network setting, a sensor node's round-trip delay time over hostile nodes compromises the node's ability to transmit data from the sender node to the destination node. Minimum distance path discovery causes the path failure, since aggressive nodes are available. Node connectivity is poor which should cause the packet loss; it does not control more energy consumption, since packet broadcasting is repeated for many times using that path. So, the proposed intertwine connection-based routing path selection (ICBRPS) technique allows only energy efficient routing path, path connectivity is important, and routing path is damaged because of the presence of aggressive nodes. It hacks the information from sensor and operates unpredictable manner. The objective of this presented ICBRPS scheme is to improve the routing path in efficient manner. If any damages occur during the transmission of data, then the alternate best node connectivity path is created by energetic route discovery method. The performance metrics of parameters are delay, network overhead, energy consumption, packet loss, packet delivery ratio, and connectivity ratio. It enhances the connectivity rate and reduces the energy consumption.

Routing Path Selection and Data Transmission in Industry-Based Mobile Communications Using Optimization Technique

In a mobile network, nodes are share data packets; sometimes, that packets are totally flooding. The packet dropping node does not easily detect for routing time instance. The node trust level is minimum causing the packet loss; it affects the entire network performance, and it reduces throughput and increases communication overhead. Proposed exhaustive routing path allocation (ERP) technique is applied to select the legitimate node for broadcasting the data packets completely. The attacker nodes of that flooding packets are detected by using the legitimate detector which are present in network environment. The node credence level evaluation algorithm is planned to estimating each and every node authority range, whether the nodes have higher credence level basis efficient packet transmission in wireless nodes; otherwise, nodes have lesser credence level basis in effective packet broadcasting. These higher credence level nodes are assigned for communication process in movable network. It improves the throughput and minimizes the communication overhead. The performance metrics of the parameters are delay, communication overhead, throughput, network lifetime, energy consumption, and packet loss.

Topology based energy efficient routing using integration of fuzzy based markov chain cluster‐optimized novel ant bee colony approach in FANET

SummaryFlying adhoc network (FANET) is a rapidly flourishing technology in recent years which has an excellent scope of growth in the to the improvised mobility and the frequency changing topology FANETs are considered as a challenging technology to design an optimal network model. This problem is fixed with the topology based routing technique. Hence a novel hybrid clustering algorithm where fuzzy based Markov chain cluster (FMC2) is integrated with the optimized novel ant bee colony (ONABC) optimization algorithm (IoFMC2‐ONABC). This algorithm demonstrates an improvised efficiency with the novel ant bee colony algorithm. The proposed model simulation is done in an NS‐2 simulator and results are compared against the existing conventional approaches like adhoc on‐demand distance vector, efficient intelligent packet broadcasting protocol, energy‐efficient routing in flying ad hoc networks, and energy‐efficient gray wolf. This method aims at achieving improvised connectivity, optimizing the power consumption thereby increasing the residual energy augmenting the performance efficiency of the network through selection of the proper cluster center during each transmission. Thus the energy consumption of the node was optimized to 7.6 J with the highest packet delivery ratio of about 85.15 ensuring minimal packet losses during huge data transmission.

Neighborhood rough set‐based route selection for mobile ad hoc networks

SummaryThe main aim of this paper is to address the problem of redundant broadcast packets using the extension of rough set concept. In general, a rough set is a mathematical tool for dealing with issues of uncertainty. In MANET, mobile nodes are moving from one place to another place in a simulation environment; hence, it creates uncertainty issues. Due to the fast mobility of mobile nodes, network metrics such as bandwidth and hop count vary. The findings were useful in identifying and improving the network's performance. The proposed NRS‐based route selection approach has been compared with conventional techniques such as rough set, covering rough set (CRS). The reduced control packets are obtained using pruning concept based on selection of one‐hop and two‐hop nodes. Eventually, the proposed approach proved that it attains a higher throughput (85%), reducing the route request packets (3406) and delay of data transmission (0.02274 s). Also, two well‐known ad hoc routing protocols were used such as Dynamic Source Routing (DSR) and Ad Hoc On‐Demand Distance Vector (AODV) protocols.

PMSS: Producer Mobility Support Scheme Optimization with RWP Mobility Model in Named Data Networking

Abstract: The movement pattern of mobile producer plays an important role in mobility performance analysis of the wireless and mobile network. However, the producer mobility behavior is directly affecting the handoff latency and signaling overhead cost. Many researchers provide analytical investigation to analyze and solve the handoff problems and compared with the simulation result. To justify between simulation and analytical investigation, movement behavior of mobile node needs to be included in the analytical investigation to make it possible to compare with the simulation-based result. This paper incorporated Random WayPoint Mobility (RWPM) model, to determine the behavior of mobile producer, for analytical solution of producer mobility support in NDN. In this paper, we introduce mobility Interest packets to conveyed new prefix or location of mobile producer, a broadcasting strategy to facilitate the handoff process and the immobile anchor router was modified to perform a dual function that is, tagging of anchors and broadcasting of tagged mobility Interest packets. The performance analysis for mobile producer behavior and handoff latency shows that our proposed Producer Mobility Support Scheme (PMSS) reduces handoff latency compared to DNS-like and Home Agent routing approach.

The Effect of Concurrent Multi-Priority Data Streams on the MAC Layer Performance of IEEE 802.11p and C-V2X Mode 4

Supporting parallel multi-priority data streams is vital for maintaining the quality of service (QoS) in vehicle-to-everything (V2X) communication. Hence, the European telecommunications standard institute (ETSI) has defined four packet types, with varying priority levels, to be used as broadcast packets in such communication. This paper studies the medium access control (MAC) layer performance of IEEE 802.11p and cellular-V2X (C-V2X) Mode 4 using discrete-time Markov chain (DTMC) based models, while considering parallel multi-priority data streams. The overall model consists of four queue models with their respective traffic generators, which are appropriately linked with the DTMCs modeling the MAC layer operations of IEEE 802.11p and C-V2X Mode 4. Closed-form solutions for the steady-state probabilities of the models are obtained, which are then utilized to derive expressions for key performance indicators at the MAC layer. Numerical results are provided to draw insights on the MAC layer performance of the two technologies. IEEE 802.11p is comparatively superior in average delay, and at maintaining fairness among multi-priority data streams, whereas C-V2X Mode 4 exhibits better collision resolution, which leads to its higher throughput. The paper also includes design insights on possible performance enhancements for future releases.