To see the other types of publications on this topic, follow the link: Packet drop probability.
Journal articles on the topic 'Packet drop probability'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 44 journal articles for your research on the topic 'Packet drop probability.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
AL-DIABAT, MOFLEH, HUSSEIN ABDEL-JABER, FADI THABTAH, OSMAN ABOU-RABIA, and MAHMOUD KISHTA. "ANALYTICAL MODELS BASED DISCRETE-TIME QUEUEING FOR THE CONGESTED NETWORK." International Journal of Modeling, Simulation, and Scientific Computing 03, no. 01 (March 2012): 1150004. http://dx.doi.org/10.1142/s1793962311500048.
Full textAbstract:
Congestion is one of the well-studied problems in computer networks, which occurs when the request for network resources exceeds the buffer capacity. Many active queue management techniques such as BLUE and RED have been proposed in the literature to control congestions in early stages. In this paper, we propose two discrete-time queueing network analytical models to drop the arrival packets in preliminary stages when the network becomes congested. The first model is based on Lambda Decreasing and it drops packets from a probability value to another higher value according to the buffer length. Whereas the second proposed model drops packets linearly based on the current queue length. We compare the performance of both our models with the original BLUE in order to decide which of these methods offers better quality of service. The comparison is done in terms of packet dropping probability, average queue length, throughput ratio, average queueing delay, and packet loss rate.
2
Hamadneh, Nabhan, Mamoon Obiedat, Ahmad Qawasmeh, and Mohammad Bsoul. "HRED, An Active Queue Management Algorithm for TCP Congestion Control." Recent Patents on Computer Science 12, no. 3 (May 8, 2019): 212–17. http://dx.doi.org/10.2174/2213275912666181205155828.
Full textAbstract:
Background: Active Queue Management (AQM) is a TCP congestion avoidance approach that predicts congestion before sources overwhelm the buffers of routers. Random Early Detection (RED) is an AQM strategy that keeps history of queue dynamics by estimating an average queue size parameter avg and drops packets when this average exceeds preset thresholds. The parameter configuration in RED is problematic and the performance of the whole network could be reduced due to wrong setup of these parameters. Drop probability is another parameter calculated by RED to tune the drop rate with the aggressiveness of arriving packets. Objective: In this article, we propose an enhancement to the drop probability calculation to increase the performance of RED. Methods: This article studies the drop rate when the average queue size is at the midpoint between the minimum and maximum thresholds. The proposal suggests a nonlinear adjustment for the drop rate in this area. Hence, we call this strategy as the Half-Way RED (HRED). Results: Our strategy is tested using the NS2 simulator and compared with some queue management strategies including RED, TD and Gentle-RED. The calculated parameters are: throughput, link utilization and packet drop rate. Conclusion: Each performance parameter has been plotted in a separate figure; then the robustness of each strategy has been evaluated against these parameters. The results suggest that this function has enhanced the performance of RED-like strategies in controlling congestion. HRED has outperformed the strategies included in this article in terms of throughput, link utilization and packet loss rate.
3
Jafri, Syed Talib Abbas, Irfan Ahmed, and Sundus Ali. "Queue-Buffer Optimization Based on Aggressive Random Early Detection in Massive NB-IoT MANET for 5G Applications." Electronics 11, no. 18 (September 18, 2022): 2955. http://dx.doi.org/10.3390/electronics11182955.
Full textAbstract:
Elements in massive narrowband Internet of Things (NB-IoT) for 5G networks suffer severely from packet drops due to queue overflow. Active Queue Management (AQM) techniques help in maintaining queue length by dropping packets early, based on certain defined parameters. In this paper, we have proposed an AQM technique, called Aggressive Random Early Detection (AgRED) which, in comparison to previously used Random Early Detection (RED) and exponential RED technique, improves the overall end-to-end delay, throughput, and packet delivery ratio of the massive NB-IoT 5G network while using UDP. This improvement has been achieved due to a sigmoid function used by the AgRED technique, which aggressively and randomly drops the incoming packets preventing them from filling the queue. Because of the incorporation of the AgRED technique, the queue at different nodes will remain available throughout the operation of the network and the probability of delivering the packets will increase. We have analyzed and compared the performance of our proposed AgRED technique and have found that the performance gain for the proposed technique is higher than other techniques (RED and exponential RED) and passive queue management techniques (drop-tail and drop-head). The improvement in results is most significant in congested network deployment scenarios and provides improvements in massive Machine Type Communication, while also supporting ultra-low latency and reliable communication for 5G applications.
4
Bemani, Ali, and Niclas Björsell. "Distributed Event Triggering Algorithm for Multi-Agent System over a Packet Dropping Network." Sensors 21, no. 14 (July 15, 2021): 4835. http://dx.doi.org/10.3390/s21144835.
Full textAbstract:
The availability of wireless networked control systems (WNCSs) has increased the interest in controlling multi-agent systems. Multiple feedback loops are closed over a shared communication network in such systems. An event triggering algorithm can significantly reduce network usage compared to the time triggering algorithm in WNCSs, however, the control performance is insecure in an industrial environment with a high probability of the packet dropping. This paper presents the design of a distributed event triggering algorithm in the state feedback controller for multi-agent systems, whose dynamics are subjected to the external interaction of other agents and under a random single packet drop scenario. Distributed event-based state estimation methods were applied in this work for designing a new event triggering algorithm for multi-agent systems while retaining satisfactory control performance, even in a high probability of packet drop condition. Simulation results for a multi-agent application show the main benefits and suitability of the proposed event triggering algorithm for multi-agent feedback control in WNCSs with packet drop imperfection.
5
Hassan, Samuuel Oluwatosin, Vivian Ogochukwu Nwaocha, Adewole Usman Rufai, Tola John Odule, Theophilus Aniemeka Enem, Lukman Adebayo Ogundele, and Suleiman Abu Usman. "Random early detection-quadratic linear: an enhanced active queue management algorithm." Bulletin of Electrical Engineering and Informatics 11, no. 4 (August 1, 2022): 2262–72. http://dx.doi.org/10.11591/eei.v11i4.3875.
Full textAbstract:
This paper identifies the lone linear drop function for computing the dropping probability between certain queue threshold values as a major weakness for the random early detection (RED) algorithm as it leads to large delay and queue instability. To address this concern, we propose an enhanced RED-based algorithm called random early detection-quadratic linear (referred to as “RED-QL”) active queue management (AQM) which leveraged the benefit of a quadratic packet drop function for a light-to moderate traffic load conditions together with a linear packet drop function for a heavy traffic load condition respectively. Results from ns-3 network simulator using different experimental scenarios clearly reveals that the proposed RED-QL algorithm yields a substantial reduction in delay performance and indeed a reduced average queue size than other three representative AQM algorithms. RED-QL is robust, easy to implement and deploy in routers (both in software and hardware) as no more than the packet drop probability profile of the classic RED’s algorithm implementation needs modest alteration.
6
Liang, Guangjun, Qi Zhu, Jianfang Xin, Jiashan Tang, and Tianjiao Zhang. "Performance Analysis of Buffer-Aided Relaying System Based on Data and Energy Coupling Queuing Model for Cooperative Communication Networks." Wireless Communications and Mobile Computing 2017 (2017): 1–14. http://dx.doi.org/10.1155/2017/9287489.
Full textAbstract:
We focus on the performance analysis of the buffer-aided relaying system which allows data and energy packets to arrive independently and depart interactively. First, we profile the cooperative relaying system model as a data arrival and energy arrival coupling queuing model. Considering the influence of channel condition on the data departure rate, a new relay transmit protocol which permits exhausting more energy packet to send one data packet in the bad channel environment is proposed. Second, the joint data packet and energy packet handling problem is ascribed to a Coupled Processor Queuing Model which could achieve its steady state transition probability by Quasi-Birth and Death method. Third, the expressions of throughput, delay, and packet drop rate for both data queue and energy queue are also derived. Simulations are demonstrated to verify the analytical results under different data arrival rate, energy arrival rate, and relaying strategy.
7
Sharma, Mohit K., and Chandra R. Murthy. "Packet Drop Probability Analysis of Dual Energy Harvesting Links With Retransmission." IEEE Journal on Selected Areas in Communications 34, no. 12 (December 2016): 3646–60. http://dx.doi.org/10.1109/jsac.2016.2611919.
Full text
8
Preye, Uguta Henry, and Onyejegbu Laeticia Nneka. "An Intelligent Fuzzy Logic System for Network Congestion Control." Circulation in Computer Science 2, no. 11 (December 20, 2017): 23–30. http://dx.doi.org/10.22632/ccs-2017-252-69.
Full textAbstract:
Network congestion is a major problem in all network environments as such it calls for ways to manage this problem. In this paper, we propose a Fuzzy Regulator Effective Random Early Detection (FRERED) system, which is an intelligent fuzzy logic based controller technique for early stage congestion detection, at the router buffer in the networks. The proposed technique extends the Fuzzy-Based system in the Fuzzy Hybrid ERED algorithm by considering the delay variable in its inference system to ease the problem of parameter initialization and parameter dependency. Unlike the Fuzzy-Based controller in the existing Fuzzy Hybrid ERED system which uses two parameter settings in its inference system that is, the queue size and average queue length in computing the dropping probability of packets. The proposed technique uses the queue size, average queue length and the delay approximation as input variables in computing the packet drop probability. The applied fuzzy logic system yields an output that denotes a packet dropping probability, which in turn controls and prevents congestion in early stage. This was achieved after simulating the proposed technique and the existing Fuzzy-Based controller using Matlab. The results obtained shows that this approach results in less packet drops for about the same link utilization as the existing Fuzzy-Based controller. Therefore, this technique, generally, controls network congestion and improves network performance. The methodology used to achieve this is the object oriented methodology and JAVA programming language was used to develop the system.
9
Rawayau, Aminu Haruna, Muhammad Dikko Amadi, Mubarak Kabir Kankara, Mahmud Muhammad Yahaya, and Samaila Bello. "HEURISTIC GATEWAY PLACEMENT FOR MINIMAL TRANSMISSION POWER & COLLISION PROBABILITY IN AN INTERNET OF THINGS LOW POWER WIDE AREA NETWORK (HGPMTPIoT-LPWAN)." FUDMA JOURNAL OF SCIENCES 7, no. 3 (May 21, 2023): 1–6. http://dx.doi.org/10.33003/fjs-2023-0703-1765.
Full textAbstract:
A variety of long-range (LoRa), low-power, and low bit-rate wireless network technologies have been made possible by the Internet of Things' (IoT) rapid growth. As a radio technology for the implementation of numerous Internet of Things applications, the LoRa low-power wide area network (LPWAN) has gained prominence. LoRa is frequently used in conjunction with the Long-Range Wide Area Network Media Access Control (LoRaWAN MAC) protocol and functions in the Industrial, Scientific, and Medical (ISM) bands, which are unlicensed. As a result of receiving a wide variety of different message sizes from diverse applications, LoRa networks experience scalability issues when the number of end nodes connected to one network is more than the shared number of channels. This results in collisions and packet loss. In this paper, heuristic gateway placement for minimal transmission power & collision probability in an internet of things low power wide area network (HGPMTPIOT-LPWAN) is proposed to increase network efficiency, and improve overall performance by measuring collision probability, which in turn can help to reduce the need for retransmissions and packet drop rate. The things network simulator is used to measure the collisions and packet drop rate. An improved performance for HGPMTPIOT as against the efficient graph-based gateway placement (EGBGP) for large-scale LoRaWAN deployments is achieved for packet drop rate by 6%. Likewise, the simulation results show improvements in terms of decreasing the collision probability for 20 to 60 nodes by 20%.
10
Boriboon, Anupon, and Siriwhaddhanah Pongpadpinit. "The HSBQ Algorithm with Triple-play Services for Broadband Hybrid Satellite Constellation Communication System." International Journal of Advances in Telecommunications, Electrotechnics, Signals and Systems 5, no. 2 (July 8, 2016): 108. http://dx.doi.org/10.11601/ijates.v5i2.169.
Full textAbstract:
The HSBQ algorithm is the one of active queue management algorithms, which orders to avoid high packet loss rates and control stable stream queue. That is the problem of calculation of the drop probability for both queue length stability and bandwidth fairness. This paper proposes the HSBQ, which drop the packets before the queues overflow at the gateways, so that the end nodes can respond to the congestion before queue overflow. This algorithm uses the change of the average queue length to adjust the amount by which the mark (or drop) probability is changed. Moreover it adjusts the queue weight, which is used to estimate the average queue length, based on the rate. The results show that HSBQ algorithm could maintain control stable stream queue better than group of congestion metric without flow information algorithm as the rate of hybrid satellite network changing dramatically, as well as the presented empiric evidences demonstrate that the use of HSBQ algorithm offers a better quality of service than the traditionally queue control mechanisms used in hybrid satellite network.
11
Chydzinski, Andrzej, and Blazej Adamczyk. "On the Influence of AQM on Serialization of Packet Losses." Sensors 23, no. 4 (February 15, 2023): 2197. http://dx.doi.org/10.3390/s23042197.
Full textAbstract:
We study the influence of the active queue management mechanism based on the queue size on the serialization of packet losses, i.e., the occurrences of losses in long, consecutive series. We use a traffic model able to mimic precisely the autocorrelation function of traffic, which is known to be far from zero in packet networks. The main contribution is a theorem on the burst ratio parameter, describing the serialization of losses, proven for an arbitrary function assigning drop probabilities to queue sizes. In numerical examples, we show the impact of the autocorrelation strength, drop probability function, and load of the link, on the serialization of losses.
12
Kato, Kaito, Hideyuki Kato, Hiroyuki Asahara, Daisuke Ito, and Takuji Kousaka. "Effects on random early detection of the packet drop probability function with an adjustable nonlinearity." Nonlinear Theory and Its Applications, IEICE 14, no. 2 (2023): 193–206. http://dx.doi.org/10.1587/nolta.14.193.
Full text
13
Sospeter, John, Di Wu, Saajid Hussain, and Tesfanesh Tesfa. "An Effective and Efficient Adaptive Probability Data Dissemination Protocol in VANET." Data 4, no. 1 (December 21, 2018): 1. http://dx.doi.org/10.3390/data4010001.
Full textAbstract:
Mobile network topology changes dynamically over time because of the high velocity of vehicles. Therefore, the concept of the data dissemination scheme in a VANET environment has become an issue of debate for many research scientists. The main purpose of VANET is to ensure passenger safety application by considering the critical emergency message. The design of the message dissemination protocol should take into consideration effective data dissemination to provide a high packet data ratio and low end-to-end delay by using network resources at a minimal level. In this paper, an effective and efficient adaptive probability data dissemination protocol (EEAPD) is proposed. EEAPD comprises a delay scheme and probabilistic approach. The redundancy ratio (r) metric is used to explain the correlation between road segments and vehicles’ density in rebroadcast probability decisions. The uniqueness of the EEAPD protocol comes from taking into account the number of road segments to decide which nodes are suitable for rebroadcasting the emergency message. The last road segment is considered in the transmission range because of the probability of it having small vehicle density. From simulation results, the proposed protocol provides a better high-packet delivery ratio and low-packet drop ratio by providing better use of the network resource within low end-to-end delay. This protocol is designed for only V2V communication by considering a beaconless strategy. the simulations in this study were conducted using Ns-3.26 and traffic simulator called “SUMO”.
14
Shanmugam, Kannan, Karthik Subburathinam, and Arunachalam Velayuthampalayam Palanisamy. "A Dynamic Probabilistic Based Broadcasting Scheme for MANETs." Scientific World Journal 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/1832026.
Full textAbstract:
MANET is commonly known as Mobile Ad Hoc Network in which cluster of mobile nodes can communicate with each other without having any basic infrastructure. The basic characteristic of MANET is dynamic topology. Due to the dynamic behavior nature, the topology of the network changes very frequently, and this will lead to the failure of the valid route repeatedly. Thus, the process of finding the valid route leads to notable drop in the throughput of the network. To identify a new valid path to the targeted mobile node, available proactive routing protocols use simple broadcasting method known as simple flooding. The simple flooding method broadcasts the RREQ packet from the source to the rest of the nodes in mobile network. But the problem with this method is disproportionate repetitive retransmission of RREQ packet which could result in high contention on the available channel and packet collision due to extreme traffic in the network. A reasonable number of routing algorithms have been suggested for reducing the lethal impact of flooding the RREQ packets. However, most of the algorithms have resulted in considerable amount of complexity and deduce the throughput by depending on special hardware components and maintaining complex information which will be less frequently used. By considering routing complexity with the goal of increasing the throughput of the network, in this paper, we have introduced a new approach called Dynamic Probabilistic Route (DPR) discovery. The Node’s Forwarding Probability (NFP) is dynamically calculated by the DPR mobile nodes using Probability Function (PF) which depends on density of local neighbor nodes and the cumulative number of its broadcast covered neighbors.
15
Bagali, Sheetal, and Ramakrishnan Sundaraguru. "Distributed resource allocation model with presence of multiple jammer for underwater wireless sensor networks." Indonesian Journal of Electrical Engineering and Computer Science 30, no. 2 (May 1, 2023): 1002. http://dx.doi.org/10.11591/ijeecs.v30.i2.pp1002-1010.
Full textAbstract:
Underwater-wireless sensor network (WSN) are prone to the jamming attacks; mainly in case of reactive jamming. Reactive jamming has emerged as one of the critical security threat for underwater-WSN; this occurs due to the reactive jammer capabilities of controlling and regulating jamming duration. Further reactive jammer possesses low detection probability and high vulnerability; moreover the existing model has been designed in consideration with terrestrial-WSN. Hence these models possesses limited capabilities of detecting the jamming and distinguish among uncorrupted and corrupted packets; also it fails to adapt with the dynamic environment. Furthermore co-operative mechanism of jamming model is presented for utilizing the resources in efficient way; however only few existing work has been carried out through the co-operative jamming detection; especially under presence of multiple jammer nodes. For overcoming research issues this paper presents distributed resource allocation (DRA) model adopting cross layer architecture under presence of multiple jammer. DRA algorithm is designed for allocating resource to jammer user in optimal manner. Experiment outcome shows the proposed DRA model achieves much better detection rate considering multi-jammer environment. Thus aid in achieving much better detection accuracy, packet drop, packet transmission and resource utilization performance.
16
Hassan, Samuel O., Adewole U. Rufai, Michael O. Agbaje, Theophilus A. Enem, Lukman A. Ogundele, and Suleiman A. Usman. "Improved random early detection congestion control algorithm for internet routers." Indonesian Journal of Electrical Engineering and Computer Science 28, no. 1 (October 1, 2022): 384. http://dx.doi.org/10.11591/ijeecs.v28.i1.pp384-395.
Full textAbstract:
In the internet, router plays a strategic role in the transmission of data packets. Active queue management (AQM) aimed at managing congestion by keeping a reduced average buffer occupancy and hence a minimal delay. The novel random early detection (RED) algorithm suffers from large average buffer occupancy and delay shortcomings. This problem is due in part to the existence of a distinctive linear packet drop function it deploys. In this paper, we present a new version of RED, called improved RED (IMRED). An important strategy of IM-RED is to deploy two dropping functions: i) nonlinear (i.e. quadratic) to deal with both light-and moderatenetwork traffic load conditions, and ii) linear to deal with heavy traffic load condition. Simulation experiments conducted using open-source ns-3 software to evaluate and compare the functionality of the proposed IM-RED with other two previous AQM algorithms confirmed that IM-RED reduces the average buffer occupancy and obtained an improved delay performance especially at heavy network traffic load scenario. Very fortunately, since RED algorithm is known to appear as a built-in model in ns-3 and even Linux kernel, its implementation can therefore be leveraged to obtain IMRED while only adjusting the packet dropping probability profile and holding on to its other attributes.
17
Avrachenkov, Kostia, and Uri Yechiali. "RETRIAL NETWORKS WITH FINITE BUFFERS AND THEIR APPLICATION TO INTERNET DATA TRAFFIC." Probability in the Engineering and Informational Sciences 22, no. 4 (September 25, 2008): 519–36. http://dx.doi.org/10.1017/s0269964808000314.
Full textAbstract:
Data on the Internet is sent by packets that go through a network of routers. A router drops packets either when its buffer is full or when it uses the Active Queue Management. Currently, the majority of the Internet routers use a simple Drop Tail strategy. The rate at which a user injects the data into the network is determined by transmission control protocol (TCP). However, most connections in the Internet consist only of few packets, and TCP does not really have an opportunity to adjust the sending rate. Thus, the data flow generated by short TCP connections appears to be some uncontrolled stochastic process. In the present work we try to describe the interaction of the data flow generated by short TCP connections with a network of finite buffers. The framework of retrial queues and networks seems to be an adequate approach for this problem. The effect of packet retransmission becomes essential when the network congestion level is high. We consider several benchmark retrial network models. In some particular cases, an explicit analytic solution is possible. If the analytic solution is not available or too entangled, we suggest using a fixed-point approximation scheme. In particular, we consider a network of one or two tandem M/M/1/K-type queues with blocking and with an M/M/1/∞-type retrial (orbit) queue. We explicitly solve the models with particular choices of K, derive stability conditions for K≥1, and present several graphs based on numerical results.
18
Bazmi, Parisa, and Manijeh Keshtgary. "A NEURAL NETWORK BASED TRAFFIC-AWARE FORWARDING STRATEGY IN NAMED DATA NETWORKING." IIUM Engineering Journal 17, no. 2 (November 30, 2016): 59–69. http://dx.doi.org/10.31436/iiumej.v17i2.617.
Full textAbstract:
Named Data Networking (NDN) is a new Internet architecture which has been proposed to eliminate TCP/IP Internet architecture restrictions. This architecture is abstracting away the notion of host and working based on naming datagrams. However, one of the major challenges of NDN is supporting QoS-aware forwarding strategy so as to forward Interest packets intelligently over multiple paths based on the current network condition. In this paper, Neural Network (NN) Based Traffic-aware Forwarding strategy (NNTF) is introduced in order to determine an optimal path for Interest forwarding. NN is embedded in NDN routers to select next hop dynamically based on the path overload probability achieved from the NN. This solution is characterized by load balancing and QoS-awareness via monitoring the available path and forwarding data on the traffic-aware shortest path. The performance of NNTF is evaluated using ndnSIM which shows the efficiency of this scheme in terms of network QoS improvementof17.5% and 72% reduction in network delay and packet drop respectively.
19
Amit Kumar Bindal, Kunal Goel,. "Dynamic Scheduler for WSN Applications in Precision Agriculture." Mathematical Statistician and Engineering Applications 71, no. 2 (May 11, 2022): 390–98. http://dx.doi.org/10.17762/msea.v71i2.100.
Full textAbstract:
Sensors may be configured to collect the various parameters those do not change over a long interval (i.e. water level, soil attributes/ fertilizer quantity of agriculture land/ growth of crops). In case, if all sensors start transmission after a lengthy intermission, it may cause packet drop over network and excessive resources may be exhausted due to retransmission. To manage the bulk data forwarding with minimum resource consumption, in this paper, an application scheduler is introduced to enforce the discipline bulk data transmission. Its performance is analyzed using LEACH protocol under the constraints of various parameters (Throughput/remaining energy/number of dead/alive sensors) with sensor density (100-300).
20
Song, Jia Jia, and Zhi Xue Zhang. "Research on the Improvement of RED Algorithm in Network Congestion Control." Applied Mechanics and Materials 713-715 (January 2015): 2471–77. http://dx.doi.org/10.4028/www.scientific.net/amm.713-715.2471.
Full textAbstract:
RED algorithm is a kind of implementation which is relatively simple, and better solutions to optimize the network congestion problem, but the RED algorithm of control for the network changes is relatively sensitive, So in practical applications may be to enhance the practical utility of RED algorithm by artificially setting control parameters. In this paper, analysis the effect of maximum drop probability on the queue and average queue based on the discrete TCP/RED feedback network model. And discuss when the queue length stabilized at the desired target, the relationship of the maximum drop probaility value with other network parameters. Based on theoretical analysis, proposed an improved RED algorithm, based on NS-2 simulation results show that this algorithm has good average latency and packet loss rate in a complex network environment, superior FRED and BLUE algorithm.
21
Hassan, Samuel Oluwatosin, Adewole Usman Rufai, Vivian Ogochukwu Nwaocha, Samson Ojo Ogunlere, Aderonke Adelola Adegbenjo, Michael Olugbenga Agbaje, and Theophilus Aniemeka Enem. "Quadratic exponential random early detection: a new enhanced random early detection-oriented congestion control algorithm for routers." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 1 (February 1, 2023): 669. http://dx.doi.org/10.11591/ijece.v13i1.pp669-679.
Full textAbstract:
<span>Network congestion is still a problem on the internet. The random early detection (RED) algorithm being the most notable and widely implemented congestion algorithm in routers faces the problems of queue instability and large delay arising from the presence of an ineffectual singular linear packet dropping function. This research article presents a refinement to RED, named quadratic exponential random early detection (QERED) algorithm, which exploits the advantages of two drop functions, namely quadratic and exponential in order to enhance the performance of RED algorithm. ns-3 simulation studies using various traffic load conditions to assess and benchmark the effectiveness of QERED with two improved variants of RED affirmed that QERED offers a better performance in terms of average queue size and delay metrics at various network scenarios. Fortunately, to replace/upgrade the implementation for RED algorithm with QERED’s in routers will require minimal effort due to the fact that nothing more besides the packet dropping probability profile got to be adjusted.</span>
22
Giri, Sovanjyoti, and Rajarshi Roy. "On NACK-Based rDWS Algorithm for Network Coded Broadcast." Entropy 21, no. 9 (September 17, 2019): 905. http://dx.doi.org/10.3390/e21090905.
Full textAbstract:
The Drop when seen (DWS) technique, an online network coding strategy is capable of making a broadcast transmission over erasure channels more robust. This throughput optimal strategy reduces the expected sender queue length. One major issue with the DWS technique is the high computational complexity. In this paper, we present a randomized version of the DWS technique (rDWS), where the unique strength of the DWS, which is the sender’s ability to drop a packet even before its decoding at receivers, is not compromised. Computational complexity of the algorithms is reduced with rDWS, but the encoding is not throughput optimal here. So, we perform a throughput efficiency analysis of it. Exact probabilistic analysis of innovativeness of a coefficient is found to be difficult. Hence, we carry out two individual analyses, maximum entropy analysis, average understanding analysis, and obtain a lower bound on the innovativeness probability of a coefficient. Based on these findings, innovativeness probability of a coded combination is analyzed. We evaluate the performance of our proposed scheme in terms of dropping and decoding statistics through simulation. Our analysis, supported by plots, reveals some interesting facts about innovativeness and shows that rDWS technique achieves near-optimal performance for a finite field of sufficient size.
23
Sarkar, Nurul I., Roman Ammann, and Salahuddin Muhammad Salim Zabir. "Analyzing TCP Performance in High Bit Error Rate Using Simulation and Modeling." Electronics 11, no. 14 (July 19, 2022): 2254. http://dx.doi.org/10.3390/electronics11142254.
Full textAbstract:
While Transmission Control Protocol (TCP) works well with a low bit error rate (BER), the performance of TCP degrades significantly if the BER rises above a certain level. A study of the performance of TCP with high BER is required for the efficient design and deployment of such systems. In this paper, we address the problem of TCP performance in high BERs and analyze the issues by investigating the effect of BERs on system performance. We consider TCP Reno in our study to explore the system performance using extensive analysis of simulation and modeling. In the analysis, we consider the amount of datagram sent and retransmitted, mean throughput, link-layer overhead, TCP window size, FTP download response time, packet dropping and retransmission, and the TCP congestion avoidance mechanism. We validate simulation results by setting up a virtualized testbed using Linux hosts and a Linux router. The results obtained show that TCP throughput degrades significantly and eventually collapses at the packet drop probability of 10% (BER = 10−5). The FTP download response time is about 32 times longer than that of a perfect channel (no packet dropping). We found that TCP Reno cannot handle such a high BER to operate in wireless environments effectively. Finally, we provide recommendations for network researchers and engineers confronted with the challenge of operating TCP over noisy channels.
24
Suma, P., O. Nagaraju, and Md Ali Hussain. "Node Disjoint Random and Optimal Path Selection (NDROPS) Algorithm for Security in MANETS." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 3 (June 1, 2017): 1197. http://dx.doi.org/10.11591/ijece.v7i3.pp1197-1203.
Full textAbstract:
<p class="ABSTRACT">Mobile Adhoc Networks are shortly called MANETs. In these types of networks, fixed infrastructures are absent and are dynamic in nature. Nodes are movable, and they are not connected with any wires. For monitoring or supervising the transmissions in MANETS, no central supervision is present. Moving nodes, dynamic topology, and absence of infrastructure are the features of MANETs. These features are advantageous where wires cannot be used and where nodes are supposed to move. But there is a problem of security. Networks are highly prone to attacks where finding the root of the cause is very hard. Many nodes disjoint routing algorithms are proposed to balance the load, to cope up with link failures, etc. This paper proposes an algorithm called Node Disjoint Random and Optimal Path Selection (NDROPS) algorithm which uses the concept of dynamic routing and node disjoint routing to provide all the above-stated advantages along with security. Routing of data packets is done through few paths which are node disjoint. The main essence of this algorithm is to distribute the data among different routes. So, a malicious node in a path can retrieve only a few packets in random. The simulation of the proposed NDROPS algorithm is performed and the performance is compared using throughout and packet drop probability.</p>
25
Bharathi, L., N. Sangeethapriya, S. Dola Sanjay, R. Durgaprasad, and Y. Lavanya. "An Improved Link Stability Based on Swift Exploring Packet Ratio Using Expected Time Matrix in Wireless Sensor Network." Journal of Computational and Theoretical Nanoscience 17, no. 12 (December 1, 2020): 5528–34. http://dx.doi.org/10.1166/jctn.2020.9449.
Full textAbstract:
Wireless sensor networks become the integral part of network data transmission, to monitor information from a complex geographic range link may be failure due to transmission ratio. Expecting Power Saving, such a sensor network that has gained poor efficiency for the link broken, communication designed to be placed in a risk and non-access area, with wireless sensor networks playing an important in channel communication as stability of power. The Origin Challenge begins with a worm entering the wireless network to stabilize the link. The worm spreads to the entire network for infection in the link terminal. Mostly adjacent node as the affected nodes is rapidly blocked, and not infected. The target position is to route the target link when packets flow ground access to monitoring region is blocked, a solution is to send, the remote sensor. To propose an efficient method of Link stability based on swift exploring packet ratio using expected time matrix in wireless sensor network (SEPR-ETC). Improvement of the target coverage probability should be accomplished by accurate sensor arrangement, loss of large gait link density in the drop zone improved by estimating. The data collected from the sensors are sent to the central node for processing to cover the need to be constantly operated the communication Link. Swift state use the packet flow to monitor the network resources through good cooperative communication to reduce the amount of data that needs to be transmitted collectively, while the wireless sensor networks are in the industry to reduce bit energy consumption. The proposed SEPR-ETC model provides an advanced technique for controlling link exploring transmission compared to the existing model.
26
Chumchu, Prawit, Roksana Boreli, and Aruna Seneviratne. "A Model-based Scalable Reliable Multicast Transport Protocol for Satellite Networks." Journal of Communications Software and Systems 1, no. 1 (April 6, 2017): 24. http://dx.doi.org/10.24138/jcomss.v1i1.313.
Full textAbstract:
In this paper, we design a new scalable reliable multicast transport protocol for satellite networks (RMT). This paper is the extensions of paper in [18]. The proposed protocoldoes not require inspection and/or interception of packets at intermediate nodes. The protocol would not require anymodification of satellites, which could be bent-pipe satellites or onboard processing satellites. The proposed protocol is divided in 2 parts: error control part and congestion control part. In error control part, we intend to solve feedback implosion and improve scalability by using a new hybrid of ARQ (Auto Repeat Request) and adaptive forward error correction (AFEC). The AFEC algorithm adapts proactive redundancy levels following the number of receivers and average packet loss rate. This leads to a number of transmissions and the number of feedback signals are virtually independent of the number of receivers. Therefore, wireless link utilization used by the proposed protocol is virtually independent of the number of multicast receivers. In congestion control part, the proposed protocol employs a new window-based congestion control scheme, which is optimized for satellite networks. To be fair to the other traffics, the congestion control mimics congestion control in the wellknown Transmission Control Protocol (TCP) which relies on “packet conservation” principle. To reduce feedback implosion, only a few receivers, ACKers, are selected to report the receiving status. In addition, in order to avoid “drop-to-zero” problem, we use a new simple wireless loss filter algorithm. This loss filter algorithm significantly reduces the probability of the congestion window size to be unnecessarily reduced because of common wireless losses. Furthermore, to improve achievable throughput, we employ slow start threshold adaptation based on estimated bandwidth. The congestion control also deals with variations in network conditions by dynamically electing ACKers.
27
Lim, Sangsoon. "IACR: an interference-aware channel reservation for wireless sensor networks." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 2 (April 1, 2019): 1220. http://dx.doi.org/10.11591/ijece.v9i2.pp1220-1225.
Full textAbstract:
<span>In battery-based wireless sensor networks, energy-efficient operation is one of the most important factors. Especially, in order to improve energy efficiency in wireless sensor networks, various studies on low power operation have been actively conducted in the MAC layer. In recent years, mutual interference among various radio technologies using the same radio frequency band has become a serious problem. Wi-Fi, ZigBee, and Bluetooth use the same frequency band of 2.4GHz at the same time, which causes various signal interference problems. In this paper, we propose a novel channel reservation scheme, called IACR, to improve the energy efficiency of wireless sensor networks in an environment where interference occurs between various wireless technologies. The proposed scheme inserts a PN code into a long preamble for exchanging transmission status information between a transmitting node and a receiving node, thereby improving the transmission success probability while receiving less influence on transmission of other radio technologies. We performed an event-driven simulation and an experiment to measure the signal detection rate. As a result, it can be seen that the proposed technique reduces the packet drop rate by 15% and increases the discoverable distance of the control packet for channel reservation.</span>
28
Tabash, I. K., M. A. Mamun, and A. Negi. "A Fuzzy Logic Based Network Congestion Control Using Active Queue Management Techniques." Journal of Scientific Research 2, no. 2 (April 26, 2010): 273–84. http://dx.doi.org/10.3329/jsr.v2i2.2786.
Full textAbstract:
Conventional IP routers are passive devices that accept packets and perform the routing function on any input. Usually the tail-drop (TD) strategy is used where the input which exceeds the buffer capacity are simply dropped. In active queue management (AQM) methods routers manage their buffers by dropping packets selectively. We study one of the AQM methods called as random exponential marking (REM). We propose an intelligent approach to AQM based on fuzzy logic controller (FLC) to drop packets dynamically, keep the buffer size around desired level and also prevent buffer overflow. Our proposed approach is based on REM algorithm, which drops the packets by drop probability function. In our proposal we replace the drop probability function by a FLC to drop the packets, stabilize the buffer around the desired size and reduce delay. Simulation results show a better regulation of the buffer. Keywords: Random exponential marking; Active queue management; Fuzzy logic controller; Pro-active queue management. © 2010 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved. DOI: 10.3329/jsr.v2i2.2786 J. Sci. Res. 2 (2), 273-284 (2010)
29
Abu-Shareha, Ahmad Adel, Basil Al-Kasasbeh, Qusai Y. Shambour, Mosleh M. Abualhaj, and Sumaya N. Al-Khatib. "Fuzzy Comprehensive Random Early Detection of Router Congestion." Information Technology and Control 51, no. 2 (June 23, 2022): 252–67. http://dx.doi.org/10.5755/j01.itc.51.2.30194.
Full textAbstract:
The queue length and the load rate should be monitored to overcome the problem of router congestion due to the increase in network utilization and achieve a high-speed transmission. Previous active queue management methods manage the queued packets in the router buffer to maintain high network performance. However, these methods depend on monitoring indicators that do not cover all the congestion signs, leading to packet loss and delay. Accordingly, all the congestion signs should be wrapped into these indicators and managed by an algorithm that randomly drops packets to avoid global synchronization, loss, and delay. In this paper, a fuzzy comprehensive random early detection (FCRED) is proposed to deal with the gap in network monitoring and congestion control at the router buffer. FCRED is built by using three indicators, which monitor the router's arrival, departure, and queue length. Accordingly, a fuzzy inference process is developed to manage these indicators and calculate the dropping probability (Dp). Simulation results show that FCRED improves loss and packet dropping under various network statuses compared with RED, BLUE, and ERED. In terms of loss, FCRED achieves zero loss at high congested status. For dropping, FCRED achieves an optimal rate of 0.47 with an arrival rate of 0.95. For the throughput and delay, FCRED achieves the best results. Accordingly, the proposed FCRED method achieves zero loss and reduces packet dropping from 0.28 to 0.21, a 25% reduction compared with the best performance of these methods. Compared with recent fuzzy-based methods, the proposed FCRED achieves comparable results and outperforms them by dropping more packets to avoid loss, which in such case is necessary dropping.
30
Tiwari, Ranjeet Kumar, Shovan Bhaumik, Paresh Date, and Thiagalingam Kirubarajan. "Particle Filter for Randomly Delayed Measurements with Unknown Latency Probability." Sensors 20, no. 19 (October 6, 2020): 5689. http://dx.doi.org/10.3390/s20195689.
Full textAbstract:
This paper focuses on developing a particle filter based solution for randomly delayed measurements with an unknown latency probability. A generalized measurement model that includes measurements randomly delayed by an arbitrary but fixed maximum number of time steps along with random packet drops is proposed. Owing to random delays and packet drops in receiving the measurements, the measurement noise sequence becomes correlated. A model for the modified noise is formulated and subsequently its probability density function (pdf) is derived. The recursion equation for the importance weights is developed using pdf of the modified measurement noise in the presence of random delays. Offline and online algorithms for identification of the unknown latency parameter using the maximum likelihood criterion are proposed. Further, this work explores the conditions that ensure the convergence of the proposed particle filter. Finally, three numerical examples, one with a non-stationary growth model and two others with target tracking, are simulated to show the effectiveness and the superiority of the proposed filter over the state-of-the-art.
31
Zhou, Qizhao, Junqing Yu, and Dong Li. "An Adaptive Authenticated Model for Big Data Stream SAVI in SDN-Based Data Center Networks." Security and Communication Networks 2021 (September 21, 2021): 1–14. http://dx.doi.org/10.1155/2021/5451820.
Full textAbstract:
With the rapid development of data-driven and bandwidth-intensive applications in the Software Defined Networking (SDN) northbound interface, big data stream is dynamically generated with high growth rates in SDN-based data center networks. However, a significant issue faced in big data stream communication is how to verify its authenticity in an untrusted environment. The big data stream traffic has the characteristics of security sensitivity, data size randomness, and latency sensitivity, putting high strain on the SDN-based communication system during larger spoofing events in it. In addition, the SDN controller may be overloaded under big data stream verification conditions on account of the fast increase of bandwidth-intensive applications and quick response requirements. To solve these problems, we propose a two-phase adaptive authenticated model (TAAM) by introducing source address validation implementation- (SAVI-) based IP source address verification. The model realizes real-time data stream address validation and dynamically reduces the redundant verification process. A traffic adaptive SAVI that utilizes a robust localization method followed by the Sequential Probability Ratio Test (SPRT) has been proposed to ensure differentiated executions of the big data stream packets forwarding and the spoofing packets discarding. The TAAM model could filter out the unmatched packets with better packet forwarding efficiency and fundamental security characteristics. The experimental results demonstrate that spoofing attacks under big data streams can be directly mitigated by it. Compared with the latest methods, TAAM can achieve desirable network performance in terms of transmission quality, security guarantee, and response time. It drops 97% of the spoofing attack packets while consuming only 9% of the controller CPU utilization on average.
32
Subathra, P., S. Sivagurunathan, and N. Ramaraj. "Detection and Prevention of Single and Cooperative Black Hole Attacks in Mobile Ad Hoc Networks." International Journal of Business Data Communications and Networking 6, no. 1 (January 2010): 38–57. http://dx.doi.org/10.4018/jbdcn.2010010103.
Full textAbstract:
A Mobile Ad hoc Network (MANET) is a collection of wireless computers (nodes) communicating over multi-hop paths, without infrastructures such as base stations and access points. Nodes must cooperate to provide necessary network functionalities. The Dynamic Source Routing (DSR) protocol is a principal routing protocol in MANET, where security can be compromised by a “Black Hole” attack. In this attack, a malicious node claims to have the shortest path to the destination and attracts all traffic and drops all packets sent for forwarding, leading to performance degradation in the network. The situation becomes even more severe when two or more nodes cooperate and perform an attack called the “Cooperative Black Hole” attack. This article proposes a solution based on probing to identify and prevent such attacks. The proposed solution discovers a secure route between the source and destination by identifying and isolating both single and cooperative black holes, making the MANET resistant against such attacks. Simulation results show that the protocol provides better security and performance in terms of detection time, packet delivery ratio and false negative probability in comparison with trust and probe based schemes.
33
Tung, K. L., Y. L. Chang, J. Y. Lai, C. H. Chang, and C. J. Chuang. "A CFD study of the deep bed filtration mechanism for submicron/nano-particle suspension." Water Science and Technology 50, no. 12 (December 1, 2004): 255–64. http://dx.doi.org/10.2166/wst.2004.0721.
Full textAbstract:
The mechanism of the deep bed filtration for submicron and nano particles suspension was conducted by means of a force analysis on the suspended particles flow path through order-packed granular filter beds. The flow fields through the filter beds were calculated by using the commercial available CFD software - Fluent. Various types of granular packing structures, such as the simple cubic packing, bodycentered packing and face-centered packing structures were chosen for analysis. The motion of suspended particle of 2.967, 0.816, 0.460 and 0.050 μm in diameter, respectively, were tracked by considering the following forces including a net gravitational force, hydraulic drag force, lift force, Brownian force, van der Waals force and a double layer force. The effects of the granular bed packing structure, the porosity of these beds and the suspended particle diameter on the capture efficiency of a granular filter bed were examined. The force analysis depicts that the inertial effect and van der Waals force increased the capture probability of particles on the granular filter bed while the lift force and the Brownian force decreased the particle deposition. Simulated results show that among the chosen packing structures, the face-center packed granular bed gives the greatest pressure drop and capture efficiency of particles due to the lower packing porosity. The simple cubic packed filter bed showed the lowest pressure drop and capture efficiency of particles due to the greatest packing porosity among the chosen packing structures. It is mainly due to the simple cubic packing structure in which there exists the free vertical downward flowing path and thus exhibits a higher packing porosity. The comparisons of the simulated capture efficiency with experimental results depicted that the body-centre packed granular bed showed the best approximation of capture efficiency compared to that of the randomly packed granular bed.
34
Cetinkaya, Ahmet, Hideaki Ishii, and Tomohisa Hayakawa. "An Overview on Denial-of-Service Attacks in Control Systems: Attack Models and Security Analyses." Entropy 21, no. 2 (February 22, 2019): 210. http://dx.doi.org/10.3390/e21020210.
Full textAbstract:
In this paper, we provide an overview of recent research efforts on networked control systems under denial-of-service attacks. Our goal is to discuss the utility of different attack modeling and analysis techniques proposed in the literature for addressing feedback control, state estimation, and multi-agent consensus problems in the face of jamming attacks in wireless channels and malicious packet drops in multi-hop networks. We discuss several modeling approaches that are employed for capturing the uncertainty in denial-of-service attack strategies. We give an outlook on deterministic constraint-based modeling ideas, game-theoretic and optimization-based techniques and probabilistic modeling approaches. A special emphasis is placed on tail-probability based failure models, which have been recently used for describing jamming attacks that affect signal to interference-plus-noise ratios of wireless channels as well as transmission failures on multi-hop networks due to packet-dropping attacks and non-malicious issues. We explain the use of attack models in the security analysis of networked systems. In addition to the modeling and analysis problems, a discussion is provided also on the recent developments concerning the design of attack-resilient control and communication protocols.
35
Manfredi, Luciano, and Jonas Mureika. "Horizon Wavefunction of Generalized Uncertainty Principle Black Holes." Advances in High Energy Physics 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/1543741.
Full textAbstract:
We study the Horizon Wavefunction (HWF) description of a Generalized Uncertainty Principle inspired metric that admits sub-Planckian black holes, where the black hole mass m is replaced by M=m1+β/2MPl2/m2. Considering the case of a wave-packet shaped by a Gaussian distribution, we compute the HWF and the probability PBH that the source is a (quantum) black hole, that is, that it lies within its horizon radius. The case β<0 is qualitatively similar to the standard Schwarzschild case, and the general shape of PBH is maintained when decreasing the free parameter but shifted to reduce the probability for the particle to be a black hole accordingly. The probability grows with increasing mass slowly for more negative β and drops to 0 for a minimum mass value. The scenario differs significantly for increasing β>0, where a minimum in PBH is encountered, thus meaning that every particle has some probability of decaying to a black hole. Furthermore, for sufficiently large β we find that every particle is a quantum black hole, in agreement with the intuitive effect of increasing β, which creates larger M and RH terms. This is likely due to a “dimensional reduction” feature of the model, where the black hole characteristics for sub-Planckian black holes mimic those in (1+1) dimensions and the horizon size grows as RH~M-1.
36
R. Rohini and K. Krishnan. "Analysis of Two-Echelon Inventory System with Two Demand Classes with Partial Backlogging." International Journal of Fuzzy Mathematical Archive 15, no. 02 (2018): 137–47. http://dx.doi.org/10.22457/ijfma.v15n2a4.
Full textAbstract:
This paper deals with a continuous review two-echelon inventory system with two demand classes. Two echelon inventory systems consist of one retailer (lower echelon) and one distributor (upper echelon) handling a single finished product. The demand at retailer is of two types. The First type of demand is usual single unit and the second type is of bulk or packet demand. The arrival distribution for single and packet demands are assumed to be independent Poisson with rates λ1(>0) and λd (>0) respectively. The operating policy at the lower echelon for the (s, S) that is whenever the inventory level drops to ‘s’ on order for Q = (S-s) items is placed, the ordered items are received after a random time which is distributed as exponential with rate µ>0. We assume that the demands occurring during the stock-out period are lost. The retailer replenishes the stock from the distributor which adopts (0, M) policy. The objective is to minimize the anticipated total cost rate by simultaneously optimizing the inventory level. The joint probability disruption of the inventory levels at retailer and the distributor are obtained in the steady state case. Various system performance measures are derived and the long run total expected inventory cost rate is calculated. Several instances of numerical examples, which provide insight into the behavior of the system, are presented.
37
Rehman, Ghani Ur, Muhammad Zubair, Iqbal Qasim, Afzal Badshah, Zafar Mahmood, Muhammad Aslam, and Syeda Fizah Jilani. "EMS: Efficient Monitoring System to Detect Non-Cooperative Nodes in IoT-Based Vehicular Delay Tolerant Networks (VDTNs)." Sensors 23, no. 1 (December 22, 2022): 99. http://dx.doi.org/10.3390/s23010099.
Full textAbstract:
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.
38
Quadir, Md Abdul, J. Christy Jackson, J. Prassanna, K. Sathyarajasekaran, K. Kumar, H. Sabireen, Shivam Ubarhande, and V. Vijaya Kumar. "An efficient algorithm to detect DDoS amplification attacks." Journal of Intelligent & Fuzzy Systems 39, no. 6 (December 4, 2020): 8565–72. http://dx.doi.org/10.3233/jifs-189173.
Full textAbstract:
Domain name system (DNS) plays a critical part in the functioning of the Internet. But since DNS queries are sent using UDP, it is vulnerable to Distributed Denial of Service (DDoS) attacks. The attacker can take advantage of this and spoof the source IP address and direct the response towards the victim network. And since the network does not keep track of the number of requests going out and responses coming in, the attacker can flood the network with these unwanted DNS responses. Along with DNS, other protocols are also exploited to perform DDoS. Usage of Network Time Protocol (NTP) is to synchronize clocks on systems. Its monlist command replies with 600 entries of previous traffic records. This response is enormous compared to the request. This functionality is used by the attacker in DDoS. Since these attacks can cause colossal congestion, it is crucial to prevent or mitigate these types of attacks. It is obligatory to discover a way to drop the spoofed packets while entering the network to mitigate this type of attack. Intelligent cybersecurity systems are designed for the detection of these attacks. An Intelligent system has AI and ML algorithms to achieve its function. This paper discusses such intelligent method to detect the attack server from legitimate traffic. This method uses an algorithm that gets activated by excess traffic in the network. The excess traffic is determined by the speed or rate of the requests and responses and their ratio. The algorithm extracts the IP addresses of servers and detects which server is sending more packets than requested or which are not requested. This server can be later blocked using a firewall or Access Control List (ACL).
39
Singh, Preeti, J. K. Rai, and Ajay K. Sharma. "Hybrid buffer and AWG based add-drop optical packet switch." Journal of Optical Communications, July 12, 2021. http://dx.doi.org/10.1515/joc-2021-0058.
Full textAbstract:
Abstract Optical packet switching (OPS) exhibits the ability to be utilized as a data transmission technique for next-generation. The core router/switch plays a significant role in packet routing and buffering in OPS. Arrayed waveguide grating (AWG) is realized as a promising core element for fast optical switching, with its intrinsic capacity to achieve wavelength routing of different wavelengths in parallel. This paper proposes an AWG-based add-drop optical packet switch, including a hybrid buffer, to resolve contention among packets. In a hybrid buffer, both optical and electronic buffers are used for the buffering of contending packets. AWGs are affected by crosstalk that can significantly impair system operation. The physical layer analysis is discussed in the presence of crosstalk, and the performance of the switch is evaluated in terms of bit error rate. The desired minimum input power is calculated for the switch’s correct operation for both optical buffer and electronic buffer. Finally, the packet loss probability (PLP) of the hybrid buffer is examined under various buffering conditions. Results reveal that with the increase in the optical power of the input signal, crosstalk power increases linearly for optical and electronic buffers. The increased crosstalk power is higher for electronic buffers than the optical buffer. The use of electronic memory in the hybrid buffer allows the hybrid buffer to increase its buffer size thus, reducing the PLP.
40
Mohammad Sirajuddin and Dr. B. Sateesh Kumar. "Mitigation of Black Hole and Selective Forwarding Attacks through Active Trust Mechanisms in Wireless Sensor Networks." International Journal of Scientific Research in Computer Science, Engineering and Information Technology, May 10, 2023, 329–37. http://dx.doi.org/10.32628/cseit2390395.
Full textAbstract:
In modern times, security remains a significant concern in wireless networks. Wireless sensor networks are widely employed in different practical situations. WSNs struggle with numerous internal and external threats, and detecting and defending against insider attacks is difficult. Insider attacks, in which intruders discard received data packets selectively, pose a significant risk to WSNs. The presence of black hole nodes within the network causes this issue. This research paper presents a secure and reliable route management methodology for WSNs that selects nodes and routing paths based on trust metrics. The proposed mechanism employs intelligent routing and node selection to defend against various types of assaults encountered during the routing process, including selective forwarding and black hole attacks. As a result, the paper identifies secure routes and establishes secure network routing. This scheme uses throughput, latency, and packet drop ratio as performance metrics. Experimentation demonstrates that the proposed system effectively increases the probability of secure network routing paths while extending the network lifecycle.
41
Nobahari, Ainaz, and Seyed Javad Mirabedini. "DSVL: Detecting Selfish Node In Vehicular Ad-hoc Networks (VANET) by Learning Automata." DSVL: Detecting Selfish Node In Vehicular Ad-hoc Networks (VANET) by Learning Automata, August 2, 2021, 1–28. http://dx.doi.org/10.32908/ahswn.v53.7989.
Full textAbstract:
Vehicular Ad-hoc Networks (VANETs) are a set of mobile nodes that move on the road and connect via wireless. Due to the limited radio range, they send data to each other by collaborating. Some nodes drop the other nodes’ packets to save the network supplements; therefore, the network’s performance will reduce. So it is necessary to identify selfish nodes to prevent other nodes from cooperating with them. In the proposed scheme, a punishmentbased algorithm is presented to identify the selfish nodes used in Adaptive Resonance Theory (ART) clustering to monitor and control them. The cluster head determines if selfish behaviors occur in the cluster or not. If the cluster head discovers that there is a selfish behavior in the cluster, it begins to check the packets that were sent and received by all nodes. In the proposed method, each node in the network is equipped with learning automata, the probability of selecting each neighbor node to send the packet, which is rewarded or punished according to the performance. Simulation results have shown that the rate of detection of selfish nodes is more than other methods, and the false alarm rate (FAR) is less than other similar methods.
42
Ghazvini, Mahdieh, Naser Movahedinia, and Kamal Jamshidi. "A Game Theory based Contention Window Adjustment for IEEE 802.11 under Heavy Load." International Journal of Communication Networks and Information Security (IJCNIS) 5, no. 2 (April 17, 2022). http://dx.doi.org/10.17762/ijcnis.v5i2.293.
Full textAbstract:
The 802.11 families are considered as the most applicable set of standards for Wireless Local Area Networks (WLANs) where nodes make access to the wireless media using random access techniques. In such networks, each node adjusts its contention window to the minimum size irrespective of the number of competing nodes, so in saturated mode and excessive number of nodes available, the network performance is reduced due to severe collision probability. A cooperative game is being proposed to adjust the users’ contention windows in improving the network throughput, delay and packet drop ratio under heavy traffic load circumstances. The system’s performance evaluated by simulations indicate some superiorities of the proposed method over 802.11-DCF (Distribute Coordinate Function).
43
Alese, Boniface Kayode, Bamidele Moses Kuboye, and Omolara Iyabode Alabede. "Development of Recovery and Redundancy Model for Real Time Wireless Networks." Journal of Computer Science Research 4, no. 3 (August 31, 2022). http://dx.doi.org/10.30564/jcsr.v4i3.4915.
Full textAbstract:
The growth in wireless technologies applications makes the necessity of providing a reliable communication over wireless networks become obvious. Guaranteeing real time communication in wireless medium poses a significant challenge due to its poor delivery reliability. In this study, a recovery and redundancy model based on sequential time division multiple access (S-TDMA) for wireless communication is developed. The media access control (MAC) layer of the S-TDMA determines which station should transmit at a given time slot based on channel state of the station. Simulations of the system models were carried out using MATLAB SIMULINK software. SIMULINK blocks from the signal processing and communication block sets were used to model the communication system. The S-TDMA performance is evaluated with total link reliability, system throughput, average probability of correct delivery before deadline and system latency. The evaluation results displayed in graphs when compared with instant retry and drop of frame were found to be reliable in recovering loss packets.
44
Ugwu, Godwin Onyekachi, Udora Nwabuoku Nwawelu, Mamilus Aginwa Ahaneku, and Cosmas Ikechukwu Ani. "Effect of service differentiation on QoS in IEEE 802.11e enhanced distributed channel access: a simulation approach." Journal of Engineering and Applied Science 69, no. 1 (January 4, 2022). http://dx.doi.org/10.1186/s44147-021-00055-3.
Full textAbstract:
AbstractThe enhanced distributed channel access (EDCA) protocol is a supplement to IEEE 802.11 medium access control (MAC), ratified by IEEE 802.11e task group to support quality of service (QoS) requirements of both data and real-time applications. Previous research show that it supports priority scheme for multimedia traffic but strict QoS is not guaranteed. This can be attributed to inappropriate tuning of the medium access parameters. Thus, an in-depth analysis of the EDCA protocol and ways of tuning medium access parameters to improve QoS requirements for multimedia traffic is presented in this work. An EDCA model was developed and simulated using MATLAB to assess the effect of differentiating contention window (CW) and arbitration inter-frame space (AIFS) of different traffic on QoS parameters. The optimal performance, delay, and maximum sustainable throughput for each traffic type were computed under saturation load. Insight shows that traffic with higher priority values acquired most of the available channels and starved traffic with lower priority values. The AIFS has more influence on the QoS of EDCA protocol. It was also observed that small CW values generate higher packet drops and collision rate probability. Thus, EDCA protocol provides mechanism for service differentiation which strongly depends on channel access parameters: CW sizes and AIFS.