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.

LSGO: Link State aware Geographic Opportunistic routing protocol for VANETs

Abstract: Robust and efficient data delivery in vehicular ad hoc networks (VANETs) with high mobility is a challenging issue due to dynamic topology changes and unstable wireless links. The opportunistic routing protocols can improve the reliability of routing by making full use of the broadcast characteristics and assist in data transmission through additional backup links. In this paper, we propose a Link State aware Geographic Opportunistic routing protocol (LSGO) which exploits a combination of geographic location and the link state information as the routing metric. The LSGO aims to improve the reliability of data transmission in a highly dynamic environment, which selects the forwarders and prioritizes them based on the vehicle’s geographic location and the link’s quality. We compare the performance of LSGO with GpsrJ + which removes the unnecessary stop at a junction and greedy traffic aware routing protocol (GyTAR) using network simulator ns-2. The simulation results show that it opens more nodes to participate in the opportunistic data forwarding and increases a connection’s throughput while using no more network capacity than traditional routing. In the simulation, compared with other two protocols, when the number of vehicles and the average vehicle velocity increase, LSGO’s packet dropping rate is reduced and the network throughput is improved.

Intercontact Routing for Energy Constrained Disaster Response Networks

Abstract: This paper presents a novel multicopy routing protocol for disruption-tolerant networks whose objective is to minimize energy expended on communication. The protocol is designed for disaster-response applications, where power and infrastructure resources are disrupted. Unlike other delay-tolerant networks, energy is a vital resource in post disaster scenarios to ensure availability of (disruption-tolerant) communication until infrastructure is restored. Our approach exploits naturally recurrent mobility and contact patterns in the network, formed by rescue workers, volunteers, survivors, and their (possibly stranded) vehicles to reduce the number of message copies needed to attain an adequate delivery ratio in the face of disconnection and intermittent connectivity. A new notion of intercontact routing is proposed that allows estimating route delays and delivery probabilities, identifying more reliable routes and controlling message replication and forwarding accordingly. In addition, we augment the protocol with a differentiated message delivery service that enables the network to function even in an extremely low energy condition. We simulate the scheme using a mobility model that reflects recurrence inspired by disaster scenarios and compare our results to previous DTN routing techniques. The evaluation shows that the new approach reduces the resource overhead per message over previous approaches while maintaining a comparable delivery ratio at the expense of a small (bounded) increase in latency.

EHRP: Enhanced hierarchical routing protocol for zigbee mesh networks ee

Abstract: This letter proposes the enhanced hierarchical routing protocol (EHRP) for ZigBee mesh networks. The EHRP finds the shortest hierarchical path based on the ZigBee hierarchical addressing scheme. The EHRP provides efficient and reliable routing paths. In addition, the EHRP is completely compatible with ZigBee v.1.0 standard. Simulation results demonstrate that the EHRP reduces routing overhead and route discovery delay of ZigBee mesh networks significantly compared with the hierarchical routing protocol (HRP) defined in ZigBee v1.0.

Deadlock-free routing and component placement for irregular mesh-based networks-on-chip

Abstract: Routing is one of the most crucial key factors which decides over the success of NoC architecture based systems or their failure. This paper uses well known principles from parallel computer architecture to develop a deadlock free highly adaptive routing algorithm for a 2D-mesh based network-on-chip (NoC) architecture including oversized IP cores. The paper consists of a short introduction into related routing theories and then gives a detailed description of the developed routing scheme. The last part is dedicated to a new floorplanning method, which allows to generate high density layouts suitable for the presented routing algorithm.

Interference-aware routing in multihop wireless networks using directional antennas

Abstract: Recent research has shown that interference can make a significant impact on the performance of multihop wireless networks. Researchers have studied interference-aware topology control recently [M. Burkhart et al., 2004]. In this paper, we study routing problems in a multihop wireless network using directional antennas with dynamic traffic. We present new definitions of link and path interference that are suitable for designing better routing algorithms. We then formulate and optimally solve two power constrained minimum interference single path routing problems. Routing along paths found by our interference-aware algorithms tends to have less channel collisions and higher network throughput. Our simulation results show that, compared with the minimum power path routing algorithm, our algorithms can reduce average path interference by 40% or more at the cost of a minor power increase. We also extend our work towards survivable routing by formulating and solving the power constrained minimum interference node-disjoint path routing problem.