Showing papers on "Hazy Sighted Link State Routing Protocol published in 2008"

IEEE 802.11s wireless mesh networks: Framework and challenges

Abstract: Wireless mesh networking based on 802.11 wireless local area network (WLAN) has been actively explored for a few years. To improve the performance of WLAN mesh networks, a few new communication protocols have been developed in recent years. However, these solutions are usually proprietary and prevent WLAN mesh networks from interworking with each other. Thus, a standard becomes indispensable for WLAN mesh networks. To meet this need, an IEEE 802.11 task group, i.e., 802.11s, is specifying a standard for WLAN mesh networks. Although several standard drafts have been released by 802.11s, many issues still remain to be resolved. In order to understand what performance can be expected from the existing framework of 802.11s standard and what functionalities shall be added to 802.11s standard to improve performance, a detailed study on the existing 802.11s standard is given in this paper. The existing framework of 802.11s standard is first presented, followed by pointing out the challenging research issues that still exist in the current 802.11 standard. The purpose of this paper is to motivate other researchers to develop new scalable protocols for 802.11 wireless mesh networks.

STOD-RP: A Spectrum-Tree Based On-Demand Routing Protocol for Multi-Hop Cognitive Radio Networks

Abstract: A unique challenge for routing in cognitive radio networks is the collaboration between the route selection and spectrum decision. To solve this problem, in this paper a Spectrum-Tree base On-Demand routing protocol (STOD-RP) is proposed where a spectrum-tree is built in each spectrum band. The formation of the spectrum-tree addresses the cooperation between spectrum decision and route selection in an efficient way. In addition, a new route metric is proposed as well as a fast and efficient spectrum-adaptive route recovery method. Simulation results show that our proposed STOD-RP reduces the control overhead and shortens the average end-to-end delay significantly.

CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding

Abstract: Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportunistic routing can be implemented in a simple and practical way without resorting to a complicated scheduling protocol. Due to constraints of computational complexity, a protocol utilizing network coding needs to perform segmented network coding, which partitions the data into multiple segments and encode only packets in the same segment. However, existing designs transmit only one segment at any given time while waiting for its acknowledgment, which degrades performance as the size of the network scales up. In this paper, we propose CodeOR, a new protocol that uses network coding in opportunistic routing to improve throughput. By transmitting a window of multiple segments concurrently, it improves the performance of existing work by a factor of two on average (and a factor of four in some cases). CodeOR is especially appropriate for real-time multimedia applications through the use of a small segment size to decrease decoding delay, and is able to further increase network throughput with a smaller packet size and a larger window size.

Ad hoc networks beyond unit disk graphs

Abstract: In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical real-world networks while at the same time being concise enough to promote strong theoretical results The quasi unit disk graph model contains all edges shorter than a parameter d between 0 and 1 and no edges longer than 1 We show that--in comparison to the cost known for unit disk graphs--the complexity results of geographic routing in this model contain the additional factor 1/d2 We prove that in quasi unit disk graphs flooding is an asymptotically message-optimal routing technique, we provide a geographic routing algorithm being most efficient in dense networks, and we show that classic geographic routing is possible with the same asymptotic performance guarantees as for unit disk graphs if d ≥ 1/√2

Route and link evaluation in wireless mesh communications networks

Abstract: Methods and systems for providing a network and routing protocol for utility services are disclosed. A method includes discovering a utility network. Neighboring nodes are discovered and the node listens for advertised routes for networks from the neighbors. The node is then registered with one or more utility networks, receiving a unique address for each network registration. Each upstream node can independently make forwarding decisions on both upstream and downstream packets, i.e., choose the next hop according to the best information available to it. The node can sense transient link problems, outage problems and traffic characteristics. Information is used to find the best route out of and within each network. Each network node maintains multi-egress, multi-ingress network routing options both for itself and the node(s) associated with it. The node is capable of several route maintenance functions utilizing the basic routing protocol and algorithms.

Agro-sense: Precision agriculture using sensor-based wireless mesh networks

Abstract: Advances in wireless personal area networks have made the practical deployment of various services possible, which until a few years ago was considered extremely costly or labor intensive. We build such a wireless sensor network for precision agriculture where real time data of the climatologieal and other environmental properties are sensed and relayed to a central repository. The architecture comprises of three distinct sections - (a) the sensor-nodes (b) the wireless mesh network and (c) the actuation components. The sensors are selected based on the properties suited for the most common crops and we identify four such attributes. The sensor network is based on the IEEE-802.15.4 standard and we develop a new static routing algorithm suited for the sensing application. The algorithm overrides the deficiency of the Hierarchical Routing scheme inherent in the ZigBee specification where the Csklp addressing algorithm limits the possible depth of the network topology due to address wastage. The new algorithm maintains the hierarchical network topology and thus ensures routing at its optimal best. The algorithms for both addressing and routing are provided. The actuation components are also a part of mesh network and are activated wirelessly for controlling irrigation and fertigation.

Survey on routing protocols for wireless sensor networks

Abstract: This paper presented the problems and challenges of routing protocols by the analysis and comparison of typical flat and hierarchical routing protocols.Finally,summaried the important features that ideal routing protocols possess as well as its future research strategies and trends.

Adaptive Routing in Underwater Delay/Disruption Tolerant Sensor Networks

Abstract: As an emerging technique, underwater sensor network (UWSN) will enable a wide range of aquatic applications. However, due to the adverse underwater environmental conditions as well as some system constraints, an underwater sensor network is usually viewed as an intermittently connected network (ICN) (or delay/disruption tolerant network (DTN)), which requires specialized routing protocols. Moreover, applications may have different requirements for different types of messages, as demands a smart protocol to handle packets adaptively. In this paper, we propose a novel routing protocol where routing is performed adaptively based on the types of messages and application requirements. This is obtained by exploiting message redundancy and resource reallocation in order to achieve different performance requirements. We demonstrate through simulations that our protocol can satisfy different application requirements and achieve a good trade-off among delivery ratio, end-to-end delay and energy consumption.

A Contention-Aware Routing Metric for Multi-Rate Multi-Radio Mesh Networks

Abstract: We present a new routing metric for multi-rate multi-radio mesh networks, which takes into account both contention for the shared wireless channel and rate diversity in multi-radio multi-channel mesh networks. A key property of the proposed contention-aware transmission time (CATT) metric is that it is isotonic, hence can be applied to link-state routing protocols. We have implemented the CATT metric in the OLSR routing protocol, and evaluate it in a test-bed with mesh nodes each equipped with four radio interfaces. Our experiments show that the proposed routing metric significantly outperforms other metrics that have appeared in the literature, in a number of scenarios that correspond to different mesh network topologies.

Robust cooperative routing protocol in mobile wireless sensor networks

Abstract: In wireless sensor networks, path breakage occurs frequently due to node mobility, node failure, and channel impairments It is challenging to combat path breakage with minimal control overhead, while adapting to rapid topological changes Due to the Wireless Broadcast Advantage (WBA), all nodes inside the transmission range of a single transmitting node may receive the packet, hence naturally they can serve as cooperative caching and backup nodes if the intended receiver fails to receive the packet In this paper, we present a distributed robust routing protocol in which nodes work cooperatively to enhance the robustness of routing against path breakage We compare the energy efficiency of cooperative routing with noncooperative routing and show that our robust routing protocol can significantly improve robustness while achieving considerable energy efficiency

Cooperative Routing in Multi-Source Multi-Destination Multi-Hop Wireless Networks

Abstract: In a network supporting cooperative communication, the sender of a transmission is no longer a single node, which causes the concept of a traditional link to be reinvestigated. Thus, the routing scheme basing on the link concept should also be reconsidered to ";truly"; exploit the potential performance gain introduced by cooperative communication. In this paper, we investigate the joint problem of routing selection in network layer and contention avoidance among multiple links in MAC layer for multi-hop wireless networks in a cooperative communication aware network. To the best of our knowledge, it is the first work to investigate the problem of cooperative communication aware routing in multi-source multi-destination multi-hop wireless networks. Several important concepts, including virtual node, virtual link and virtual link based contention graph are introduced. Basing on those concepts, an optimal cooperative routing is achieved and a distributed routing scheme is proposed after some practical approximations. The simulation results show that our scheme reduces the total transmission power comparing with non-cooperative routing and greatly increases the network throughput comparing with single flow cooperative routings.

On ant routing algorithms in ad hoc networks with critical connectivity

Abstract: This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing algorithms inspired by the behavior of the ant colonies in locating and storing food. The effectiveness of the heuristic algorithm is supported by mathematical proofs and demonstrated by a comparison with the well-known Ad hoc On Demand Distance Vector (AODV) algorithm. The differences and the similarities of the two algorithms have been highlighted. Results obtained by a theoretical analysis and a simulation campaign show that DAR allows obtaining some important advantages that makes it a valuable candidate to operate in ad hoc networks and the same method helps in the selection of the algorithm parameters. Since the approach aims at minimizing complexity in the nodes at the expenses of the optimality of the solution, it results to be particularly suitable in environments where fast communication establishment and minimum signalling overhead are requested. These requirements are typical of ad hoc networks with critical connectivity, as described in the paper. Thus the performance of the proposed algorithm are shown in ad hoc networks with critical connectivity and compared to some existing ad hoc routing algorithms.

Routing protocols for vehicular Ad Hoc networks in rural areas

Abstract: Research on vehicular ad hoc networks has focused mainly on efficient routing protocol design under conditions where there are relatively large numbers of closely spaced vehicles. These routing protocols are designed principally for urban areas with high node density and fully connected networks and are not suitable for packet delivery in a sparse, partially connected VANET. In this article, we examine the challenges of VANETs in sparse network conditions, review alternatives including epidemic routing, and propose a border node-based routing protocol for partially connected VANETs. The BBR protocol can tolerate network partition due to low node density and high node mobility. The performance of epidemic routing and BBR are evaluated with a geographic and traffic information- based mobility model that captures typical highway conditions. The simulation results show that under rural network conditions, a limited flooding protocol such as BBR performs well and offers the advantage of not relying on a location service required by other protocols proposed for VANETs.

Routing Protocols for Next Generation Networks Inspired by Collective Behaviors of Insect Societies: An Overview

Abstract: In this chapter we discuss the properties and review the main instances of network routing algorithms whose bottom-up design has been inspired by collective behaviors of social insects such as ants and bees. This class of bio-inspired routing algorithms includes a relatively large number of algorithms mostly developed during the last ten years. The characteristics inherited by the biological systems of inspiration almost naturally empower these algorithms with characteristics such as autonomy, self-organization, adaptivity, robustness, and scalability, which are all desirable if not necessary properties to deal with the challenges of current and next-generation networks. In the chapter we consider different classes of wired and wireless networks, and for each class we briefly discuss the characteristics of the main ant- and bee-colony-inspired algorithms which can be found in literature. We point out their distinctive features and discuss their general pros and cons in relationship to the state of the art.

The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes

Abstract: We consider the problem of establishing a route and sending packets between a source/destination pair in ad hoc networks composed of rational selfish nodes whose purpose is to maximize their own utility. In order to motivate nodes to follow the protocol specification, we use side payments that are made to the forwarding nodes. Our goal is to design a fully distributed algorithm such that (1) a node is always better off participating in the protocol execution (individual rationality), (2) a node is always better off behaving according to the protocol specification (truthfulness), (3) messages are routed along the most energy-efficient (least cost) path, and (4) the message complexity is reasonably low. We introduce the COMMIT protocol for individually rational, truthful, and energy-efficient routing in ad hoc networks. To the best of our knowledge, this is the first ad hoc routing protocol with these features. COMMIT is based on the VCG payment scheme in conjunction with a novel game-theoretic technique to achieve truthfulness for the sender node. By means of simulation, we show that the inevitable economic inefficiency is small. As an aside, our work demonstrates the advantage of using a cross-layer approach to solving problems: Leveraging the existence of an underlying topology control protocol, we are able to simplify the design and analysis of our routing protocol and reduce its message complexity. On the other hand, our investigation of the routing problem in the presence of selfish nodes disclosed a new metric under which topology control protocols can be evaluated: the cost of cooperation.

An Optimization Framework for Opportunistic Multipath Routing in Wireless Mesh Networks

Abstract: We consider wireless mesh networks, and exploit the inherent broadcast nature of wireless by making use of multipath routing. We present an optimization framework that enables us to derive optimal flow control, routing, scheduling, and rate adaptation schemes, where we use network coding to ease the routing problem. We prove optimality and derive a primal-dual algorithm that lays the basis for a practical protocol. We use simulation to show on realistic topologies that we can achieve 20-200% throughput improvement compared to single path routing, and several times compared to a recent related opportunistic protocol (MORE).

Practical Coding-Aware Mechanism for Opportunistic Routing in Wireless Mesh Networks

Abstract: Opportunistic routing and network coding have been considered as effective strategies for improving the throughput of wireless mesh networks (WMN) However, most existing work studied opportunistic routing and network coding separately This has largely limited the ability of the above strategies from effectively improving the network performance To achieve improved network throughput, in this paper, we propose a coding-aware opportunistic routing mechanism for WMNs The design goal is achieved by effectively integrating the above two strategies such that decision on each packet forwarding is made with the awareness of potential coding opportunities Simulation results show that our proposed mechanism can remarkably improve the network throughput

Wireless mesh network transit link topology optimization method and system

Abstract: A method and configuration manager generates a routing topology for a wireless mesh network. The wireless mesh network has a plurality of internal nodes, at least one edge node, and at least one originating device. A plurality of potential routing solutions is determined which contain a plurality of paths through the wireless mesh network from the at least one originating device to the at least one edge node such that data communicated from the at least one originating device reaches the at least one edge node in no more than a predetermined number of hops. Each potential routing solution is based on at least one measured wireless communication parameter between internal nodes. Metric calculations for each potential routing solution are computed to determine a preferred routing solution. The wireless mesh network is configured to route traffic using the preferred routing solution.

Link-State Routing with Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering

Abstract: Link-state routing with hop-by-hop forwarding is widely used in the Internet today. The current versions of these protocols, like OSPF, split traffic evenly over shortest paths based on link weights. However, optimizing the link weights for OSPF to the offered traffic is an NP-hard problem, and even the best setting of the weights can deviate significantly from an optimal distribution of the traffic. In this paper, we propose a new link-state routing protocol, PEFT, that splits traffic over multiple paths with an exponential penalty on longer paths. Unlike its predecessor, DEFT, our new protocol provably achieves optimal traffic engineering while retaining the simplicity of hop-by-hop forwarding. A gain of 15 % in capacity utilization over OSPF is demonstrated using the Abilene topology and traffic traces. The new protocol also leads to significant reduction in the time needed to compute the best link weights. Both the protocol and the computational methods are developed in a new conceptual framework, called network entropy maximization, which is used to identify the traffic distributions that are not only optimal but also realizable by link-state routing.

DTN Routing in Vehicular Sensor Networks

Abstract: Currently, vehicular sensor network (VSN) has been paid much attention for monitoring the physical world of urban areas. We have studied VSNs by utilizing about 4000 taxies and 1000 buses equipped with GPS-based mobile sensors in Shanghai to constitute a virtual vehicular sensor network. The communication-connection intermittence makes the routing issue nontrivial when delay-tolerant applications are deployed in VSNs. The existing DTN routing protocols can be categorized as "neighbor-oriented" and how to select a neighbor candidate was always neglected. In this paper, we present a new DTN routing protocol for Delay-Tolerant Vehicular Sensor Networks, Packet-Oriented Routing protocol (POR), which is designed to emphasize neighbor selection based on awareness of packets to be sent and in consideration of probability to complete transferring of these packets. Our results show that POR performs much better than the ordinary Epidemic routing, as well as other popular routing protocols applied in a similar setting.

Routing in Large-Scale Buses Ad Hoc Networks

Abstract: A disruption-tolerant network (DTN) attempts to route packets between nodes that are temporarily connected. Difficulty in such networks is that nodes have no information about the network status and contact opportunities. The situation is different in public bus networks because the movement of buses exhibits some regularity so that routing in a deterministic way is possible. Many algorithms use a contacts oracle that provides the exact meeting times and durations between all nodes. However, in a real vehicular environment, an oracle is not always accurate, and deterministic routing gives poor results. In this paper, we present BLER, a routing algorithm that achieves effective routing in a buses environment. BLER, compared to other algorithms, performs routing at bus line level instead of bus level; it uses specific bus lines information to achieve good performances. We evaluate BLER on real traces of the bus network of Shanghai, and compare it to other routing algorithms. Performances provide good results for this kind of DTNs.

Adaptive Routing Protocol with Energy Efficiency and Event Clustering for Wireless Sensor Networks

Abstract: Wireless sensor network (WSN) is a promising approach for a variety of applications. Routing protocol for WSNs is very challenging because it should be simple, scalable, energy-efficient, and robust to deal with a very large number of nodes, and also self-configurable to node failures and changes of the network topology dynamically. Recently, many researchers have focused on developing hierarchical protocols for WSNs. However, most protocols in the literatures cannot scale well to large sensor networks and difficult to apply in the real applications. In this paper, we propose a novel adaptive routing protocol for WSNs called ARPEES. The main design features of the proposed method are: energy efficiency, dynamic event clustering, and multi-hop relay considering the trade-off relationship between the residual energy available of relay nodes and distance from the relay node to the base station. With a distributed and light overhead traffic approach, we spread energy consumption required for aggregating data and relaying them to different sensor nodes to prolong the lifetime of the whole network. In this method, we consider energy and distance as the parameters in the proposed function to select relay nodes and finally select the optimal path among cluster heads, relay nodes and the base station. The simulation results show that our routing protocol achieves better performance than other previous routing protocols.

A General Interference-Aware Framework for Joint Routing and Link Scheduling in Wireless Mesh Networks

Abstract: Joint design and optimization of traditionally independent problems such as routing and link scheduling have recently become one of the leading research trends in wireless mesh networks. Although technically challenging, cross-layering is, in fact, expected to bring significant benefits from the network resource exploitation standpoint to achieve high system utilization. In this article we propose a versatile framework for joint design of routing and link scheduling, introducing the notion of link activation constraints, which are related to the transceiver capability and the broadcast nature of the wireless medium. To this end, we introduce a taxonomy of wireless interference models to harmonize existing approaches presented in the literature. Finally, we evaluate the impact on network capacity of the various interference models when optimal joint routing and link scheduling are employed.

Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks

Abstract: One possibility direction to assist routing in Mobile Ad Hoc Network (MANET) is to use geographical location information provided by positioning devices such as global positioning systems (GPS). Instead of searching the route in the entire network blindly, position-based routing protocol uses the location information of mobile nodes to confine the route searching space into a smaller estimated range. The smaller route searching space to be searched, the less routing overhead and broadcast storm problem will occur. In this paper, we proposed a location-based routing protocol called LARDAR. There are three important characteristics be used in our protocol to improve the performance. Firstly, we use the location information of destination node to predict a smaller triangle or rectangle request zone that covers the position of destination in the past. The smaller route discovery space reduces the traffic of route request and the probability of collision. Secondly, in order to adapt the precision of the estimated request zone, and reduce the searching range, we applied a dynamic adaptation of request zone technique to trigger intermediate nodes using the location information of destination node to redefine a more precise request zone. Finally, an increasing-exclusive search approach is used to redo route discovery by a progressive increasing search angle basis when route discovery failed. This progressive increased request zone and exclusive search method is helpful to reduce routing overhead. It guarantees that the areas of route rediscovery will never exceed twice the entire network. Simulation results show that LARDAR has lower routing cost and collision than other protocols.

Design of a QoS-Aware Routing Mechanism for Wireless Multimedia Sensor Networks

Abstract: In wireless sensor networks, majority of routing protocols considered energy efficiency as the main objective and assumed data traffic with unconstrained delivery requirements. However, the introduction of image and video sensors demands certain quality of service (QoS) from the routing protocols and underlying networks. Managing real-time data requires both energy efficiency and QoS assurance in order to ensure efficient usage of sensor resources and correctness of the collected information. In this paper, we present a novel QoS-aware routing protocol to support high data rate for wireless multimedia sensor networks. Being multi-channel multi-path the foundation, the routing decision is made according to the dynamic adjustment of the required bandwidth and path-length-based proportional delay differentiation for real-time data. The proposed protocol works in a distributed manner to ensure bandwidth and end- to-end delay requirements of real-time data. At the same time, the throughput of non-real-time data is maximized by adjusting the service rate of real-time and non-real-time data. Results evaluated in simulation demonstrate a significant performance improvement in terms of average delay, average lifetime and network throughput.

A Reputation-Based Metric for Secure Routing in Wireless Mesh Networks

Abstract: The continuous growth of wireless networks calls for more and more sophisticated solutions for their security. In particular, mechanisms for limiting effects of routing protocol attacks are becoming a mandatory requirement: black-hole and gray-hole attacks can in fact seriously compromise the performance of a critical infrastructure like a Wireless Mesh Network. In this paper we present a new routing metric aimed at mitigating the effects of such attacks, based on an estimation of the trustworthiness level of network nodes. By applying the metric to existing wireless routing protocols we show that it is possible to increase both the security level and the performance of the overall network, even in the presence of routing attacks.