Unmanned Aerial Vehicles (UAVs) are critical for maintaining communication in disaster-affected areas, where terrestrial infrastructure is often unavailable and network connectivity becomes highly fragile. To address this challenge, the paper proposes decentralized data forwarding and trajectory alignment in UAV-assisted networks using an information-centric paradigm. Specifically, we propose a Mobility-Aware QoS Information-Centric Networking (MA-QoS ICN) framework, wherein each UAV embeds Quality-of-Service information (QoS info), including priority, deadline, and packet lifetime—as well as UAV Mobility State Information (UMSI), such as velocity, direction, position, and battery level, directly into the ICN packet headers. To model the dynamic and uncertain environment, we formulate the UAV coordination problem as a stochastic game for maximizing long-term content delivery performance, where each UAV acts as a learning agent and makes forwarding and trajectory alignment decisions based on its local state. We then develop a multi-agent reinforcement learning (MARL) framework in which each UAV independently discovers its optimal strategy through local observations and experience, without requiring centralized control. In particular, we adopt an agent-independent learning method based on Independent Q-Learning, leveraging ICN’s packet-level handling for implicit coordination. This design significantly reduces communication overhead while preserving coordination among agents. Simulation results demonstrate that the proposed framework achieves substantial improvements in delivery reliability, latency reduction, and retransmission minimization, along with enhanced scalability under diverse disaster conditions.

The spectral efficiency of sixth-generation (6G) wireless networks is anticipated to experience large improvements through the implementation of non-orthogonal multiple access (NOMA) technology. The integration of short-packet communications (SPC) into NOMA networks enables low-latency operation and high spectral efficiency. The present study investigates the performance of multiple users in a NOMA downlink SPC system operating over an$\alpha - \kappa - \mu$shadowed fading channel. Precise and asymptotic closed-form approximations for the average block error rate (BLER), reliability, throughput, goodput, and overall BLER were derived using approximate Gaussian-Chebyshev quadrature. The analytical results were validated through numerical simulations, providing insights into the impact of fading parameters on system performance. The study's findings indicate that the proposed downlink NOMA SPC system is highly suitable for ultra-reliable and low-latency communications (URLLC), achieving reliability levels of 99.99% for multiple users. The study also determined the optimal transmission bit rate required to maximize throughput and goodput while minimizing the BLER. The proposed downlink NOMA SPC system operating with an$\alpha - \kappa - \mu$shadowed fading channel demonstrates high potential for improving Internet of Things (IoT) network performance over conventional downlink orthogonal multiple access (OMA) approaches. Most of the analysis adopts perfect successive interference cancellation (pSIC) and perfect channel state information (pCSI) as theoretical benchmarks, while additional results explicitly quantify the performance degradation caused by residual interference and channel estimation errors (CEE). The results reveal that imperfect SIC (ipSIC) dominates the BLER floor at high signal-to-noise ratio (SNR), whereas imperfect CSI (ipCSI) primarily affects the moderate-SNR regime, highlighting distinct impairment-driven performance bottlenecks. Therefore, we have extended the study by including two additional scenarios: pCSI combined with ipSIC, and ipCSI combined with ipSIC. This extension allows us to compare the performance of these systems and clearly shows that the system with pSIC and pCSI achieves the best performance. Finally, the results were validated with Monte Carlo simulations.

In-network caching stands as one of the core pillars of the Named Data Networking (NDN) paradigm, where every internet router has the capability to store the incoming data packets in its cache along the path between data sources and consumers. This capability is particularly vital in Internet of Things (IoT) environments, where efficient and timely data retrieval is critical. Numerous strategies have been designed for caching IoT data and often rely on the Exact Match Policy (EMP), which strictly matches content names for data retrieval. However, semantic considerations of content names in EMP remain underexplored. Additionally, several caching mechanisms are modeled after traditional IP-based communication approaches, such as neighbor or topology-based centrality methods for content placement and data eviction for replacement. These approaches hold limited relevance in NDN, as content names can originate from anywhere in the network. To this end, we propose a novel semantic-aware naming resolution as an alternative to EMP in cache design. Furthermore, the proposed scheme introduces a content-based centrality mechanism, along with a backup strategy for cache management. Integration of semantics into caching strategies offers a more optimal approach for supporting NDN IoT. This combination can boost overall network performance. Simulation results illustrate that the proposed scheme outperformed the advanced existing studies CaDaCa and PoolCache in cache hit ratios, semantic satisfaction rate, latency, and route elongation factor.

Vehicular ad-hoc networks (VANETs) are characterized by high mobility, dynamic topology changes, and unstable connections, and additionally, they require stringent communication requirements. To make VANET communication more efficient, this poster proposes a Lagrange-based optimized forwarding strategy (LOFS) for information-centric VANETs. The LOFS accounts for several parameters, including link expiration time (LET), link congestion, quality of service (QoS), and traffic conditions to select the next vehicle for Interest and Data packet forwarding. In addition, LOFS mitigates the broadcast storm problem of the existing multicast forwarding strategy, designed for information-centric VANETs.

Real-time healthcare applications demand stringent communication resources to meet the QoS requirements. To meet the application resource demands, this poster proposes a Load and Bandwidth aware Forwarding strategy (LBF-ICN) in Information-Centric Networks (ICN). The LBF-ICN considers router interfaces' pending entries and available bandwidth resources in order to select the next hop for interest forwarding. The LBF-ICN strategy aims to distribute the network load along with bandwidth allocation in interest forwarding.

To efficiently allocate communication and computation resources among enhanced Mobile Broadband (eMBB) and ultra–Reliable Low Latency Communication (uRLLC) applications, this article proposes a joint communication and computation resource allocation scheme in 6th Generation (6G) Information-Centric Networks named: CCR-ICN. To achieve efficient communication and computation resources sharing, the CCR-ICN scheme designs a microservice-centric Interest naming structure to enable named-based communication. Furthermore, the CCR-ICN scheme designs a robust forwarding strategy specifically tailored to efficiently allocate communication resources such as bandwidth among eMBB and uRLLC application requests. In addition, for the allocation of computation resources, the proposed scheme designs a priority-driven computation resources allocation mechanism ensuring effective allocation of Multi-Access Edge Computing (MEC) computation resources. To evaluate the proposed scheme, we performed extensive simulations in a widely used ns-3-based ndnSIM simulator and the results reveal the CCR-ICN achieves 66.82% higher communication resource allocation, and a 17.51% lower communication overhead compared to the TS-6G scheme. Moreover, the CCR-ICN performs computation request satisfaction at 42.03% and 12.72% higher than the TS-6G and EWFQ/LC schemes respectively. Furthermore, the CCR-ICN achieves computation resource utilization of 35.54% and 21.63% lower than the EWFQ/LC and TS-6G schemes respectively.

The advancement of vehicular onboard units (OBUs) has led to compute-intensive and delay-sensitive vehicular applications. Undeniably edge-assisted static roadside computing terminal (sRCT) offers immediate computations, a surge of smart vehicles and intensive computation requests during crowded hours may overload the sRCT, leading to performance degradation and intolerable delays. Therefore, to facilitate proximate computations and achieve ultra-low latency, this article envisions a Consortium of mobile vehicular Fog, Edge, and Cloud (CFEC) an ultra-low latency microservices-centric in-network computing framework for vehicular Named Data networks (VNDN). CFEC develops a fog-profiler-assisted mobile vehicular fog based on vehicles’ mobility patterns and available resource characteristics to ensure reliable computation offloading and reverse-path stability in a dynamic vehicular environment. Furthermore, CFEC introduces an intermediary ZTMC controller that effectively filters out underutilized sRCTs and routes computation requests to nearby, filtered sRCTs, thus minimizing transmission time and accelerating computations even during crowded hours. Simulations results revealed that CFEC significantly reduces computational satisfaction delays by up to 32.5%, 48.5%, and 31.9%, 51.025% against varying interest and node rates, respectively while in extreme traffic conditions, CFEC achieved an impressive computation satisfaction ratio of around 85% compared with benchmark schemes.

This work studies the built-in multicast model in Contiki OS to provide the basis of a comparative evaluation for a new optimisation model using Radio Duty Cycling (RDC) mechanism. A significant amount of energy is consumed at the edge node executing various multicast routing protocols in Low-Power and Lossy Networks (LLN). The optimisation of the routing protocol and selection of an efficient multicast transmission model has the potential to reduce energy consumption in Edge Computing (EC) enabled LLN. With the precise objective of reducing energy consumption, this paper utilises a well-known RDC technique in multicast communication scenarios. To this end, a series of experiments are conducted to evaluate the performance of the existing RDC mechanisms proposed in the literature. The evaluation results are then utilised to develop an efficient RDC-based multicast transmission model. The comparative performance analysis reveals a 23.7% reduction in the RDC rate compared to the traditional model, consequently improving the energy consumption of EC-enabled LLN.

In recent decade, the applications of the Internet of Things (IoT) have been widely spread out and the market of IoT has been rapidly growing. One of the essential elements in IoT structure is wireless sensor network (WSN) because it provides useful information anywhere and it makes IoT be more necessary technology in people’s daily life. The types of sensors in IoT are becoming more diverse beyond the conventional sensors, such as mobile phones, wearable devices, surveillance cameras, and even vehicles. Typically, in WSNs, the end users are more interested in fetching the updated sensed data no matter which node is producing that data.

The promising vision of information-centric networking (ICN) and of its realization, named data networking (NDN), has attracted extensive attention in recent years in the context of the Internet of Things (IoT) and wireless sensor networks (WSNs). However, a comprehensive NDN/ICN-based architectural design for WSNs, including specially tailored naming schemes and forwarding mechanisms, has yet to be explored. In this article, we present single-channel cluster-based information-centric WSN (CCIC-WSN), an NDN/ICN-based framework to fulfill the requirements of cluster-based WSNs, such as communication between child nodes and cluster heads (CHs), association of new child nodes with CHs, discovery of the namespace of newly associated nodes, and child node mobility. Through an extensive simulation study, we demonstrate that CCIC-WSN achieves 71%-90% lower energy consumption and 74%-96% lower data retrieval delays than recently proposed frameworks for NDN/ICN-based WSNs under various evaluation settings.

Nowadays, online applications are moving to the cloud, and for delay-sensitive ones, the cloud is being extended with edge/fog domains. Emerging cloud platforms that tightly integrate compute and network resources enable novel services, such as versatile IoT (Internet of Things), augmented reality or Tactile Internet applications. Virtual infrastructure managers (VIMs), network controllers and upper-level orchestrators are in charge of managing these distributed resources. A key and challenging task of these orchestrators is to find the proper placement for software components of the services. As the basic variant of the related theoretical problem (Virtual Network Embedding) is known to be NP-hard, heuristic solutions and approximations can be addressed. In this paper, we propose two architecture options together with proof-of-concept prototypes and corresponding embedding algorithms, which enable the provisioning of delay-sensitive IoT applications. On the one hand, we extend the VIM itself with network-awareness, typically not available in today's VIMs. On the other hand, we propose a multi-layer orchestration system where an orchestrator is added on top of VIMs and network controllers to integrate different resource domains. We argue that the large-scale performance and feasibility of the proposals can only be evaluated with complete prototypes, including all relevant components. Therefore, we implemented fully-fledged solutions and conducted large-scale experiments to reveal the scalability characteristics of both approaches. We found that our VIM extension can be a valid option for single-provider setups encompassing even 100 edge domains (Points of Presence equipped with multiple servers) and serving a few hundreds of customers. Whereas, our multi-layer orchestration system showed better scaling characteristics in a wider range of scenarios at the cost of a more complex control plane including additional entities and novel APIs (Application Programming Interfaces).

Blockchain is the most popular security network technology in the 21stcentury and still under active research. The consensus algorithms in Blockchain plays a major role and are crucial for maintaining the integrity and security of a distributed network. In addition, there are various problems arising from the consensus algorithms adopted in the existing Blockchain network. Therefore, it is of upmost importance to develop a consensus algorithm to address these problems. In this paper, therefore, we propose an efficient consensus algorithm in a Blockchain network environment consisting of several distributed users. First, we study the process of consensus among users to add new blocks to the existing Blockchain. Second, we introduce the other conventional consensus algorithms, analyze the problems of each algorithm, and propose Rock-Scissors-Paper (RSP) algorithm to mitigate these problems. The RSP algorithm is an algorithm that achieves consensus among distributed users using three static balanced variables, Rock (R), Scissors (S), and Paper (P) to avoid attacks by malicious participants. Furthermore, the propose RSP algorithm is compared with the existing consensus algorithms to predict the performance and its effects in a distributed mobile network environment.

As the number of vehicles is increasing, the number of road side accidents is also increasing rapidly. The majority of these accidents is caused by the negligence of the driver. For intelligent transportation services, new protocols and architecture are continuously being developed by researchers around the globe. Thus to ensure the safety of drivers many countries are now adopting and investing a lot on vehicular ad hoc network (VANET). On the other perspective, there are many issues related to this field that must be resolved before VANET technology is practically adopted. In the case of no or low‐security, several attacks can occur that may affect the efficiency and the reliability of the system. To make VANET systems more efficient software defined networking (SDN) technology is introduced in it. This technique was shortly named as SDN‐based VANET. SDN‐based VANET system helps us to get rid of the restriction and the challenges that are present in the simple VANET systems. It helps us to decrease the overall load on the network by managing the overall network through a single remote controller. In this survey paper, we will elaborate the concept of SDN‐based VANET, its working, applications, services, security threats, and benefits over the previous techniques.

Because IEEE802.15.4-based wireless sensor networks (WSNs) and IEEE802.11-based wireless local area networks (WLANs) use same ISM frequency bands, they interferes each other. Based on the past researches, the interference makes severe impacts on the performances of WSNs rather than that of WLANs. This paper proposes a method to improve IEEE802.15.4-based WSNs performances coexisting with WLANs by transmitting only beacon frames in interference-free-channels. The method increases the reliability of beacon frames as well as overall channel utilizations. The effectiveness of the proposed method is evaluated through the extensive simulations.

The use of IEEE 802.15.4 standard based application systems has been rapidly increasing, for example, in medical services, sensor networks, public safety systems, and home automation systems. However, issues arise from the fact that IEEE 802.15.4 standard based low rate wireless personal area networks (LR-WPANs) use the same frequency bands as wireless local area networks (WLANs), and they interfere with each other. Based on past research on this issue, the interference has a more serious impact on LR-WPANs’ performance than on WLANs’ performance. In this paper we propose a method to improve LR-WPANs’ performance while coexisting with WLANs, which is called the reliable beacon transmission based medium access control (MAC) protocol. Since the reliability of a beacon frame is important, in this method, only the beacon frame is transmitted in interference-free channels, and the data packets are transmitted in interfered channels instead of abandoning the channels altogether. This method increases the reliability of beacon frames as well as overall channel utilizations. The effectiveness of the proposed method was evaluated through extensive simulations, and this paper proves that this method improves the performance of IEEE 802.15.4 based wireless sensor networks (WSNs) over WLANs’ interferences.

Unlike analogue voice signal-oriented and narrowband-based conventional systems, the tactical wireless networks have been evolved to deal with multimedia traffics over wideband systems in a past decade. While new waveforms like Wideband Networking Waveform (WNW) have been developed for the physical layer of the future tactical networks, the enhancement in a network layer protocol is not well-reported. In this paper, an enhancement is proposed to improve the performances of the voice packet transmissions using the conventional TDMA-based protocol specified in MIL-STD-188-220 military standard over the wideband environments. By allowing stations to transmit voice packets in Bump-Slot, significant improvements are achieved. It is proved by the extensive simulations.

Even though multicast data transmissions in wireless communication standards doesn't require ARQ, to achieve reliable multicast over wireless channel, using ARQ is inevitable. However, unlike unicast, a sender needs to receive multiple acknowledgements (ACKs) from group members, and transmitting ACK from each group member degrades the network performance due to the overhead including multiple ACK packet transmissions and channel access process for ACKs and so on. An acknowledgement method with a minimum overhead is proposed in this paper, called OFDMA-based Multicast ACK (OMACK). The scheme uses one OFDM symbol for acknowledgements from all member stations (STAs), and each member STA indicates their packet reception status by allocating a symbol on previously allocated its own sub-carrier within the OFDM symbol. The proposed scheme is extensively evaluated by using simulation, and the results show that the scheme significantly reduces the aforementioned overhead comparing to legacy solutions and as a consequence improves the performance of the wireless networks.

We present an "opportunistic" scheduling policy with the objective of improving delay performance for time-sensitive users in wireless networks. Since packet delay depends on both resource allocation and time-varying capacity of wireless channels, we introduce a search radius (SR) into the framework of packet fair queueing (PFQ) and employ maximum relative SNR (Max-rSNR) as scheduling rule with the purpose of providing short-term temporal fairness guarantee and improving user throughput. We make theoretical analysis of the delay performance of each user and find that each user's delay is directly related to SR, moreover the value of SR should be restricted within a limited range in order to provide better delay performance to each user. Based on this, we propose a feasible iterative algorithm to achieve an appropriate SR. We conduct an extensive set of simulations, which characterizes the performance of our scheduling scheme.

In this paper, we present statistical fairness opportunistic scheduling (SFOS), a wireless scheduling algorithm with the objective of improving system throughput while providing statistical fairness guarantee. In particular, SFOS provides statistical fairness by using a virtual time variation, while improving system throughput by using our designed utility function which relates to the transmission rate. We develop a general analytical framework for SFOS, which shows that the fairness index is bounded by the utility. Further, we investigate the design rule of the utility function over Rayleigh fading channels and discrete transmission rates and present a reference design. Simulation results evaluate SFOS can significantly improve system throughput while providing statistical fairness guarantee.

We first examine the impact of channel errors and collisions on the performance of legacy IEEE 802.11 fragmentation, and find the optimal fragment size depends on both channel condition and network size. Then, we present an improved contention-free fragmentation burst (CFF) scheme, by which the source immediately retransmits the failed fragment without backoff procedure except for the first one. Finally, a channel adaptive fragmentation (ADF) scheme based on CFF is proposed to combat both channel errors and collisions. ADF can distinguish frame transmission failure caused by collision from that by channel error in moderate noisy channel. Simulations show our CFF and ADF have distinct performance improvements in noisy channel and large size networks.

The IEEE 802.11 standard defines two coordination functions: distributed coordination function (DCF) and point coordination function (PCF). These coordination functions coordinate the shared wireless medium. The PCF uses a centralized polling-based channel access method to support time-bounded services. To design an efficient polling scheme, the point coordinator (PC) needs to obtain information about the current transmission status and channel condition for each station. To reduce overhead caused by polling frames, it is better to poll all stations using one polling frame containing the transmission schedule. In this paper, we propose an efficient polling scheme, referred to as two-step multipolling (TS-MP), for the PCF in wireless local area networks (WLANs). In this new scheme, we propose to use two multipolling frames with different purposes. The first frame is broadcast to collect information such as the numbers of pending frames and the physical-layer transmission rates for the communication links among all stations. The second frame contains a polling sequence for data transmissions designed based on the collected information. This frame is broadcast to all stations. Extensive simulation studies show that TS-MP not only overcomes the aforementioned deficiencies, but also help to implement rate adaptation over time-varying wireless channel.

The IEEE 802.11 standard defines a centralized polling-based channel access method, the point coordination function (PCF), to support time-bounded services. In this paper, we propose an efficient polling scheme, referred to as two-step multipolling (TS-MP), for the PCF in WLANs. In this new scheme, we propose to use two multi-polling frames for different purposes. The first frame is broadcasted to collect information such as the numbers of pending frames and the physical layer transmission rates for the communication links among all stations. The second frame is broadcasted with a polling sequence for data transmissions designed by utilizing the collected information. Extensive simulation studies show that TS-MP not only overcomes PCFs deficiencies, but also helps to implement rate adaptation over a time-varying wireless channel.

The specification of high-rate wireless personal area network (HR WPAN) has been standardized by the IEEE 802.15.3 task group for communications of consumer electronics and portable communication devices and a final draft standard has been completed. The physical layer in IEEE 802.15.3 standard is designed to achieve data rates of 11-55Mbps. However, a MAC protocol in IEEE 802.15.3 standard does not specify the method to choose an appropriate data rate. In this paper, we propose a rate-adaptive medium access control (MAC) protocol for HR WPAN. The data rate for the next transmission is selected by channel prediction based on the currently received frame and informs the sender about the changed rate using a rate-adaptive acknowledgement (RA-ACK) frame. By overhearing the RA-ACK frame, a piconet controller can efficiently allocate channel times. In addition, we propose a constant physical layer frame length regardless of a data rate. In this way, the channel can be more effectively utilized by squeezing more bits into one transmission. The proposed scheme is evaluated under a time-correlated fading channel model in terms of the achieved throughput Simulation results show that this scheme achieves a much higher throughput than a non rate-adaptive MAC protocol in HR WPAN does.

Many rate-adaptive MAC protocols have been proposed in the past for wireless LANs over time-varying media to provide efficient channel usage and throughput enhancement. Most of these protocols are receiver-based and employ RTS/CTS collision avoidance handshakes specified in the distributed coordination function (DCF) of the IEEE802.11 MAC. However, these protocols do not consider the possible bursty transmission of fragments in a rate-adaptive fashion. In this paper, a rate-adaptive protocol with a dynamic fragmentation scheme is proposed in order to enhance the throughput by employing bursty fragment transmissions based on the channel condition. Instead of using one fragmentation threshold, multiple thresholds for different data rates are proposed so that more data can be transmitted at higher data rates when the channel is good. In the fragmentation scheme of IEEE802.11, all fragments are generated with equal size at the same time, and all fragments will not change until they are transmitted. In our proposed scheme, whenever the rate for the next transmission is chosen based on the channel condition estimated from the previous fragment transmission, a new fragment is generated using the fragment threshold for the new rate. In this way, the channel can be more effectively utilized to squeeze in more bits. This scheme is evaluated under a time-correlated fading channel model in terms of the achieved throughput. Simulation results show that this scheme achieves a much higher throughput than other rate-adaptive protocols do.