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.

Joint routing and link rate allocation under bandwidth and energy constraints in sensor networks

Abstract: In sensor networks, both energy and bandwidth are scarce resources. In the past, many energy efficient routing algorithms have been devised in order to maximize network lifetime, in which wireless link bandwidth has been optimistically assumed to be sufficient. This article shows that ignoring the bandwidth constraint can lead to infeasible routing solutions. As energy constraint affects how data should be routed, link bandwidth also affects not only the routing topology but also the allowed data rate on each link. In this paper, we discuss the sufficient condition on link bandwidth that makes a routing solution feasible, then provide mathematical optimization models to tackle both energy and bandwidth constraints.We first present a basic mathematical model to address using uniform transmission power for routing without data aggregation, then extend it to handle nonuniform transmission power, and then routing with data aggregation. We propose two efficient heuristics to compute the routing topology and link data rate. Simulation results show that these heuristics provide more feasible routing solutions than previous work, and provide significant improvement on throughput and lifetime.

Communicating data frames across communication networks that use incompatible network routing protocols

Abstract: A communication method operates to seamlessly transmit internet protocol (IP) data frames, such as IPv6 data frames, over a communication network that uses a non-IP network routing protocol, i.e., a communication network that implements a network routing protocol other than, or that is incompatible with an IP network routing protocol, such as the WirelessHART protocol. This communication method enables, for example, field devices or other intelligent devices within a process plant network that uses a non-IP communication network to perform messaging of IP data frames generated at or to be received by internet protocol enabled devices either within the process plant network or outside of the process plant network.

Low latency and energy efficient routing protocols for wireless sensor networks

Abstract: Wireless sensor network (WSN) consists of tiny sensor nodes with sensing, computation and wireless communication capabilities. Now a days, it is finding wide applicability and increasing deployment, as it enables reliable monitoring and analysis of environment. The design of routing protocols for WSN is influenced by many challenging factors like fault tolerance, energy efficiency, scalability, latency, power consumption and network topology. In this paper, we mainly focus on minimizing end to end latency and energy efficiency as primary design objectives of routing protocols for WSN without overshadowing the other design factors. We present a survey of low latency, energy efficient and time critical routing protocols. TEEN (Threshold - sensitive Energy Efficient sensor Network protocol), a reactive network protocol which is well suited for time critical data sensing applications is quite efficient in terms of energy consumption and response time. APTEEN (Adaptive Periodic Threshold - sensitive Energy Efficient sensor Network protocol), a hybrid network protocol which gives the overall picture of the network at periodic intervals in a very energy efficient manner. SPEED is a Stateless, highly efficient and scalable protocol for sensor networks which achieves end to end soft real time communication by maintaining a desired delivery speed across the network through a novel combination of feedback control and non deterministic geographic forwarding. RAP, a real - time communication architecture for large scale sensor networks which significantly reduces the end to end latency by using Velocity - Monotonic Scheduling (VMS). RPAR, Real - Time Power Aware Routing Protocol which supports energy efficient real - time communication by dynamically adapting transmission power and routing decisions. We also discuss the advantages and performance issues of each routing protocol.

Energy efficient routing in wireless ad hoc networks

Abstract: Ad hoc wireless networks are power constrained since nodes operate with limited battery energy Thus, energy consumption is crucial in the design of new ad hoc routing protocols To design such protocols, we have to look away from the traditional minimum, hop routing schemes In this, paper, we propose three extensions to the state-of-the-art shortest-cost routing algorithm, AODV The discovery mechanism in these extensions (LEAR-AODV, PAR-AODV, and LPR-AODV) uses energy consumption as a routing metric They reduce the energy consumption of the nodes by routing packets to their destination using energy-optimal routes We show that these algorithms improve the network survivability by maintaining the network connectivity They carry out this objective with low overhead and without affecting the other wireless network protocol layers

Intersection-Based Routing Protocol for VANETs

Abstract: Vehicular ad hoc network (VANET) is an emerging wireless communications technology that is capable of enhancing driving safety and velocity by exchanging real-time transportation information. In VANETs, the carry-and-forward strategy has been adopted to overcome uneven distribution of vehicles. If the next vehicle located is in transmission range, then the vehicle forwards the packets; if not, then it carries the packets until meeting. The carry mostly occurs on sparsely populated road segments, with long carry distances having long end-to-end packet delays. Similarly, the dense condition could have long delays, due to queuing delays. The proposed intersection-based routing protocol finds a minimum delay routing path in various vehicle densities. Moreover, vehicles reroute each packet according to real-time road conditions in each intersection, and the packet routing at the intersections is dependent on the moving direction of the next vehicle. Finally, the simulation results show that the proposed Intersection-Based Routing (IBR) protocol has less end-to-end delay compared to vehicle-assisted data delivery (VADD) and greedy traffic aware routing protocol (GyTAR) protcols.