Node Buffer Research Articles

Performance improvement in wireless sensor networks by removing the packet drop from the node buffer

In Wireless Sensor Networks (WSNs) typed applications, the node buffer plays a vital role to store the processed data before transmitting it further to the base node through neighbor nodule. Nowadays, in Multi-Application Wireless Sensor Networks (MAWSNs) scenario, to improve network performance of the node buffer has to be maintained or efficiently balanced. Because, for implementing various applications, at the same time in MAWSNs, the processing, transmitting capability of the node should be enhanced and the node storage capacity (Buffer) should be maintained. Since, if the node buffer exhausted then automatically it drops the data packet and the data will be lost and hence performance degradation will occur in the network. It will also affect the network lifetime. Hence, this paper implements a mechanism to enhance the node buffer for improving network performance. The work is implemented on Network Simulator i.e., NS2 version 2.34/2.35. Our work outperforms in comparison with the existing work and improves network performance.

Learning for Multiple-Relay Selection in a Vehicular Delay Tolerant Network

In a vehicular delay tolerant network (VDTN), there is no static connection, and the network behavior is highly temporal. This makes determining the routing protocol critical for the performance of a network. However, traditional routing technology rarely considers the influence of a VDTN’s selfish nodes. Under ideal conditions, all nodes will try to store and transfer as many messages as possible. However, selfish nodes may not transfer messages to other nodes due to limited resources. Taking selfish nodes into account is necessary for improving the performance of a VDTN. In this paper, we calculate each node’s credit value by recording each node’s behavior when messages are transferring to avoid selecting selfish nodes as the relay. We present an efficient VDTN specific multi-copy routing algorithm that combines Q-learning and the credit value to determine whether a candidate node is suitable for delivering a message. Because multi-copy routing protocols require a high buffer to store messages, we also optimize the node buffer to reduce network congestion. The proposed algorithm is evaluated by a number of different performance metrics, such as delivery probability, network overhead, and message latency. The proposed algorithm achieves better results in different configurations and provides improved delivery probability, low message latency, and network overhead.

A Routing Delay Reduction Mechanism Based on Dynamic Switching through Congestion Prediction in Wireless Mobile Network

The advancement in wireless mobile networks (WMNs) and their technologies are becoming the most popular technologies today and are widely used in various communication services. Devices for communication are equipped with wireless network interfaces through which they can efficiently stream data to their network-wide devices. However, due to the extreme use of different services, and TCP incapacity to control congestion, it causes a high overload in wireless communication, which makes the network extremely unstable and congested. Conventional routing methods with congestion control mechanisms for multimedia streams are not reliable for transport layer protocols. In such a case, it makes wireless networks very complex and challenging to perform smooth routing due to its dynamic characteristics and resource constraints. It can be overcome through scheduling flow control in multiple network interfaces for smooth packets streaming data, and even it can play an important role in congestion control by overwhelming the buffers of intermediate nodes and reduction in packet loss. In this paper, we propose a Routing Delay Reduction Approach (RDRA) based on dynamic switching by estimating the transmission rate and delay probability through congestion prediction. The goal of RDRA is to reduce routing latency and packet loss and improve throughput at different traffic rates. Experimental evaluation measures at different traffic rate variation it shows an improved performance in terms of throughput and low latency compared to the related protocols.

An Improved Error Control Model in Packet Switched Wide Area Networks

Error is an important problem in communication that occurs in shared networks when a packet fails to arrive at the destination or it arrives at the destination but some of the bits are in error or have been altered. In typical packet switched wide area networks, this can occur quite easily when output links are slower than inputs and multiple traffic sources competing for same output link at the same time. Typical for packet switched WAN, the packet transmit input/output buffer and queue of the network devices in their way towards the destination. Moreover, these networks are characterized by the fact that packets often arrive in “burst”. The buffers in the network devices are intended to assimilate these traffic hosts until they can be processed. Nevertheless, the available buffers in the network nodes may fill up rapidly if the network traffic is too high which in turn may lead to discarded packets. The situation cannot be avoided by increasing the size of the buffers, since unreasonable buffer size will lead to excessive end-to-end (e2e) delay. A typical scenario for congestion occurs where multiple incoming link feed into single outgoing link (e.g several Local Area Networks connected to Wide Area Networks). The routers of the networks are highly susceptible for traffic congestion because they are too small for the amount of traffic required to handle.
 This paper presented general concepts of Error Control and its mechanisms and its application to packet switched wide area networks An improved model was proposed with reduced error while transmitting packets from one channel to the other.
 Simulating the model for reducing error control in packet switched wide area networks increased the number of messages, reduced response time used in transmitting and receiving packets, reduced network utilization.

Model of node traffic recovery behavior and cascading congestion analysis in networks

In many real networks, temporary and fluctuant high load on nodes does not always lead to the complete failure of them. The recovery of nodes’ traffic function and the corresponding cascading congestion phenomenon can be observed. In this paper, we quantitatively associate local node capacity with external network load, and reveal the cascading congestion phenomenon of networks by modeling the traffic recovery behavior of nodes under fluctuant load. A hard traffic recovery model describing the general traffic recovery behavior of nodes and an adaptive traffic recovery model containing a local flow-adjusting strategy are proposed. We apply the two models to artificial networks and real networks. The network cascading congestion process and the limitation of network delivery ability under given node capacity are revealed. A hierarchical and load-dependent distribution of accepting probability is proved to be beneficial for the adaptive traffic recovery model in enhancing the network robustness against cascading congestion. Moreover, the critical node capacity corresponding to the maximal network load can be determined by our models. This function of our models is significant for obtaining the maximal network delivery ability with the lowest cost of node buffer in real applications.

E2-SCRP: An Energy Efficient Secure Cluster-based Routing Protocol for 3D Underwater Acoustic MANET (UWMANET)

In the current years, Underwater Mobile Ad hoc Network (UWMANET) has emerged as an enthusiastic field for supporting disaster prevention applications (Climate and Weather Observation, Earthquakes in Ocean (Tsunamis), underwater level navigation and tracking). In UWMANET, conventional data transmission methods have certain drawbacks such as high energy consumption, packet loss rate and end-to-end delay. Nowadays, mobile node i.e. Autonomous Underwater Vehicle (AUV) is widely used for data collection from underwater sensors, which act as a relay between sensor node and surface sink. Security is a significant issue in UWMANET, which is required for secure communications. In this paper, Energy Efficient Secure Cluster based Routing Protocol called E2-SCRP is presented in 3D UWMANET environment. The qu-Vanstone based Elliptic Curve Cryptography (qV-ECC) based short-term public key generation scheme is proposed for sensor node authentication. To reduce energy consumption, layer based clustering algorithm is proposed using Type-2 Fuzzy Logic System (T2fls) where Trust value, Distance between neighbors, Relative mobility and Node buffer size for cluster head (CH) election are considered. Next step is to execute two different security schemes based on Event Management. For event occurred clusters, Ciphertext Stealing Technique (CST) is used to resolve the ciphertext expansion problem. For normal data transmission, Lightweight Digital Watermarking (LDW) with Firefly algorithm is proposed. Optimal route for data transmission is executed by Pigeons Swarm Optimization (PiSO) and the forward to sink node via Adjacent AUV. Experiments conducted using NS3 (3.26) and the performance is evaluated for several metrics include packet delivery ratio, energy consumption, end-to-end delay, security strength, and throughput.

Efficient evict policy for PRoPHET

Opportunistic network (OppNets) routing protocols are improved to run in a situation in which it does not present a consistent end-to-end communication. The investigators of the Delay Tolerant Networks (DTN) team had aimed at the performance of routing protocols which use “Store-Carry-Forward” method. Delay Tolerant Networks routing presumes that the node buffer is unlimited. Thus, the condition for message arraying and dropping strategy, for each inclination is very risky and advantageous in such limited situations. This paper offers an effective eviction strategy to improve the PRoPHET routing protocol quality. This strategy adds to the PRoPHETv2 routing protocol, which is currently proposed FIFO by default. The investigators evaluate the influence of several parameters, including the message life/buffer time, based on the performance of the PRoPHET pertaining to delay, replication/hop number, and delivery ratio. This paper evaluates the influence of individual parameter along with the MOFO drop strategy. The effectiveness of the projected method is assessed and compared with various procedures according to metrics, for instance, overhead, latency, and delivery ratio. The simulation findings ascertain that the applied dropping strategy enhances the efficiency of PRoPHET routing compared to the other different dropping strategies.

Dynamic alternate buffer switching and congestion control in wireless multimedia sensor networks

Normally sensor nodes are located at unattended environment which has low battery power. The wireless hypermedia sensor based networks have huge capacity and continuous flow of data from source to sink. Congestion arises at the time of incoming data is greater than available resources. The congestion causes packet loss, buffer over flow, energy wastage and increases end to end delay. The proposed method Dynamic Alternate Buffer switching and Congestion Control is used to manage congestion in an efficient manner. In which congestion is detected based on remaining buffer, remaining energy and trust level of the sensor nodes. This approach is based on cost evaluation method which decides primary and spare buffers at run time. This method is used to enable dynamic buffer switching and optimize the effect of congestion. The performance of BETCC compared with various existing protocol like TCEER and TFCC in terms of energy consumption and data loss ratio.

Steady-State Analysis of Buffer Occupancy for Different Forwarding Strategies in Mobile Opportunistic Network

We perform a study on the buffer occupancy 1 1 The term buffer occupancy refers to the amount (or number) of data (or packets) present in the buffer. We shall be using the terms buffer occupancy and system size interchangeably as deemed fit. and its steady-state properties in a mobile opportunistic network (MON) for different forwarding strategies. Nodes in MON adhere to replication based strategy in order to ensure reliable delivery. Such replications occur in bulks during intermittent and very short contact events, which often lead to buffer congestion in the relay nodes, thereby affecting the network performance. The state-of-the-art on buffer management in MON relies on local information exchange to measure buffer occupancy, which leads to overhead. Therefore, to find the average buffer occupancy, we first study the aggregated bulk transfer size using real-life contact traces and find that it follows a log-normal distribution. Since the contact rate has been observed to follow a Poisson distribution, we model the packet arrival process in each node as a compound Poisson process. Furthermore, the departure process is modeled as packets dropped due to time-to-live expiry, which is shown to have an exponential distribution. Using the above model, we derive the steady-state probability distribution of buffer occupancy of an arbitrary node for three different classes of replication scheme, viz., epidemic routing, probabilistic routing, and time-varying probabilistic routing. The results of this paper help in assessing how fast a node buffer gets depleted under different routing algorithms, which will help in designing better buffer management techniques and routing algorithms.

Temporal flows in temporal networks

We introduce temporal flows on temporal networks. We show that one can find the maximum amount of flow that can pass from a source vertex s to a sink vertex t up to a given time in Polynomial time. We provide a static Time-Extended network (TEG) of polynomial size to the input, and show that temporal flows can be decomposed into flows, each moving through a single s-t temporal path. We then examine the case of unbounded node buffers. We prove that the maximum temporal flow is equal to the value of the minimum temporal s-t cut. We partially characterise networks with random edge availabilities that tend to eliminate the s-t temporal flow. We also consider mixed temporal networks, where some edges have specified availabilities and some edges have random availabilities; we define the truncated expectation of the maximum temporal flow and show that it is #P-hard to compute it.

IRPanet: Intelligent Routing Protocol in VANET for Dynamic Route Optimization

This paper presents novel routing protocol, IRPANET (Intelligent Routing Protocol in VANET) for Vehicular Adhoc Network (VANET). Vehicular Ad Hoc Networks are special class of Mobile Adhoc Network, created by road vehicles installed with wireless gadgets). Since the environment is dynamic due to high mobility and the topology changes are too frequent, no connection or path can be established between nodes. The issues are challenging for the design of an effective and efficient protocol for such a dynamic environment. This problem can be solved using probabilistic, heuristic and even machine learning based approaches incorporated with store and forward mechanism. Here, we proposed a design framework using heuristics and probabilistic approaches composite with the time series techniques for selecting best and optimize path for forwarding packets using open street map (OSM). Our proposed algorithm uses various parameters (Heuristics Based Routing) for calculating optimal path for packets to be sent, such geographical position (GPS installed in every vehicle), velocity / speed of vehicle, priority of the packets, distances (Euclidean, Haversine, Vicinity) between vehicle, direction of vehicle, communication range of the vehicle, free buffer of nodes and network congestion. These networks can be used for medical emergency, security, entertainment and routing purposes (applications of VANET). These parameters while used in collaboration provide us a very strong and admissible heuristics. We have mathematically proved that the proposed technique is efficient for the routing of packets especially in medical emergency situation.

Analysis of Congestion using mobile nodes in Wireless Network

This article discusses the work plan of wireless ad hoc network and the problems related to it during congestion. The congestion in wireless network congestion will vary with different topologies, methods of network deployment, mobility, channel utilization and power consumption at node level. This might lead to degradation of TCP performance of packet loss. In this research the proposed work plan the use of different number of nodes and their effect on congestion in wireless network. The reason for loss in wireless network could be overload of packets in node buffer space. This research will also enable us to conduct a deeper study to understand network congestion in ad-hoc networks. We will try to simulate various network environments with different number of users and then study the network on parameters like throughput, good put; packets dropped etc.

A LIMITED INTERMEDIATE NODE BUFFERING BASED RWA SCHEME IN OBS BACKBONE NETWORKS

An all optical backbone Optical Burst Switched (OBS) network comprises of a multitude of optical transport sub-systems erected in commercial, residential as well as industrial areas. The heterogeneous nature of the large volumes of traffic generated by various applications and services ideally requires an optical backbone network infrastructure to accommodate it. Such a network must be continuously adaptable to the changing nature of the traffic as well as its spontaneous growth with time. In so doing, it has to ensure high end-to-end quality of service (QoS), availability as well as provision adaptable controllability in cooperation with peripheral (service) layer networks. To successfully design and deploy a cost-effective backbone network, consideration must be taken with regards to system configuration, as well as in applied devices manufacturing. This is to ensure that any component failure does not add any noticeable performance degradation as the network will quickly reconfigure itself accordingly. At operational level, effective routing approaches are necessary to ensure minimized congestion as well as contention occurrences. The aggregation of both transit and local traffic at a node influences each other such as to aggravate congestion and to a certain extent reduce contention occurrences (due to the streamline effect). In this paper, we propose a priority based intermediate Node Buffering based PIB-RWA scheme to combat the problem of contention occurrences and to prevent bursts discarding. It basically selects primary as well as deflection paths/links based on past contention frequency occurrences as well as current resources states in the candidate paths. Furthermore, the scheme also augments intermediate buffering provisioning for contending data bursts that are almost reaching the destination. Simulation results show that the scheme performs well in terms of key QoS metrics such as network throughput, data burst loss probabilities as well as load balancing

Design, implementation and analysis of routing based attack model for delay tolerant networks for prophet routing protocol

Delay tolerant network (DTN) is an evolution of mobile adhoc network (MANET). In computing, network security is the main issue as the attacks by malicious and selfish nodes are increasing on the network day by day. This paper defines an attack model in which malicious nodes (in DTN with Prophet Routing Protocol) receive the data from genuine nodes. It is done by falsifying their routing information (Delivery Predictability). Later malicious nodes spoof their identity and receive messages as destination nodes. The Legitimate messages are deleted by malicious nodes and also from the source node buffer as the source node treats the message being delivered to the final destination. Delivery Probability, Overhead Ratio, Average Latency and Average Buffer time metrics are evaluated using ONE simulator. In simulated network, 126 nodes are considered and by making only 3% nodes malicious, performance of the network is decreased by approximately 40-50%.

SOBM - Server Occupancy Based Migration by Optimizing Link and Storage Capacity in Check Points

Checkpoint (CP) routing requires a procedure for heavy load and dynamic routing packets over a cluster network, by monitoring network load. High traffic CP network does intense transactions by multiple applications and shares the information among the nodes in the network and delivers the same to the server. The Proposed work assigns time slots and each slot checks the path to send or migrate the data to manage the load and data accumulation between servers and if there arises any data loss it recovers from the previous node buffers. Data rate and delay is checked by each link and adjust the data flow to various servers. Based on time, network state, incoming packet rates, server load, link-based migration is applied. It increases network packets receiving rates, and minimizes the delay in checkpoints.

Integrated Sized-Based Buffer Management Policy for Resource-Constrained Delay Tolerant Network

Delay tolerant network is a type of network where the end-to-end path is not available from source to destination due to the node mobility, dynamic topology and network partitioning or such a path is highly unstable and may split almost immediately after it has been explored. In this background, existing ad hoc routing protocols would be unsuccessful. Therefore, the concept of store-carry-forward mechanism is utilized by introducing a new layer on the top of transport layer called as bundle layer. The bundle layer store message(s) in a finite size buffer for the long duration of time. As a result, node buffer runs out of space and drop messages to overcome congestion. In this paper, we aim to schedule the node buffer by using local knowledge-based buffer management policies called as best message-size selections buffer management policy. We have utilized the local information available in message header such as message-size to control the drop of messages. The evaluation of proposed policy with the existing DOA, DLA, LIFO, MOFO, N-drop and SHLI have been analyzed in ONE simulator in terms of reducing message drop, overhead, latency and raising the delivery ratio.

A Combinational Buffer Management Scheme in Mobile Opportunistic Network

Nodes in Mobile Opportunistic Network (MON) have to cache packets to deal with the intermittent connection. The buffer management strategy obviously impacts the performance of MON, and it attracts more attention recently. Due to the limited storage capacity of nodes, traditional buffer management strategies just drop messages based on the property of message, and they neglect the collaboration between neighbors, resulting in an ineffective performance improvement. Therefore, effective buffer management strategies are necessary to ensure that each node has enough buffer space to store the message when the node buffer is close to congestion. In this paper, we propose a buffer management strategy by integrating the characteristics of messages and nodes, and migrate the redundant messages to the neighbor to optimize the total utility, instead of deleting them. The simulation experiment results show that it can obviously improve the delivery ratio, the overhead ratio and the average delays, and reduce the amount of hops compared with the traditional ones.

A theoretical analysis of buffer occupancy for Intermittently-Connected Networks

Network congestion is a well-known problem that may heavily affect the overall network performance. Congestion control approaches in Intermittently-Connected Networks (ICNs) differ from those used in classical networks, since the assumptions of “universal connectivity” of the nodes and “global information” about the network do not hold. In this paper, an analytical framework is proposed to investigate node buffer occupancy in ICNs through bulk-arrivals/bulk-services queuing models. A relation in the z-domain between the discrete probability densities of the buffer state occupancies and of the sizes of the arriving bulks is exploited to analyze two classes of forwarding strategies for ICNs. The infinite- and finite-buffer cases are investigated, simulated, and compared in terms of the concept of stochastic order, which is also used to compare models obtained for different parameter choices. The results can be exploited for buffer dimensioning and for deriving estimates of performance metrics such as average buffer occupancy, average delivery delay, and buffer overflow probability. The theoretical analysis is complemented by numerical outcomes from a network simulator and from real mobility traces.

Efficient Design and Scalable Control for Store-and-Forward Capable Optical Transport Networks

The increasingly bursty nature of delay-tolerable content delivery services requires new design and control perspectives in state-of-the-art end-to-end bufferless transport networks. Store-and-forward capable networked buffers in end-to-end lightpath networks enable an optical delay-tolerant networking (DTN) service that efficiently improves the capacity of optical networks by time-domain traffic shaping. We model an architecture of the optical DTN and asymptotically analyze the blocking probability performance as a function of the buffer node ratio. We propose a novel buffer node location algorithm by suggesting a bottleneckness centrality measure and evaluate the algorithm by comparing it with reference facility location algorithms. Rigorous simulation studies over practical core network topologies, as a function of networking cost, reveal higher performance of the optical DTN model as well as the proposed network-planning algorithms.

Percolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks

The node buffer size has a large influence on the performance of Mobile Opportunistic Networks (MONs). This is mainly because each node should temporarily cache packets to deal with the intermittently connected links. In this paper, we study fundamental bounds on node buffer size below which the network system can not achieve the expected performance such as the transmission delay and packet delivery ratio. Given the condition that each link has the same probability p to be active in the next time slot when the link is inactive and q to be inactive when the link is active, there exists a critical value pc from a percolation perspective. If p > pc, the network is in the supercritical case, where we found that there is an achievable upper bound on the buffer size of nodes, independent of the inactive probability q. When p < pc, the network is in the subcritical case, and there exists a closed-form solution for buffer occupation, which is independent of the size of the network.