983 research outputs found
Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting
In a multihop wireless network, it is crucial but challenging to schedule
transmissions in an efficient and fair manner. In this paper, a novel
distributed node scheduling algorithm, called Local Voting, is proposed. This
algorithm tries to semi-equalize the load (defined as the ratio of the queue
length over the number of allocated slots) through slot reallocation based on
local information exchange. The algorithm stems from the finding that the
shortest delivery time or delay is obtained when the load is semi-equalized
throughout the network. In addition, we prove that, with Local Voting, the
network system converges asymptotically towards the optimal scheduling.
Moreover, through extensive simulations, the performance of Local Voting is
further investigated in comparison with several representative scheduling
algorithms from the literature. Simulation results show that the proposed
algorithm achieves better performance than the other distributed algorithms in
terms of average delay, maximum delay, and fairness. Despite being distributed,
the performance of Local Voting is also found to be very close to a centralized
algorithm that is deemed to have the optimal performance
Two-Hop Routing with Traffic-Differentiation for QoS Guarantee in Wireless Sensor Networks
This paper proposes a Traffic-Differentiated Two-Hop Routing protocol for
Quality of Service (QoS) in Wireless Sensor Networks (WSNs). It targets WSN
applications having different types of data traffic with several priorities.
The protocol achieves to increase Packet Reception Ratio (PRR) and reduce
end-to-end delay while considering multi-queue priority policy, two-hop
neighborhood information, link reliability and power efficiency. The protocol
is modular and utilizes effective methods for estimating the link metrics.
Numerical results show that the proposed protocol is a feasible solution to
addresses QoS service differenti- ation for traffic with different priorities.Comment: 13 page
Network delay control through adaptive queue management
Timeliness in delivering packets for delay-sensitive applications is an important QoS (Quality of Service) measure in many systems, notably those that need to provide real-time performance. In such systems, if delay-sensitive traffic is delivered to the destination beyond the deadline, then the packets will be rendered useless and dropped after received at the destination. Bandwidth that is already scarce and shared between network nodes is wasted in relaying these expired packets. This thesis proposes that a deterministic per-hop delay can be achieved by using a dynamic queue threshold concept to bound delay of each node. A deterministic per-hop delay is a key component in guaranteeing a deterministic end-to-end delay. The research aims to develop a generic approach that can constrain network delay of delay-sensitive traffic in a dynamic network. Two adaptive queue management schemes, namely, DTH (Dynamic THreshold) and ADTH (Adaptive DTH) are proposed to realize the claim. Both DTH and ADTH use the dynamic threshold concept to constrain queuing delay so that bounded average queuing delay can be achieved for the former and bounded maximum nodal delay can be achieved for the latter. DTH is an analytical approach, which uses queuing theory with superposition of N MMBP-2 (Markov Modulated Bernoulli Process) arrival processes to obtain a mapping relationship between average queuing delay and an appropriate queuing threshold, for queue management. While ADTH is an measurement-based algorithmic approach that can respond to the time-varying link quality and network dynamics in wireless ad hoc networks to constrain network delay. It manages a queue based on system performance measurements and feedback of error measured against a target delay requirement. Numerical analysis and Matlab simulation have been carried out for DTH for the purposes of validation and performance analysis. While ADTH has been evaluated in NS-2 simulation and implemented in a multi-hop wireless ad hoc network testbed for performance analysis. Results show that DTH and ADTH can constrain network delay based on the specified delay requirements, with higher packet loss as a trade-off
Fog Computing: A Taxonomy, Survey and Future Directions
In recent years, the number of Internet of Things (IoT) devices/sensors has
increased to a great extent. To support the computational demand of real-time
latency-sensitive applications of largely geo-distributed IoT devices/sensors,
a new computing paradigm named "Fog computing" has been introduced. Generally,
Fog computing resides closer to the IoT devices/sensors and extends the
Cloud-based computing, storage and networking facilities. In this chapter, we
comprehensively analyse the challenges in Fogs acting as an intermediate layer
between IoT devices/ sensors and Cloud datacentres and review the current
developments in this field. We present a taxonomy of Fog computing according to
the identified challenges and its key features.We also map the existing works
to the taxonomy in order to identify current research gaps in the area of Fog
computing. Moreover, based on the observations, we propose future directions
for research
Design, Analysis, and Optimization of Traffic Engineering for Software Defined Networks
Network traffic has been growing exponentially due to the rapid development of applications and communications technologies. Conventional routing protocols, such as Open-Shortest Path First (OSPF), do not provide optimal routing and result in weak network resources. Optimal traffic engineering (TE) is not applicable in practice due to operational constraints such as limited memory on the forwarding devices and routes oscillation. Recently, a new way of centralized management of networks enabled by Software-Defined Networking (SDN) made it easy to apply most traffic engineering ideas in practice. \par Toward creating an applicable traffic engineering system, we created a TE simulator for experimenting with TE and evaluating TE systems efficiently as this tool employs parallel processing to achieve high efficiency. The purpose of the simulator is two aspects: (1) We use it to understand traffic engineering, (2) we use it to formulate a new traffic engineering algorithm that is near-optimal and applicable in practice. We study the design of some important aspects of any TE system. In particular, the consequences of achieving optimal TE by solving the multi-commodity flow problem (MCF) and the consequences of choosing single-path routing over multi-path routing. With the help of the TE simulator, we compare many TE systems constructed by combining different paths selection techniques with two objective functions for rate adaptations: load balancing (LB) and average delay (AD). The results confirm that paths selected based on the theoretical approach known as Oblivious Routing combined with AD objective function can significantly increase the performance in terms of throughput, congestion, and delay.\par However, the new proposed system comes with a cost. The AD function has a higher complexity than the LB function. We show that this problem can be tackled by training deep learning models. We trained two models with two different neural network architectures: Multilayer Perceptron (MLP) and Long-Short Term Memory (LSTM), to get a responsive traffic engineering system. The input training data is based on synthetic data obtained from the simulator. The output of the two models is the split ratios that the SDN controller uses to instruct the switching devices about how to forward traffic in the network. The result confirms that both models are effective and can be used to forward traffic in an optimal or near-optimal way. The LSTM model has shown a slightly better result than MLP due to its ability to predict a longer output sequence
Towards Reliable Multi-Path Routing : An Integrated Cooperation Model for Drones
Ad-hoc networks have evolved into a vital wireless communication component by offering an adaptable infrastructure suitable for various scenarios in our increasingly interconnected and mobile world. However, this adaptability also exposes these networks to security challenges, given their dynamic nature, where nodes frequently join and leave. This dynamism is advantageous but presents resource constraints and vulnerability to malicious nodes, impacting data transmission reliability and security.
In this context, this article explores the development of a secure routing protocol for Ad-hoc networks based on a cooperation reinforcement model to reduce the degradation of routing performance. We leverage the reputation of nodes as an additional security layer to monitor their behavior and evaluate their level of reliability. To exemplify our solution, we focus on drone fleets (UAVs) as a pertinent case study. Drones frequently operate in dynamic, challenging environments, relying on Ad-hoc networks for communication. They serve as an apt illustration, highlighting the complexities of the issue and the efficacy of our proposed remedy. The simulation results show the effectiveness of our proposed solution compared to stae-of-the-artsolutions
- …