6 research outputs found
Impact of Transmission Power Control in multi-hop networks
Many Transmission Power Control (TPC) algorithms have been proposed in the past, yet the conditions under which they are evaluated do not always reflect typical Internet-of-Things (IoT) scenarios. IoT networks consist of several source nodes transmitting data simultaneously, possibly along multiple hops. Link failures are highly frequent, causing the TPC algorithm to kick-in quite often. To this end, in this paper we study the impact that frequent TPC actions have across different layers. Our study shows how one node’s decision to scale its transmission power can affect the performance of both routing and MAC layers of multiple other nodes in the network, generating cascading packet retransmissions and forcing far too many nodes to consume more energy. We find that crucial objectives of TPC such as conserving energy and increasing network capacity are severely undermined in multi-hop networks
OPTIMISING APPLICATION PERFORMANCE WITH QOS SUPPORT IN AD HOC NETWORKS
The popularity of wireless communication has increased substantially over the last decade, due to mobility support, flexibility and ease of deployment. Among next generation of mobile communication technologies, Ad Hoc networking plays an important role, since it can stand alone as private network, become a part of public network, either for general use or as part of disaster management scenarios.
The performance of multihop Ad Hoc networks is heavily affected by interference, mobility, limited shared bandwidth, battery life, error rate of wireless media, and the presence of hidden and exposed terminals. The scheduler and the Medium Access Control (MAC) play a vital role in providing Quality of Service (QoS) and policing delay, end-to-end throughput, jitter, and fairness for user application services. This project aims to optimise the usage of the available limited resources in terms of battery life and bandwidth, in order to reduce packet delivery time and interference, enhance fairness, as well as increase the end-to-end throughput, and increase the overall network performance.
The end-to-end throughput of an Ad Hoc network decays rapidly as the hop count between the source and destination pair increases and additional flows injected along the path of an existing flow affects the flows arriving from further away; in order to address this problem, the thesis proposes a Hop Based Dynamic Fair Scheduler that prioritises flows subject to the hop count of frames, leading to a 10% increase in fairness when compared to a IEEE 802.11b with single queue. Another mechanism to improve network performance in high congestion scenarios is network-aware queuing that reduces loss and improve the end-to-end throughput of the communicating nodes, using a medium access control method, named Dynamic Queue Utilisation Based Medium Access Control (DQUB-MAC). This MAC provides higher access probability to the nodes with congested queue, so that data generated at a high rate can be forwarded more effectively. Finally, the DQUB-MAC is modified to take account of hop count and a new MAC called Queue Utilisation with Hop Based Enhanced Arbitrary Inter Frame Spacing (QU-EAIFS) is also designed in this thesis. Validation tests in a long chain topology demonstrate that DQUB-MAC and QU-EAIFS increase the performance of the network during saturation by 35% and 40% respectively compared to IEEE 802.11b.
High transmission power leads to greater interference and represents a significant challenge for Ad Hoc networks, particularly in the context of shared bandwidth and limited battery life. The thesis proposes two power control mechanisms that also employ a random backoff value directly proportional to the number of the active contending neighbours. The first mechanism, named Location Based Transmission using a Neighbour Aware with Optimised EIFS for Ad Hoc Networks (LBT-NA with Optimised EIFS MAC), controls the transmission power by exchanging location information between the communicating nodes in order to provide better fairness through a dynamic EIFS based on the overheard packet length. In a random topology, with randomly placed source and destination nodes, the performance gain of the proposed MAC over IEEE 802.11b ranges from approximately 3% to above 90% and the fairness index improved significantly. Further, the transmission power is directly proportional to the distance of communication. So, the performance is high and the durability of the nodes increases compared to a fixed transmission power MAC such as IEEE 802.11b when communicating distance is shorter. However, the mechanism requires positional information, therefore, given that location is typically unavailable, a more feasible power control cross layered system called Dynamic Neighbour Aware – Power controlled MAC (Dynamic NA -PMAC)is designed to adjust the transmission power by estimating the communicating distance based on the estimated overheard signal strength.
In summary, the thesis proposes a number of mechanisms that improve the fairness amongst the competing flows, increase the end-to-end throughput, decrease the delay, reduce the transmission power in Ad Hoc environments and substantially increase the overall performance of the network
Recommended from our members
Integrated Scheduling and Beam Steering for Spatial Reuse
This document describes an approach to integrating antenna selection and control into a time-division MAC scheduling process. I argue that through such integration it is possible to achieve greater spatial reuse and interference mitigation than by solving the two problems separately. Without coupling between the MAC scheduling and physical antenna configuration processes, a \u22chicken-and-egg\u22 problem exists: If antenna decisions are made before scheduling, they cannot be optimized for the communication that will actually occur. If, on the other hand, the scheduling decisions are made first, the scheduler cannot know what the actual interference and communications properties of the network will be.
This dissertation presents algorithms for optimal spatial reuse TDMA scheduling with reconfigurable antennas. I present and solve the joint beam steering and scheduling problem for spatial reuse TDMA and describe an implemented system based on the algorithms developed. The algorithms described achieve up to a 600% speedup over TDMA in the experiments performed. This is based on using an optimization decomposition approach to arrive at a working distributed protocol which is equivalent to the original problem statement while also producing optimal solutions in an amount of time that is at worst linear in the size of the input. This is, to the best of my knowledge, the first actually implemented STDMA scheduling system based on dual decomposition. This dissertation identifies and briefly address some of the challenges that arise in taking such a system from theory to reality