scispace - formally typeset
Search or ask a question
Topic

Static routing

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


Papers
More filters
Journal ArticleDOI
24 Mar 2011-Sensors
TL;DR: Insight is provided into routing protocols designed specifically for large-scale WSNs based on the hierarchical structure and a comparison of each routing protocol is conducted to demonstrate the differences between the protocols.
Abstract: With the advances in micro-electronics, wireless sensor devices have been made much smaller and more integrated, and large-scale wireless sensor networks (WSNs) based the cooperation among the significant amount of nodes have become a hot topic. “Large-scale” means mainly large area or high density of a network. Accordingly the routing protocols must scale well to the network scope extension and node density increases. A sensor node is normally energy-limited and cannot be recharged, and thus its energy consumption has a quite significant effect on the scalability of the protocol. To the best of our knowledge, currently the mainstream methods to solve the energy problem in large-scale WSNs are the hierarchical routing protocols. In a hierarchical routing protocol, all the nodes are divided into several groups with different assignment levels. The nodes within the high level are responsible for data aggregation and management work, and the low level nodes for sensing their surroundings and collecting information. The hierarchical routing protocols are proved to be more energy-efficient than flat ones in which all the nodes play the same role, especially in terms of the data aggregation and the flooding of the control packets. With focus on the hierarchical structure, in this paper we provide an insight into routing protocols designed specifically for large-scale WSNs. According to the different objectives, the protocols are generally classified based on different criteria such as control overhead reduction, energy consumption mitigation and energy balance. In order to gain a comprehensive understanding of each protocol, we highlight their innovative ideas, describe the underlying principles in detail and analyze their advantages and disadvantages. Moreover a comparison of each routing protocol is conducted to demonstrate the differences between the protocols in terms of message complexity, memory requirements, localization, data aggregation, clustering manner and other metrics. Finally some open issues in routing protocol design in large-scale wireless sensor networks and conclusions are proposed.

161 citations

Journal ArticleDOI
16 May 2011
TL;DR: The results indicate that a combination of multipath routing and the backpressure-based packet-scheduling scheme can show a significant improvement in the network reliability, latency, and throughput performance.
Abstract: It is envisioned that one of the most important issues in smart grid will be to design a network architecture that is capable of providing secure and reliable two-way communication from meters to other Smart Grid domains. While networking technologies and systems have been greatly enhanced, in wireless communication environments the smart grid faces new challenges in terms of reliability and efficiency. In this paper we present a multigate mesh network architecture to handle real-time traffic for the last mile communication. The paper consists of three parts; multigate routing, real-time traffic scheduling, and multichannel (MC) aided wireless mesh routing. The multigate routing is based on a flexible mesh network architecture that expands on the hybrid tree routing of the IEEE 802.11s. The network is specifically designed to operate in a multi gateway structure in order to meet the smart grid requirements in terms of reliability, self-healing, and throughput performance. This includes developing a timer-based multiple-path diversity scheme that takes advantage of the multi gateway network structure. With respect to packet scheduling, we introduce a novel and efficient scheme that is capable of balancing the traffic load among multiple gateways. The proposed scheme, which is based on the backpressure concept due to its simplicity, is suitable for practical implementation. We also present an MC aided wireless mesh routing protocol which is specifically designed for multigate smart grid networks. The results indicate that a combination of multipath routing and the backpressure-based packet-scheduling scheme can show a significant improvement in the network reliability, latency, and throughput performance. We also show an improvement in the order of magnitude can be achieved via the proposed multichannel aided routing protocol.

160 citations

Patent
Richard Crump1
17 Jan 2002
TL;DR: In this paper, the control plane is split into box management control functions and routing control functions, and the routing table is also distributed across multiple processing cards, including a high-speed backplane bus for control plane traffic and a fabric for forwarding plane traffic.
Abstract: An information routing system and apparatus includes separate control and forwarding planes The control plane is split into box management control functions and routing control functions The box management control functions are isolated to a single processing card, while the routing control functions are distributed across multiple processing cards The routing table is also distributed across multiple processing cards The multiple processing cards are interconnected via a high-speed backplane bus for control plane traffic and by a fabric for forwarding plane traffic

160 citations

Proceedings ArticleDOI
18 Jan 2005
TL;DR: This paper proposes the first routing algorithm that considers feasibility of redundant via insertion in the detailed routing stage, and transforms the routing problem to a multiple constraint shortest path problem, and solved by Lagrangian relaxation technique.
Abstract: Redundant via insertion is a good solution to reduce the yield loss by via failure. However, the existing methods are all post-layout optimizations that insert redundant via after detailed routing. In this paper, we propose the first routing algorithm that considers feasibility of redundant via insertion in the detailed routing stage. Our routing problem is formulated as maze routing with redundant via constraints. The problem is transformed to a multiple constraint shortest path problem, and solved by Lagrangian relaxation technique. Experimental results show that our algorithm can find routing layout with much higher rate of redundant via than conventional maze routing.

159 citations

Journal ArticleDOI
TL;DR: This paper presents a comprehensive survey of recent social-aware routing protocols, which offer an insight into how to utilize social relationships to design efficient and applicable routing algorithms in DTNs.
Abstract: In the past few years, more and more researchers have paid close attention to the emerging field of delay tolerant networks (DTNs), in which network often partitions and end-to-end paths do not exist nearly all the time. To cope with these challenges, most routing protocols employ the "store-carry-forward" strategy to transmit messages. However, the difficulty of this strategy is how to choose the best relay node and determine the best time to forward messages. Fortunately, social relations among nodes can be used to address these problems. In this paper, we present a comprehensive survey of recent social-aware routing protocols, which offer an insight into how to utilize social relationships to design efficient and applicable routing algorithms in DTNs. First, we review the major practical applications of DTNs. Then, we focus on understanding social ties between nodes and investigating some design-related issues of social-based routing approaches, e.g., the ways to obtain social relations among nodes, the metrics and approaches to identify the characteristics of social ties, the strategies to optimize social-aware routing protocols, and the suitable mobility traces to evaluate these protocols. We also create a taxonomy for social-aware routing protocols according to the sources of social relations. Finally, we outline several open issues and research challenges.

159 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
95% related
Wireless network
122.5K papers, 2.1M citations
93% related
Wireless ad hoc network
49K papers, 1.1M citations
93% related
Wireless sensor network
142K papers, 2.4M citations
93% related
Server
79.5K papers, 1.4M citations
92% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202391
2022209
202130
202035
201962
2018132