Average Packet Delay Research Articles

Revolutionizing MANET Route Discovery with INTSM: An Innovative Load Balancing Approach

Communication challenges in ad hoc networks arise due to the mobility of nodes, causing frequent changes in connections and locations. Maintaining network equilibrium to prevent node overload and underutilization is crucial. However, imposing static behaviors on nodes to improve performance can lead to delays, especially in core nodes. Addressing these issues, this research proposes the Intermediate Node Traffic Sharing Model (INTSM) for ad hoc networks. INTSM prioritizes congestion control and load balancing during route discovery, aiming to optimize network resource utilization and traffic distribution, thereby reducing packet delays. The model employs dynamic traffic sharing algorithms that consider real-time network conditions, enabling nodes to adjust their behaviour adaptively. This approach minimizes congestion by distributing traffic loads more evenly across the network, preventing bottlenecks at central nodes. Additionally, INTSM incorporates predictive analysis to foresee potential congestion points and reroute traffic proactively, enhancing overall network stability and performance. Extensive simulations demonstrate that INTSM significantly reduces average packet delay and improves throughput compared to traditional routing protocols. The results highlight the model's efficacy in diverse scenarios, including high mobility and varying traffic loads, proving its robustness and scalability. The primary objective of this study is to enhance navigation and equilibrium mechanisms to improve the performance of ad hoc networks, contributing to more reliable and efficient wireless communication systems. The findings of this research have significant implications for the design of future ad hoc networks, particularly in applications requiring high reliability and quick adaptation to changing network conditions, such as disaster recovery, military operations, and mobile sensor networks. By addressing the critical challenges of congestion control and load balancing, INTSM offers a promising solution to enhance the resilience and efficiency of ad hoc networks.

Analysis of Unmanned Aerial Vehicle-Assisted Cellular Vehicle-to-Everything Communication Using Markovian Game in a Federated Learning Environment

The paper studies a game theory model to ensure fairness and improve the communication efficiency in an unmanned aerial vehicle (UAV)-assisted cellular vehicle-to-everything (C-V2X) communication network using Markovian game theory in a federated learning (FL) environment. The UAV and each vehicle in a cluster utilized a strategy-based mechanism to maximize their model completion and transmission probability. We modeled a two-stage zero sum Markovian game with incomplete information to jointly study the utility maximization of the participating vehicles and the UAV in the FL environment. We modeled the aggregating process at the UAV as a mixed strategy game between the UAV and each vehicle. By employing Nash equilibrium, the UAV determined the probability of sufficient updates received from each vehicle. We analyzed and proposed decision-making strategies for several representative interactions involving gross data offloading and federated learning. When multiple vehicles enter a parameter transmission conflict, various strategy combinations are evaluated to decide which vehicles transmit their data to the UAV. The optimal payoff in a transmission window is derived using the Karush–Khun–Tucker (KKT) optimality conditions. We also studied the variation in optimal model parameter transmission probability, average packet delay, UAV transmit power, and the UAV–Vehicle optimal communication probabilities under different conditions.

A Method for 5G–ICN Seamless Mobility Support Based on Router Buffered Data

The 5G core network adopts a Control and User Plane Separation (CUPS) architecture to meet the challenges of low-latency business requirements. In this architecture, a balance between management costs and User Experience (UE) is achieved by moving User Plane Function (UPF) to the edge of the network. However, cross-UPF handover during communication between the UE and the remote server will cause TCP/IP session interruption and affect continuity of delay-sensitive real-time communication continuity. Information-Centric Networks (ICNs) separate identity and location, and their ability to route based on identity can effectively handle mobility. Therefore, based on the 5G-ICN architecture, we propose a seamless mobility support method based on router buffered data (BDMM), making full use of the ICN’s identity-based routing capabilities to solve the problem of UE cross-UPF handover affecting business continuity. BDMM also uses the ICN router data buffering capabilities to reduce packet loss during handovers. We design a dynamic buffer resource allocation strategy (DBRAS) that can adjust the buffer resource allocation results in time according to network traffic changes and business types to solve the problem of unreasonable buffer resource allocation. Finally, experimental results show that our method outperforms other methods in terms of average packet delay, weighted average packet loss rate, and network overhead. In addition, our method also has good performance in average handover delay.

Traffic Classification and Packet Scheduling Strategy with Deadline Constraints for Input-Queued Switches in Time-Sensitive Networking

Deterministic transmission technology is a core key technology that supports deterministic real-time transmission requirements for industrial control in Time-Sensitive Networking (TSN). It requires each network node to have a deterministic forwarding delay to ensure the real-time end-to-end transmission of critical traffic streams. Therefore, when forwarding data frames, the switch nodes must consider the time-limited requirements of the traffic. In the input-queued switch system, an algorithm for clock-synchronized deterministic network traffic classification scheduling (CSDN-TCS) is proposed to address the issue of whether a higher-quality-of-service (QoS) performance can be provided under packet deadline constraints. First, the scheduling problem of the switch is transformed into a decomposition problem of the traffic matrix. Secondly, the maximum weight-matching algorithm in graph theory is used to solve the matching results slot by slot. By fully utilizing the slot resources, as many packets as possible can be scheduled to be completed before the deadline arrives. For two types of packet scheduling problems, this paper uses the maximum flow algorithm with upper- and lower-bound constraints to move packets from a larger deadline set to idle slots in a smaller deadline set, enabling early transmission, reducing the average packet delay, and increasing system throughput. When there are three or more types of deadlines in the scheduling set, this scheduling problem is an NP-hard problem. We solve this problem by polling the two types of scheduling algorithms. In this paper, simulation experiments based on the switching size and line load are designed, and the Earliest Deadline First (EDF) algorithm and the Flow-Based Iterative Packet Scheduling (FIPS) algorithm are compared with the CSDN-TCS algorithm. The simulation results show that under the same conditions, the CSDN-TCS algorithm proposed in this paper outperforms the other two algorithms in terms of success rate, packet loss rate, average delay and throughput rate. Compared with the FIPS algorithm, the CSDN-TCS algorithm has lower time complexity under the same QoS performance.

Block chain technology for secured dynamic optimal routing in WSN with optimized generative adversarial capsule network

SummaryOne of the key strategies in wireless sensor network (WSN) for sending data packets to the base station (BC) is known as routing. However, malicious node outbreaks will occur, which exaggerate the functions of WSNs during the routing procedure. A secure routing protocol is necessary to protect the effectiveness of WSN and routing fortification. In real‐time scenarios, the existing routing protocol is volatile dynamically; it makes difficult to identify the performance of unprotected routing nodes. In this manuscript, a unique routing strategy is proposed for secured dynamic optimal routing (SDOR) in WSN that combines block chain technology optimized with a generative adversarial capsule network. Every routing sensor node contains a secret key, which is used to construct a crypto hash signature (CHS) token for flow access. The proposed block chain‐based WSN is used to provide SDOR information using a self‐attention‐based generative adversarial capsule network that is improved using the flamingo search algorithm. Following that, the security on the proposed block chain WSN is assessed from six angles. Block chain token transactions are evaluated using measures including average latency, average energy usage, and throughput. The proposed SDOR‐SA‐GAC‐FSA‐CHS‐BWSN delivers 53.87%, 42.57%, and 32.87% lower average packet delay, 28.97%, 37.73%, and 34.75% lesser identification time analyzed to the existing methods, such as trusted distributed routing scheme for WSNs using block chain (SDOR‐DCNN‐SSOA‐BWSN), secure authentication with DSM‐KL ascertained presentation optimization of hybrid block chain‐enabled model for multi‐WSN (SDOR‐DSM‐KL‐BWSN), and optimizing the valid transaction utilizing reinforcement learning‐based block chain ecosystem in WSN (SDOR‐RIL‐BWSN).

A Novel Analytical Model for the IEEE 802.11p/bd Medium Access Control, with Consideration of the Capture Effect in the Internet of Vehicles

The traditional vehicular ad hoc network (VANET), which is evolving into the internet of vehicles (IoV), has drawn great attention for its enormous potential in road safety improvement, traffic management, infotainment service support, and even autonomous driving. IEEE 802.11p, as the vital standard for wireless access in vehicular environments, has been released for more than one decade and its evolution, IEEE 802.11bd, has also been released for a few months. Since the analytical models for the IEEE 802.11p/bd medium access control (MAC) play important roles in terms of performance evaluation and MAC protocol optimization, a lot of analytical models have been proposed. However, the existing analytical models are still not accurate as a result of ignoring some important factors of the MAC itself and real communication scenarios. Motivated by this, a novel analytical model is proposed, based on a novel two-dimensional (2-D) Markov chain model. In contrast to the existing studies, all the important factors are considered in this proposed model, such as the backoff freezing mechanism, retry limit, post-backoff states, differentiated packet arrival probabilities for empty buffer queue, and queue model of packets in the buffer. In addition, the influence of the capture effect under a Nakagami-m fading channel has also been considered. Then, the expressions of successful transmission, collided transmission, normalized unsaturated throughput, and average packet delay are all meticulously derived, respectively. At last, the accuracy of the proposed analytical model is verified via the simulation results, which show that it is more accurate than the existing analytical models.

Improving QoS in mobile multimedia streaming with SCTP-PQ

The Stream Control Transmission Protocol (SCTP) is often the preferred transport layer protocol in streaming applications. This protocol combines the best aspects of Transmission Control Protocol (TCP) and User Datagram Protocol (UDP), but also offers additional features. SCTP supports multihoming and multi-streaming applications and has a congestion mechanism like TCP. Media streaming consists of different types of frames with different levels of importance. For example, I-frames carry more information than B-frames in Moving Picture Experts Group (MPEG). Usually, MPEG frames are processed using the First-In-First-Out (FIFO) algorithm. In this paper, a four-level priority queue integrated protocol named SCTP Priority Queue (SCTP-PQ) has been developed to reduce jitter and delay in real-time multimedia streaming for mobile devices. As part of the development, priority and retransmitted packets are determined on the sending side and these packets are processed faster by using the priority queue on the receiving side. In this way, the average queue delay of priority packets on the receiving side is reduced by 90 % and the throughput values are increased by an average of 10 times. The developed protocol has been extensively tested and compared with SCTP. The results show that the SCTP-PQ outperforms the standard SCTP in terms of jitter and delay.

An efficient adaptive routing algorithm for the Co-optimization of fault tolerance and congestion awareness based on 3D NoC

In this paper, we propose an adaptive, fault-tolerant, and congestion-aware (AFTC) routing algorithm. It improves the overall network performance of three-dimensional Network-on-Chip (3D NoC) in terms of deadlock-free, adaptability, fault tolerance, and balanced traffic. Firstly, the algorithm proposed 12 turn models to avoid deadlock problems. Then, the adaptability of the algorithm is improved by using the three-dimensional diagonal region division method. At the same time, the AFTC can reduce the number of turn-around steps during fault tolerance. Finally, the AFTC can balance traffic by setting different congestion thresholds. Compared with Vertical-Mesh-Conscious-Dynamic (VMCD) algorithm in terms of average packet delay and throughput, the AFTC algorithm can improve the throughput by an average of 27.29 % and 18.62 % while reducing the average delay time in different fault rates under uniform traffic and hotspot traffic patterns, respectively.

Stop & Offload: Periodic data offloading in UAV networks

Swarms of Unmanned Aerial Vehicles (UAVs) are a key technology to support communication in many harsh environments where fixed infrastructures (e.g., 5G) are disrupted or not available. However, the fast mobility and highly dynamic network topology pose unique challenges and require the development of novel multi-hop routing protocols. Previous work in this direction extends geographical protocols or adapts approaches designed for Mobile Ad-hoc NETworks (MANETs), rarely taking full advantage of UAV capabilities. In this paper, we introduce a novel data offloading approach, namely Stop & Offload, that exploits the device controllable mobility to facilitate network routing. The swarm of UAVs performs data offloading synchronously and recurrently. At fixed intervals of time, the swarm interrupts the sensing mission (Stop) and moves, as little as possible, to build a connected formation to the base station and offload the data (Offload). We provide both centralized solutions — assuming a long-range control channel — and a distributed solution — working in the absence of a control channel. By means of extensive simulations we show that our proposals outperform state-of-the-art solutions, decreasing the time taken to build a connected formation of about 45% and increasing the time spent on sensing of 10%. Additionally, we compared our protocol with various routing strategies and observe remarkable improvements, including a 50% reduction in average packet delay.

Transmission Timing Control among Both Aperiodic and Periodic Flows for Reliable Transfer by Restricted Packet Loss and within Permissible Delay in Wireless Sensor Networks

Nowadays, in various wireless sensor networks, both aperiodically generated packets like event detections and periodically generated ones for environmental, machinery, vital monitoring, etc. are transferred. Thus, packet loss caused by collision should be suppressed among aperiodic and periodic packets. In addition, some packets for wireless applications such as factory IoT must be transferred within permissible end-to-end delays, in addition to improving packet loss. In this paper, we propose transmission timing control of both aperiodic and periodic packets at an upper layer of medium access control (MAC). First, to suppress packet loss caused by collision, transmission timings of aperiodic and periodic packets are distributed on the time axis. Then, transmission timings of delay-bounded packets with permissible delays are assigned within the bounded periods so that transfer within their permissible delays is possible to maximally satisfy their permissible delays. Such control at an upper layer has advantages of no modification to the MAC layer standardized by IEEE 802.11, 802.15.4, etc. and low sensor node cost, whereas existing approaches at the MAC layer rely on MAC modifications and time synchronization among all sensor nodes. Performance evaluation verifies that the proposed transmission timing control improves packet loss rate regardless of the presence or absence of packet's periodicity and permissible delay, and restricts average transfer delay of delay-bounded packets within their permissible delays comparably to a greedy approach that transmits delay-bounded packets to the MAC layer immediately when they are generated at an upper layer.

A Novel Link Selection in Coordinated Direct and Buffer-Aided Relay Transmission

Buffer-aided relay networks provide more reliability and coverage in future wireless communications. Therefore, this paper investigates a buffer-aided cooperative relaying system with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> relays and a direct link from the source to the destination, providing a general scenario different from other existing state-of-the-art techniques. In particular, we propose a novel link selection scheme, which adaptively coordinates the selection priorities of the direct and cooperative relay link according to the instantaneous buffer state. The performance of the proposed link selection scheme is analyzed, in terms of outage probability, average packet delay (APD) and diversity order by providing closed-form expressions. For asymptotic analysis, a theoretical framework is presented by dividing all buffer states into different sets, which verifies that the minimum buffer size is just two for achieving the full diversity order of 2 <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> + 1. We also provide the relationship between the asymptotic APD and diversity order by adjusting predefined target queue lengths, which shows that the diversity order ranges from <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> + 1 to 2 <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> + 1 as the asymptotic APD ranges from 0 to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> time slots per packet. Both theoretical and simulation results demonstrate that direct transmission significantly improves the outage and delay performance simultaneously.

Efficient Detection and Localization of DoS Attacks in Heterogeneous Vehicular Networks

Vehicular communication has emerged as a powerful tool for providing a safe and comfortable driving experience for users. Long Term Evolution (LTE) supports and enhances the quality of vehicular communication due to its properties such as high data rate, spatial reuse, and low delay. However, high mobility of vehicles introduces a wide variety of security threats, including Denial-of-Service (DoS) attacks. In this paper, we propose effective solutions for real-time detection and localization of DoS attacks in an LTE-based vehicular network with mobile network components (e.g., vehicles, femto access points, etc.). We consider malicious data transmission by vehicles in two ways- using real identification (unintentional) and using fake identification (intentional). This paper makes three important contributions. First, we propose an efficient attack detection technique based on data packet counter and average Packet Delivery Ratio (PDR). Next, we present an improved attack detection framework using machine learning algorithms. We use some ML-based supervised classification algorithms to make detection more robust and consistent. Finally, we propose Data Packet Counter (DPC)-based, triangulation-based and measurement report based localization for both intentional and unintentional DoS attacks. We analyze the average packet delay incurred by vehicles by modelling the system as an <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$M/M/m$</tex-math></inline-formula> queue. Our experimental evaluation demonstrates that our proposed technique significantly outperforms state-of-the-art techniques.

Cooperative communication for safety message dissemination in unsaturated networks with varying contention windows

SummarySafety message dissemination is crucial in vehicular ad hoc networks (VANETs) for road safety applications. Vehicles regularly transmit safety messages to surrounding vehicles to prevent road accidents. However, changing vehicle mobility and density can cause unstable network conditions in VANETs, making it inappropriate to use a fixed contention window (CW) for different network densities. It has been proposed a 1‐D Markov model under unsaturation conditions to analyze the performance of the system with varying CWs under changing vehicle densities. Additionally, it introduces the use of cooperative communication (CoC) to relay failed safety messages. In CoC, two control packets, namely, negative acknowledge (NACK) and enable to cooperate (ETC), are utilized. The proposed analytical model named cooperative communication for safety message dissemination (CoC‐SMD) is used to calculate throughput and average packet delay for varying CW and different packet size. The simulation confirms the validity of the analytical results and show significant improvement in the metrics through the use of varying CW sizes and CoC compared with existing techniques.

ICN-Oriented Mobility Support Method for Dynamic Allocation of Mobile Data Flows

Information-centric networking (ICN) is a promising solution that can meet the challenges of IP-based networks. ICN adopts the solution of separating name and address to solve the dual semantics problem of IP addresses, which has natural advantages in supporting mobility. These mobility support methods in ICN have realized route optimization to a certain extent. In fact, due to these methods not considering the real-time network environment, such as the bandwidth of the switching path and the characteristics of different mobile data flows, these approaches adopt the same routing optimization solution for all data flows generated by mobile users, resulting in a single switching path. The bandwidth of a single switching path may not meet the transmission requirements of mobile data flows, which will greatly affect the performance of mobile users. Therefore, how to efficiently allocate switching paths for multiple mobile data flows generated by mobile users is an urgent problem in ICN mobility support. In this paper, we first propose a mobility support method for dynamically allocating mobile data flows (DAFM) based on the ICN mobility support architecture and model the mobile data flow allocation problem as a late-binding node selection problem. We then propose a double-constraints heuristic algorithm (DCHA) based on the Moser algorithm. By simultaneously adjusting the bandwidth resource constraints of the switching path and the space resource constraints of the Mobility Flow Table (MFT), we achieve late-binding node selection to minimize average packet delay. Finally, experimental results show that our proposal can achieve mobility support. Under the guarantee of a low-latency Name Resolution System (NRS), our method outperforms other methods in terms of average packet delay, packet loss rate, and handover delay.

Model of optimal distribution of network resources with constraints on quality of service indicators

Existing algorithms and mathematical models of queuing at the nodes of a telecommunications network are considered in this paper. The necessity of coordinated solutions to problems of distribution of channel and buffer resources of the network is shown. A model for the optimal distribution of channel and buffer resources on network nodes has been developed. The optimization (minimization) criterion is the total average packet delay with constraints on the quality of service (QoS) indicators of heterogeneous flows. The optimization problem is presented as a constrained nonlinear programming problem and solved using the “fmincon” program of the optimization toolbox MATLAB package.

Adaptive global coordination of local routing policies for communication networks

We consider optimal routing of data packets in communication networks featuring time-variable flow rates and bandwidth limitations. Taking into account recent programmability developments in communication systems, we propose a two-level control scheme: routers with a programmable data plane implement local proportional control policies that forward the incoming data to different available output interfaces at line rate. The local controllers’ parameters are adapted periodically on a slower time scale by a logically centralized (software-defined) network controller running a global coordination algorithm that keeps the routing feasible and optimal with respect to a network metric, such as the average packet delay. A robust optimization approach is selected to handle traffic variations in-between global adaptation steps. The outcome is a non-convex Quadratically Constrained Quadratic Program (QCQP), for which we present an iterative solution approach that is computationally suitable for realistically-sized backbone communication networks. With simulation experiments, we demonstrate the advantages of adaptive, global routing coordination compared to fixed, globally or locally-determined policies, especially concerning packet loss.

Data Interworking Model and Analysis for Harmonization of Smart Metering Protocols in IoT-Based AMI System

In the energy sector, since the adoption of remote device management for massive advanced metering infrastructure (AMI) devices and Internet of Things (IoT) technology using a representational state transfer (RESTful) architecture, a blurred boundary has been developed between traditional AMI and IoT. With respect to smart meters, the standard-based smart metering protocol, called the device language message specification (DLMS) protocol, still has a predominant role in the AMI industry. Thus, we aim to propose a novel data interworking model in this article that embraces the DLMS protocol in AMI using the most promising IoT protocol, the so-called lightweight machine-to-machine (LwM2M) protocol. We provide a 1:1 conversion model using the correlation of the two protocols with an analysis of the object modeling and resource management methods of both the LwM2M and DLMS protocols. The proposed model utilizes a complete RESTful architecture, which is the most beneficial in the LwM2M protocol. It improves the average packet transmission efficiency and packet delay on the plaintext and encrypted text (session establishment and authenticated encryption) by 52.9%p and 9.9%p, respectively, and by 11.86 ms for both cases, compared to the encapsulation method of the LwM2M protocol, KEPCO's current approach. This work provides the key idea to unify the protocol for the remote metering and device management of field devices into the LwM2M protocol, and it is expected that this work will improve the efficiency in the operation and management of KEPCO's AMI system.

Study on fine-grained mechanism of delay guarantee based on idea of particle access in wireless networks

Aiming at the problems existing in the current mechanisms of delay guarantee in wireless networks(i.e. poor scalability, coarse granularity for provided service levels, and improving delay performance at the expense of sacrificing some resource utilization), this paper puts forward both the idea of particle access and the corresponding access mechanism. In this paper, a traffic flow is modeled as a group of information particles that carry a certain amount of information and are valid for certain periods of time. Firstly, the definitions of information particles and the group of information particles are given. It is proved that the minimum reachable access bandwidth of an information particle group can be achieved by using the EDF(earliest deadline first) transmission strategy. Moreover, a fine-grained mechanism of delay guarantee based on the idea of particle access is proposed for the dynamic access environment in wireless networks. Extensive simulations are carried out for the application scenario of downlink transmissions, and it is shown that, in the case of heavy traffic loads, comparing with the rapid growth of the average packet delays and the packet loss rates in a legacy access mechanism, the proposed fine-grained access strategy based on the idea of particle access can also achieve the better performance on the average packet delays and the packet loss rates, and hence higher effective throughput is obtained. The research in this paper pave a new way for further improving quality of service (QoS) mechanisms of wireless networks.

Performance Analysis of IEEE 802.11p MAC with Considering Capture Effect under Nakagami-m Fading Channel in VANETs

Vehicular ad hoc networks (VANETs) have recently drawn a large amount of attention because of their enormous potential in road safety improvement and traffic management as well as infotainment service support. As the standard of medium access control (MAC) and physical (PHY) layers for VANETs, IEEE 802.11p has been proposed for more than a decade. Though performance analyses of IEEE 802.11p MAC have been performed, the existing analytical methods still need to be improved. In this paper, to assess the saturated throughput and the average packet delay of IEEE 802.11p MAC in VANETs, a two-dimensional (2-D) Markov model is introduced by considering the capture effect under Nakagami-m fading channel. Moreover, the closed-form expressions of successful transmission, collided transmission, saturated throughput, and average packet delay are carefully derived. Finally, the simulation results are demonstrated to verify the accuracy of the proposed analytical model, which also proves that this analytical model is more precise than the existing ones in terms of saturated throughput and average packet delay.

Energy-balanced neuro-fuzzy dynamic clustering scheme for green & sustainable IoT based smart cities

The Internet of Things (IoT) is a pervasive computing technology that provides solutions to critical sustainable smart city applications. Each sustainable application has its own set of requirements, including energy efficiency, Quality of Service (QoS), hardware, and software resources. Even though green IoT devices operate in a resource-constrained environment. Monitoring, recognizing, and responding to activities that entail continuous access to timely information in a partially or fully distributed ecosystem is a difficult task. To overcome the challenges of resource management in the IoT, we proposed an energy-efficient Dynamic Clustering Routing (DCR) protocol using a neuro-fuzzy technique for restricting the resources of IoT devices. The proposed protocol uses a dynamic self-organizing neural network to create dynamic clusters in a network. The test-bed analysis is for computing the real-time event detection and clustering sensor nodes using TinyOS. The simulation result shows that the proposed protocol achieved a significant gain over peer-competing well-known green communication routing protocols like Low-energy Adaptive Clustering Hierarchy (LEACH) and Low-energy Adaptive Clustering Hierarchy-Centralized (LEACH-C). The proposed model results show that using neuro-fuzzy logic is effective for sustainable IoT devices and green smart city applications in terms of resource management and dynamic clustering. The result analysis shows that the proposed protocol shows an average 35% significant gain on the First Node Dies (FND), Last Node Dies (LND), the number of packets sent to CH & BS, network convergence time, network overhead, and average packet delay to compare with the LEACH and LEACH-C.