210 research outputs found

    Maximum Multipath Routing Throughput in Multirate Wireless Mesh Networks

    Full text link
    In this paper, we consider the problem of finding the maximum routing throughput between any pair of nodes in an arbitrary multirate wireless mesh network (WMN) using multiple paths. Multipath routing is an efficient technique to maximize routing throughput in WMN, however maximizing multipath routing throughput is a NP-complete problem due to the shared medium for electromagnetic wave transmission in wireless channel, inducing collision-free scheduling as part of the optimization problem. In this work, we first provide problem formulation that incorporates collision-free schedule, and then based on this formulation we design an algorithm with search pruning that jointly optimizes paths and transmission schedule. Though suboptimal, compared to the known optimal single path flow, we demonstrate that an efficient multipath routing scheme can increase the routing throughput by up to 100% for simple WMNs.Comment: This paper has been accepted for publication in IEEE 80th Vehicular Technology Conference, VTC-Fall 201

    Identifying Design Requirements for Wireless Routing Link Metrics

    Full text link
    In this paper, we identify and analyze the requirements to design a new routing link metric for wireless multihop networks. Considering these requirements, when a link metric is proposed, then both the design and implementation of the link metric with a routing protocol become easy. Secondly, the underlying network issues can easily be tackled. Thirdly, an appreciable performance of the network is guaranteed. Along with the existing implementation of three link metrics Expected Transmission Count (ETX), Minimum Delay (MD), and Minimum Loss (ML), we implement inverse ETX; invETX with Optimized Link State Routing (OLSR) using NS-2.34. The simulation results show that how the computational burden of a metric degrades the performance of the respective protocol and how a metric has to trade-off between different performance parameters

    Opportunistic Routing in Multihop Wireless Networks: Capacity, Energy Efficiency, and Security

    Get PDF
    Opportunistic routing (OR) takes advantages of the spatial diversity and broadcast nature of wireless networks to combat the time-varying links by involving multiple neighboring nodes (forwarding candidates) for each packet relay. This dissertation studies the properties, energy efficiency, capacity, throughput, protocol design and security issues about OR in multihop wireless networks. Firstly, we study geographic opportunistic routing (GOR), a variant of OR which makes use of nodes\u27 location information. We identify and prove three important properties of GOR. The first one is on prioritizing the forwarding candidates according to their geographic advancements to the destination. The second one is on choosing the forwarding candidates based on their advancements and link qualities in order to maximize the expected packet advancement (EPA) with different number of forwarding candidates. The third one is on the concavity of the maximum EPA in respect to the number of forwarding candidates. We further propose a local metric, EPA per unit energy consumption, to tradeoff the routing performance and energy efficiency for GOR. Leveraging the proved properties of GOR, we propose two efficient algorithms to select and prioritize forwarding candidates to maximize the local metric. Secondly, capacity is a fundamental issue in multihop wireless networks. We propose a framework to compute the end-to-end throughput bound or capacity of OR in single/multirate systems given OR strategies (candidate selection and prioritization). Taking into account wireless interference and unique properties of OR, we propose a new method of constructing transmission conflict graphs, and we introduce the concept of concurrent transmission sets to allow the proper formulation of the maximum end-to-end throughput problem as a maximum-flow linear programming problem subject to the transmission conflict constraints. We also propose two OR metrics: expected medium time (EMT) and expected advancement rate (EAR), and the corresponding distributed and local rate and candidate set selection schemes, the Least Medium Time OR (LMTOR) and the Multirate Geographic OR (MGOR). We further extend our framework to compute the capacity of OR in multi-radio multi-channel systems with dynamic OR strategies. We study the necessary and sufficient conditions for the schedulability of a traffic demand vector associated with a transmitter to its forwarding candidates in a concurrent transmission set. We further propose an LP approach and a heuristic algorithm to obtain an opportunistic forwarding strategy scheduling that satisfies a traffic demand vector. Our methodology can be used to calculate the end-to-end throughput bound of OR in multi-radio/channel/rate multihop wireless networks, as well as to study the OR behaviors (such as candidate selection and prioritization) under different network configurations. Thirdly, protocol design of OR in a contention-based medium access environment is an important and challenging issue. In order to avoid duplication, we should ensure only the best receiver of each packet to forward it in an efficient way. We investigate the existing candidate coordination schemes and propose a fast slotted acknowledgment (FSA) to further improve the performance of OR by using a single ACK to coordinate the forwarding candidates with the help of the channel sensing technique. Furthermore, we study the throughput of GOR in multi-rate and single-rate systems. We introduce a framework to analyze the one-hop throughput of GOR, and provide a deeper insight on the trade-off between the benefit (packet advancement, bandwidth, and transmission reliability) and cost (medium time delay) associated with the node collaboration. We propose a local metric named expected one-hop throughput (EOT) to balance the benefit and cost. Finally, packet reception ratio (PRR) has been widely used as an indicator of the link quality in multihop wireless networks. Many routing protocols including OR in wireless networks depend on the PRR information to make routing decision. Providing accurate link quality measurement (LQM) is essential to ensure the right operation of these routing protocols. However, the existing LQM mechanisms are subject to malicious attacks, thus can not guarantee to provide correct link quality information. We analyze the security vulnerabilities in the existing link quality measurement (LQM) mechanisms and propose an efficient broadcast-based secure LQM (SLQM) mechanism, which prevents the malicious attackers from reporting a higher PRR than the actual one. We analyze the security strength and the cost of the proposed mechanism

    Load Balancing Dynamic Source Routing Protocol Based on Multi-Path Routing

    Get PDF
    A HWMP improved routing protocol (HWMMRP) is proposed in this paper. The protocol adopts the integrated link state routing criterion algorithm LCCM providing small overhead, with factors such as bandwidth, queue length and noise interference fully considered. In order to solve the problem of the tree routing mechanism being easily congested at the root node, a multi-path multi-gateway shunting mechanism is applied. A multipath routing mechanism is also incorporated in the reactive routing mode. Both the new criteria and the protocol are simulated in the NS-2 environment, and are compared with comparable protocols. The experimental results show that our protocol can effectively avoid node congestion, and provides a better dynamic load balancing capability as well as a better performance than the standard HWMP and AODV protocols

    QoS constrained cellular ad hoc augmented networks

    Get PDF
    In this dissertation, based on different design criteria, three novel quality of service (QoS) constrained cellular ad hoc augmented network (CAHAN) architectures are proposed for next generation wireless networks. The CAHAN architectures have a hybrid architecture, in which each MT of CDMA cellular networks has ad hoc communication capability. The CAHAN architectures are an evolutionary approach to conventional cellular networks. The proposed architectures have good system scalability and high system reliability. The first proposed architecture is the QoS constrained minimum-power cellular ad hoc augmented network architecture (QCMP CAHAN). The QCMP CAHAN can find the optimal minimum-power routes under the QoS constraints (bandwidth, packet-delay, or packet-error-rate constraint). The total energy consumed by the MTs is lower in the case of QCMP CAHAN than in the case of pure cellular networks. As the ad hoc communication range of each MT increases, the total transmitted power in QCMP CAHAN decreases. However, due to the increased number of hops involved in information delivery between the source and the destination, the end-to-end delay increases. The maximum end-to-end delay will be limited to a specified tolerable value for different services. An MT in QCMP CAHAN will not relay any messages when its ad hoc communication range is zero, and if this is the case for all MTs, then QCMP CAHAN reduces to the traditional cellular network. A QoS constrained network lifetime extension cellular ad hoc augmented network architecture (QCLE CAHAN) is proposed to achieve the maximum network lifetime under the QoS constraints. The network lifetime is higher in the case of QCLE CAHAN than in the case of pure cellular networks or QCMP CAHAN. In QCLE CAHAN, a novel QoS-constrained network lifetime extension routing algorithm will dynamically select suitable ad-hoc-switch-to-cellular points (ASCPs) according to the MT remaining battery energy such that the selection will balance all the MT battery energy and maximizes the network lifetime. As the number of ASCPs in an ad hoc subnet decreases, the network lifetime will be extended. Maximum network lifetime can be increased until the end-to-end QoS in QCLE CAHAN reaches its maximum tolerable value. Geocasting is the mechanism to multicast messages to the MTs whose locations lie within a given geographic area (target area). Geolocation-aware CAHAN (GA CAHAN) architecture is proposed to improve total transmitted power expended for geocast services in cellular networks. By using GA CAHAN for geocasting, saving in total transmitted energy can be achieved as compared to the case of pure cellular networks. When the size of geocast target area is large, GA CAHAN can save larger transmitted energy

    Experimental and analytical evalution of embedded link performance with small-scale channel fluctuations

    Get PDF
    We have deployed a first-of-its-kind, urban-scale wireless mesh network which provides Internet access to 1000's of users spanning multiple square kilometers in an underserved area in Houston, TX. However, in this and other urban environments, IEEE 802.11 link performance is both misunderstood and poor-performing due to complex node interactions which are affected by a vast array of factors including topology, channel conditions, modulation rate, packet sizes, and physical layer capture. In this thesis, I draw from 100's of thousands of urban measurements and develop an analytical model to understand the performance of links embedded in the aforementioned complex scenarios. My focus is on two fundamental concepts involving embedded links. First, choosing the modulation rate which maximizes the throughput is imperative since each bit of the (overly-)shared medium is critical. Yet, all existing rate adaptation mechanisrns fail to track the ideal rate even in a simple, non-mobile urban scenario. Using a custom cross-layer framework, I implement multiple and previously un-implemented rate adaptation mechanisms to reveal the reasons for the failure and design rate adaptation mechanisms which are able to track urban and downtown vehicular and non-mobile environments. Second, I pose a basic, yet unsolved problem: given a time-varying channel and traffic matrix in the aforementioned complex scenario, predict the throughput of an embedded link and understand the complex interactions of factors that lead to its performance. By performing thousands of measurements of embedded links on an urban mesh network and developing an analytical model, this work is the first to show that even a 1 dB change in channel state can yield a bi-modal shift in throughput that emulates a change in node connectivity. Finally, I apply our model and experimentation to modulation rate selection and the interaction of control and data traffic to show that understanding these complex interdependencies leads to operation in improved performance regimes. My work has implications for this and other urban communities which have unequal access to Internet resources, enabling a high-speed access infrastructure at extremely low cost
    corecore