Priority Scheduling Algorithm for Traffic in a LTE-based Defence Mesh Network Incorporating Centralised Scheduling Architecture

Wireless mesh networks (WMN) are the networks of future and can operate on multiple protocols ranging from WiFi, WiMax to long term evolution (LTE). As a recent trend defence networks are incorporating off-the-shelf, state of the art commercial protocols to enhance the capability of their networks. LTE is one such commercially available protocol which is easy to deploy and provide high data rate which can be ideally implemented in WMN for defence networks. To enable these high data rate services LTE-based defence mesh networks (DMN) are the requirement of the day and future. However, LTE-based DMN are prone to congestion at times of active operations or full-fledged war. The congestion scenarios may lead to LTE packet loss. Hence, it is pertinent that these networks amalgamate information grooming algorithms to alleviate the throughput of the network in peak hour conditions. An efficient priority scheduling algorithm based on class of service prioritisation, data rate consumption and location of origin of traffic in the DMN is proposed. The simulations demonstrate that by incorporating the proposed priority scheduling algorithm, the overall packet loss of priority packets in the DMN reduces substantially

Proposta de Uso de Métodos Ágeis no Gerenciamento e Implantação de Projeto de Redes sem Fio

As redes de comunicação sem fio apesar de oferecerem vantagens quanto a transferência e disponibilidade de informações por radiofrequência, possuem processos de implementação e gerenciamento em sua maioria com falhas que podem comprometer a qualidade. Este artigo trata além de realizar uma proposta de utilização de métodos ágeis para projetos de redes wireless demonstrar que apesar das metodologias ágeis terem foco em projetos de desenvolvimento de software podem ser bem aplicadas para áreas distintas. As metodologias Extreme Programming, Scrum e Lean foram selecionadas por darem suporte na solução das problemáticas encontradas na execução do projeto de redes sem fio, tanto no gerenciamento quanto na implementação.Palavras-chave: Redes Sem Fio, Extreme Programming, Scrum, Lean

Single queue priority scheduler for video transmission in IEEE 802.11 networks

Includes bibliography.Mobile video transmission poses many challenges in standard wireless network like Wireless Local Area Network or IEEE 802.11. The challenges range from handover, delay, packet loss, jitter, fading and signal loss. Some studies have suggested an increase in network resources as a way to cater for the huge demands and reduce congestion in the network, while others suggest that optimizing the available resources might also reduce these challenges. In line with the optimization approach, this study proffers a solution to the video loss in IEEE 802.11 networks. It uses the Single-Queue Priority Scheduler to rearrange the video frames based on their importance. An MPEG frame (trace file) was rearranged by assigning weights to the video frames I, B and P. These frames were then prioritized and arranged in a single queue. A parameter to actively arrange the queue ( ) was deduced from three metrics- deadline, priority and cost. This value Sn was used to arrange the video trace or frames from the lowest to the highest. The arranged video trace or frames were injected into the queue and transmitted in that order. The results show that the implementation of Single-Queue Priority Scheduler algorithm improves the video transmission in Wireless Local Area Network. Without Single-Queue Priority Scheduler algorithm, the buffer overflow loss is 22.8% of the total load, but with SQPS algorithm, it is 8% of the total load. Without SQPS algorithm, the Packet Loss Ratio is about61%; but with the SQPS algorithm, the PLR reduces to 34%. Although, this scheduling algorithm produced better results with a reduction in packet loss, there were still some losses in the network

A Classification Framework for Scheduling Algorithms in Wireless Mesh Networks

Scheduling MAC-layer transmissions in multi-hop wireless networks is an active and stimulating area of research. There are several interesting algorithms proposed in the literature in the problem space of scheduling for multi-hop wireless networks, specifically for (a) WiMAX mesh networks, (b) long distance multi-hop WiFi networks, and (c) Vehicular Ad-hoc Networks (VANETs). In general, these algorithms have several dimensions in terms of the assumptions made, the input space considered and the solution space generated. In this context, the goal of this survey is three-fold. Firstly, we classify the scheduling algorithms proposed in the literature based on following parameters: problem setting, problem goal, type of inputs and solution technique. Secondly, we describe different scheduling algorithms based on this classification framework. We specifically cover the state-of-the-art scheduling mechanisms proposed for generic multichannel, multi-radio wireless mesh networks and in particular scheduling algorithms for WiMAX mesh networks, long distance mesh networks and vehicular ad-hoc networks. We describe scheduling algorithms which consider scheduling data, voice as well as video traffic. Finally, we compare these algorithms based on our classification parameters. We also critique individual mechanisms and point out the practicality and the limitations, wherever applicable. We observe that, the literature in the domain of scheduling for wireless mesh network is quite extensive, in terms of depth as well as breadth. Our classification framework helps in understanding the pros and cons of various aspects of scheduling for wireless multi-hop (popularly known as wireless mesh) networks. We also list desirable properties of any scheduling mechanism and use our classification framework to point out the open research issues in the space of scheduling for wireless mesh networks