27 research outputs found

    Adaptive load balancing routing algorithms for the next generation wireless telecommunications networks

    Get PDF
    This thesis was submitted for the degree of Doctor of Philosophy and was awarded by Brunel UniversityWith the rapid development of wireless networks, mesh networks are evolving as a new important technology, presenting a high research and commercial interest. Additionally, wireless mesh networks have a wide variety of applications, offering the ability to provide network access in both rural and urban areas with low cost of maintenance. One of the main functionalities of a wireless mesh network is load balancing routing, which is the procedure of finding the best, according to some criteria, routes that data need to follow to transfer from one node to another. Routing is one of the state-of-the-art areas of research because the current algorithms and protocols are not efficient and effective due to the diversity of the characteristics of these networks. In this thesis, two new routing algorithms have been developed for No Intra-Cell Interference (NICI) and Limited Intra-Cell Interference (LICI) networks based on WiMAX, the most advanced wireless technology ready for deployment. The algorithms created are based on the classical Dijkstra and Ford-Fulkerson algorithms and can be implemented in the cases of unicast and multicast transmission respectively.State scholarships foundation of Greece

    Spectrum Allocation Algorithms for Cognitive Radio Mesh Networks

    Get PDF
    Empowered by the cognitive radio technology, and motivated by the sporadic channel utilization, both spatially and temporally, dynamic spectrum access networks (also referred to as cognitive radio networks and next generation wireless networks) have emerged as a solution to improve spectrum utilization and provide more flexibility to wireless communication. A cognitive radio network is composed of wireless users, referred to as secondary users, which are allowed to use licensed spectrum bands as long as their are no primary, licensed, users occupying the channel in their vicinity. This restricted spectrum access strategy leads to heterogeneity in channel availability among secondary users. This heterogeneity forms a significant source of performance degradation for cognitive radio networks, and poses a great challenge on protocol design. In this dissertation, we propose spectrum allocation algorithms that take into consideration the heterogeneity property and its effect on the network performance. The spectrum allocation solutions proposed in this dissertation address three major objectives in cognitive radio mesh networks. The first objective is maximizing the network coverage, in terms of the total number of served clients, and at the same time simplifying the communication coordination function. To address this objective, we proposed a received based channel allocation strategy that alleviates the need for a common control channel, thus simplifying the coordination function, and at the same time maximizes the number of clients served with link reliability guarantees. We show the superiority of the proposed allocation strategy over other existing strategies. The second objective is improving the multicast throughput to compensate for the performance degradation caused by channel heterogeneity. We proposed a scheduling algorithm that schedules multicast transmissions over both time and frequency and integrates that with the use of network coding. This algorithm achieves a significant gain, measured as the reduction in the total multicast time, as the simulation results prove. We also proposed a failure recovery algorithm that can adaptively adjust the schedule in response to temporary changes in channel availability. The last objective is minimizing the effect of channel switching on the end-to-end delay and network throughput. Channel switching can be a significant source of delay and bandwidth wastage, especially if the secondary users are utilizing a wide spectrum band. To address this issue, we proposed an on-demand multicast routing algorithm for cognitive radio mesh networks based on dynamic programming. The algorithm finds the best available route in terms of end-to-end delay, taking into consideration the switching latency at individual nodes and the transmission time on different channels. We also presented the extensibility of the proposed algorithm to different routing metric. Furthermore, a route recovery algorithm that takes into consideration the overhead of rerouting and the route cost was also proposed. The gain of these algorithms was proved by simulation

    Exploiting the power of multiplicity: a holistic survey of network-layer multipath

    Get PDF
    The Internet is inherently a multipath network: For an underlying network with only a single path, connecting various nodes would have been debilitatingly fragile. Unfortunately, traditional Internet technologies have been designed around the restrictive assumption of a single working path between a source and a destination. The lack of native multipath support constrains network performance even as the underlying network is richly connected and has redundant multiple paths. Computer networks can exploit the power of multiplicity, through which a diverse collection of paths is resource pooled as a single resource, to unlock the inherent redundancy of the Internet. This opens up a new vista of opportunities, promising increased throughput (through concurrent usage of multiple paths) and increased reliability and fault tolerance (through the use of multiple paths in backup/redundant arrangements). There are many emerging trends in networking that signify that the Internet's future will be multipath, including the use of multipath technology in data center computing; the ready availability of multiple heterogeneous radio interfaces in wireless (such as Wi-Fi and cellular) in wireless devices; ubiquity of mobile devices that are multihomed with heterogeneous access networks; and the development and standardization of multipath transport protocols such as multipath TCP. The aim of this paper is to provide a comprehensive survey of the literature on network-layer multipath solutions. We will present a detailed investigation of two important design issues, namely, the control plane problem of how to compute and select the routes and the data plane problem of how to split the flow on the computed paths. The main contribution of this paper is a systematic articulation of the main design issues in network-layer multipath routing along with a broad-ranging survey of the vast literature on network-layer multipathing. We also highlight open issues and identify directions for future work

    Design methods for optimal resource allocation in wireless networks

    Get PDF
    Wireless communications have seen remarkable progress over the past two decades and perceived tremendous success due to their agile nature and capability to provide fast and ubiquitous internet access. Maturation of 3G wireless network services, development of smart-phones and other broadband mobile computing devices however have motivated researchers to design wireless networks with increased capacity and coverage, therefore un-leaching the wireless broadband capabilities. In this thesis, we address two very important design aspects of wireless networks, namely, interference management and control through optimal cross-layer design and channel fading mitigation through relay-assisted cooperative communications. For the former, we address, in the context of wireless network design, the problem of optimally partitioning the spectrum into a set of non-overlapping channels with non uniform spectrum widths and we model the combinatorially complex problem of joint routing, link scheduling, and spectrum allocation as an optimization problem. We use column generation decomposition technique (which decomposes the original problem into a master and a pricing subproblem) for solving the problem optimally. We also propose several sub-optimal methods for efficiently solving the pricing subproblems. For the latter problem, we study the joint problem of relay selection and power allocation in both wireless unicast and multicast cooperative cellular networks. We employ convex optimization technique to model this complex optimization problem and use branch and bound technique to solve it optimally. We also present sub-optimal methods to reduce the problem complexity and solve it more efficiently

    Opportunistic routing in wireless mesh networks

    Get PDF
    Advances in communication and networking technologies are rapidly making ubiquitous network connectivity a reality. In recent years, Wireless Mesh Networks (WMNs) have already become very popular and been receiving an increasing amount of attention by the research community. Basically, a WMN consists of simple mesh routers and mesh clients, where mesh routers form the backbone of WMN. Due to the limited transmission range of the radio, many pairs of nodes in WMN may not be able to communicate directly, hence they need other intermediate nodes to forward packets for them. Routing in such networks is an important issue and it poses great challenges. Opportunistic Routing (OR) has been investigated in recent years as a way to increase the performance of WMNs by exploiting its broadcast nature. In OR, in contrast to traditional routing, instead of pre-selecting a single specic node to be the next-hop as a forwarder for a packet, an ordered set of nodes (referred to as candidates) is selected as the potential next-hop forwarders. Thus, the source can use multiple potential paths to deliver the packets to the destination. More specically, when the current node transmits a packet, all the candidates that successfully receive it will coordinate with each other to determine which one will actually forward it, while the others will simply discard the packet. This dissertation studies the properties, performance, maximum gain, candidate selection algorithms and multicast delivery issues about Opportunistic Routing in WMNs. Firstly, we focus on the performance analysis of OR by proposing a Discrete Time Markov Chain (DTMC). This model can be used to evaluate OR in terms of expected number of transmissions from the source to the destination. Secondly, we apply our Markov model to compare relevant candidate selection algorithms that have been proposed in the literature. They range from non-optimum, but simple, to optimum, but with a high computational cost. Thirdly, the set of candidates which a node uses and priority order of them have a signicant impact on the performance of OR. Therefore, using a good metric and algorithm to select and order the candidates are key factors in designing an OR protocol. As the next contribution we propose a new metric that measures the expected distance progress of sending a packet using a set of candidates. Based on this metric we propose a candidate selection algorithm which its performance is very close to the optimum algorithm although our algorithm runs much faster. Fourthly, we have investigated the maximum gain that can be obtained using OR. We have obtained some equations that yield the distances of the candidates in OR such that the per transmission progress towards the destination is maximized. Based on these equations we have proposed a novel candidate selection algorithm. Our new algorithm only needs the geographical location of nodes. The performance of our proposal is very close to the optimum candidate selection algorithm although our algorithm runs much faster. Finally, using OR to support multicast is an other issue that we have investigated in this thesis. We do so by proposing a new multicast protocol which uses OR. Unlike traditional multicast protocols, there is no designated next-hop forwarder for each destination in our protocol, thus the delivery ratio is maximized by taking advantage of spatial diversity

    Interference-Aware Routing in Wireless Mesh Networks

    Get PDF
    User demand for seamless connectivity has encouraged the development of alternatives to traditional communications infrastructure networks. Potential solutions have to be low-cost, easily deployable and adaptive to the environment. One approach that has gained tremendous attention over the past few years is the deployment of a backbone of access points wirelessly interconnected, allowing users to access the wired infrastructure via wireless multi-hop communication. Wireless Mesh Networks (WMN) fall into this category and constitute a technology that could revolutionize the way wireless network access is provided. However, limited transfer capacity and interference resulting from the shared nature of the transmission medium will prevent widespread deployment if the network performance does not meet users' expectations. It is therefore imperative to provide efficient mechanisms for such networks. Resource management encompasses a number of different issues, including routing. Although a profusion of routing mechanisms have been proposed for other wireless technologies, the unique characteristics of WMNs (i.e. fixed wireless backbone, with the possibility to embed multiple interfaces) prevent their straight forward adoption in WMNs. Moreover, the severe performance degradations that can result from the interference generated by concurrent data transmissions and environmental noise call for the development of interference-aware routing mechanisms. In this thesis, we investigated the impact of interference on the network performance of wireless mesh networks. We designed algorithms to associate routers to gateways that minimize the interference level in single-channel and multi-channel networks. We then studied the performance of existing routing metrics and their suitability for mesh networks. As a result of this analysis, we designed a novel routing metric and showed its benefits over existing ones. Finally, we provided an analytical evaluation of the probability of finding two non interfering paths given a network topology

    Optimizing infrastructure placement in Wireless Mesh Networks

    Get PDF
    Wireless Mesh Networks (WMNs) are a promising flexible and low cost technology to efficiently deliver broadband services to communities. In a WMN, a mesh router is deployed at each house, which acts both as a local access point and a relay to other nearby houses. Since mesh routers typically consist of off-the-shelf equipment, the major cost of the network is in the placement and management of Internet Transit Access Points (ITAP) which act as the connection to the internet. In designing a WMN, we therefore aimed to minimize the number of ITAPs required whilst maximizing the traffic that could be served to each house. We investigated heuristic and meta-heuristic approaches with an efficient combination of move operators to solve these placement problems by using single and multi-objective formulations. Many real-world optimisation problems involve dealing with multiple and sometimes conflicting objectives. A multi-objective approach to optimize WMN infrastructure placement design with three conflicting objectives is presented: it aims to minimize the number of ITAPs, maximize the fairness of bandwidth allocation and maximize the coverage to mesh clients. We discuss how such an approach could allow more effective ITAP deployment, enabling a greater number of consumers to obtain internet services. Two approaches are compared during our investigation of multi-objective optimization, namely the weighted sum approach and the use of an evolutionary algorithm. In this thesis we investigate a multi-objective optimization algorithm to solve the WMN infrastructure placement problem. The move operators demonstrate their efficiency when compared to simple Hill Climbing (HC) and Simulated Annealing (SA) for the single objective method
    corecore