Analyzing Buffer Requirement for Wireless Enhancement of TCP in Network Mobility

2013 ◽  
Vol 9 (1) ◽  
pp. 28-49
Author(s):  
Bhaskar Sardar
Keyword(s):  
Base Station ◽  
Packet Transmission ◽  
Buffer Size ◽  
Network Mobility ◽  
Memory Space ◽  
Wireless Links ◽  
Mobile Router ◽  
Buffer Requirement ◽  
Tcp Connections ◽  
Very High

On-board TCP (obTCP) has been shown to address the dual wireless link related issues in network mobility (NEMO) effectively. obTCP uses agents at both base station (BS) and mobile router (MR). The agents store incoming TCP packet in a buffer for future possible retransmissions over the wireless links. Since the number of TCP connections passing through the MR could be very large, the amount of memory space required for the buffers may become very high. This may put the deployment of obTCP in question. So, in this paper, the authors investigate the buffer requirement problem of obTCP at MR for each TCP connection. For this purpose, they describe a Markov model to keep track of the packet transmission process of MR. The buffer size for each TCP connection is represented as a function of loss probability of the wireless links. Interestingly, from the numerical results, the authors find that the buffer size requirement at MR is significantly low for each TCP connections. This observation claims possible implementation of obTCP in NEMO.

scholarly journals Security Techniques for Wormhole Attack in Wireless Sensor Networks

2018 ◽  
Vol 7 (2.23) ◽  
pp. 59 ◽  
Author(s):  
Surinder Singh ◽  
Hardeep Singh Saini
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Base Station ◽  
Packet Transmission ◽  
Wireless Sensor ◽  
Security Threat ◽  
Wormhole Attack ◽  
Protocol Security ◽  
Routing Mechanism ◽  
Packet Drop

The wireless sensor network has group of sensors which can sense the data and route this data to base station. As there is no physical connection between sensor and base station the important data can be routed without wires. The broadcast nature of wireless sensor network makes it prone to security threat to the valuable data. The attacker node can detect the data by creating their own data aggregation and routing mechanism .The number of attacks can be possible on the network layer. Out of these attacks wormhole is one of the major attack which can change the routing method of the whole wireless sensor network. In this attack,the attacker node can control the packet transmission of whole network and route it to the tunnel of nodes. The major drawback of this attack is to increase the packet drop and disturbing the routing mechanism. A number of security techniques are developed by the researcher to reduce the packet drop ratio and secure the routing mechanism of the network. Out of all thesetechniquesfew related to packet drop ratio are discussed in this paper. TheLightweight countermeasure for the wormhole attack (LITEWORP) based on Dynamic Source routing (DSR) protocol security technique,Delay Per Hop Indication (Delphi) based on AODV(Avoidance Routing Protocol) Protocol security technique and MOBIWORP based on DSRprotocol security technique reduce the packet loss percentage 40%,43% and 35% respectively.   

scholarly journals Early Window Tailoring: A New Approach to Increase the Number of TCP Connections Served

2019 ◽  
Vol 2019 ◽  
pp. 1-12
Author(s):  
Marcos Talau ◽  
Mauro Fonseca ◽  
Emilio C. G. Wille
Keyword(s):  
Congestion Control ◽  
Loss Rate ◽  
New Approach ◽  
Window Management ◽  
Multiple Devices ◽  
Congestion Control Mechanism ◽  
Tcp Connections ◽  
Multiple Scenarios ◽  
Very High ◽  
Better Than

In the absence of losses, TCP constantly increases the amount of data sent per instant of time. This behavior leads to problems that affect its performance, especially when multiple devices share the same gateway. Several studies have been done to mitigate such problems, but many of them require TCP side changes or a meticulous configuration. Some studies have shown promise, such as the use of gateway techniques to change the receiver’s advertised window of ACK segments based on the amount of memory in the gateway; in this work, we use the term “network-return” to refer to these techniques. In this paper, we present a new network-return technique called early window tailoring (EWT). For its use, it does not require any modification in the TCP implementations at the sides and does not require that all routers in the path use the same congestion control mechanism, and the use in the gateway is sufficient. With the use of the simulator ns-3 and following the recommendations of RFC 7928, the new approach was tested in multiple scenarios. The EWT was compared to drop-tail, RED, ARED, and the two network-return techniques—explicit window adaptation (EWA) and active window management (AWM). In the results, it was observed that EWT was shown to be efficient in congestion control. Its use avoided losses of segments, bringing expressive gains in the transfer latency and goodput and maintaining fairness between the flows. However, unlike other approaches, the most prominent feature of EWT is its ability to maintain a very high number of active flows at a given level of segment loss rate. The EWT allowed the existence of a number of flows, which is on average 49.3% better than its best competitor and 75.8% better when no AQM scheme was used.

A Customized IPv6 Header for Packet Transmission over a LAN

2010 ◽  
Vol 439-440 ◽  
pp. 1081-1086
Author(s):  
Hua Qing Zhou ◽  
Sheng Hui Dai
Keyword(s):  
Packet Loss ◽  
Transmission Efficiency ◽  
Compression Algorithm ◽  
Packet Transmission ◽  
New Method ◽  
Transmission Performance ◽  
Wireless Links ◽  
Header Compression

Header compression can effectively improve transmission efficiency, but existing header compression algorithm reduces the performance when operating over wireless links, because the differencing coding that the algorithm used does not adapt to packet over LAN. A new method for IPv6 header compression named is proposed, the compression is based on substitution and is not affected by packet loss. The method can significant improve the transmission performance over LAN.

Improved Algorithm for Mining Maximum Frequent Patterns Based on FP-Tree

2013 ◽  
Vol 756-759 ◽  
pp. 3692-3695 ◽  
Author(s):  
Nai Li Liu ◽  
Lei Ma
Keyword(s):  
Data Mining ◽  
Fast Algorithm ◽  
Association Rule ◽  
Frequent Patterns ◽  
Memory Space ◽  
The Cost ◽  
Mining Association Rule ◽  
Very High ◽  
Improved Algorithm

Mining association rule is an important matter in data mining, in which mining maximum frequent patterns is a key problem. Many of the previous algorithms mine maximum frequent patterns by producing candidate patterns firstly, then pruning. But the cost of producing candidate patterns is very high, especially when there exists long patterns. In this paper, the structure of a FP-tree is improved, we propose a fast algorithm based on FP-Tree for mining maximum frequent patterns, the algorithm does not produce maximum frequent candidate patterns and is more effectively than other improved algorithms. The new FP-Tree is a one-way tree and only retains pointers to point its father in each node, so at least one third of memory is saved. Experiment results show that the algorithm is efficient and saves memory space.

scholarly journals Delay-Aware Program Codes Dissemination Scheme in Internet of Everything

2016 ◽  
Vol 2016 ◽  
pp. 1-18 ◽  
Author(s):  
Yixuan Xu ◽  
Anfeng Liu ◽  
Changqin Huang
Keyword(s):  
Special Functions ◽  
Dynamic Environment ◽  
Residual Energy ◽  
Base Station ◽  
Link Quality ◽  
Energy Utilization ◽  
Smart Devices ◽  
Internet Of Everything ◽  
Wireless Links ◽  
Transmission Cost

Due to recent advancements in big data, connection technologies, and smart devices, our environment is transforming into an “Internet of Everything” (IoE) environment. These smart devices can obtain new or special functions by reprogramming: upgrade their soft systems through receiving new version of program codes. However, bulk codes dissemination suffers from large delay, energy consumption, and number of retransmissions because of the unreliability of wireless links. In this paper, a delay-aware program dissemination (DAPD) scheme is proposed to disseminate program codes with fast, reliable, and energy-efficient style. We observe that although total energy is limited in wireless sensor network, there exists residual energy in nodes deployed far from the base station. Therefore, DAPD scheme improves the performance of bulk codes dissemination through the following two aspects. (1) Due to the fact that a high transmitting power can significantly improve the quality of wireless links, transmitting power of sensors with more residual energy is enhanced to improve link quality. (2) Due to the fact that performance of correlated dissemination tends to degrade in a highly dynamic environment, link correlation is autonomously updated in DAPD during codes dissemination to maintain improvements brought by correlated dissemination. Theoretical analysis and experimental results show that, compared with previous work, DAPD scheme improves the dissemination performance in terms of completion time, transmission cost, and the efficiency of energy utilization.

scholarly journals A RADIAL BASIS NEURAL NETWORK CONTROLLER TO SOLVE CONGESTION IN WIRELESS SENSOR NETWORKS

2018 ◽  
Vol 44 (1) ◽  
pp. 40-48
Author(s):  
Maab Hussain
Keyword(s):  
Neural Network ◽  
Shortest Path ◽  
Base Station ◽  
Wireless Sensor ◽  
Network Congestion ◽  
Time Data ◽  
Radial Basis Neural Network ◽  
Memory Space ◽  
Neural Network Controller ◽  
Radial Basis

In multihop networks, such as the Internet and the Mobile Ad-hoc Networks, routing is one of the most importantissues that has an important effect on the network’s performance. This work explores the possibility of using the shortest path routingin wireless sensor network . An ideal routing algorithm should combat to find an perfect path for data that transmitted within anexact time. First an overview of shortest path algorithm is given. Then a congestion estimation algorithm based on multilayerperceptron neural networks (MLP-NNs) with sigmoid activation function, (Radial Basis Neural Network Congestion Controller(RBNNCC) )as a controller at the memory space of the base station node. The trained network model was used to estimate trafficcongestion along the selected route. A comparison study between the network with and without controller in terms of: trafficreceived to the base station, execution time, data lost, and memory utilization . The result clearly shows the effectiveness of RadialBasis Neural Network Congestion Controller (RBNNCC) in traffic congestion prediction and control.

scholarly journals Comparative analysis of scheduling algorithms for radio resource allocation in future communication networks

2021 ◽  
Vol 7 ◽  
pp. e546
Author(s):  
Khuram Ashfaq ◽  
Ghazanfar Ali Safdar ◽  
Masood Ur-Rehman
Keyword(s):  
Communication Networks ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Base Station ◽  
System Level ◽  
Fractional Frequency Reuse ◽  
Resource Assignment ◽  
Radio Resource ◽  
Downlink Transmission ◽  
Wireless Links

Background Wireless links are fast becoming the key communication mode. However, as compared to the wired link, their characteristics make the traffic prone to time- and location-dependent signal attenuation, noise, fading, and interference that result in time varying channel capacities and link error rate. Scheduling algorithms play an important role in wireless links to guarantee quality of service (QoS) parameters such as throughput, delay, jitter, fairness and packet loss rate. The scheduler has vital importance in current as well as future cellular communications since it assigns resource block (RB) to different users for transmission. Scheduling algorithm makes a decision based on the information of link state, number of sessions, reserved rates and status of the session queues. The information required by a scheduler implemented in the base station can easily be collected from the downlink transmission. Methods This paper reflects on the importance of schedulers for future wireless communications taking LTE-A networks as a case study. It compares the performance of four well-known scheduling algorithms including round robin (RR), best channel quality indicator (BCQI), proportional fair (PF), and fractional frequency reuse (FFR). The performance of these four algorithms is evaluated in terms of throughput, fairness index, spectral efficiency and overall effectiveness. System level simulations have been performed using a MATLAB based LTE-A Vienna downlink simulator. Results The results show that the FFR scheduler is the best performer among the four tested algorithms. It also exhibits flexibility and adaptability for radio resource assignment.

scholarly journals Underwater Routing Protocols: Analysis of Intrepid Link Selection Mechanism, Challenges and Strategies

2020 ◽  
Author(s):  
Shahzad Ashraf ◽  
Tauqeer Ahmed
Keyword(s):  
Routing Protocol ◽  
Base Station ◽  
Packet Transmission ◽  
Sensor Nodes ◽  
Destination Node ◽  
Delivery Ratio ◽  
Communication Link ◽  
Routing Mechanism ◽  
Pollution Detection ◽  
Terrestrial Network

Abstract The sensor nodes deployed in underwater environment has different routing mechanism in contrast to the terrestrial network. Getting underwater data on pollution detection, control of the ecosystem, marine mining, catastrophe avoidance and strategic surveillance thereby demands smooth packet transmission from dynamic nodes to base station encounters numerous challenges, out of which selecting best communication link between source and destination node is a key phenomenon of Underwater sensor network. The meticulous research has been conducted to search out the best link selection mythology of bodacious underwater routing protocol EnOR, SURS‐PES and USPF. The performance has been evaluated through NS2 simulation for packet delivery ratio, end-to-end delay, network lifespan and network energy consumption.

Sign in / Sign up

Export Citation Format

Share Document