Journal articles: 'Packet drops'

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

2

THONG, WILSON WANG-KIT, and GUANRONG CHEN. "COMPLEX DYNAMICAL BEHAVIORS OF DEFLECTION ROUTING ON GRID NETWORKS." International Journal of Bifurcation and Chaos 22, no. 07 (July 2012): 1250169. http://dx.doi.org/10.1142/s0218127412501696.

Full text

Abstract:

Deflection routing is a mechanism to route packets away from congestion. Traditional shortest path routing uses only the static topological information as input, whereas deflection routing takes into account the dynamic queue length information. In the simplest form of deflection routing, a packet being dropped due to queue buffer overflow is "rescued" and is rerouted to other links. Deflection routing can thus reduce the rate of packet drops and allow a network to carry more packets without the need of additional bandwidth. However, it can also lead to unstable deflecting behavior in some congestion scenario. It is important to study deflection behavior when operating near the point of congestion. In this paper, the performance in terms of packet drop rate and traveling time are studied through extensive simulation, and complex behavior in the traffic with self-similarity property is observed and discussed.

APA, Harvard, Vancouver, ISO, and other styles

3

Ko, Jongbin, Jungtaek Seo, Eui-Jik Kim, and Taeshik Shon. "Monitoring Agent for Detecting Malicious Packet Drops for Wireless Sensor Networks in the Microgrid and Grid-Enabled Vehicles." International Journal of Advanced Robotic Systems 9, no. 1 (January 1, 2012): 31. http://dx.doi.org/10.5772/50256.

Full text

Abstract:

Of the range of wireless communication technologies, wireless sensor networks (WSN) will be one of the most appropriate technologies for the Microgrid and Grid-enabled Vehicles in the Smartgrid. To ensure the security of WSN, the detection of attacks is more efficient than their prevention because of the lack of computing power. Malicious packet drops are the easiest means of attacking WSNs. Thus, the sensors used for constructing a WSN require a packet drop monitoring agent, such as Watchdog. However, Watchdog has a partial drop problem such that an attacker can manipulate the packet dropping rate below the minimum misbehaviour monitoring threshold. Furthermore, Watchdog does not consider real traffic situations, such as congestion and collision, and so it has no way of recognizing whether a packet drop is due to a real attack or network congestion. In this paper, we propose a malicious packet drop monitoring agent, which considers traffic conditions. We used the actual traffic volume on neighbouring nodes and the drop rate while monitoring a sending node for specific period. It is more effective in real network scenarios because unlike Watchdog it considers the actual traffic, which only uses the Pathrater. Moreover, our proposed method does not require authentication, packet encryption or detection packets. Thus, there is a lower likelihood of detection failure due to packet spoofing, Man-In-the Middle attacks or Wormhole attacks. To test the suitability of our proposed concept for a series of network scenarios, we divided the simulations into three types: one attack node, more than one attack nodes and no attack nodes. The results of the simulations meet our expectations.

APA, Harvard, Vancouver, ISO, and other styles

4

Huang, Chi-Heng, Hsu-Feng Chou, John E. Bowers, Farzam Toudeh-Fallah, and Russ Gyurek. "Dynamically reconfigurable optical packet switch (DROPS)." Optics Express 14, no. 25 (2006): 12008. http://dx.doi.org/10.1364/oe.14.012008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Singh, Gulbir, Om Prakash Dubey, and Gautam Kumar. "A SOLUTION TO SELECTIVE FORWARD ATTACK IN WIRELESS SENSOR NETWORK." International Journal of Students' Research in Technology & Management 6, no. 2 (March 3, 2018): 25–30. http://dx.doi.org/10.18510/ijsrtm.2018.625.

Full text

Abstract:

Wireless mesh network represent a solution to provide wireless connectivity. There is some attacks on wireless sensor networks like black hole attack, sinkhole attack, Sybil attack, selective forwarding, etc. In this paper, we will concentrate on selective forwarding attack. Selective Forwarding Attack is one of the many security threats in wireless sensor networks which can degrade network performance. An adversary on the transmission path selectively drops the packet. The adversary same time transfers the packet, while in a few occasions it drops the packet. It is diﬃcult to detect this type of attack since the packet loss may be due to unreliable wireless communication. The proposed scheme is based on the trust value of each node. During data transmission, a node selects a downstream node that has highest trust value, which is updated dynamically based on the number of packets a node has forwarded and dropped. We compared our scheme with the existing scheme and found that the packet loss in the proposed scheme is much less than the existing scheme.

APA, Harvard, Vancouver, ISO, and other styles

6

Lee, Jin-Kuk, and Kang-G. Shin. "NetDraino: Saving Network Resources via Selective Packet Drops." Journal of Computing Science and Engineering 1, no. 1 (September 30, 2007): 31–55. http://dx.doi.org/10.5626/jcse.2007.1.1.031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Felicioni, Flavia, François Simonot, Françoise Simonot-Lion, and Ye-Qiong Song. "OPTIMAL CONTROL WITH PACKET DROPS IN NETWORKED CONTROL SYSTEMS." IFAC Proceedings Volumes 42, no. 3 (2009): 64–71. http://dx.doi.org/10.3182/20090520-3-kr-3006.00010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Nair, Girish N., Alexandre R. Mesquita, and Joao P. Hespanha. "Optimal Redundant Transmission for State Estimation with Packet Drops." IFAC Proceedings Volumes 43, no. 19 (2010): 163–68. http://dx.doi.org/10.3182/20100913-2-fr-4014.00080.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

10

Sangi, Abdur Rashid, Mohammed S. Alkatheiri, Satish Anamalamudi, Mohammed A. Alqarni, Muhammad Hammad Memon, and Wanan Yang. "Spectrum Handoff Aware AODV Routing Protocol for Cognitive Radio Vehicular Ad Hoc Networks." Complexity 2021 (September 14, 2021): 1–13. http://dx.doi.org/10.1155/2021/6981719.

Full text

Abstract:

End-to-end application performance and throughput of vehicular cognitive transport control protocol depend on how efficiently the segments (TCP header) are being transmitted from source to destination. One way to enhance the performance of vehicular cognitive TCP protocol is by reducing the packet drops in between the source and destination. In general, packet drops occur in between the source and destination of Cognitive Radio Vehicular Ad Hoc Network (CR-VANET) because of spectrum handoff or cognitive node handoff, or network congestion. In this paper, we focus on enhancing the performance of cognitive TCP protocol through “cognitive AODV routing protocol with the spectrum handoff mechanism.” In the proposed work, channel-route control messages of cognitive AODV routing protocol are updated with the support of spectrum handoff which helps to provide the backup opportunistic channel during PU active and helps to reduce the end-to-end spectrum handoff packet drops. Simulation results reveal that the overall performance of the vehicular cognitive TCP protocol with the proposed spectrum handoff aware cognitive AODV routing protocol is enhanced as compared to the existing cognitive TCP protocol.

APA, Harvard, Vancouver, ISO, and other styles

11

Maratha, Barakat Pravin, Tarek R. Sheltami, and Elhadi M. Shakshuki. "Performance Evaluation of Topology based Routing Protocols in a VANET Highway Scenario." International Journal of Distributed Systems and Technologies 8, no. 1 (January 2017): 34–45. http://dx.doi.org/10.4018/ijdst.2017010103.

Full text

Abstract:

Vehicular Ad-Hoc Network (VANET) has been derived from the well-established Mobile Ad-hoc Network (MANET). It facilitates wireless communication among vehicles to roadside equipment. Such kind of communication is utilized for different purposes such as safety, comfort, or even entertainment. The performance of VANET applications are highly determined by its underlying routing protocols. In this paper, the authors investigate the performance of topology based MANET routing protocols (AODV, DSDV and DSR) in a VANET highway design using NCTUNS 6.0 simulator. Different parameters are varied including speed, node density, propagation loss model, fading effects, data rate and payload. The selected routing protocols are then evaluated in terms of performance metrics throughput, packet drop and packet collision. Results shows that the performance of routing protocols depends on the application requirements in terms of throughput, delay and percentage of packet drops.

APA, Harvard, Vancouver, ISO, and other styles

12

Harmeet Singh, Er, and Dr Vijay Dhir. "A Novel Hybrid and Secure Clustering Black hole Attacks Mitigation Technique in Wireless LAN." International Journal of Engineering & Technology 7, no. 4.7 (September 27, 2018): 389. http://dx.doi.org/10.14419/ijet.v7i4.7.23035.

Full text

Abstract:

Wireless LAN is a dynamic network with large number of mobile nodes. As the traffic increases over the wireless, it will lead to number of problems like congestion and packet loss. This congestion and packet loss problems occurs due to the attacks in wireless LAN.Out of the various attacks black hole attack is most dangerous attack which drops all of the packets received from the source node and which act as a black hole in the universe. In this paper we are providing solution against this attack. We propose a Novel Hybrid and Secure Clustering Black hole Attack Mitigation Technique in Wireless LAN. This technique firstly detects the black hole attack by using threshold values against different parameters, after this clustering approach is used for secure path from source to destination by reducing overhead in the network. Most of existing mechanisms are not as efficient because by isolating black hole attack overhead is increased. A HSBM approach has remarkable advantage over these existing techniques. We simulate the proposed technique by using NS2 simulator and proved that our technique effectively detects the black hole attack in terms of throughput, packet loss, end to end packet delivery ratio, delay.

APA, Harvard, Vancouver, ISO, and other styles

13

Robinson, Craig, and P. Kumar. "Optimizing controller location in networked control systems with packet drops." IEEE Journal on Selected Areas in Communications 26, no. 4 (May 2008): 661–71. http://dx.doi.org/10.1109/jsac.2008.080508.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Alapati, Yaswanth Kumar, and Suban Ravichandran. "Routing Methods in MANET with Secured Key Management and Packet Drop Reductions: A Survey." Asian Journal of Computer Science and Technology 7, S1 (November 5, 2018): 20–23. http://dx.doi.org/10.51983/ajcst-2018.7.s1.1812.

Full text

Abstract:

MANET routing is complex task and selecting secured route ought to be made sooner before the node leaves the network. Quick choices dependably redress network execution. Most MANET routing conventions are intended to work in a cordial and agreeable condition which makes them powerless against different assaults. Further, nodes need to forward data packets to different nodes to empower information correspondence between the nodes that are not in the radio scope of each other. Be that as it may, a node may decline to forward data packets or halfway do the sending or even endeavor to intrude on the system tasks. This is for the most part thought to be a sort of bad conduct which demonstrates the presence of malicious node in a system. Trust and Reputation would fill in as a noteworthy answer for these issues. Secured data transmission is a complex task in MANET as there is a maximum chance for attackers to crash the network. Taking in the system qualities and picking right routing choices at right occasions would be a noteworthy arrangement. In this work, we have completed a broad overview of fault tolerant methods connected to routing in MANETs. Because of the proximity of attacker nodes, the procedure of administration disclosure is extraordinarily influenced, which may prompt poorer execution of the network. This may prompt less packet delivery proportion, throughput, expanded control overhead;add up to overhead and packet drops. Further, anchoring administration revelation task is exceptionally troublesome since, it includes the notoriety of the extensive number of middle of the road nodes present in the system[3]. This paper presents a survey on different techniques for routing,key management and reductions method on packer droppings.

APA, Harvard, Vancouver, ISO, and other styles

15

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

16

Kimura, Mitsutaka, Mitsuhiro Imaizumi, and Toshio Nakagawa. "Optimal Policy of Window Flow Control Based on Packet Transmission Interval with Explicit Congestion Notification." International Journal of Reliability, Quality and Safety Engineering 26, no. 05 (June 30, 2019): 1950024. http://dx.doi.org/10.1142/s0218539319500244.

Full text

Abstract:

This paper discusses a reliability problem of window flow control scheme with Explicit Congestion Notification (ECN) in the communication system, which is an essential issue in the long-distance transmission such as cloud computing. For example, there is a problem of reduction in transmission efficiency caused by a packet loss from network congestion. In order to solve the problem, recently, High-performance and Flexible Protocol (HpFP) has been proposed and performed a verification of effectiveness by simulation. 6 HpFP provides efficient packet communication by changing a packet transmission interval [T. Murata, T. Mizuhara, A. Takagi, K. Fukushima, K. Yamamoto, Y. Nagaya, K. Muranaga and E. Kimura, HpFP: A new protocol for LFNs with packet-loss based on UDP: A basic concept and detailed design of the protocol, IEICE Technical Report 115(484) IN2015-109, pp. 7–12 (2016)]. We have discussed the reliability model of a window flow control scheme based on a packet transmission interval. 7 We have proposed the model which judges the occurrence of congestion in a network by the number of retransmission [M. Kimura, M. Imaizumi and T. Nakagawa, Reliability modelling of window flow control scheme for a communication system based on packet transmission interval, in Proc. 23rd ISSAT Int. Conf. Reliability and Quality in Design (2017), pp. 171–175]. On the other hand, ECN mechanism for the detection of incipient congestion has been already proposed. ECN mechanism is efficient for the window flow control scheme because ECN bit is set in the packet header as an indication of congestion and is avoided unnecessary packet drops. We consider a stochastic model of a window flow control scheme based on a packet transmission interval with ECN. If ECN bit has been set during connection, a packet transmission interval is prolonged. We derive the mean time until packet transmissions succeed, and analytically discuss an optimal policy to maximize the amount of packets per unit of time until the transmission succeeds.

APA, Harvard, Vancouver, ISO, and other styles

17

Hussain, Mohammed, and Balaganesh Duraisamy. "Preventing Malicious Packet Drops in MANETs by Counter Based Authenticated Acknowledgement." Ingénierie des systèmes d information 25, no. 2 (May 15, 2020): 173–81. http://dx.doi.org/10.18280/isi.250204.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Leong, Alex S., Subhrakanti Dey, and Daniel E. Quevedo. "Sensor Scheduling in Variance Based Event Triggered Estimation With Packet Drops." IEEE Transactions on Automatic Control 62, no. 4 (April 2017): 1880–95. http://dx.doi.org/10.1109/tac.2016.2602499.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Tallapragada, Pavankumar, Massimo Franceschetti, and Jorge Cortes. "Event-Triggered Second-Moment Stabilization of Linear Systems Under Packet Drops." IEEE Transactions on Automatic Control 63, no. 8 (August 2018): 2374–88. http://dx.doi.org/10.1109/tac.2017.2764067.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Bose, Shourya, and Pavankumar Tallapragada. "Event‐triggered second‐moment stabilisation under action‐dependent Markov packet drops." IET Control Theory & Applications 15, no. 7 (February 16, 2021): 949–64. http://dx.doi.org/10.1049/cth2.12094.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Xu, Liang, Yilin Mo, and Lihua Xie. "Remote State Estimation With Stochastic Event-Triggered Sensor Schedule and Packet Drops." IEEE Transactions on Automatic Control 65, no. 11 (November 2020): 4981–88. http://dx.doi.org/10.1109/tac.2020.3004328.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Rahem, Abdalrazak Tareq, Mahamod Ismail, Nor Fadzilah Abdullah, and Mohammed Balfaqih. "Node Cooperation to Avoid Early Congestion Detection Based on Cross-Layer for Wireless Ad Hoc Networks." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 5 (October 1, 2016): 2322. http://dx.doi.org/10.11591/ijece.v6i5.11624.

Full text

Abstract:

The resent application of wireless ad hoc networks (WANET) demands a high and reliable data load. The simultaneous transfer of large amounts of data different nearby sources to nearby destinations in a massive network under these circumstances results in the possibility of network congestion. Congestion is an extremely unwanted condition because it creates extra overhead to the already deeply loaded environment, which ultimately leads to resource exhaustion, and can lead to packet drops and retransmission at either the MAC or upper layers. We present a lightweight congestion control and early avoidance congestion control scheme, which can effective control congestion while keeping overhead to a minimum. This scheme is based on the Cross-layer between the MAC and network layers lead to early detection of congestion. With the help of node cooperation the sender node is triggered to find an alternative route based on TMT. This mechanism controls the network resources rather than the data traffic. Detailed performance results show enhancement in the throughput and packet delivery ratio, as well as a reduction in packet drop. Generally, network performance increases.

APA, Harvard, Vancouver, ISO, and other styles

23

Rahem, Abdalrazak Tareq, Mahamod Ismail, Nor Fadzilah Abdullah, and Mohammed Balfaqih. "Node Cooperation to Avoid Early Congestion Detection Based on Cross-Layer for Wireless Ad Hoc Networks." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 5 (October 1, 2016): 2322. http://dx.doi.org/10.11591/ijece.v6i5.pp2322-2330.

Full text

Abstract:

The resent application of wireless ad hoc networks (WANET) demands a high and reliable data load. The simultaneous transfer of large amounts of data different nearby sources to nearby destinations in a massive network under these circumstances results in the possibility of network congestion. Congestion is an extremely unwanted condition because it creates extra overhead to the already deeply loaded environment, which ultimately leads to resource exhaustion, and can lead to packet drops and retransmission at either the MAC or upper layers. We present a lightweight congestion control and early avoidance congestion control scheme, which can effective control congestion while keeping overhead to a minimum. This scheme is based on the Cross-layer between the MAC and network layers lead to early detection of congestion. With the help of node cooperation the sender node is triggered to find an alternative route based on TMT. This mechanism controls the network resources rather than the data traffic. Detailed performance results show enhancement in the throughput and packet delivery ratio, as well as a reduction in packet drop. Generally, network performance increases.

APA, Harvard, Vancouver, ISO, and other styles

24

Yadav, Saneh Lata, R. L. Ujjwal, Sushil Kumar, Omprakash Kaiwartya, Manoj Kumar, and Pankaj Kumar Kashyap. "Traffic and Energy Aware Optimization for Congestion Control in Next Generation Wireless Sensor Networks." Journal of Sensors 2021 (June 28, 2021): 1–16. http://dx.doi.org/10.1155/2021/5575802.

Full text

Abstract:

Congestion in wireless sensor networks (WSNs) is an unavoidable issue in today’s scenario, where data traffic increased to its aggregated capacity of the channel. The consequence of this turns in to overflowing of the buffer at each receiving sensor nodes which ultimately drops the packets, reduces the packet delivery ratio, and degrades throughput of the network, since retransmission of every unacknowledged packet is not an optimized solution in terms of energy for resource-restricted sensor nodes. Routing is one of the most preferred approaches for minimizing the energy consumption of nodes and enhancing the throughput in WSNs, since the routing problem has been proved to be an NP-hard and it has been realized that a heuristic-based approach provides better performance than their traditional counterparts. To tackle all the mentioned issues, this paper proposes an efficient congestion avoidance approach using Huffman coding algorithm and ant colony optimization (ECA-HA) to improve the network performance. This approach is a combination of traffic-oriented and resource-oriented optimization. Specially, ant colony optimization has been employed to find multiple congestion-free alternate paths. The forward ant constructs multiple congestion-free paths from source to sink node, and backward ant ensures about the successful creation of paths moving from sink to source node, considering energy of the link, packet loss rate, and congestion level. Huffman coding considers the packet loss rate on different alternate paths discovered by ant colony optimization for selection of an optimal path. Finally, the simulation result presents that the proposed approach outperforms the state of the art approaches in terms of average energy consumption, delay, and throughput and packet delivery ratio.

APA, Harvard, Vancouver, ISO, and other styles

25

Kashibuchi, Kenichi, Tarik Taleb, Abbas Jamalipour, Yoshiaki Nemoto, and Nei Kato. "Prioritization-based Layered Multicast for Fixed/Mobile Networks with Fast Convergence and Inter-Session Fairness." Journal of Communications Software and Systems 2, no. 2 (April 5, 2017): 89. http://dx.doi.org/10.24138/jcomss.v2i2.292.

Full text

Abstract:

Multimedia streaming services are becoming popular in both wired and wireless networks. Layered multicast is a widely accepted approach for streaming multimedia data to a large number of users. Existing layered multicast approaches donot interact well with network dynamics. Indeed, upon a change in network conditions, they require a long time till they can appropriately adjust their data transmission rate. Additionally, they do not achieve fairness when users from different sessions share the bandwidth of a bottleneck link.In this paper, we propose a scheme that allows newly-arriving users to promptly converge their data transmission rates to the most optimal rate that best suit the current conditions of the network without degrading the system fairness. The proposed scheme is based on the fact that layered multicast uses prioritybased packet dropping policies. In the proposed scheme, two newly-defined packet messages are considered: “low priority join” and “normal join” messages. To join a session, a user first subscribes to all corresponding layers by issuing “low priority join” messages. It then computes packet drops experienced oneach layer. If packets of a given layer experience a drop rate higher than a predetermined threshold, the user leaves that layer and all higher layers. The user then “officially” joins the remaining layers by transmitting “normal join” messages. This operation helps users to subscrive to only layers whose aggregate bandwidth fits the current network conditions. The performance of the proposed scheme is evaluated through computer simulations and is compared against the Receiverdriven Layered Multicast (RLM) scheme. The results show that the proposed scheme achieves appropriate bandwidth utilization from the start of the session. The results demonstrate also that the proposed scheme is effective in managing handover in mobile networks and achieves better Quality of Service (QoS) inheterogeneous mobile environments.

APA, Harvard, Vancouver, ISO, and other styles

26

Kalpana, M., R. Dhanalakshmi, and P. Parthiban. "Prolonging the Lifetime of Wireless Sensor Networks Interconnected to Fixed Network Using Hierarchical Energy Tree Based Routing Algorithm." Scientific World Journal 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/158420.

Full text

Abstract:

This research work proposes a mathematical model for the lifetime of wireless sensor networks (WSN). It also proposes an energy efficient routing algorithm for WSN called hierarchical energy tree based routing algorithm (HETRA) based on hierarchical energy tree constructed using the available energy in each node. The energy efficiency is further augmented by reducing the packet drops using exponential congestion control algorithm (TCP/EXP). The algorithms are evaluated in WSNs interconnected to fixed network with seven distribution patterns, simulated in ns2 and compared with the existing algorithms based on the parameters such as number of data packets, throughput, network lifetime, and data packets average network lifetime product. Evaluation and simulation results show that the combination of HETRA and TCP/EXP maximizes longer network lifetime in all the patterns. The lifetime of the network with HETRA algorithm has increased approximately 3.2 times that of the network implemented with AODV.

APA, Harvard, Vancouver, ISO, and other styles

27

Rigatos, Gerasimos G. "Derivative-Free Distributed Filtering for MIMO Robotic Systems under Delays and Packet Drops." International Journal of Advanced Robotic Systems 10, no. 2 (January 2013): 133. http://dx.doi.org/10.5772/54186.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Wang, Yue, Meng Xia, Vijay Gupta, and Panos J. Antsaklis. "On Feedback Passivity of Discrete-Time Nonlinear Networked Control Systems With Packet Drops." IEEE Transactions on Automatic Control 60, no. 9 (September 2015): 2434–39. http://dx.doi.org/10.1109/tac.2014.2384754.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Bu, Bing, Fei Richard Yu, and Tao Tang. "Performance Improved Methods for Communication-Based Train Control Systems With Random Packet Drops." IEEE Transactions on Intelligent Transportation Systems 15, no. 3 (June 2014): 1179–92. http://dx.doi.org/10.1109/tits.2013.2294719.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Trivellato, Matteo, and Nevio Benvenuto. "State control in networked control systems under packet drops and limited transmission bandwidth." IEEE Transactions on Communications 58, no. 2 (February 2010): 611–22. http://dx.doi.org/10.1109/tcomm.2010.02.080289.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Leong, Alex S., Daniel E. Quevedo, Anders Ahlén, and Karl H. Johansson. "Network Topology Reconfiguration for State Estimation Over Sensor Networks With Correlated Packet Drops." IFAC Proceedings Volumes 47, no. 3 (2014): 5532–37. http://dx.doi.org/10.3182/20140824-6-za-1003.01846.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Chrysos, Nikolaos, Lydia Chen, Christoforos Kachris, and Manolis Katevenis. "Discharging the Network From Its Flow Control Headaches: Packet Drops and HOL Blocking." IEEE/ACM Transactions on Networking 24, no. 1 (February 2016): 15–28. http://dx.doi.org/10.1109/tnet.2014.2378012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Ferdiansyah, Novan, and Nugroho Suharto. "Performance Comparison of Middle Router Nodes and Edge Router Nodes on Manet Networks using Olsr and Batman Protocols." Jurnal Jartel: Jurnal Jaringan Telekomunikasi 9, no. 2 (June 19, 2019): 1–10. http://dx.doi.org/10.33795/jartel.v9i2.168.

Full text

Abstract:

The development of wireless technology has created a new network, namely the MANET network. In a MANET network, a node can be a router or an end user because in a MANET network the node is flexible. MANET networks have proactive OLSR and BATMAN protocols. When a node becomes a router, many other nodes will pass it. This research was conducted to determine the formation of the router node in the middle, namely the router that is passed by a lot of communication and the edge, that is, the router that has little communication through the network using parameters of CPU usage, RAM usage, and processing delay. From the test results, the CPU value on OLSR and BATMAN for the middle router node is 0.3 and for the edge router it is 0.2 when communicating, when there is no communication the CPU value on OLSR is still 0.3 while in BATMAN the BATMAN value drops to 0.2. For memory used in both protocols get 0.0 because the router only forwards packets without needing to process the packet. For processing delay in the two protocols, the value varies because packet delivery has an uncertain delivery interval between packets. In BATMAN protocol, CPU usage is better than OLSR because if there is no data communication, the CPU value from BATMAN goes down and on OLSR there is no fixed CPU value communication.

APA, Harvard, Vancouver, ISO, and other styles

34

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

35

RB, Sajyth, and Sujatha G. "Design of data confidential and reliable bee clustering routing protocol in MANET (Vol 2)." International Journal of Engineering & Technology 7, no. 2.8 (March 19, 2018): 661. http://dx.doi.org/10.14419/ijet.v7i2.8.10552.

Full text

Abstract:

Mobile ad hoc network (MANET) requires extraneous energy effectualness and legion intelligence for which a best clustered based approach is pertained called the “Bee-Ad Hoc-C”. In MANET the mechanism of multi-hop routing is imperative but may leads to a challenging issue like lack of data privacy during communication. ECC (Elliptical Curve Cryptography) is integrated with the Bee clustering approach to provide an energy efficient and secure data delivery system. Even though it ensures data confidentiality, data reliability is still disputable such as data dropping attack, Black hole attack (Attacker router drops the data without forwarding to destination). In such cases the technique of overhearing is utilized by the neighbor routers and the packet forwarding statistics are measured based on the ratio between the received and forwarded packets. The presence of attack is detected if the packet forwarding ratio is poor in the network which paves a way to the alternate path identification for a reliable data transmission. The proposed work is an integration of SC-AODV along with ECC in Bee clustering approach with an extra added overhearing technique which n on the whole ensures data confidentiality, data reliability and energy efficiency.

APA, Harvard, Vancouver, ISO, and other styles

36

Ingole, Piyush K., M. V. Sarode, and Meenakshi S. Arya. "Score Based Network Selection in Heterogeneous Wireless Networks to Enhance Quality of Service for End User." Asian Journal of Computer Science and Technology 8, no. 1 (February 5, 2019): 22–25. http://dx.doi.org/10.51983/ajcst-2019.8.1.2124.

Full text

Abstract:

Abrupt node movements is mobile networks directly affects the network connectivity of the node. Abruptly moving nodes generally face the issue of low network quality, and call drops. An effective handoff mechanism is needed in order to address this issue. In this research, we are proposing a network score based handoff mechanism, which follows the make-before-break principle. An improvement in terms of handoff delay, and packet loss is reported by the extensive analysis and simulations performed on the proposed system. Average handoff delay of less than 1ms, and packet loss ratio of less than 1% are obtained by our research. We plan to extend the research further for multiple networks to extend the performance analysis.

APA, Harvard, Vancouver, ISO, and other styles

37

Ez-zaidi, Asmaa, and Said Rakrak. "An Efficient Approach for Storage Balancing in Wireless Sensor Networks." International Journal of Online Engineering (iJOE) 13, no. 09 (September 22, 2017): 4. http://dx.doi.org/10.3991/ijoe.v13i09.7090.

Full text

Abstract:

the use of mobile sinks in data collection has received much attention in recent years. In fact, mobility was introduced to solve problems that occur in data gathering with static sinks such as hotspots, quick energy depletion of sensor nodes and so on. Using mobile sinks provides an effective mechanism to improve reliability, security as well as connectivity within the network. Nevertheless, the sink’s mobility poses new challenges, especially when the sink follows an unpredictable movement while gathering data. In this case, the network will experience huge latency and suffer from significant packet loss particularly when sensor nodes do not have enough memory storage to buffer collected data between two successive visits of the mobile sink. In this paper we propose a new approach in which sensor nodes cooperate to manage the storage and prevent packet drops. When a node’s memory is almost full, it offloads its data to its neighbor nodes in function of their free spaces. In case there are no neighbor nodes with sufficient storage space, the sink is urgently notified about the overloaded region that needs to be rapidly dumped. Simulation results reveal that our proposed approach decreases drastically the loss of packets and balances the sensor network.

APA, Harvard, Vancouver, ISO, and other styles

38

Zhou, Jianming, Guoxiang Gu, and Xiang Chen. "Distributed Kalman Filtering Over Wireless Sensor Networks in the Presence of Data Packet Drops." IEEE Transactions on Automatic Control 64, no. 4 (April 2019): 1603–10. http://dx.doi.org/10.1109/tac.2018.2854644.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

JIA, Ning, Ye-Qiong Song, and Rui-Zhong LIN. "ANALYSIS OF NETWORKED CONTROL SYSTEM WITH PACKET DROPS GOVERNED BY (m,k)-FIRM CONSTRAINT." IFAC Proceedings Volumes 38, no. 2 (2005): 63–70. http://dx.doi.org/10.3182/20051114-2-mx-3901.00010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

41

Saleh, Zahraa, and Qahhar Qadir. "The Downside of Software-Defined Networking in Wireless Network." UKH Journal of Science and Engineering 4, no. 2 (December 31, 2020): 147–56. http://dx.doi.org/10.25079/ukhjse.v4n2y2020.pp147-156.

Full text

Abstract:

Mobile traffic volumes have grown exponentially because of the increase in services and applications. Traditional networks are complex to manage because the forwarding, control, and management planes are all bundled together and, thus, administrators are supposed to deploy high-level policies, as each vendor has its own configuration methods. Software-Defined Networking (SDN) is considered the future paradigm of communication networks. It decouples control logic from its underlying hardware, thereby promoting logically centralized network control and making the network more programmable and easy to configure. Low-power wireless technologies are moving toward a multitenant and multiapplication Internet of Things (IoT), which requires an architecture with scalable, reliable, and configured solutions. However, employing an SDN-based centralized architecture in the environment of a low-power wireless IoT network introduces significant challenges, such as difficult-to-control traffic, unreliable links, network contention, and high associated overheads that can significantly affect the performance of the network. This paper is a contribution toward a performance evaluation for the use of SDN in wireless networking by evaluating the latency, packet drop ratio (PDR), data extraction rate (DER), and overheads. The results show that SDN adds a high percentage of overheads to the network, which is about 43% of the 57% user packets, and the DER drops when the number of mesh nodes are increased, in addition to the high loss that was observed for packets that traveled over more hops.

APA, Harvard, Vancouver, ISO, and other styles

42

Nisar, Kashif, Angela Amphawan, and Suhaidi B. Hassan. "Comprehensive Structure of Novel Voice Priority Queue Scheduling System Model for VoIP Over WLANs." International Journal of Advanced Pervasive and Ubiquitous Computing 3, no. 4 (October 2011): 50–70. http://dx.doi.org/10.4018/japuc.2011100106.

Full text

Abstract:

Voice over Internet Protocol (VoIP) has grown quickly in the world of telecommunication. Wireless Local Area Networks (WLANs) are the most performance assuring technology for wireless networks, and WLANs have facilitated high-rate voice services at low cost and good flexibility. In a voice conversation, each client works as a sender or a receiver depending on the direction of traffic flow over the network. A VoIP application requires high throughput, low packet loss, and a high fairness index over the network. The packets of VoIP streaming may experience drops because of the competition among the different kinds of traffic flow over the network. A VoIP application is also sensitive to delay and requires the voice packets to arrive on time from the sender to the receiver side without any delay over WLAN. The scheduling system model for VoIP traffic is an unresolved problem. The objectives of this paper are to identify scheduler issues. This comprehensive structure of Novel Voice Priority Queue (VPQ) scheduling system model for VoIP over WLAN discusses the essential background of the VPQ schedulers and algorithms. This paper also identifies the importance of the scheduling techniques over WLANs.

APA, Harvard, Vancouver, ISO, and other styles

43

Neerugatti, Vikram, and A. Rama Mohan Reddy. "Acknowledgement Based Technique for Detection of the Wormhole Attack in RPL Based Internet of Things Networks." Asian Journal of Computer Science and Technology 8, S3 (June 5, 2019): 100–104. http://dx.doi.org/10.51983/ajcst-2019.8.s3.2075.

Full text

Abstract:

Internet of Things (IoT) is the advanced technology, were the constrained nodes/things (all the objects around us such as chair, home, car, keys, etc.) will be connected to the internet to form a network, for sharing and monitoring the data, remotely. RPL (IPv6 Routing Protocol for Low Power and Lossy networks) is a routing protocol particularly designed for the constrained (low powered, low computation, less size, etc.) networks with the protocol 6LoWPAN (IPv6 Low Powered wireless Personal Area Networks). Due to the constrained behaviour of the RPL protocol, it will leads to many RPL routing attacks such as Sinkhole, Black hole, Wormhole, Selective forwarding, rank attacks, etc. This paper was focused on the Wormhole attack. The Wormhole attack will select the packets from one location and drops those packets in some other location (malicious) by forming the Tunnelling. To detect this attack here proposed and implemented a novel approach called (ADWA). Acknowledgement based technique for detection of the wormhole attack in RPL based Internet of Things networks. This approach was shown efficient results with the Telosb sky emulator nodes in the Contiki Cooja simulator, in terms of the Packet delivery ratio, delay and detection of wormhole attack.

APA, Harvard, Vancouver, ISO, and other styles

44

Cho, Kyeongsun, and Youngho Cho. "HyperLedger Fabric-Based Proactive Defense against Inside Attackers in the WSN With Trust Mechanism." Electronics 9, no. 10 (October 12, 2020): 1659. http://dx.doi.org/10.3390/electronics9101659.

Full text

Abstract:

In Wireless Sensor Networks (WSNs), the Trust Mechanism (TM) is used to defend against insider attacks by measuring the trustworthiness of all inside sensor nodes in the network. Thus, each sensor node with TM observes its neighbor nodes’ behaviors, evaluates their trustworthiness as numeric trust values, and captures untrustworthy nodes as inside attackers. Although the defense performance of trust mechanisms can be further improved by sharing the information about inside attackers detected by TM with all sensor nodes, the detected inside attacker list must be securely shared with and stored in all sensor nodes in the WSN. However, according to our survey, we observed that most existing studies simply assume that the communication channel for sharing the attacker detection list is reliable and trusted even in the presence of inside attackers in the WSN. In this paper, we propose and implement a proactive defense model that integrates the HyperLedger Fabric and trust mechanism to defend against inside attackers by securely sharing the detected inside attacker list with all sensor nodes in the WSN. In addition, we conduct comparative experiments to show that our proposed model can better defend against inside attackers than an existing trust mechanism. According to our experimental results, our proposed model could lower the attack damage (the number of packet drops) caused by an inside packet drop attacker by 59 to 67% compared to an existing trust mechanism.

APA, Harvard, Vancouver, ISO, and other styles

45

Bakhsh, Sheikh Tahir, Saleh Alghamdi, Rayan A. Alsemmeari, and Syed Raheel Hassan. "An adaptive intrusion detection and prevention system for Internet of Things." International Journal of Distributed Sensor Networks 15, no. 11 (November 2019): 155014771988810. http://dx.doi.org/10.1177/1550147719888109.

Full text

Abstract:

The revolution of computer network technologies and telecommunication technologies increases the number of Internet users enormously around the world. Thus, many companies nowadays produce various devices having network chips, each device becomes part of the Internet of Things and can run on the Internet to achieve various services for its users. This led to the increase in security threats and attacks on these devices. Due to the increased number of devices connected to the Internet, the attackers have more opportunities to perform their attacks in such an environment. Therefore, security has become a big challenge more than before. In addition, confidentiality, integrity, and availability are required components to assure the security of Internet of Things. In this article, an adaptive intrusion detection and prevention system is proposed for Internet of Things (IDPIoT) to enhance security along with the growth of the devices connected to the Internet. The proposed IDPIoT enhances the security including host-based and network-based functionality by examining the existing intrusion detection systems. Once the proposed IDPIoT receives the packet, it examines the behavior, the packet is suspected, and it blocks or drops the packet. The main goal is accomplished by implementing one essential part of security, which is intrusion detection and prevention system.

APA, Harvard, Vancouver, ISO, and other styles

46

Lei, Lei, and She Kun. "Speaker Recognition Using Wavelet Packet Entropy, I-Vector, and Cosine Distance Scoring." Journal of Electrical and Computer Engineering 2017 (2017): 1–9. http://dx.doi.org/10.1155/2017/1735698.

Full text

Abstract:

Today, more and more people have benefited from the speaker recognition. However, the accuracy of speaker recognition often drops off rapidly because of the low-quality speech and noise. This paper proposed a new speaker recognition model based on wavelet packet entropy (WPE), i-vector, and cosine distance scoring (CDS). In the proposed model, WPE transforms the speeches into short-term spectrum feature vectors (short vectors) and resists the noise. I-vector is generated from those short vectors and characterizes speech to improve the recognition accuracy. CDS fast compares with the difference between two i-vectors to give out the recognition result. The proposed model is evaluated by TIMIT speech database. The results of the experiments show that the proposed model can obtain good performance in clear and noisy environment and be insensitive to the low-quality speech, but the time cost of the model is high. To reduce the time cost, the parallel computation is used.

APA, Harvard, Vancouver, ISO, and other styles

47

Yang, Qing, Gang Chen, and Ting Wang. "ADMM-based distributed algorithm for economic dispatch in power systems with both packet drops and communication delays." IEEE/CAA Journal of Automatica Sinica 7, no. 3 (May 2020): 842–52. http://dx.doi.org/10.1109/jas.2020.1003156.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Zhang, Mukai, Badriah Alenezi, Stefen Hui, and Stanislaw H. Zak. "Unknown Input Observers for Discretized Systems With Application to Networked Systems Corrupted by Sparse Malicious Packet Drops." IEEE Control Systems Letters 5, no. 4 (October 2021): 1261–66. http://dx.doi.org/10.1109/lcsys.2020.3031454.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Wang, Ying, and Guo Rui Li. "Research on Selective Forwarding Attack Detection Scheme in Wireless Sensor Networks." Advanced Materials Research 433-440 (January 2012): 5298–302. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.5298.

Full text

Abstract:

Selective forwarding attacks in wireless sensor networks may corrupt some mission critical applications such as military surveillance and critical facilities monitoring. They are very difficult to be detected and distinguished from normal packet drops in wireless sensor networks. We propose an improved sequential mesh test based detection scheme in this paper. The scheme extracts a small quantity of samples to run the test, instead of regulating the total times of test in advance. We show through experiments that our scheme can provide higher detection accurate rate and lower false alarm rate than the existing detection schemes. Meanwhile, less communication and computation power are required to detect the selective forwarding attacks.

APA, Harvard, Vancouver, ISO, and other styles

50

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Packet drops'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles