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.

Self-timed mesh routing chip with data broadcasting

Abstract: A method and apparatus providing for data broadcasting in a two dimensional mesh of processor nodes is disclosed. In accordance with the present invention, a self-timed message routing chip is coupled to each processor node, thereby forming a two dimensional mesh of message routing chips. Broadcasting originates from a corner node, and data can broadcast through the mesh routing chips to a row, a column, or a matrix of nodes. The mesh routing chips, together, form a self-timed pipeline with each individual message routing chip having broadcasting hardware which provides for the forking of a message within that particular message routing chip. The self-timed forking of a message within individual message routing chips directly supports data broadcasting within the two dimensional mesh.

A Review on Hierarchical Routing Protocols for Wireless Sensor Networks

Abstract: The routing protocol for Wireless Sensor Networks (WSNs) is defined as the manner of data dissemination from the network field (source) to the base station (destination). Based on the network topology, there are two types of routing protocols in WSNs, they are namely flat routing protocols and hierarchical routing protocols. Hierarchical routing protocols (HRPs) are more energy efficient and scalable compared to flat routing protocols. This paper discusses how topology management and network application influence the performance of cluster-based and chain-based hierarchical networks. It reviews the basic features of sensor connectivity issues such as power control in topology set-up, sleep/idle pairing and data transmission control that are used in five common HRPs, and it also examines their impact on the protocol performance. A good picture of their respective performances give an indication how network applications, i.e whether reactive or proactive, and topology management i.e. whether centralized or distributed would determine the network performance. Finally, from the ensuring discussion, it is shown that the chain-based HRPs guarantee a longer network lifetime compared to cluster-based HRPs by three to five times.

QoS routing based on multi-class nodes for mobile ad hoc networks

Abstract: In this paper, we present a new quality of service (QoS) routing protocol for mobile ad hoc networks (MANETs). Most of the existing routing protocols assume homogeneous nodes in MANETs, i.e., all nodes have the same communication capabilities and characteristics. However, in many ad hoc networks, nodes are not the same. Some nodes have longer transmission range, larger transmission bandwidth, and are more reliable and robust than other nodes. We take advantage of the non-homogeneous property to design more efficient QoS routing protocol. And node location information is used to aid routing. We also develop a new algorithm to calculate end-to-end bandwidth for a given path. Our QoS routing protocol contains end-to-end bandwidth calculation and bandwidth reservation. QoS route is discovered and setup only when it is needed. Extensive simulation studies demonstrate the good performance of the QoS routing protocol.

Longevity of routes in mobile ad hoc networks

Abstract: An ad hoc network is a collection of mobile nodes where communication takes place through the wireless medium and in the absence of any fixed infrastructure. Direct communication is only possible between neighboring nodes and hence multi hop communication becomes necessary for distant nodes. It is essential that a routing protocol is used by a source node to discover a route to the destination node so that it can successfully transmit its message via the intermediate nodes. The lifetime of a particular route is dependent on the speed and direction of movement of all the nodes involved in the route. In this paper, we investigate the expected lifetime of a route so that the route discovery protocol can be invoked at the right time without disrupting the communication. We argue that if the movement pattern of the nodes is absolutely deterministic then the lifetime of a route can be determined exactly. On the other hand, a chaotic mobility pattern will bring in uncertainty to the lifetime of the route. We calculate the expected lifetime for different mobility models.

Digital Signature-Based Secure Node Disjoint Multipath Routing Protocol for Wireless Sensor Networks

Abstract: The objective of energy efficient routing protocol is to increase the operational lifetime of the wireless sensor networks Multipath routing protocols enhance the lifetime of the wireless sensor networks by distributing traffic among multiple paths instead of a single optimal path Transmission of secured data is also an important research concern in the wireless sensor networks In this paper, a secure node disjoint multipath routing protocol for wireless sensor networks is proposed Here, the data packets are transmitted in a secure manner by using the digital signature crypto system It is compared with an ad hoc on-demand multipath distance vector routing protocol It shows better results in terms of packet delivery fraction, energy consumption, and end-to-end delay compared to the ad hoc on-demand multipath distance vector routing