Optimal scheduling and fair servicepolicy for STDMA in underwater networks with acoustic communications

In this work, a multi-hop string network with a single sink node is analyzed. A periodic optimal scheduling for TDMA operation that considers the characteristic long propagation delay of the underwater acoustic channel is presented. This planning of transmissions is obtained with the help of a new geometrical method based on a 2D lattice in the space-time domain. In order to evaluate the performance of this optimal scheduling, two service policies have been compared: FIFO and Round-Robin. Simulation results, including achievable throughput, packet delay, and queue length, are shown. The network fairness has also been quantified with the Gini index

An Analytical Model for Wireless Mesh Networks with Collision-Free TDMA and Finite Queues

Wireless mesh networks are a promising technology for connecting sensors and actuators with high flexibility and low investment costs. In industrial applications, however, reliability is essential. Therefore, two time-slotted medium access methods, DSME and TSCH, were added to the IEEE 802.15.4 standard. They allow collision-free communication in multi-hop networks and provide channel hopping for mitigating external interferences. The slot schedule used in these networks is of high importance for the network performance. This paper supports the development of efficient schedules by providing an analytical model for the assessment of such schedules, focused on TSCH. A Markov chain model for the finite queue on every node is introduced that takes the slot distribution into account. The models of all nodes are interconnected to calculate network metrics such as packet delivery ratio, end-to-end delay and throughput. An evaluation compares the model with a simulation of the Orchestra schedule. The model is applied to Orchestra as well as to two simple distributed scheduling algorithms to demonstrate the importance of traffic-awareness for achieving high throughput.Comment: 17 pages, 14 figure

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

Final report on the evaluation of RRM/CRRM algorithms

Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin

Traffic-adaptive, flow-specific medium access for wireless networks

In this report, we formally introduce the novel concept of traffic-adaptive, flow-specific medium access control and show that it outperforms contention, non-contention and hybrid medium access schemes. A traffic-adaptive, flow-specific mechanism is proposed that utilizes flow-specific queue size statistics to select between medium access modes. A general model for traffic adaptive, flow-specific medium access control is developed and it is shown that hybrid medium access as well as traditional contention-based and non-contention schemes can be seen as special cases of the more general flow-specific access. The two flow, two-mode case of the general model is developed in detail and it is shown analytically that this queue-based implementation of traffic-adaptive, flow-specific medium access outperforms contention, non-contention, and hybrid approaches. The proposed traffic-adaptive, flow-specific mechanism is applied to Cooperative Wireless Sensor Network Medium Access Control (CWS-MAC) a flow-specific medium access protocol. Performance is evaluated is evaluated and compared to the traditional medium access approaches. Both analytical and simulation results are provided including the development of throughput and delay expressions for slotted ALOHA with periodic server vacations.Approved for public release; distribution is unlimited

Dynamic bandwidth allocation with SLA awareness for QoS in ethernet passive optical networks

Quality-of-service (QoS) support in Ethernet passive optical networks is a crucial concern. We propose a new dynamic bandwidth allocation (DBA) algorithm for service differentiation that meets the service-level agreements (SLAs) of the users. The proposed delay-aware (DA) online DBA algorithm provides constant and predictable average packet delay and reduced delay variation for the high-and medium-priority traffic while keeping the packet loss rate under check. We prove the effectiveness of the proposed algorithm by exhaustive simulations