scispace - formally typeset
Search or ask a question

Showing papers on "Hazy Sighted Link State Routing Protocol published in 2006"


Proceedings ArticleDOI
01 Jan 2006
TL;DR: A new interference aware routing metric - iAWARE - is presented that aids in finding paths that are better in terms of reduced interflow and intra-flow interference and which delivers increased throughput in single radio and two radio mesh networks compared to similar protocol with WCETT and MIC routing metrics.
Abstract: We address the problem of interference aware routing in multi-radio infrastructure mesh networks wherein each mesh node is equipped with multiple radio interfaces and a subset of nodes serve as Internet gateways. We present a new interference aware routing metric - iAWARE that aids in finding paths that are better in terms of reduced interflow and intra-flow interference. We incorporate this metric and new support for multi-radio networks in the well known AODV routing protocol to design an enhanced AODV-MR routing protocol. We study the performance of our new routing metric by implementing it in our wireless testbed consisting of 12 mesh nodes. We show that iAWARE tracks changes in interfering traffic far better than existing well known link metrics such as ETT and IRU. We also demonstrate that our AODV-MR protocol delivers increased throughput in single radio and two radio mesh networks compared to similar protocol with WCETT and MIC routing metrics. We also show that in the case of two radio mesh networks, our metric achieves good intra-path channel diversity.

569 citations


Journal ArticleDOI
11 Aug 2006
TL;DR: The experimental results show that VRR provides robust performance across a wide range of environments and workloads, and performs comparably to, or better than, the best wireless routing protocol in each experiment.
Abstract: This paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in Distributed Hash Tables (DHTs) but it does not rely on an underlying network routing protocol. It is implemented directly on top of the link layer. VRR provides both raditional point-to-point network routing and DHT routing to the node responsible for a hash table key.VRR can be used with any link layer technology but this paper describes a design and several implementations of VRR that are tuned for wireless networks. We evaluate the performance of VRR using simulations and measurements from a sensor network and an 802.11a testbed. The experimental results show that VRR provides robust performance across a wide range of environments and workloads. It performs comparably to, or better than, the best wireless routing protocol in each experiment. VRR performs well because of its unique features: it does not require network flooding or trans-lation between fixed identifiers and location-dependent addresses.

392 citations


Journal ArticleDOI
TL;DR: It is shown that the problem of routing messages in a wireless sensor network so as to maximize network lifetime is NP-hard and an online heuristic is developed, which performs two shortest path computations to route each message, which results in greater lifetime.
Abstract: We show that the problem of routing messages in a wireless sensor network so as to maximize network lifetime is NP-hard. In our model, the online model, each message has to be routed without knowledge of future route requests. We also develop an online heuristic to maximize network lifetime. Our heuristic, which performs two shortest path computations to route each message, is superior to previously published heuristics for lifetime maximization - our heuristic results in greater lifetime and its performance is less sensitive to the selection of heuristic parameters. Additionally, our heuristic is superior on the capacity metric

171 citations


Journal ArticleDOI
TL;DR: A lightweight hierarchical routing model, way point routing (WPR), in which a number of intermediate nodes on a route are selected as waypoints and the route is divided into segments by the waypoints, which shows that DOA scales well for large networks with more than 1,000 nodes.
Abstract: We present a lightweight hierarchical routing model, way point routing (WPR), in which a number of intermediate nodes on a route are selected as waypoints and the route is divided into segments by the waypoints. The waypoints, including the source and the destination, run a high-level intersegment routing protocol, while the nodes on each segment run a low-level intrasegment routing protocol. One distinct advantage of our model is that when a node on the route moves out or fails, instead of discarding the whole original route and discovering a new route from the source to the destination, only the two waypoint nodes of the broken segment have to find a new segment. In addition, our model is lightweight because it maintains a hierarchy only for nodes on active routes. On the other hand, existing hierarchical routing protocols such as CGSR and ZRP maintain hierarchies for the entire network. We present an instantiation of WPR, where we use DSR as the intersegment routing protocol and AODV as the intrasegment routing protocol. This instantiation is termed DSR over AODV (DOA) routing protocol. Thus, DSR and AODV - two well-known on-demand routing protocols for MANETs - are combined into one hierarchical routing protocol and become two special cases of our protocol. Furthermore, we present two novel techniques for DOA: one is an efficient loop detection method and the other is a multitarget route, discovery. Simulation results show that DOA scales well for large networks with more than 1,000 nodes, incurring about 60 percent-80 percent less overhead than AODV, while other metrics are better than or comparable to AODV and DSR

149 citations


Proceedings ArticleDOI
18 Apr 2006
TL;DR: A MECH (maximum energy cluster head) routing protocol that has self-configuration and hierarchical tree routing properties, and reduces the distance of cluster-head to the base station.
Abstract: In recent years, there has been a growing interest in wireless sensor networks. One of the major issues in wireless sensor network is developing an energy-efficient routing protocol. Since the sensor nodes have limited available power, energy conservation is a critical issue in wireless sensor network for nodes and network life. Most of the existing routing protocols for sensor networks don't turn off the radio frequency completely. They speed up the energy consumption. LEACH (low energy adaptive clustering hierarchy) is a clustering-based protocol that non-cluster-head nodes will turn off their RF completely until their pre-allocated time slot. However, LEACH has a drawback that the cluster is not evenly distributed due to its randomized rotation of local cluster-head. In this paper, we propose a MECH (maximum energy cluster head) routing protocol. It has self-configuration and hierarchical tree routing properties. MECH improves LEACH in several aspects. MECH constructs clusters based on radio range and the number of cluster members. The cluster topology in the network is distributed more equally, through our cluster constructing. We also propose a hierarchical tree routing method that reduces the distance of cluster-head to the base station.

147 citations


Proceedings ArticleDOI
09 Oct 2006
TL;DR: This work proposes a novel multi-path hybrid routing protocol, multipath mesh (MMESH), that effectively discovers multiple paths and proposes elegant traffic splitting algorithms for balancing traffic over these multiple paths to synergistically improve the overall performance.
Abstract: Wireless mesh networks are envisioned to support the wired backbone with a wireless backbone for providing Internet connectivity to residential areas and offices. Routing protocols designed for mobile ad hoc networks (MANETs) primarily concentrate on finding a single best possible route to any destination out of the various paths available. However in wireless mesh networks, traffic is primarily routed either towards the Internet gateways (IGWs) or from the IGWs to the access points (APs). Thus, if multiple APs choose the best throughput path towards a gateway, the traffic loads on certain paths and mesh routers increases tremendously thereby deteriorating the overall performance of the network. To this end, we propose a novel multi-path hybrid routing protocol, multipath mesh (MMESH), that effectively discovers multiple paths. We also propose elegant traffic splitting algorithms for balancing traffic over these multiple paths to synergistically improve the overall performance. Through extensive simulations, we observe that our protocol works very well to cope with the variations in the network. Our protocol also improves the performance of flows traversing multiple hops

130 citations


Proceedings ArticleDOI
04 Jul 2006
TL;DR: There is a fundamental difference between unicast and multicast routing in how data packets are transmitted at the link layer, and accordingly there is a difference in how the routing metrics for each of these primitives are designed.
Abstract: The stationary nature of nodes in a mesh network has shifted the main design goal of routing protocols from maintaining connectivity between source and destination nodes to finding high-throughput paths between them. In recent years, numerous link-quality-based routing metrics have been proposed for choosing high-throughput paths for unicast protocols. In this paper we study routing metrics for high-throughput tree or mesh construction in multicast protocols. We show that there is a fundamental difference between unicast and multicast routing in how data packets are transmitted at the link layer, and accordingly there is a difference in how the routing metrics for each of these primitives are designed. We adapt certain routing metrics for unicast for high-throughput multicast routing and propose news ones not previously used for high-throughput. We then study the performance improvement achieved by using different link-quality-based routing metrics via extensive simulation and experiments on a mesh network testbed, using ODMRP as a representative multicast protocol. Our testbed experiment results show that ODMRP enhanced with linkquality routing metrics can achieve up to 17.5% throughput improvement as compared to the original ODMRP.

129 citations


Journal ArticleDOI
TL;DR: A set of criteria is defined against which the existing routing protocols from ad hoc, sensor, and WMNs can be evaluated and performance metrics identified, and this will serve as the basis for deriving the key design features for routing in wireless mesh networks.
Abstract: Wireless Mesh Networks (WMNs) are an emerging technology that could revolutionize the way wireless network access is provided. The interconnection of access points using wireless links exhibits great potential in addressing the "last mile" connectivity issue. To realize this vision, it is imperative to provide efficient resource management. Resource management encompasses a number of different issues, including routing. Although a profusion of routing mechanisms has been proposed for other wireless networks, the unique characteristics of WMNs (e.g., wireless backbone) suggest that WMNs demand a specific solution. To have a clear and precise focus on future research in WMN routing, the characteristics of WMNs that have a strong impact on routing must be identified. Then a set of criteria is defined against which the existing routing protocols from ad hoc, sensor, and WMNs can be evaluated and performance metrics identified. This will serve as the basis for deriving the key design features for routing in wireless mesh networks. Thus, this paper will help to guide and refocus future works in this area.

126 citations


Proceedings ArticleDOI
09 Oct 2006
TL;DR: A new routing algorithm is proposed that reduces the amount of heat produced in the network and uses mechanisms to adapt to topologies with low degree of connectivity and to switch to shortest path routing if a time threshold is exceeded.
Abstract: One of the major applications of sensor networks in near future will be in the area of biomedical research. Implanted biosensor nodes are already being used for various medical applications. These in-vivo sensor networks collect different biometric data and communicate the data to the base station wirelessly. These sensor networks produce heat, as the nodes have to communicate among themselves wirelessly. The rise in temperature of the nodes due to communication should not be very high. A high temperature of the in-vivo nodes for a prolonged period might damage the surrounding tissues. In this paper, we propose a new routing algorithm that reduces the amount of heat produced in the network. In the simple form, the algorithm routes packets to the coolest neighbor without inducing routing loops. In the adaptive form, the algorithm uses mechanisms to adapt to topologies with low degree of connectivity and to switch to shortest path routing if a time threshold is exceeded. The proposed algorithm performs much better in terms of reducing the amount of heat produced, delay and power consumption compared to the shortest hop routing algorithm and a previously proposed Thermal Aware Routing Algorithm (TARA).

121 citations


Journal ArticleDOI
TL;DR: In this paper, cluster-based routing mechanisms for wireless sensor networks are analyzed and cluster head selection, cluster formation and data transmission are three key techniques in cluster- based routing protocols.
Abstract: Routing technology at the network layer is pivotal in the architecture of wireless sensor networks. As an active branch of routing technology, cluster-based routing protocols excel in network topology management, energy minimization, data aggregation and so on. In this paper, cluster-based routing mechanisms for wireless sensor networks are analyzed. Cluster head selection, cluster formation and data transmission are three key techniques in cluster-based routing protocols. As viewed from the three techniques, recent representative cluster-based routing protocols are presented, and their characteristics and application areas are compared. Finally, the future research issues in this area are pointed out.

112 citations


Proceedings ArticleDOI
19 Jun 2006
TL;DR: This paper evaluates the feasibility of a mesh network for an all-wireless office using traces of office users and an actual 21-node multi-radio mesh testbed in an office area and concludes that for the traces and deployed system, under most conditions, all-Wireless office meshes are feasible.
Abstract: There is a fair amount of evidence that mesh (static multihop wireless) networks are gaining popularity, both in the academic literature and in the commercial space. Nonetheless, none of the prior work has evaluated the feasibility of applications on mesh through the use of deployed networks and real user traffic. The state of the art is the use of deployed testbeds with synthetic traces consisting of random traffic patterns.In this paper, we evaluate the feasibility of a mesh network for an all-wireless office using traces of office users and an actual 21-node multi-radio mesh testbed in an office area. Unlike previous mesh studies that have examined routing design in detail, we examine how different office mesh design choices impact the performance of user traffic. From our traces of 11 users spanning over a month, we identify 3 one hour trace periods with different characteristics and evaluate network performance for them. In addition, we consider different user-server placement, different wireless hardware, different wireless settings and different routing metrics.We find that our captured traffic is significantly different from the synthetic workloads typically used in the prior work. Our trace capture and replay methodology allows us to directly quantify the feasibility of office meshes by measuring the additional delay experienced by individual transactions made by user applications. Performance on our mesh network depends on the routing metric chosen, the user-server placement and the traffic load period. The choice of wireless hardware and wireless settings has a significant impact on performance under heavy load and challenging placement. Ultimately we conclude that for our traces and deployed system, under most conditions, all-wireless office meshes are feasible. In most cases, individual transactions incur under 20ms of additional delay over the mesh network. We believe this is an acceptable delay for most applications where a wired network to every machine is not readily available. We argue that our results are scalable to a network of over 100 users.

Proceedings ArticleDOI
04 Dec 2006
TL;DR: This paper design, implement, and evaluate a new secure routing protocol for sensor networks that requires no special hardware and provides message delivery even in an environment with active adversaries.
Abstract: The deployment of sensor networks in security- and safety-critical environments requires secure communication primitives. In this paper, we design, implement, and evaluate a new secure routing protocol for sensor networks. Our protocol requires no special hardware and provides message delivery even in an environment with active adversaries. We adopt a clean-slate approach and design a new sensor network routing protocol with security and efficiency as central design parameters. Our protocol is efficient yet highly resilient to active attacks. We demonstrate the performance of our algorithms with simulation results as well as an implementation on Telos sensor nodes.

Journal ArticleDOI
TL;DR: This work studies routing algorithms on wireless networks that use only short paths, for minimizing latency, and achieve good load balance, for balancing the energy use and presents algorithms that achieve good performance in terms of both measures simultaneously.
Abstract: We study routing algorithms on wireless networks that use only short paths, for minimizing latency, and achieve good load balance, for balancing the energy use. We consider the special case when all the nodes are located in a narrow strip with width at most /spl radic/3/2 /spl ap/ 0.86 times the communication radius. We present algorithms that achieve good performance in terms of both measures simultaneously. In particular, the routing path is at most four times the shortest path length and the maximum load on any node is at most three times that of the most load-balanced algorithm without path-length constraint. In addition, our routing algorithms make routing decisions by only local information and, as a consequence, are more adaptive to topology changes due to dynamic node insertions/deletions or due to mobility.

Proceedings ArticleDOI
01 Sep 2006
TL;DR: The results of simulations show that GROUP is an energy-efficient and scalable routing protocol for large-scale wireless sensor networks.
Abstract: In this paper, we propose GROUP, a grid-clustering routing protocol that provides scalable and efficient packet routing for large-scale wireless sensor networks. The sink proactively, dynamically and randomly builds a cluster grid structure in GROUP. Only small part of all sensor nodes will participate in election of cluster heads. GROUP can distribute the energy load among the sensors in the network, and provide in-network processing support to reduce the amount of information that must be transmitted to the sink. We have evaluated the performance of GROUP through simulation experiments. The results of simulations show that GROUP is an energy-efficient and scalable routing protocol for large-scale wireless sensor networks

Journal ArticleDOI
TL;DR: This work investigates a network routing problem where a probabilistic local broadcast transmission model is used to determine routing, and presents three distributed algorithms which compute an optimal routing policy, discuss their convergence properties, and demonstrate their performance through simulation.
Abstract: We investigate a network routing problem where a probabilistic local broadcast transmission model is used to determine routing. We discuss this model's key features, and note that the local broadcast transmission model can be viewed as soft handoff for an ad-hoc network. We present results showing that an index policy is optimal for the routing problem. We extend the network model to allow for control of transmission type, and prove that the index nature of the optimal routing policy remains unchanged. We present three distributed algorithms which compute an optimal routing policy, discuss their convergence properties, and demonstrate their performance through simulation.

Proceedings ArticleDOI
03 Apr 2006
TL;DR: Simulation results indicate that knowledge on the vehicles' heading adds major benefits to routing in terms of reducing the number of link breakage events and increasing the end-to-end throughput.
Abstract: Internetworking over vehicle ad-hoc networks (VANETs) is getting increasing attention from all major car manufacturers. The design of effective vehicular communications poses a series of technical challenges. Guaranteeing a stable and reliable routing mechanism over VANETs is an important step towards the realization of effective vehicular communications. In current ad-hoc routing protocols, the control messages in reactive protocols and route update timers in proactive protocols are not used to anticipate link breakage. They solely indicate presence or absence of a route to a given node. Consequently, the route maintenance process at both protocol types is initiated only after a link breakage event takes place. This paper argues the use of information on vehicle headings to predict a possible link breakage event prior to its occurrence. Vehicles are grouped according to their velocity vectors. When a vehicle shifts to a different group and a route, involving the vehicle, is to be broken, the proposed protocol searches for a more stable and "more durable" route that includes vehicles from the same group. The proposed scheme is dubbed velocity-heading based routing protocol (VHRP). Whilst the proposed scheme can be implemented on any existing routing protocol, the paper considers the case of VHRP over destination-sequenced distance vector (DSDV) routing protocol. The performance of the scheme is evaluated through computer simulations. Simulation results indicate that knowledge on the vehicles' heading adds major benefits to routing in terms of reducing the number of link breakage events and increasing the end-to-end throughput

Proceedings ArticleDOI
04 Jan 2006
TL;DR: This paper presents an on-demand secure routing protocol for ad hoc networks based on a distributed authentication mechanism that makes use of recommendation and trust evaluation to establish a trust relationship between network entities and uses feedback to adjust it.
Abstract: Ad hoc networks, which do not rely on infrastructure such as access points or base stations, can be deployed rapidly and inexpensively even in situations with geographical or time constraints. Ad hoc networks have attractive applications in both military and disaster situations and also in commercial uses like sensor networks or conferencing. However, the nature of ad hoc networks makes them vulnerable to attacks, especially in the routing protocol. How to protect an ad hoc routing protocol is an important research topic. In this paper, we present an on-demand secure routing protocol for ad hoc networks based on a distributed authentication mechanism. The protocol makes use of recommendation and trust evaluation to establish a trust relationship between network entities and uses feedback to adjust it. The protocol does not need the support of a trusted third party and can discover multiple routes between two nodes.

Proceedings ArticleDOI
Cedric Westphal1
01 Oct 2006
TL;DR: The opportunistic routing in dynamic ad hoc networks, the OPRAH protocols, which uses the air interface to find a more optimal path for each packet in a dynamic network.
Abstract: This paper describes the opportunistic routing in dynamic ad hoc networks, the OPRAH protocols, which uses the air interface to find a more optimal path for each packet in a dynamic network In the static environment the connectivity is perturbed only by fading between two fixed points, the performance of these protocols depends on how steady a route is Thus these protocols have the following advantages: ability to interoperate with wired protocols, to ensure that the ad hoc network can communicate with the legacy wired infrastructure, it works in a low mobility environment, and it should be implemented using relatively simple off-the-shelf components

Proceedings ArticleDOI
11 Dec 2006
TL;DR: A new path metric called Bottleneck Link Capacity (BLC) is proposed which accounts for the link quality, the interference among links, and the traffic load on the links and a routing protocol called Capacity-Aware Routing (CAR) is developed which makes use of BLC as the routing metric.
Abstract: Employing multiple channels in wireless multi-hop networks is regarded as an effective approach to increasing network capacity. However, existing routing protocols may not be able to properly utilize the advantages of multiple channels in such networks. In this paper, we focus on IEEE 802.11-based wireless mesh networks with stationary nodes, such as wireless backhaul networks and community wireless networks. We propose a new path metric called Bottleneck Link Capacity (BLC) which accounts for the link quality, the interference among links, and the traffic load on the links. Then, we develop a routing protocol called Capacity-Aware Routing (CAR) which makes use of BLC as the routing metric. Finally, we evaluate the performance of BLC via simulations. The results show that our path metric outperforms others in terms of system throughput and end-to-end delay.

Proceedings ArticleDOI
11 Dec 2006
TL;DR: This paper presents an analytical evaluation of the throughput and proposes a position-based algorithm to iteratively find a path between a source and a destination and demonstrates how interference can significantly degrade the nominal network capacity and void the benefits of multipath routing.
Abstract: Spreading traffic over multiple paths has been shown to enhance network performance compared to single path routing. However, the route coupling effect specific to wireless environments (consequent to the shared transmission medium) can significantly reduce the benefits of such an approach. In this paper, we focus on the 2-path routing problem in a non-mobile and non energy-constrained network. We evaluate the network performance and the effect of interference in a single source-destination pair scenario and for multiple source-destinations pairs. In the former case, we provide an analytical evaluation of the throughput and propose a position-based algorithm to iteratively find a path between a source and a destination. In the latter case, we demonstrate how interference can significantly degrade the nominal network capacity and void the benefits of multipath routing.

Journal ArticleDOI
TL;DR: This paper proposes and evaluates a low-cost approach to building a topology-aware routing mesh that eliminates virtual links that contain duplicate physical segments in the underlying network, and shows that constructing a sparser routing mesh on the topology -aware routingMesh---rather than directly on the Internet---itself benefit, which improves the resilience of the resulting routing mesh.
Abstract: Routing overlays have become a viable approach to working around slow BGP convergence and sub-optimal path selection, as well as to deploy novel forwarding architectures. A common sub-component of a routing overlay is a routing mesh: the route-selection algorithm considers only those virtual links inter-node links in an overlay---in the routing mesh rather than all N2 virtual links connecting an N-node overlay. Doing so reduces routing overhead, thereby improving the scalability of the overlay, as long as the process of constructing the mesh doesn't itself introduce overhead.This paper proposes and evaluates a low-cost approach to building a topology-aware routing mesh that eliminates virtual links that contain duplicate physical segments in the underlying network. An evaluation of our method on PlanetLab shows that a conservative link pruning algorithm reduces routing overhead by a factor of two without negatively impacting route selection. Additional analysis quanti es the impact on route selection of defining an even sparser mesh on top of the topology-aware routing mesh, documenting the cost/benefit tradeoff that is intrinsic to routing. It also shows that constructing a sparser routing mesh on the topology-aware routing mesh---rather than directly on the Internet---itself benefit,; from having the reduced number of duplicate physical segments in the underlying network, which improves the resilience of the resulting routing mesh.

Proceedings ArticleDOI
01 Dec 2006
TL;DR: A comprehensive review for routing features and techniques in wireless ad hoc networks for more than a dozen typical existing routing protocols is presented, comparing their properties according to different criteria, and categorize them according to their routing strategies and relationships.
Abstract: Wireless ad hoc network is a collection of mobile nodes forming a temporary network without the aid of any centralized administration or standard support services regularly available on conventional networks. It differs from the infrastructure-based network by not having base stations to rely on but the network achieves connectivity by using an ad hoc routing protocol. Absence of any fixed infrastructure pose number of different problems to this area. Some of the challenges that require standard solutions include routing, bandwidth constraints, hidden terminal problem and limited battery power. Routing is the process of information exchange between two hosts in networks. Routing is the first area that attainedfocus since the invention of commercialized mobile ad hoc networks In this paper, we present a comprehensive review for routing features and techniques in wireless ad hoc networks. For more than a dozen typical existing routing protocols, we compare their properties according to different criteria, and categorize them according to their routing strategies and relationships.

Journal ArticleDOI
01 May 2006
TL;DR: Bypass routing is presented, a local recovery protocol that aims to reduce the frequency of route request floods triggered by broken routes, and implemented SLR (Source Routing with Local Recovery), a prototype of this approach.
Abstract: On-demand routing protocols for ad hoc networks reduce the cost of routing in high mobility environments. However, route discovery in on-demand routing is typically performed via network-wide flooding, which consumes a substantial amount of bandwidth. In this paper, we present bypass routing, a local recovery protocol that aims to reduce the frequency of route request floods triggered by broken routes. Specifically, when a broken link is detected, a node patches the affected route using local information, which is acquired on-demand, and thereby bypasses the broken link. We implemented SLR (Source Routing with Local Recovery) as a prototype of our approach. Simulation studies show that SLR achieves efficient and effective local recovery while maintaining acceptable overhead.

Journal ArticleDOI
01 Jul 2006
TL;DR: A new geographic routing algorithm that forwards packets from sensors to base stations along efficient routes and replaces the right-hand rule by distance upgrading is proposed, which is fully distributed and responds to topology changes instantly with localised operations.
Abstract: Wireless sensor networks have attracted great attention in research and industrial development due to their fast-growing application potentials. New techniques must be developed for sensor networks due to their lack of infrastructure support and the constraints on computation capability, memory space, communication bandwidth and above all, energy supply. To prolong the life time of a battery-powered sensor network, an energy efficient routing algorithm for data collection is essential. We propose a new geographic routing algorithm that forwards packets from sensors to base stations along efficient routes. The algorithm eliminates the voids that cause non-optimal routing paths in geographic routing. It replaces the right-hand rule by distance upgrading. It is fully distributed and responds to topology changes instantly with localised operations. We formally prove the correctness of the algorithm and evaluate its performance by simulations.

Proceedings ArticleDOI
01 Nov 2006
TL;DR: A collusion attack model against optimized link state routing (OLSR) protocol which is one of the four standard routing protocols for MANETs is presented and a technique to detect the attack by utilizing information of two hops neighbors is presented.
Abstract: Rapid advances in wireless networking technologies have made it possible to construct a mobile ad hoc network (MANET) which can be applied in infrastructureless situations. However, due to their inherent characteristics, MANETs are vulnerable to various kinds of attacks which aim at disrupting their routing operations. To develop a strong security scheme to protect against these attacks it is necessary to understand the possible form of attacks that may be launched. Recently, researchers have proposed and investigated several possible attacks against MANET. However, there are still unanticipated or sophisticated attacks that have not been well studied. In this paper, we present a collusion attack model against optimized link state routing (OLSR) protocol which is one of the four standard routing protocols for MANETs. After analyzed the attack in detail and demonstrated the feasibility of the attack through simulations, we present a technique to detect the attack by utilizing information of two hops neighbors.

Proceedings ArticleDOI
01 Sep 2006
TL;DR: This paper proposes a distributed, scalable and localized multipath search protocol to discover multiple node-disjoint paths between the sink and source nodes and proposes a load balancing algorithm to distribute the traffic over the multiple paths discovered.
Abstract: The energy consumption is a key design criterion for the routing protocols in wireless sensor networks. Some of the conventional single path routing schemes may not be optimal to maximize the network lifetime and connectivity. In this paper, we propose a distributed, scalable and localized multipath search protocol to discover multiple node-disjoint paths between the sink and source nodes. We also propose a load balancing algorithm to distribute the traffic over the multiple paths discovered. We compare our proposed scheme with the directed diffusion, directed transmission, and the energy-aware routing protocols. Simulation results show that our proposed scheme has a higher node energy efficiency, lower average delay and control overhead than those protocols.

01 Mar 2006
TL;DR: The Optimized Link State Routing (OLSR) protocol for mobile ad hoc networks as mentioned in this paper provides shortest routes in terms of number of hops using Dijkstra's shortest path algorithm.
Abstract: The Optimized Link State Routing (OLSR) protocol for mobile ad hoc networks provides shortest routes in terms of number of hops using Dijkstra's shortest path algorithm. In order to support multiple- metric routing criteria, a quality of service (QoS) extension can be added to OLSR functioning. No additional control traffic is generated (only augmented HELLO and TC messages). QOLSR protocol uses standard multipoint relays (MPRs) to ensure that the overhead is as low as possible for forwarding control traffic. Local QoS metrics information on links are used to calculate quality of service MPRs (QMPRS) and then flooded in the network by TC messages to calculate routing tables. QOLSR can find optimal paths on the known partial topology having the same performances that those on the whole network. These paths contain only QMPRs as intermediate nodes between a source destination pair. This memo describes the QOLSR protocol, which is an enhancement of OLSR to support multiple-metric QoS routing.

Journal ArticleDOI
TL;DR: A new routing protocol called multiclass (MC) routing is presented, which is specifically designed for heterogeneous MANETs, which has very good performance, and outperforms a popular routing protocol-zone routing protocol, in terms of reliability, scalability, route discovery latency, overhead, as well as packet delay and throughput.
Abstract: Efficient routing is very important for mobile ad hoc networks (MANETs) Most existing routing protocols consider homogeneous ad hoc networks, in which all nodes are identical, ie, they have the same communication capabilities and characteristics Although a homogeneous network model is simple and easy to analyze, it misses important characteristics of many realistic MANETs such as military battlefield networks In addition, a homogeneous ad hoc network suffers from poor performance limits and scalability In many ad hoc networks, multiple types of nodes do coexist; and some nodes have larger transmission power, higher transmission data rate, better processing capability, and are more robust against bit errors and congestion than other nodes Hence, a heterogeneous network model is more realistic and provides many advantages (eg, leading to more efficient routing protocol design) In this paper, we present a new routing protocol called multiclass (MC) routing, which is specifically designed for heterogeneous MANETs Moreover, we also design a new medium access control (MAC) protocol for heterogeneous MANETs, which is more efficient than IEEE 80211b Extensive simulation results demonstrate that the MC routing has very good performance, and outperforms a popular routing protocol-zone routing protocol, in terms of reliability, scalability, route discovery latency, overhead, as well as packet delay and throughput

Journal ArticleDOI
TL;DR: Dynamic Backup Routes Routing Protocol (DBR^2P), a backup node mechanism for quick reconnection during link failures, is proposed in this paper and could more thoroughly improve the quality of routing protocol than those proposed in the past.

Proceedings ArticleDOI
23 Apr 2006
TL;DR: This paper develops an energy efficient routing scheme that takes into account the interference created by existing flows in the network, and shows that the routes chosen are more energy efficient than the state of the art.
Abstract: In this paper, we develop an energy efficient routing scheme that takes into account the interference created by existing flows in the network. Unlike previous works, we explicitly study the impact of routing a new flow on the energy consumption of the network. Under certain assumptions on how links are scheduled, we can show that our proposed algorithm is asymptotically (in time) optimal in terms of minimizing the average energy consumption. We also develop a distributed version of the algorithm. Our algorithm automatically detours around a congested area in the network, which helps mitigate network congestion and improve overall network performance. Using simulations, we show that the routes chosen by our algorithm (centralized and distributed) are more energy efficient than the state of the art.