Low Packet Loss Rate Research Articles

Fault-tolerant and QoS based Network Layer for Security Management

Wireless sensor networks have profound effects on many application fields like security management which need an immediate, fast and energy efficient route. In this paper, we define a fault-tolerant and QoS based network layer for security management of chemical products warehouse which can be classified as real-time and mission critical application. This application generate routine data packets and alert packets caused by unusual events which need a high reliability, short end to end delay and low packet loss rate constraints. After each node compute his hop count and build his neighbors table in the initialization phase, packets can be routed to the sink. We use FELGossiping protocol for routine data packets and node-disjoint multipath routing protocol for alert packets. Furthermore, we utilize the information gathering phase of FELGossiping to update the neighbors table and detect the failed nodes, and we adapt the network topology changes by rerun the initialization phase when chemical units were added or removed from the warehouse. Analysis shows that the network layer is energy efficient and can meet the QoS constraints of unusual events packets.

A Novel Scheduling Algorithm for Low and High Mobility Users in Multi-hop WiMAX Network

QoS provisioning and high capacity for high mobility users are considered as the distresses of broadband wireless communications (BWC) and specifically the key technology of WiMAX. Hence, the scheduling and resource allocation algorithms play the main role in this regard. In the research conducted on scheduling algorithms in WiMAX network, two principal methods of AMC and PUSC are used. The high capacity in AMC mode algorithms is achieved by considering the low speed users. Conversely, in PUSC mode algorithms, speed does not affect the network performances; however, the capacity is low. To date, the importance of presenting QoS and maintaining the network capacity for the users with different speeds has not been acknowledged yet. This paper presents novel scheduling algorithms and also new frame partitioning scheme which are proper for the users with different mobility speeds. The new algorithm uses two modes of AMC and PUSC simultaneously to maintain the high capacity of the network. QoS is also provided. The simulation results reveal that our algorithm increases capacity while it presents low packet delay and packet loss rate in the presence of both high and low mobility speed users.

Gray Relevance Algorithm Based Routing Protocol in Ad Hoc Network

The characteristics of nodes moving arbitrarily and the network topology changing frequently lead to AODV routing protocol, which uses minimum hop-count as the metric for route selection, facing intermittent connectivity frequently which would cause QoS of network degradation in Ad Hoc Network. In this paper, we integrate three cross layer infor-mation which consists of the remaining energy of nodes, the remaining queue length and the hop-count from source node to destination node. Then we present the GRA-AODV routing protocol based on the gray relevance algorithm. By comparing the simulation and experimental results, in the case of slightly increase in routing overhead, the improved Gray Relevance Algorithm-AODV routing possesses lower average end to end delay and lower packet loss rate, and it has superior robustness in the mobile Ad Hoc Network with network topology changing frequently.

Scalable software architecture for distributed MMORPG traffic generation based on integration of UrBBaN-Gen and IMUNES

We present a scalable software architecture for distributed traffic generation capable of producing Massively Multiplayer Online Role-Playing Game (MMORPG) packet flows in a statistically accurate manner for thousands of concurrent players. The main challenge, to achieve truly massive scale traffic generation, has been achieved by introducing kernel based virtualization, pioneered by the network simulator/emulator IMUNES, into the User Behaviour Based Network Traffic Generation (UrBBan-Gen, introduced in our earlier work). The UrBBan-Gen software architecture consists of four modules: Service repository, Control function and user interface, Behaviour process, and Traffic generation process. IMUNES has been integratedinto the virtualization part of the Traffic generation process,which has resulted in two improvements: 1) increasing thenumber of generated packet flows while accurately replicating the required statistical properties, and, 2) introducing the ability to run various network scenarios in simulated, as well as real networks, under realistic traffic loads. With respect to the traffic generation capabilities of the previous version of UrBBan-Gen, which was based on Linux containers, the IMUNES based solution demonstrates higher scalability, lower packet loss rates, and lower CPU load for both the UDP traffic at high packet rate and “thin” TCP traffic flows typical for MMORPGs.

Study of Wireless Sensor Networks Routing Metric for High Reliable Transmission

To wireless communication, it is easy to be interrupted by all sorts of factors, such as, antenna direction, transmission power, distance, nodes voltage and so on. And the reliable transmission of data is the key problem for Wireless Sensor Networks (WSN) in recent years. In former research, there are many methods which can ensure data reliable transmission, but can not choose the best performance path and reduce the bottleneck link effectively. So, on the basis of analyzing the influence of antenna direction, transmission power, distance and nodes voltage on LQI respectively, the paper proposes a new method—link quality indication based on metric (LQIBM), which can accurately find the link with severe packet loss rate in wireless networks firstly. Second, the model of LQIBM is constructed by Combining the mean and Coefficient of Variation (C.V) of link quality appropriately. Then, the hardware experiment platform is conducted by using wireless communication chip CC2430. Compared with LQIM, the results of simulation and experiment show that LQIBM succeed in finding the best communication path that has much lower packet loss rate, the miscarriage of justice is avoided for LQIM , the path with the bottleneck link is effectively excluded, and the better reliability of the data transmission is achieved for WSN.

An efficient cooperative ARQ protocol for wireless relay networks

An efficient cooperative Automatic Repeat reQuest (ARQ) protocol for distributed space–time coded cooperative networks is proposed in this paper. Conventional cooperative ARQ protocol just utilizes the relays which can decode the packet from the source in direct transmission. However, relays which can not receive the packet successfully have the ability to listen to the retransmission and decode the packet with high probability. Therefore, we consider to let these relays join in the next possible retransmission. We prove that the proposed cooperative ARQ protocol has a lower packet loss rate and average retransmission number than conventional ARQ protocol. Finally, the simulation results verify our theoretical results and show that the proposed ARQ protocol is suitable for the relay networks where the source node is close to the relay nodes.

Monitoring and classifying animal behavior using ZigBee-based mobile ad hoc wireless sensor networks and artificial neural networks

Animal welfare is an issue of great importance in modern food production systems. Because animal behavior provides reliable information about animal health and welfare, recent research has aimed at designing monitoring systems capable of measuring behavioral parameters and transforming them into their corresponding behavioral modes. However, network unreliability and high-energy consumption have limited the applicability of those systems. In this study, a 2.4-GHz ZigBee-based mobile ad hoc wireless sensor network (MANET) that is able to overcome those problems is presented. The designed MANET showed high communication reliability, low energy consumption and low packet loss rate (14.8%) due to the deployment of modern communication protocols (e.g. multi-hop communication and handshaking protocol). The measured behavioral parameters were transformed into the corresponding behavioral modes using a multilayer perceptron (MLP)-based artificial neural network (ANN). The best performance of the ANN in terms of the mean squared error (MSE) and the convergence speed was achieved when it was initialized and trained using the Nguyen–Widrow and Levenberg–Marquardt back-propagation algorithms, respectively. The success rate of behavior classification into five classes (i.e. grazing, lying down, walking, standing and others) was 76.2% (σmean=1.06) on average. The results of this study showed an important improvement regarding the performance of the designed MANET and behavior classification compared to the results of other similar studies.

The multimedia service session handoff method in heterogeneous wireless networks

The IP Multimedia Subsystem (IMS) can provide multimedia services between heterogeneous wireless networks. But the efficiency of the service session handoff will bring a significant impact to user experience. For the integration of heterogeneous wireless networks, we propose a Session Initiation Protocol (SIP) based multimedia service session handoff method named MS²HM. To reduce the handoff delay between heterogeneous wireless networks, the MS²HM uses the methods of advance registration and old-new address temporary matching. We modelled the node processing delay and network transmission delay, and analyse the total delay and the packet loss rate of the MS²HM. Specially, this paper contrastively analyses the handoff delay under different frame error control in the 3G-WLAN integrated network, and the result shows that MS²HM has lower handoff delay than the method proposed by Wedlund and Schulzrinne. The MS²HM can meet the low delay and low packet loss rate requirements of IMS service session handoff between heterogeneous wireless networks, and ensure the QoS of the IMS services.

Optimal Resource Allocation for Pervasive Health Monitoring Systems with Body Sensor Networks

Pervasive health monitoring is an eHealth service, which plays an important role in prevention and early detection of diseases. There are two major challenges in pervasive health monitoring systems with Body Sensor Networks (BSNs). The first challenge is the sustainable power supply for BSNs. The second challenge is Quality of Service (QoS) guarantee for the delivery of data streams. In this paper, we optimize the resource allocations to provide a sustainable and high-quality service in health monitoring systems. Specifically, we formulate and solve two resource optimization problems, respectively. In the first optimization problem, steady-rate optimization problem, we optimize the source rate at each sensor to minimize the rate fluctuation with respect to the average sustainable rate, subject to the requirement of uninterrupted service. The first optimization problem is solved by a proposed analytical solution. The second optimization problem is formulated based on the optimal source rates of the sensors obtained in the steady-rate optimization problem. In the second optimization problem, we jointly optimize the transmission power and the transmission rate at each aggregator to provide QoS guarantee to data delivery. The second optimization problem is converted into a convex optimization problem, which is then solved efficiently. In the simulations, we demonstrate that the proposed optimized scheme enables the pervasive health monitoring system to provide a sustainable service with guaranteed low delay and low Packet Loss Rate (PLR) to subscribers.

Recursive Parametric Wavelength Conversion Scheme for Optical Packet Switch

This paper proposes a scheme to increase possible patterns of wavelength-conversion for an optical packet switch (OPS) with parametric wavelength converters (PWCs) by obtaining additional converted wavelengths using the existing resources. It is called a recursive parametric wavelength conversion (RPWC) scheme. A PWC uses a pump wavelength to define the original and converted wavelengths, called wavelength conversion pairs. None of conversion pairs from any PWCs can sometime support the request, although some wavelengths at the requested output fiber are available. Therefore, packet loss occurs and several conversion pairs are wasteful. In RPWC, unused conversion pairs are used to create additional conversion pairs. The OPS allows each wavelength to be converted using combination of unused conversion pairs using more than one PWC, instead of using only a single PWC as in a conventional scheme. Simulation results show that RPWC achieves lower packet loss rate than the conventional scheme, under both uniform and non-uniform traffic. To show the feasibility of RPWC, we develop a prototype of an optical switch with RPWC and demonstrate it in experiment.

Research on WFQ Algorithm Improvement of Wireless Sensor Network

It needs to consider about providing packet scheduling algorithm based on priority for different traffic in Wireless Sensor Network (WSN) to ensure enough low delay and enough low packet loss rate for high priority traffic and normal application of the network. Based on analysis on commonly used packet scheduling algorithm and considering about requirements of WSN on queue priority, the paper introduced delay parameter to represent network performance to distribution of WFQ scheduling weight so that network resource distribution adaptively adjust to current each queue, so as to obtain a kind of improved WFQ scheduling algorithm oriented to self-similar traffic. Based on provided formula and implementation flow of improved, simulation of improved was conducted in OPNET network environment. Simulation results show that the algorithm has good validity on the basis of inheriting not high complexity of WFQ algorithm.

A New MAC Protocol for Moving Target in Distributed Wireless Sensor Networks

A wireless sensor network (WSN) is composed of many nodes with limited power supply; most nodes are stationary in the network which could probably involve a few mobile nodes. Various medium access control (MAC) protocols specially aimed at a target locating application for WSNs have been proposed. However, most of these protocols based on the problem of energy-limited does not consider the mobility of nodes. Therefore, in order to solve such problem, this paper proposes a MAC protocol—Distribute Moving-MAC (DM-MAC). Under the condition of keeping high network coverage, the protocol utilizes the redundancy of nodes to strengthen the robustness and energy efficiency of network, and decreases the packet loss rate of the mobile node’s communication links for realizing reliable communication of two nodes. Simulation indicates that the new protocol has higher energy efficiency, lower packet loss rate and higher network coverage which suit for wireless sensor network with mobile nodes well.

An Available Transmission Time Routing Metric for Wireless Ad-Hoc Sensor Networks

Routing metric is very important for performance of wireless ad hoc sensor networks. ETX and ETT routing metrics cannot accurately estimate the average transmission time since they do not take back-off scheme of IEEE 802.11 in Mac layer into account. We present a new available transmission time (ATT) routing metric based on IEEE 802.11 DCF, which considers available link bandwidth and also takes physical transmission rates into account. A plugin for OLSR routing protocol daemon is implemented on Linux platform, and experiments are taken to compare ATT with ETX and ETT. Our results show that the ATT metric has the lowest packet loss rate and the lowest jitter rate among the analyzed metrics. ATT also outweigh other two metrics in the network performance, so it is the most appropriate for wireless ad hoc sensor networks.

An Adaptive Fault-Tolerant Communication Scheme for Body Sensor Networks

A high degree of reliability for critical data transmission is required in body sensor networks (BSNs). However, BSNs are usually vulnerable to channel impairments due to body fading effect and RF interference, which may potentially cause data transmission to be unreliable. In this paper, an adaptive and flexible fault-tolerant communication scheme for BSNs, namely AFTCS, is proposed. AFTCS adopts a channel bandwidth reservation strategy to provide reliable data transmission when channel impairments occur. In order to fulfill the reliability requirements of critical sensors, fault-tolerant priority and queue are employed to adaptively adjust the channel bandwidth allocation. Simulation results show that AFTCS can alleviate the effect of channel impairments, while yielding lower packet loss rate and latency for critical sensors at runtime.

QoS-aware Rate Control Algorithm in Long Distance Wireless Mesh Networks

Supporting delay sensitive real-time traffic such as video and voice over wireless local area network-based (WLAN) long distance wireless mesh networks (LDWMN) is a challenging and attractive task. To support real-time traffic, an efficient quality of service (QoS)-aware rate control (QARC) algorithm is proposed, which aims to improve the system performance by adapting the transmission rate to the current link condition in the design of LDWMN for rural areas . The proposed QARC is simply based on local acknowledgement frames to indicate the correct reception of the packet, and hence it is compatible with the current WLAN mesh networks . QARC will adaptively select best rate according to the sequence of consecutive rate selection s which is depicted by hidden Markov model . Based on the simulation and its comparison with the numerical analysis, it shows that the proposed rate control algorithm QARC closely approximates the ideal case with the perfect knowledge about the channel, and yields significantly higher throughput, lower packet loss rate and end-to-end delay than existed schemes in long distance environment .

IDSRT: Integrated Dynamic Soft Real-time Architecture for Critical Infrastructure Data Delivery over WLAN

The real-time control data delivery system of the Critical Infrastructure (i.e. SCADA—Supervisory Control and Data Acquisition system) is important because appropriate decisions cannot be made without having data delivered in a timely manner. Because these applications use multiple heterogeneous resources such as CPU, network bandwidth and storage, they call for an integrated and coordinated real-time scheduling across multiple resources to meet end-to-end deadlines. We present a design and implementation of iDSRT—an integrated dynamic soft real-time system to provide fine-grained end-to-end delay guarantees over WLAN. iDSRT takes the deadline partitioning approach: end-to-end deadlines are partitioned into multiple sub-deadlines for CPU scheduling and network scheduling. It integrates three important schedulers: task scheduler, packet scheduler and node scheduler to achieve global coordination. We validate iDSRT in Linux and evaluate it in an experimental SCADA test-bed. The results are promising and show that iDSRT can successfully achieve soft real-time guarantees in SCADA system with very low packet loss rate compared to available commodity best-effort systems.

An Interference-Aware Admission Control Design for Wireless Mesh Networks

In this paper, we present IAC, an interference aware admission control algorithm for use in wireless mesh networks. The core concept of IAC is to use a low overhead dual threshold based approach to share the bandwidth information with its neighbors in the interfering range. As a result, IAC guarantees that the shared wireless bandwidth is not overutilized and the quality of all existing flows are preserved. Moreover, IAC takes into account the intraflow interference effect to estimate the bandwidth consumption of the flow in a multihop path. We have further proposed two approaches of bandwidth allocation, FCFS and MCU, and demonstrated that proper tuning of thresholds can lead to high performance of both schemes. Simulation results illustrate that IAC effectively limits the overutilization of channel resources which in turn results in high throughput, low delay and low packet loss rate for all admitted flows.

A Novel Mobility Management Protocol Supporting Network Seamless Roaming

New wireless applications has grown very quickly in recent years. In some cases, several nodes need to move as a whole while the traditional mobile IP can’t support a network roaming together. Improved Mobile IP-Roaming Supported protocol (IMIP-RS) is proposed in this paper. In IMIP-RS, the distance between mobile nodes and the domain agent can be multi-hops while the value in MIP is only 1-hop. It combines handoff and buffer technologies in layer 2 with extended mobile IP technology in layer 3. It allows a roaming net to keep normal communication during fast moving. A demo system is developed and the protocol is verified. Test results indicate that it’s capable of achieving high data throughput, low response time and low packet loss rate. It can work with high quality of service (QoS) during rapid movement.

Performance Characteristics of Cluster -Based Multicast Key Distribution Scheme for Mobile Adhoc Networks

Many emerging commercial and military applications require secure multicast communication in adhoc environments. Secure multicast communication in mobile adhoc networks is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, high packet loss rates and limited resources such as bandwidth, time and power. Hence key management is the fundamental challenge in achieving reliable secure communication using multicast key distribution for mobile adhoc networks. This paper proposes and evaluates the performance of an new cluster-based multicast tree algorithm with destination sequenced distance vector routing protocol to provide efficient and reliable multicast key distribution. Simulation results in NS2 accurately predict the performance of proposed scheme in terms of energy, latency, key delivery ratio and packet drop rate under varying network conditions. This proposed scheme achieves reliability, while exhibiting low packet loss rate with high key delivery ratio compared with the existing scheme.

Energy efficient CBMT for secure multicast key distribution in mobile ad hoc networks

Multicast key distribution in mobile adhoc networks is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority and limited resources such as bandwidth, time and power. In many multicast interactions, a new member can join, a current member can leave at any time and existing members must communicate securely using multicast key distribution within constrained energy for mobile adhoc networks. This paper proposes a new efficient cluster based multicast tree (CBMT) algorithm for secure multicast key distribution, in which the source node uses a Multicast version of the Destination Sequenced Distance Vector (MDSDV) routing protocol to consume less energy. It also reduces end to end delay in multicast transmission. Simulation results show the efficient CBMT using MDSDV have better system performance in terms of QOS metrics such as energy, latency, key delivery ratio and packet drop rate under varying network conditions. This proposed scheme achieves reliability, while exhibiting low packet loss rate with high key delivery ratio.