RECOMAC: a cross-layer cooperative network protocol for wireless ad hoc networks

A novel decentralized cross-layer multi-hop cooperative protocol, namely, Routing Enabled Cooperative Medium Access Control (RECOMAC) is proposed for wireless ad hoc networks. The protocol architecture makes use of cooperative forwarding methods, in which coded packets are forwarded via opportunistically formed cooperative sets within a region, as RECOMAC spans the physical, medium access control (MAC) and routing layers. Randomized coding is exploited at the physical layer to realize cooperative transmissions, and cooperative forwarding is implemented for routing functionality, which is submerged into the MAC layer, while the overhead for MAC and route set up is minimized. RECOMAC is shown to provide dramatic performance improvements of eight times higher throughput and one tenth of end-to-end delay than that of the conventional architecture in practical wireless mesh networks

Enhanced Collision Resolution for the IEEE 802.11 Distributed Coordination Function

The IEEE 802.11 standard relies on the Distributed Coordination Function (DCF) as the fundamental medium access control method. DCF uses the Binary Exponential Backoff (BEB) algorithm to regulate channel access. The backoff period determined by BEB depends on a contention window (CW) whose size is doubled if a station suffers a collision and reset to its minimum value after a successful transmission. BEB doubles the CW size upon collision to reduce the collision probability in retransmission. However, this CW increase reduces channel access time because stations will spend more time sensing the channel rather than accessing it. Although resetting the CW to its minimum value increases channel access, it negatively affects fairness because it favours successfully transmitting stations over stations suffering from collisions. Moreover, resetting CW leads to increasing the collision probability and therefore increases the number of collisions. % Quality control editor: Please ensure that the intended meaning has been maintained in the edits of the previous sentence. Since increasing channel access time and reducing the probability of collisions are important factors to improve the DCF performance, and they conflict with each other, improving one will have an adverse effect on the other and consequently will harm the DCF performance. We propose an algorithm, \gls{ECRA}, that solves collisions once they occur without instantly increasing the CW size. Our algorithm reduces the collision probability without affecting channel access time. We also propose an accurate analytical model that allows comparing the theoretical saturation and maximum throughputs of our algorithm with those of benchmark algorithms. Our model uses a collision probability that is dependent on the station transmission history and thus provides a precise estimation of the probability that a station transmits in a random timeslot, which results in a more accurate throughput analysis. We present extensive simulations for fixed and mobile scenarios. The results show that on average, our algorithm outperformed BEB in terms of throughput and fairness. Compared to other benchmark algorithms, our algorithm improved, on average, throughput and delay performance

A Survey of Medium Access Mechanisms for Providing QoS in Ad-Hoc Networks

n/

MeshScan: a Fast and Efficient Handoff Scheme for IEEE 802.11 Wireless Mesh Networks

As a next generation network solution, Wireless Mesh Networks (WMN) provides fast Internet access to a large area, which is from university campus to city scale. In order to provide an uninterrupted Internet experience to a mobile client, a process called handoff is required to maintain the network connection from one Mesh Node (MN) to another MN. Ideally, handoff should be completely transparent to mobile users. A critical application like VoIP will require a handoff capability that transfers a call from one mesh node (MN) to another in less than 50 msec. However the current IEEE 802.11 standards do not address the handoff well. Studies have revealed that standard handoff on IEEE 802.11 WLANs incurs a latency of the order of hundreds of milliseconds to several seconds. Moreover, the discovery step in the handoff process accounts for more than 99% of this latency. The study addresses the latency in the discovery step by introducing an efficient and powerful client-side scan technique called MeshScan which replaces the discovery step with a unicast scan that transmits Authentication Request frames to potential MNs. A prototype of MeshScan has been developed based on the MadWifi WLAN driver on Linux operating systems. The feasibility of MeshScan to support fast handoff in WMNs has been demonstrated through extensive computer simulations and experiments under same given conditions. The results from the simulations and experiments show that the latency associated with handoff can be reduced from seconds to a few milliseconds by using the MeshScan technique. Furthermore, it is shown that MeshScan can continue to function effectively even under heavy traffic loads

Routing for Flying Networks using Software-Defined Networking

Nos últimos anos, os Veículos Aéreos Não Tripulados (UAVs) estão a ser usados de forma crescente em inúmeras aplicações, tanto militares como civis. A sua miniaturização e o preço reduzido abriram o caminho para o uso de enxames de UAVs, que permitem melhores resultados na realização de tarefas em relação a UAVs independentes. Contudo, para permitir a cooperação entre UAVs, devem ser asseguradas comunicações contínuas e fiáveis.Além disso, os enxames de UAVs foram identificados pela comunidade científica como meio para permitir o acesso à Internet a utilizadores terrestres em cenários como prestação de socorros e Eventos Temporários Lotados (TCEs), tirando partido da sua capacidade para transportar Pontos de Acesso (APs) Wi-Fi e células Long-Term Evolution (LTE). Soluções que dependem de uma Estação de Controlo (CS) capaz de posicionar os UAVs de acordo com as necessidades de tráfego dos utilizadores demonstraram aumentar a Qualidade de Serviço (QoS) oferecida pela rede. No entanto, estas soluções introduzem desafios importantes no que diz respeito ao encaminhamento do tráfego.Recentemente, foi proposta uma solução que tira partido do conhecimento da CS sobre o estado futuro da rede para atualizar dinamicamente as tabelas de encaminhamento de modo a que as ligações na rede voadora não sejam interrompidas, em vez de se recuperar da sua interrupção, como é o caso na maioria dos protocolos de encaminhamento existentes. Apesar de não considerar o impacto das reconfigurações na rede de acesso, como consequência da mobilidade dos APs, ou o balanceamento da carga na rede, esta abordagem é promissora e merece ser desenvolvida e implementada num sistema real.Esta dissertação tem como foco a implementação de um protocolo de encaminhamento para redes voadoras baseado em Software-Defined Networking (SDN). Especificamente, aborda os problemas de mobilidade e de balanceamento da carga na rede de uma perspetiva centralizada, garantindo simultaneamente comunicações ininterruptas e de banda-larga entre utilizadores terrestres e a Internet, permitindo assim que os UAVs se possam reposicionar e reconfigurar sem interferir com as ligações dos terminais à rede.In recent years, Unmanned Aerial Vehicles (UAVs) are being increasingly used in various applications, both military and civilian. Their miniaturisation and low cost paved the way to the usage of swarms of UAVs, which provide better results when performing tasks compared to single UAVs. However, to enable cooperation between the UAVs, always-on and reliable communications must be ensured.Moreover, swarms of UAVs are being targeted by the scientific community as a way to provide Internet access to ground users in scenarios such as disaster reliefs and Temporary Crowded Events (TCEs), taking advantage of the capability of UAVs to carry Wi-Fi Access Points (APs) or Long-Term Evolution (LTE) cells. Solutions relying on a Control Station (CS) capable of positioning the UAVs according to the users' traffic demands have been shown to improve the Quality of Service (QoS) provided by the network. However, they introduce important challenges regarding network routing.Recently, a solution was proposed to take advantage of the knowledge provided by a CS regarding how the network will change, by dynamically updating the forwarding tables before links in the flying network are disrupted, rather than recovering from link failure, as is the case in most of the existing routing protocols. Although it does not consider the impact of reconfigurations on the access network due to the mobility of the APs, it is a promising approach worthy of being improved and implemented in a real system.This dissertation focuses on implementing a routing solution for flying networks based on Software-Defined Networking (SDN). Specifically, it addresses the mobility management and network load balancing issues from a centralised perspective, while simultaneously enabling uninterruptible and broadband communications between ground users and the Internet, thus allowing UAVs to reposition and reconfigure themselves without interfering with the terminals' connections to the network

Priority-Based Content Delivery in the Internet of Vehicles through Named Data Networking

Named Data Networking (NDN) has been recently proposed as a prominent solution for content delivery in the Internet of Vehicles (IoV), where cars equipped with a variety of wireless communication technologies exchange information aimed to support safety, traffic efficiency, monitoring and infotainment applications. The main NDN tenets, i.e., name-based communication and in-network caching, perfectly fit the demands of time- and spatially-relevant content requested by vehicles regardless of their provenance. However, existing vehicular NDN solutions have not been targeted to wisely ensure prioritized traffic treatment based on the specific needs of heterogeneous IoV content types. In this work, we propose a holistic NDN solution that, according to the demands of data traffic codified in NDN content names, dynamically shapes the NDN forwarding decisions to ensure the appropriate prioritization. Specifically, our proposal first selects the outgoing interface(s) (i.e., 802.11, LTE) for NDN packets and then properly tunes the timing of the actual transmissions. Simulation results show that the proposed enhancements succeed in achieving differentiated traffic treatment, while keeping traffic load under control

Traffic-Adaptive and Link-Quality-Aware Communication in Wireless Sensor Networks

This paper is a summary of the main contributions of the PhD thesis published in [1]. The main research contributions of the thesis are driven by the research question how to design simple, yet efficient and robust run-time adaptive resource allocation schemes within the communication stack of Wireless Sensor Network (WSN) nodes. The thesis addresses several problem domains with contributions on different layers of the WSN communication stack. The main contributions can be summarized as follows: First, a a novel run-time adaptive MAC protocol is introduced, which stepwise allocates the power-hungry radio interface in an on-demand manner when the encountered traffic load requires it. Second, the thesis outlines a methodology for robust, reliable and accurate software-based energy-estimation, which is calculated at network runtime on the sensor node itself. Third, the thesis evaluates several Forward Error Correction (FEC) strategies to adaptively allocate the correctional power of Error Correcting Codes (ECCs) to cope with timely and spatially variable bit error rates. Fourth, in the context of TCP-based communications in WSNs, the thesis evaluates distributed caching and local retransmission strategies to overcome the performance degrading effects of packet corruption and transmission failures when transmitting data over multiple hops. The performance of all developed protocols are evaluated on a self-developed real-world WSN testbed and achieve superior performance over selected existing approaches, especially where traffic load and channel conditions are suspect to rapid variations over tim