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.

Predictive caching strategy for on-demand routing protocols in wireless ad hoc networks

Abstract: Route caching strategy is important in on-demand routing protocols in wireless ad hoc networks. While high routing overhead usually has a significant performance impact in low bandwidth wireless networks, a good route caching strategy can reduce routing overheads by making use of the available route information more efficiently. In this paper, we first study the effects of two cache schemes, "link cache" and "path cache", on the performance of on-demand routing protocols through simulations based on the Dynamic Source Routing (DSR) protocol. Since the "path cache" DSR has been extensively studied, we focus in this paper on the "link cache" DSR in combination with timer-based stale link expiry mechanisms. The effects of different link lifetime values on the performance of routing protocol in terms of routing overhead, packet delivery ratio and packet latency are investigated. A caching strategy incorporating adaptive link timeout is then proposed, which aims at tracking the "optimal" link lifetime under various node mobility levels by adaptively adjusting the link lifetime based on the real link lifetime statistics. The performance of the proposed strategy is then compared with the conventional "path cache" DSR. The results show that without a timeout mechanism, a link cache scheme may suffer severe performance degradation due to the use of broken routes, while the proposed adaptive "link cache" strategy achieves significantly improved performance by reducing the routing overhead when the network traffic load is high.

An adaptive learning routing protocol for the prevention of distributed denial of service attacks in wireless mesh networks

Abstract: Wireless Mesh Networks (WMNs) have potentially unlimited applications in the future. Therefore, establishing a viable and secure wireless network routing protocol for these networks is essential. Currently, these networks are being used in connecting large sections of cities by setting up wireless routers at strategic points all around the city. These networks can also support connecting remote areas of the country, instead of having to lay a cable all the way. The nature of applications mentioned above make these networks prone to different attacks. Thus, security of these networks is a serious concern. In this paper, we study the impact of Distributed Denial of Service (DDoS) attacks on WMNs. We base our work on the existing Optimized Link State Routing protocol (OLSR) and we weave in concepts of Learning Automata (LA) to protect the network from this kind of attack. The simulation results for the proposed scheme show that the proposed protocol is effective in the prevention of DDoS attacks in WMNs.

Method for routing ad-hoc signals

Abstract: An ad-hoc network is a typically a dynamic collection of nodes capable of communicating therebetween without the aid of pre-established infrastructure. Ad-hoc networks differ from traditional networks in that the topology of interconnections between nodes is inherently dynamic and not fixed. Generally, the routing protocols belong to two groups: proactive and reactive. Proactive protocols attempt to maintain correct and up-to-date routing information at every node. Reactive protocols, in turn, collect necessary routing information only if a pair of nodes are to establish a communication. In accordance with embodiments of the invention a reactive ad-hoc network protocol is disclosed that uses controlled flooding to broadcast packets of information within the ad-hoc network. Furthermore, the ad-hoc network protocol does not maintain up-to-date routing information at every node in an ad-hoc network and does not utilize specific control messages to assure that packets within the ad-hoc network follow optimal paths.

Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks

Abstract: One possibility direction to assist routing in Mobile Ad Hoc Network (MANET) is to use geographical location information provided by positioning devices such as global positioning systems (GPS). Instead of searching the route in the entire network blindly, position-based routing protocol uses the location information of mobile nodes to confine the route searching space into a smaller estimated range. The smaller route searching space to be searched, the less routing overhead and broadcast storm problem will occur. In this paper, we proposed a location-based routing protocol called LARDAR. There are three important characteristics be used in our protocol to improve the performance. Firstly, we use the location information of destination node to predict a smaller triangle or rectangle request zone that covers the position of destination in the past. The smaller route discovery space reduces the traffic of route request and the probability of collision. Secondly, in order to adapt the precision of the estimated request zone, and reduce the searching range, we applied a dynamic adaptation of request zone technique to trigger intermediate nodes using the location information of destination node to redefine a more precise request zone. Finally, an increasing-exclusive search approach is used to redo route discovery by a progressive increasing search angle basis when route discovery failed. This progressive increased request zone and exclusive search method is helpful to reduce routing overhead. It guarantees that the areas of route rediscovery will never exceed twice the entire network. Simulation results show that LARDAR has lower routing cost and collision than other protocols.

Elective participation in ad hoc networks based on energy consumption

Abstract: In ad hoc networks, each node utilizes its limited resources to carry out the collective operation of the network. It is not always in the best interests of the network's nodes to demand the continuous participation of all nodes in the network operations. We propose an energy dependent participation (EDP) scheme, where a node periodically re-evaluates its participation in the network based on the residual energy in its battery. More importantly, a node gives special consideration to supporting the communication needs of its active network applications and preventing further network partitioning. EDP's localized partition checking algorithm is particularly well suited for the zone routing protocol, where the link-state information is proactively maintained within each node's local zone and routes to faraway nodes are reactively obtained via global queries. Through simulations, we evaluate the impact of our proposed scheme on battery life and network connectivity. Our results suggest that the EDP scheme can increase the usable lifetime of a battery-constraint ad hoc network by over 50%.