Static routing

About: Static routing is a research topic. Over the lifetime, 25733 publications have been published within this topic receiving 576732 citations.

MAP: medial axis based geometric routing in sensor networks

Abstract: One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication Important consideration includes scalability, routing complexity, the length of the communication paths and the load sharing of the routes In this paper, we show that a compact and expressive abstraction of network connectivity by the medial axis enables efficient and localized routing We propose MAP, a Medial Axis based naming and routing Protocol that does not require locations, makes routing decisions locally, and achieves good load balancing In its preprocessing phase, MAP constructs the medial axis of the sensor field, defined as the set of nodes with at least two closest boundary nodes The medial axis of the network captures both the complex geometry and non-trivial topology of the sensor field It can be represented compactly by a graph whose size is comparable with the complexity of the geometric features (eg, the number of holes) Each node is then given a name related to its position with respect to the medial axis The routing scheme is derived through local decisions based on the names of the source and destination nodes and guarantees delivery with reasonable and natural routes We show by both theoretical analysis and simulations that our medial axis based geometric routing scheme is scalable, produces short routes, achieves excellent load balancing, and is very robust to variations in the network model

Local coordination based routing and spectrum assignment in multi-hop cognitive radio networks

Abstract: Although Cognitive Radio technology brings efficient spectrum usage and effective interference avoidance, it also brings new challenges to routing in multi-hop Cognitive Radio Networks. Firstly, spectrum assignment is required for each hop in routing; secondly, new delay is introduced during multi-frequency scheduling and frequency switching in each node; thirdly, the intersecting nodes serving multi-frequency traffic is easy to be bottleneck in neighborhood region. In this paper, we analysis and model the pernode delay and the path delay in multi-hop Cognitive Radio Network. Then we propose a framework of local coordination based routing and spectrum assignment to solve above problems, which consists of one protocol for routing path and one scheme for neighborhood region. A on-demand Routing and Spectrum Assignment Protocol is proposed to exchange the local spectrum information and interact with multi-frequency scheduling in each node. A local coordination scheme is presented to support flow redirection at an intersecting node and distribute heavy multi-frequency workload to its neighborhood. We prove the correctness and effectiveness of the protocol by thorough simulations, and find that the proposed solution provides good adaptability to varying spectrum distribution. The end-to-end delay when adaptive relay is cooperating with routing protocol outperforms traditional bare-routing solutions.

Beacon-less geographic routing made practical: challenges, design guidelines, and protocols

Abstract: Geographic routing has emerged as one of the most efficient and scalable routing solutions for wireless sensor networks. In traditional geographic routing protocols, each node exchanges periodic one-hop beacons to determine the position of its neighbors. Recent studies proved that these beacons can create severe problems in real deployments due to the highly dynamic and error-prone nature of wireless links. To avoid these problems, new variants of geographic routing protocols that do not require beacons are being proposed. In this article we review some of the latest proposals in the field of beacon-less geographic routing and introduce the main design challenges and alternatives. In addition, we perform an empirical study to assess the performance of beacon-based and beacon-less routing protocols using a real WSN deployment.

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.