Paths In Wireless Networks Research Articles

Implementation of P4-Based Schedulers for Multipath Communication

Multipath communication is a well-developed technology that enhances communication effectiveness and resilience. Moreover, it can flexibly utilize network resources through load balancing among available paths. However, traditionally, deploying such load balancing functions on network devices is costly due to the required configuration changes and complicated signaling mechanisms on the devices’ control planes. Programming Protocol-independent Packet Processors (P4) has recently emerged as a programming language that enables programmability on the data plane, with the potential to relieve such issues in multipath communication. This work introduces and implements three P4-based multipath schedulers that can split traffic over several paths in wireless networks. The first is P4-based Random Splitting, which distributes traffic randomly. The second is P4-based Weighted Round Robin, with path scheduling based on weights in accordance with path capability. The last is P4-based Dynamic Weighted Round Robin (DWRR), which can improve bandwidth utilization by shifting the weights following dynamic changes in the available bandwidth (i.e., when congestion occurs). We have extensively evaluated the implementation of these three P4-based schedulers in a Mininet-WiFi/P4 environment with User Datagram Protocol (UDP) traffic. The results show that these schedulers can achieve multipath communication with the designed scheduling mechanisms.

Pengembangan Sistem Komunikasi Data Dan Jaringan Komputer Dengan Penerapan Wireless Distribution System (WDS) di SMK Negeri 1 Pringgabaya

At Present, many schools have used wireless networks that are used to support wired networks. Cable network is used as an amplifier of access point to make internet access for users. The problems of networking using these cables can be a major constraint to inaccessible places that can reduce the flexibility of usage. The solution for this problem is to develop and implement Wireless Distribution System (WDS) on the access point. WDS is a system to develop wireless internet network without having to use cable as backbone for access point but to take advantage of wireless network path from access point. The parameters used in the WDS system are the parameters of jitter, througput, delay and packet loss. WDS performance can be analyzed so that will be known comparison of access point performance results with cable backbone

Using OpenFlow to control redundant paths in wireless networks

The deployment of wireless networks in critical industrial environments must ensure the availability of monitoring and control applications, for which it is essential to exploit redundancy techniques. In order to reduce to zero the failover time, in this paper, the Parallel Redundancy Protocol (PRP) is used in Wireless Local Area Networks (WLAN) which are implemented under the Software-Defined Networking (SDN) paradigm. It is discussed how the OpenFlow protocol allows an external controller to configure redundant paths between dual-homed devices. As a result, critical services can be protected in interference and mobility situations. The improvement in availability has been obtained by using both emulation and simulation.

Network-Layer Performance Analysis of Multihop Fading Channels

A fundamental problem for the delay and backlog analysis across multihop paths in wireless networks is how to account for the random properties of the wireless channel. Since the usual statistical models for radio signals in a propagation environment do not lend themselves easily to a description of the available service rate, the performance analysis of wireless networks has resorted to higher-layer abstractions, e.g., using Markov chain models. In this paper, we propose a network calculus that can incorporate common statistical models of fading channels and obtain statistical bounds on delay and backlog across multiple nodes. We conduct the analysis in a transfer domain, where the service process at a link is characterized by the instantaneous signal-to-noise ratio at the receiver. We discover that, in the transfer domain, the network model is governed by a dioid algebra, which we refer to as the (min, ×) algebra. Using this algebra, we derive the desired delay and backlog bounds. Using arguments from large deviations theory, we show that the bounds are asymptotically tight. An application of the analysis is demonstrated for a multihop network of Rayleigh fading channels with cross traffic at each hop.

To Propose a Mobility Based Reconfigurable System under Disaster Management in WSN

In this work, it proposes mobility based dynamic reconfiguration system in WSN. In this work, it uses the concept of dynamic reconfiguration routing protocol that achieves the need of various applications and also various network conditions. In this work, an environmental data collection scenario is taken. In this, all nodes are in dynamic nature and moves randomly. All nodes are communicating with each other as well as from head nodes. There is a direct communication between head & nodes. It provides a multi-hop routing based on shortest path in wireless networks. It provides a complete path with the loss of some packets. In this work, a controller is designed which is used to control the movement and location of nodes. Before disaster occurred, all nodes changed their location for security. As disaster under control, there may get back to their locations. But in this, some localization error is present but its value is less than 3% which is very efficient.

TCP-AP Enhanced Behaviour With rt-Winf And Node Count: boosted-TCP-AP

<p>Congestion control in wireless networks is strongly dependent on the dynamics and instability of wireless links. Therefore, it is very difficult to accurately evaluate the characteristics of the wireless links. It is known that TCP experiences serious performance degradation problems in wireless networks. New congestion control mechanisms, such as TCP-AP, do not evaluate accurately the capacity and available link bandwidth in wireless networks. In this paper we propose new congestion control protocol for wireless networks, based in TCP-AP. We name the protocol boosted-TCP-AP. It relies on the MAC layer information gathered by a new method to accurately estimate the available bandwidth and the path capacity over a wireless network path (rt-Winf), and also takes into consideration the node path count. The new congestion control mechanism is evaluated in different scenarios in wireless mesh and ad-hoc networks, and compared against several new approaches for wireless congestion control. It is shown that boosted-TCP-AP outperforms the base TCP-AP, showing its stable behavior and better channel utilization.</p>

XCP-Winf and RCP-Winf: Improving Explicit Wireless Congestion Control

Congestion control in wireless networks is strongly dependent on the dynamics and instability of wireless links. Therefore, it is very difficult to accurately evaluate the characteristics of the wireless links. It is known that TCP experiences serious performance degradation problems in wireless networks. Moreover, congestion control mechanisms that rely on network interaction and network parameters, such as XCP and RCP, do not evaluate accurately the capacity and available link bandwidth in wireless networks. In this paper we propose new explicit flow control protocols for wireless mesh networks, based on XCP and RCP. We name these protocols XCP-Winf and RCP-Winf. They rely on the MAC layer information gathered by a new method to accurately estimate the available bandwidth and the path capacity over a wireless network path. The estimation is performed in real time and without the need to intrusively inject packets in the network. These new congestion control mechanisms are evaluated in different scenarios in wireless mesh and ad hoc networks and compared against several new approaches for wireless congestion control. It is shown that both XCP-Winf and RCP-Winf outperform the evaluated approaches, showing its stable behavior and better channel utilization.

Simple, Practical, and Effective Opportunistic Routing for Short-Haul Multi-Hop Wireless Networks

In this paper, we propose a simple and practical opportunistic routing algorithm, and we analyze its performance along a multi-hop wireless network path, while considering link-level interference among the network nodes. Through our analysis, we show that our algorithm results in significant improvement in throughput, especially for short-haul paths. The proposed algorithm can be easily integrated into most routing protocols with only minor modifications. Consequently, the algorithm provides a practical and effective approach for implementation of opportunistic routing in wireless networks.

Hop Count Distribution of Multihop Paths in Wireless Networks With Arbitrary Node Density: Modeling and Its Applications

The significance of hop counts on the throughput and delay performance in multihop wireless networks has been well demonstrated in the literature. However, so far, there has been very little analytical work on determining the expected hop count for packet forwarding in multihop wireless networks. In this paper, we develop an analytical framework for the hop count distribution in a multihop wireless network with an arbitrary node density. We derive the average progress per hop and obtain the path connectivity probability in a network. Together with the derived per-hop progress and the path connectivity probability, we can express the probability distribution for the expected hop count in multihop wireless networks. We also demonstrate that, based on our analytical result, many network design guidelines can be provided. Specifically, the average packet delivery ratio in the network under a hop count limitation can be estimated accurately, and the tradeoff between the flooding cost and the search latency for target location discovery that is commonly used in many ad hoc routing protocols can also be evaluated.

Choosing an accurate network path model

We present a novel domain analysis methodology that enables network researchers to quickly select the most accurate modeling and analysis method or methods for a given wired or wireless network path and network characteristic of interest e.g. , delay, loss, or error process). Our approach includes two classical models, and two data preconditioning models developed in the Tapas project.