Flow Allocation for Maximum Throughput and Bounded Delay on Multiple Disjoint Paths for Random Access Wireless Multihop Networks

In this paper, we consider random access, wireless, multi-hop networks, with multi-packet reception capabilities, where multiple flows are forwarded to the gateways through node disjoint paths. We explore the issue of allocating flow on multiple paths, exhibiting both intra- and inter-path interference, in order to maximize average aggregate flow throughput (AAT) and also provide bounded packet delay. A distributed flow allocation scheme is proposed where allocation of flow on paths is formulated as an optimization problem. Through an illustrative topology it is shown that the corresponding problem is non-convex. Furthermore, a simple, but accurate model is employed for the average aggregate throughput achieved by all flows, that captures both intra- and inter-path interference through the SINR model. The proposed scheme is evaluated through Ns2 simulations of several random wireless scenarios. Simulation results reveal that, the model employed, accurately captures the AAT observed in the simulated scenarios, even when the assumption of saturated queues is removed. Simulation results also show that the proposed scheme achieves significantly higher AAT, for the vast majority of the wireless scenarios explored, than the following flow allocation schemes: one that assigns flows on paths on a round-robin fashion, one that optimally utilizes the best path only, and another one that assigns the maximum possible flow on each path. Finally, a variant of the proposed scheme is explored, where interference for each link is approximated by considering its dominant interfering nodes only.Comment: IEEE Transactions on Vehicular Technolog

Performance Modelling and Optimisation of Multi-hop Networks

A major challenge in the design of large-scale networks is to predict and optimise the total time and energy consumption required to deliver a packet from a source node to a destination node. Examples of such complex networks include wireless ad hoc and sensor networks which need to deal with the effects of node mobility, routing inaccuracies, higher packet loss rates, limited or time-varying effective bandwidth, energy constraints, and the computational limitations of the nodes. They also include more reliable communication environments, such as wired networks, that are susceptible to random failures, security threats and malicious behaviours which compromise their quality of service (QoS) guarantees. In such networks, packets traverse a number of hops that cannot be determined in advance and encounter non-homogeneous network conditions that have been largely ignored in the literature. This thesis examines analytical properties of packet travel in large networks and investigates the implications of some packet coding techniques on both QoS and resource utilisation. Specifically, we use a mixed jump and diffusion model to represent packet traversal through large networks. The model accounts for network non-homogeneity regarding routing and the loss rate that a packet experiences as it passes successive segments of a source to destination route. A mixed analytical-numerical method is developed to compute the average packet travel time and the energy it consumes. The model is able to capture the effects of increased loss rate in areas remote from the source and destination, variable rate of advancement towards destination over the route, as well as of defending against malicious packets within a certain distance from the destination. We then consider sending multiple coded packets that follow independent paths to the destination node so as to mitigate the effects of losses and routing inaccuracies. We study a homogeneous medium and obtain the time-dependent properties of the packet’s travel process, allowing us to compare the merits and limitations of coding, both in terms of delivery times and energy efficiency. Finally, we propose models that can assist in the analysis and optimisation of the performance of inter-flow network coding (NC). We analyse two queueing models for a router that carries out NC, in addition to its standard packet routing function. The approach is extended to the study of multiple hops, which leads to an optimisation problem that characterises the optimal time that packets should be held back in a router, waiting for coding opportunities to arise, so that the total packet end-to-end delay is minimised

Cross-layer design for wireless sensor relay networks

In recent years, the idea of wireless sensor networks has gathered a great deal of attention. A distributed wireless sensor network may have hundreds of small sensor nodes. Each individual sensor contains both processing and communication elements and is designed in some degree to monitor the environmental events specified by the end user of the network. Information about the environment is gathered by sensors and delivered to a remote collector. This research conducts an investigation with respect to the energy efficiency and the cross-layer design in wireless sensor networks. Motivated by the multipath utilization and transmit diversity capability of space-time block codes (STBC), a new energy efficient cooperative routing algorithm using the STBC is proposed. Furthermore, the steady state performance of the network is analyzed via a Markov chain model. The proposed approach in this dissertation can significantly reduce the energy consumption and improve the power efficiency. This work also studies the application of differential STBC for wireless multi-hop sensor networks over fading channels. Using differential STBC, multiple sensors are selected acting as parallel relay nodes to receive and relay collected data. The proposed technique offers low complexity, since it does not need to track or estimate the time-varying channel coefficients. Analysis and simulation results show that the new approach can improve the system performance. This dissertation models the cooperative relay method for sensor networks using a Markov chain and an M/G/1 queuing system. The analytical and simulation results indicate system improvements in terms of throughput and end-to-end delay. Moreover, the impact of network resource constraints on the performance of multi-hop sensor networks with cooperative relay is also investigated. The system performance under assumptions of infinite buffer or finite buffer sizes is studied, the go through delay and the packet drop probability are improved compared to traditional single relay method. Moreover, a packet collision model for crucial nodes in wireless sensor networks is introduced. Using such a model, a space and network diversity combining (SNDC) method is designed to separate the collision at the collector. The network performance in terms of throughput, delay, energy consumption and efficiency are analyzed and evaluated

Diversity, Coding, and Multiplexing Trade-Off of Network-Coded Cooperative Wireless Networks

In this paper, we study the performance of network-coded cooperative diversity systems with practical communication constraints. More specifically, we investigate the interplay between diversity, coding, and multiplexing gain when the relay nodes do not act as dedicated repeaters, which only forward data packets transmitted by the sources, but they attempt to pursue their own interest by forwarding packets which contain a network-coded version of received and their own data. We provide a very accurate analysis of the Average Bit Error Probability (ABEP) for two network topologies with three and four nodes, when practical communication constraints, i.e., erroneous decoding at the relays and fading over all the wireless links, are taken into account. Furthermore, diversity and coding gain are studied, and advantages and disadvantages of cooperation and binary Network Coding (NC) are highlighted. Our results show that the throughput increase introduced by NC is offset by a loss of diversity and coding gain. It is shown that there is neither a coding nor a diversity gain for the source node when the relays forward a network-coded version of received and their own data. Compared to other results available in the literature, the conclusion is that binary NC seems to be more useful when the relay nodes act only on behalf of the source nodes, and do not mix their own packets to the received ones. Analytical derivation and findings are substantiated through extensive Monte Carlo simulations.Comment: IEEE International Conference on Communications (ICC), 2012. Accepted for publication and oral presentatio

Cross-layer design of multi-hop wireless networks

MULTI -hop wireless networks are usually defined as a collection of nodes equipped with radio transmitters, which not only have the capability to communicate each other in a multi-hop fashion, but also to route each others’ data packets. The distributed nature of such networks makes them suitable for a variety of applications where there are no assumed reliable central entities, or controllers, and may significantly improve the scalability issues of conventional single-hop wireless networks. This Ph.D. dissertation mainly investigates two aspects of the research issues related to the efficient multi-hop wireless networks design, namely: (a) network protocols and (b) network management, both in cross-layer design paradigms to ensure the notion of service quality, such as quality of service (QoS) in wireless mesh networks (WMNs) for backhaul applications and quality of information (QoI) in wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of this Ph.D. dissertation, different network settings are used as illustrative examples, however the proposed algorithms, methodologies, protocols, and models are not restricted in the considered networks, but rather have wide applicability. First, this dissertation proposes a cross-layer design framework integrating a distributed proportional-fair scheduler and a QoS routing algorithm, while using WMNs as an illustrative example. The proposed approach has significant performance gain compared with other network protocols. Second, this dissertation proposes a generic admission control methodology for any packet network, wired and wireless, by modeling the network as a black box, and using a generic mathematical 0. Abstract 3 function and Taylor expansion to capture the admission impact. Third, this dissertation further enhances the previous designs by proposing a negotiation process, to bridge the applications’ service quality demands and the resource management, while using WSNs as an illustrative example. This approach allows the negotiation among different service classes and WSN resource allocations to reach the optimal operational status. Finally, the guarantees of the service quality are extended to the environment of multiple, disconnected, mobile subnetworks, where the question of how to maintain communications using dynamically controlled, unmanned data ferries is investigated

SDDV: scalable data dissemination in vehicular ad hoc networks

An important challenge in the domain of vehicular ad hoc networks (VANET) is the scalability of data dissemination. Under dense traffic conditions, the large number of communicating vehicles can easily result in a congested wireless channel. In that situation, delays and packet losses increase to a level where the VANET cannot be applied for road safety applications anymore. This paper introduces scalable data dissemination in vehicular ad hoc networks (SDDV), a holistic solution to this problem. It is composed of several techniques spread across the different layers of the protocol stack. Simulation results are presented that illustrate the severity of the scalability problem when applying common state-of-the-art techniques and parameters. Starting from such a baseline solution, optimization techniques are gradually added to SDDV until the scalability problem is entirely solved. Besides the performance evaluation based on simulations, the paper ends with an evaluation of the final SDDV configuration on real hardware. Experiments including 110 nodes are performed on the iMinds w-iLab.t wireless lab. The results of these experiments confirm the results obtained in the corresponding simulations

Available Bandwidth Estimation for Adaptive Video Streaming in Mobile Ad Hoc

[EN] We propose in this paper an algorithm for available bandwidth estimation in mobile ad hoc networks and its integration into a conventional routing protocol like AODV for improving the rate-adaptive video streaming. We have introduced in our approach a local estimation of the available bandwidth as well as a prediction of the consumed bandwidth. This information allows video application to adjust its transmission rate avoiding network congestion. We conducted a performance evaluation of our solution through simulation experiments using two network scenarios. In the simulation study, transmission of video streams encoded with the H.264/MPEG-4 advanced video coding standard was evaluated. The results reveal performance improvements in terms of packet loss, delay and PSNR.Castellanos, W.; Guerri Cebollada, JC.; Arce Vila, P. (2019). Available Bandwidth Estimation for Adaptive Video Streaming in Mobile Ad Hoc. International Journal of Wireless Information Networks. 26(3):218-229. https://doi.org/10.1007/s10776-019-00431-0S21822926