scispace - formally typeset
Search or ask a question
Topic

Hazy Sighted Link State Routing Protocol

About: Hazy Sighted Link State Routing Protocol is a research topic. Over the lifetime, 6936 publications have been published within this topic receiving 169377 citations. The topic is also known as: HSLS.


Papers
More filters
Proceedings ArticleDOI
16 Apr 2007
TL;DR: A novel technique for reducing the total hardware cost of routing tables for both source and distributed routing approaches is presented, based on applying a fixed routing function combined with minimal deviation tables that are used only when the routing decisions for a given destination deviate from the predefined routing function.
Abstract: The majority of current Network on Chip (NoC) architectures employ mesh topology and use simple static routing, to reduce power and area. However, regular mesh topology is unrealistic due to variations in module sizes and shapes, and is not suitable for application-specific NoCs. Consequently, simplistic routing techniques such as XY routing are inadequate, raising the need for low cost alternatives which can work in irregular mesh networks. In this paper we present a novel technique for reducing the total hardware cost of routing tables for both source and distributed routing approaches. The proposed technique is based on applying a fixed routing function combined with minimal deviation tables that are used only when the routing decisions for a given destination deviate from the predefined routing function. We apply this methodology to compare three hardware efficient routing methods for irregular mesh topology NoCs. For each method, we develop path selection algorithms that minimize the overall cost of routing tables. Finally, we demonstrate by simulations on random and specific real application network instances a significant cost saving compared to standard solutions, and examine the scaling of cost savings with growing NoC size.1

65 citations

Journal ArticleDOI
Yuhuai Peng1, Yao Yu1, Lei Guo1, Dingde Jiang1, Qiming Gai1 
TL;DR: This paper proposes a novel cross-layer QoS-aware routing protocol on OLSR (CLQ-OLSR) to support real-time multimedia communication by efficiently exploiting multi-radio and multi-channel method and demonstrates that the network aggregate throughput can almost be improved by 300% compared with the single radio case.

65 citations

Journal ArticleDOI
01 Sep 2012
TL;DR: A Grid-based Multipath with Congestion Avoidance Routing protocol (GMCAR) is proposed as an efficient QoS routing protocol that is suited for grided sensor networks and shows its superiority in achieving better utilization to the available storage.
Abstract: Recently, the interest in wireless sensor networks has been magnetized in the delay sensitive applications such as real-time applications. These time critical applications crave certain QoS requirements as though end-to-end delay guarantee and network bandwidth reservation. However, the severe resource constraints of the wireless sensor networks pose great challenges that hinder supporting these requirements. In this paper, we propose a Grid-based Multipath with Congestion Avoidance Routing protocol (GMCAR) as an efficient QoS routing protocol that is suited for grided sensor networks. We employ the idea of dividing the sensor network field into grids. Inside each grid, one of the sensor nodes is selected as a master node which is responsible for delivering the data generated by any node in that grid and for routing the data received from other master nodes in the neighbor grids. For each master node, multiple diagonal paths that connect the master node to the sink are stored as routing entries in the routing table of that node. The novelty of the proposed protocol lies behind the idea of incorporating the grids densities along with the hop count into the routing decisions. A congestion control mechanism is proposed in order to relieve the congested areas in case of congestion occurrence. Simulation results show that our proposed protocol has the potential to achieve up to 19.5% energy saving, 24.7% reduction in the delay and up to 8.5% enhancement in the network throughput when compared to another QoS routing protocol. However, when compared to the basic grid-based coordinated routing protocol, it achieves 23% energy saving. In addition, the proposed protocol shows its superiority in achieving better utilization to the available storage.

65 citations

Journal ArticleDOI
01 Jul 2006
TL;DR: A new geographic routing algorithm that forwards packets from sensors to base stations along efficient routes and replaces the right-hand rule by distance upgrading is proposed, which is fully distributed and responds to topology changes instantly with localised operations.
Abstract: Wireless sensor networks have attracted great attention in research and industrial development due to their fast-growing application potentials. New techniques must be developed for sensor networks due to their lack of infrastructure support and the constraints on computation capability, memory space, communication bandwidth and above all, energy supply. To prolong the life time of a battery-powered sensor network, an energy efficient routing algorithm for data collection is essential. We propose a new geographic routing algorithm that forwards packets from sensors to base stations along efficient routes. The algorithm eliminates the voids that cause non-optimal routing paths in geographic routing. It replaces the right-hand rule by distance upgrading. It is fully distributed and responds to topology changes instantly with localised operations. We formally prove the correctness of the algorithm and evaluate its performance by simulations.

65 citations

Proceedings ArticleDOI
13 Oct 2003
TL;DR: It is demonstrated that existing ad hoc routing protocols are vulnerable to passive attacks, and it is concluded that ad hoc networks deployed in hostile environments need new countermeasures to resist such passive attacks.
Abstract: In hostile environments, adversaries can launch passive attacks against interceptable routing information embedded in routing messages and data packets. Allowing adversaries to trace network routes and infer the motion pattern of nodes at the end of those routes may pose a serious threat to covert operations. In this paper we propose a feasible adversary model of such attacks, then present several instantiations and study the principles of designing corresponding countermeasures. We demonstrate that existing ad hoc routing protocols are vulnerable to passive attacks: in the feasible adversary model, (a) the location and motion patterns of mobile nodes can be traced, while (b) proactive and reactive/on-demand ad hoc routes across multiple mobile nodes can be visualized by the adversary. We conclude that ad hoc networks deployed in hostile environments need new countermeasures to resist such passive attacks.

65 citations

Network Information
Related Topics (5)
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
93% related
Wireless ad hoc network
49K papers, 1.1M citations
93% related
Network packet
159.7K papers, 2.2M citations
92% related
Wireless sensor network
142K papers, 2.4M citations
92% related
Wireless network
122.5K papers, 2.1M citations
92% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20236
202210
20211
20193
201822
2017264