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.

Securing the OLSR routing protocol with or without compromised nodes in the network

Abstract: The primary issue with respect to securing Mobile Ad hoc NETworks (MANETs) is that of ensuring network integrity even when the network is subject to attacks to break its connectivity. In this research report, we study how to secure the OLSR routing protocol . We first analyse the attacks that can be launched against the network integrity. We then present mechanisms for ensuring that only ``trusted'' nodes are admitted into the network and, subsequently, are the only nodes used to forward traffic. We also present mechanisms for detecting and dealing with scenarios where ``trusted'' nodes have become compromised.

Location aided broadcast in wireless ad hoc network systems

Abstract: Ad hoc networks in wireless communications is a challenging field due to the constant change of network topology. Broadcast service in ad hoc networks is critical in supporting various important applications and message routing. We examine the problem of the traditional broadcast protocol (i.e., flooding) in mobile wireless ad hoc networks, also known as "broadcast storm problem". We introduce a location aided algorithm to compute the optimal local cover set without delay and without much communication overhead. Based on the algorithm, we propose three new location-aided broadcast protocols for ad hoc networks that compute the optimal local cover set for retransmissions on-the-fly. We compare and analyze the simulation results of our protocols and others. The results show that our new protocols save a significant amount of wireless bandwidth and consume less overhead.

Effective Data Aggregation Supported by Dynamic Routing in Wireless Sensor Networks

Abstract: Data aggregation is an main method to conserve energy in wireless sensor network (WSN) Prior work on data aggregation protocols are generally based on static routing schemes, such as tree-based, cluster-based or chain-based routing schemes Although they can save energy to some extent, in dynamic scenarios where the source nodes are changing frequently, they will not only incur high overhead to continuously reconstruct the routing but also can not reduce the communication overhead effectively Our work aims to design an effective data aggregation mechanism supported by dynamic routing (DASDR) which can adapt to different scenarios without incurring much overhead Enlightened by the concept of potential field in the discipline of physics, the dynamic routing in DASDR is designed based on two potential fields: depth potential field which guarantees packets reaching the sink at last and queue potential field which makes packets more spatially convergent and thus data aggregation will be more efficient Simulation results show that DASDR is more effective in energy savings as well as scales well with regard to the network size

Improved LEACH routing protocol for large scale wireless sensor networks routing

Abstract: Due to energy limit of sensors, lifetime maximization of wireless sensor network is one of the key problems protocol design. Low Energy Adaptive Clustering Hierarchy (LEACH) is a well known routing protocol in WSN, but its performance decreases sharply with increase of the network scale. To solve this problem, we introduce an improved LEACH routing protocol to balance energy consumption among the whole network. LEACH-MF adopts the methods of multi-layer clustering and eliminates redundant information. Simulation results on NS2 show that the proposed protocol extends the survival time of the network and performs much better than LEACH protocol.

Neighbor-Based Dynamic Connectivity Factor Routing Protocol for Mobile Ad Hoc Network

Abstract: Recently, Mobile Ad hoc Networks (MANETs) have witnessed rapid development due to the low cost, diversity, and simplicity of mobile devices. Such devices can form a reliable network in a short time for use as a rescue information system after a natural disaster, where the communication infrastructure may no longer be available or accessible. Because the nodes in such a network are free to move at any time in the absence of centralized control, routing is considered to be the most challenging issue. Moreover, some routing protocols, such as Neighbor Coverage-Based Probabilistic Rebroadcast (NCPR), completely rely on preset variables, which are required to be set by the system administrator based on the scenario. Unfortunately, the setting that is proper for a specific scenario is not suitable for another scenario. In addition, some other routing protocols, such as Ad hoc On-demand Distance Vector (AODV), employ the Route REQuest message (RREQ) flooding scheme to find a path to a particular destination in the route discovery stage. Although the flooding scheme guarantees better reachability, it introduces undesirable routing overhead, which in turn leads to system performance degradation. Thus, this paper proposes a novel routing protocol, neighbor-based Dynamic Connectivity Factor routing Protocol (DCFP), that is able to dynamically probe the status of the underlying network without the intervention of a system administrator based on a novel connectivity metric, while reducing the RREQ overhead using a new connectivity factor. Furthermore, extensive simulation experiments are conducted to evaluate the performance of the proposed DCFP, where the NCPR and AODV are used as a benchmark. The proposed DCFP manages to address the need for preset variables in NCPR. Simulation results show that DCFP outperforms both NCPR and AODV in terms of end-to-end delay, normalized routing overhead, MAC collision, energy consumption, network connectivity, and packet delivery ratio due to its novel mechanism for reducing redundant RREQ.