Showing papers on "Wireless Routing Protocol published in 2006"
TL;DR: This article captures the state of the art in routing protocols in DTNs with three main approaches: the tree approach, the space and time approach, and the modified shortest shortest path approach.
Abstract: n the last few years, there has been much research activity in mobile, wireless, ad hoc networks (MANET). MANETs are infrastructure-less, and nodes in the networks are constantly moving. In MANETs, nodes can directly communicate with each other if they enter each others' communication range. A node can terminate packets or forward packets (serve as a relay). Thus, a packet traverses an ad hoc network by being relayed from one node to another, until it reaches its destination. As nodes are moving, this becomes a challenging task, since the topology of the network is in constant change. How to find a destination, how to route to that destination, and how to insure robust communication in the face of constant topology change are major challenges in mobile ad hoc networks. Routing in mobile ad hoc networks is a well-studied topic. To accommodate the dynamic topology of mobile ad hoc networks, an abundance of routing protocols have recent-For all these routing protocols, it is implicitly assumed that the network is connected and there is a contemporaneous end-to-end path between any source and destination pair. However, in a physical ad hoc network, the assumption that there is a contemporaneous end-to-end path between any source and destination pair may not be true, as illustrated below. In MANETs, when nodes are in motion, links can be obstructed by intervening objects. When nodes must conserve power, links are shut down periodically. These events result in intermittent connectivity. At any given time, when no path exists between source and destination, network partition is said to occur. Thus, it is perfectly possible that two nodes may never be part of the same connected portion of the network. Figure 1 illustrates the time evolving behavior in intermittent-ABSTRACT Recently there has been much research activity in the emerging area of intermittently connected ad hoc networks and delay/disruption tolerant networks (DTN). There are different types of DTNs, depending on the nature of the network environment. Routing in DTNs is one of the key components in the DTN architecture. Therefore, in the last few years researchers have proposed different routing protocols for different types of DTNs. In this article we capture the state of the art in routing protocols in DTNs. We categorize these routing protocols based on information used. For deter-ministic time evolving networks, three main approaches are discussed: the tree approach, the space and time approach, and the modified shortest …
861 citations
15 May 2006
TL;DR: This paper proposes a novel routing protocol, called vector-based forwarding (VBF), to provide robust, scalable and energy efficient routing in Underwater Sensor Networks (UWSNs).
Abstract: In this paper, we tackle one fundamental problem in Underwater Sensor Networks (UWSNs): robust, scalable and energy efficient routing. UWSNs are significantly different from terrestrial sensor networks in the following aspects: low bandwidth, high latency, node float mobility (resulting in high network dynamics), high error probability, and 3-dimensional space. These new features bring many challenges to the network protocol design of UWSNs. In this paper, we propose a novel routing protocol, called vector-based forwarding (VBF), to provide robust, scalable and energy efficient routing. VBF is essentially a position-based routing approach: nodes close to the “vector” from the source to the destination will forward the message. In this way, only a small fraction of the nodes are involved in routing. VBF also adopts a localized and distributed self-adaptation algorithm which allows nodes to weigh the benefit of forwarding packets and thus reduce energy consumption by discarding the low benefit packets. Through simulation experiments, we show the promising performance of VBF.
688 citations
TL;DR: AOMDV as discussed by the authors is an on-demand, multipath distance vector routing protocol for mobile ad hoc networks, which guarantees loop freedom and disjointness of alternate paths.
Abstract: We develop an on-demand, multipath distance vector routing protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as ad hoc on-demand distance vector (AODV). The resulting protocol is referred to as ad hoc on-demand multipath distance vector (AOMDV). The protocol guarantees loop freedom and disjointness of alternate paths. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to effectively cope with mobility-induced route failures. In particular, it reduces the packet loss by up to 40% and achieves a remarkable improvement in the end-to-end delay (often more than a factor of two). AOMDV also reduces routing overhead by about 30% by reducing the frequency of route discovery operations. Copyright © 2006 John Wiley & Sons, Ltd.
625 citations
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
TL;DR: A link layer protocol to manage multiple channels is proposed, and it can be implemented over existing IEEE 802.11 hardware and a new routing metric for multi-channel multi-interface networks is incorporated into an on-demand routing protocol that operates over the link layer Protocol.
Abstract: Wireless technologies, such as IEEE 802.11a, that are used in ad hoc networks provide for multiple non-overlapping channels. Most ad hoc network protocols that are currently available are designed to use a single channel. However, the available network capacity can be increased by using multiple channels. This paper presents new protocols specifically designed to exploit multiple channels. Our protocols simplify the use of multiple channels by using multiple interfaces, although the number of interfaces per host is typically smaller than the number of channels. We propose a link layer protocol to manage multiple channels, and it can be implemented over existing IEEE 802.11 hardware. We also propose a new routing metric for multi-channel multi-interface networks, and the metric is incorporated into an on-demand routing protocol that operates over the link layer protocol. Simulation results demonstrate the effectiveness of the proposed approach in significantly increasing network capacity, by utilizing all the available channels, even when the number of interfaces per host is smaller than the number of channels.
512 citations
01 May 2006
TL;DR: This work presents a classification of MAC protocols and their brief description, based on their operating principles and underlying features, and presents a brief summary of key ideas and a general direction for future work.
Abstract: Studies of ad hoc wireless networks are a relatively new field gaining more popularity for various new applications. In these networks, the Medium Access Control (MAC) protocols are responsible for coordinating the access from active nodes. These protocols are of significant importance since the wireless communication channel is inherently prone to errors and unique problems such as the hidden-terminal problem, the exposed-terminal problem, and signal fading effects. Although a lot of research has been conducted on MAC protocols, the various issues involved have mostly been presented in isolation of each other. We therefore make an attempt to present a comprehensive survey of major schemes, integrating various related issues and challenges with a view to providing a big-picture outlook to this vast area. We present a classification of MAC protocols and their brief description, based on their operating principles and underlying features. In conclusion, we present a brief summary of key ideas and a general direction for future work.
458 citations
30 Nov 2006
TL;DR: Simulations based on a realistic radio model of MICA2 motes show that RPAR significantly reduces the number of deadlines missed and energy consumption compared to existing real-time and energy-efficient routing protocols.
Abstract: Many wireless sensor network applications must resolve the inherent conflict between energy efficient communication and the need to achieve desired quality of service such as end-to-end communication delay. To address this challenge, we propose the Real-time Power-Aware Routing (RPAR) protocol, which achieves application-specified communication delays at low energy cost by dynamically adapting transmission power and routing decisions. RPAR features a power-aware forwarding policy and an efficient neighborhood manager that are optimized for resource-constrained wireless sensors. Moreover, RPAR addresses important practical issues in wireless sensor networks, including lossy links, scalability, and severe memory and bandwidth constraints. Simulations based on a realistic radio model of MICA2 motes show that RPAR significantly reduces the number of deadlines missed and energy consumption compared to existing real-time and energy-efficient routing protocols.
450 citations
TL;DR: This paper presents a class of algorithms that can be implemented at the sources to stably and optimally split the flow between each source-destination pair and shows that the connection-level throughput region of such multi-path routing/congestion control algorithms can be larger than that of a single-path congestion control scheme.
Abstract: We consider the problem of congestion-aware multi-path routing in the Internet. Currently, Internet routing protocols select only a single path between a source and a destination. However, due to many policy routing decisions, single-path routing may limit the achievable throughput. In this paper, we envision a scenario where multi-path routing is enabled in the Internet to take advantage of path diversity. Using minimal congestion feedback signals from the routers, we present a class of algorithms that can be implemented at the sources to stably and optimally split the flow between each source-destination pair. We then show that the connection-level throughput region of such multi-path routing/congestion control algorithms can be larger than that of a single-path congestion control scheme.
449 citations
TL;DR: The main contribution is to prove the asymptotic optimality of a primal-dual congestion controller, which is known to model different versions of transmission control protocol well.
Abstract: In this paper, we describe and analyze a joint scheduling, routing and congestion control mechanism for wireless networks, that asymptotically guarantees stability of the buffers and fair allocation of the network resources. The queue-lengths serve as common information to different layers of the network protocol stack. Our main contribution is to prove the asymptotic optimality of a primal-dual congestion controller, which is known to model different versions of transmission control protocol well
399 citations
06 Sep 2006
TL;DR: The Secure Ad hoc On-Demand Distance Vector is an extension of the AODV routing protocol that can be used to protect the route discovery mechanism providing security features like integrity and authentication.
Abstract: The Secure Ad hoc On-Demand Distance Vector (SAODV) is an extension of
the AODV routing protocol that can be used to protect the route
discovery mechanism providing security features like integrity and
authentication.
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.
24 Jul 2006
TL;DR: Analytical models based on queuing theory are developed for DyXY routing for a two-dimensional mesh NoC architecture, and analytical results match very well with the simulation results.
Abstract: A novel routing algorithm, namely dynamic XY (DyXY) routing, is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time.A new router architecture is developed to support the routing algorithm.Analytical models based on queuing theory are developed for DyXY routing for a two-dimensional mesh NoC architecture,and analytical results match very well with the simulation results.It is observed that DyXY routing can achieve better performance compared with static XY routing and odd-even routing.
23 Apr 2006
TL;DR: It is shown that routing based on MobySpace can achieve good performance compared to that of a number of standard algorithms, especially for nodes that are present in the network a large portion of the time, and the degree of homogeneity of node mobility patterns has a high impact on routing.
Abstract: Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call MobySpace, constructed upon nodes' mobility patterns. We provide here an analysis and a large scale evaluation of this routing scheme in the context of ambient networking by replaying real mobility traces. The specific MobySpace evaluated is based on the frequency of visits of nodes to each possible location. We show that routing based on MobySpace can achieve good performance compared to that of a number of standard algorithms, especially for nodes that are present in the network a large portion of the time. We determine that the degree of homogeneity of node mobility patterns has a high impact on routing. And finally, we study the ability of nodes to learn their own mobility patterns.
04 Sep 2006
TL;DR: In this article, the authors presented a new wireless sensor network routing protocol based on the Ant Colony Optimization metaheuristic, which is studied by simulation for several Wireless Sensor Network scenarios and the results clearly show that it minimises communication load and maximises energy savings.
Abstract: Wireless Sensor Networks are characterized by having specific requirements such as limited energy availability, low memory and reduced processing power. On the other hand, these networks have enormous potential applicability, e.g., habitat monitoring, medical care, military surveillance or traffic control. Many protocols have been developed for Wireless Sensor Networks that try to overcome the constraints that characterize this type of networks. Ant-based routing protocols can add a significant contribution to assist in the maximisation of the network lifetime, but this is only possible by means of an adaptable and balanced algorithm that takes into account the Wireless Sensor Networks main restrictions. This paper presents a new Wireless Sensor Network routing protocol, which is based on the Ant Colony Optimization metaheuristic. The protocol was studied by simulation for several Wireless Sensor Network scenarios and the results clearly show that it minimises communication load and maximises energy savings.
22 May 2006
TL;DR: This paper derives accurate closed form expressions for the expected encounter time between different nodes, under ommonly used mobility models, and demonstrates that derivative results oncerning the delay of various routing schemes are very accurate, under all the mobility models examined.
Abstract: Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established.Mobility was considered a necessary evil that invalidates paths and needs to be overcome in an intelligent way to allow for seamless ommunication between nodes.However, it has recently been recognized that mobility an be turned into a useful ally, by making nodes carry data around the network instead of transmitting them. This model of routing departs from the traditional paradigm and requires new theoretical tools to model its performance. A mobility-assisted protocol forwards data only when appropriate relays encounter each other, and thus the time between such encounters, called hitting or meeting time, is of high importance.In this paper, we derive accurate closed form expressions for the expected encounter time between different nodes, under ommonly used mobility models. We also propose a mobility model that can successfully capture some important real-world mobility haracteristics, often ignored in popular mobility models, and alculate hitting times for this model as well. Finally, we integrate this results with a general theoretical framework that can be used to analyze the performance of mobility-assisted routing schemes. We demonstrate that derivative results oncerning the delay of various routing s hemes are very accurate, under all the mobility models examined. Hence, this work helps in better under-standing the performance of various approaches in different settings, and an facilitate the design of new, improved protocols.
11 Aug 2006
TL;DR: An initial stab at the ROFL routing algorithm, proposing and analyzing its scaling and efficiency properties, and suggesting that the idea of routing on flat labels cannot be immediately dismissed.
Abstract: It is accepted wisdom that the current Internet architecture conflates network locations and host identities, but there is no agreement on how a future architecture should distinguish the two. One could sidestep this quandary by routing directly on host identities themselves, and eliminating the need for network-layer protocols to include any mention of network location. The key to achieving this is the ability to route on flat labels. In this paper we take an initial stab at this challenge, proposing and analyzing our ROFL routing algorithm. While its scaling and efficiency properties are far from ideal, our results suggest that the idea of routing on flat labels cannot be immediately dismissed.
11 Aug 2006
TL;DR: A multi-path inter-domain routing protocol called MIRO is presented that offers substantial flexiility, while giving transit domains control over the flow of traffic through their infrastructure and avoiding state explosion in disseminating reachability information.
Abstract: The Internet consists of thousands of independent domains with different, and sometimes competing, business interests. However, the current interdomain routing protocol (BGP) limits each router to using a single route for each destination prefix, which may not satisfy the diverse requirements of end users. Recent proposals for source routing offer an alternative where end hosts or edge routers select the end-to-end paths. However, source routing leaves transit domains with very little control and introduces difficult scalability and security challenges. In this paper, we present a multi-path inter-domain routing protocol called MIRO that offers substantial flexiility, while giving transit domains control over the flow of traffic through their infrastructure and avoiding state explosion in disseminating reachability information. In MIRO, routers learn default routes through the existing BGP protocol, and arbitrary pairs of domains can negotiate the use of additional paths (bound to tunnels in the data plane) tailored to their special needs. MIRO retains the simplicity of BGP for most traffic, and remains backwards compatible with BGP to allow for incremental deployability. Experiments with Internet topology and routing data illustrate that MIRO offers tremendous flexibility for path selection with reasonable overhead.
29 Sep 2006
TL;DR: This article gives the first complete and formal proofs that several proposed face routing, and combined greedy-face routing schemes do guarantee delivery in specific graph classes or even any arbitrary planar graphs.
Abstract: It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this article is to clarify that this is not the truth in general. We show that specifically in relative neighborhood and Gabriel graphs recovery from a greedy routing failure is always possible without changing between any adjacent faces. Guaranteed delivery then follows from guaranteed recovery while traversing the very first face. In arbitrary graphs, however, a proper face selection mechanism is of importance since recovery from a greedy routing failure may require visiting a sequence of faces before greedy routing can be restarted again. A prominent approach is to visit a sequence of faces which are intersected by the line connecting the source and destination node. Whenever encountering an edge which is intersecting with this line, the critical part is to decide if face traversal has to change to the next adjacent one or not. Failures may occur from incorporating face routing procedures that force to change the traversed face at each intersection. Recently observed routing failures which were produced by the GPSR protocol in arbitrary planar graphs result from incorporating such a face routing variant. They cannot be constructed by the well known GFG algorithm which does not force changing the face anytime. Beside methods which visit the faces intersected by the source destination line, we discuss face routing variants which simply restart face routing whenever the next face has to be explored. We give the first complete and formal proofs that several proposed face routing, and combined greedyface routing schemes do guarantee delivery in specific graph classes or even any arbitrary planar graphs. We also discuss the reasons why other methods may fail to deliver a message or even end up in a loop.
20 Apr 2006
TL;DR: This paper proposed an improved protocol called "LEACH-Mobile" for mobile nodes to declare the membership of a cluster as they move, and to confirm whether a mobile sensor node is able to communicate with a specific cluster head within a time slot allocated in TDMA schedule.
Abstract: In mobility-centric environments, wireless sensor networks are designed to accommodate energy efficiency, dynamic self-organization and mobility. In typical applications of wireless sensor networks, fixed sensor nodes are mixed with mobile sensor nodes in 'hot areas'. Also, as they move, network topology needs to be reconstructed by reacting upon the mobility of sensor nodes quickly. In this paper we proposed an improved protocol called "LEACH-Mobile" for mobile nodes to declare the membership of a cluster as they move, and to confirm whether a mobile sensor node is able to communicate with a specific cluster head within a time slot allocated in TDMA schedule. The LEACH-Mobile protocol achieved definite improvement in data transfer success rate as mobile nodes increased compared to the non-mobility centric LEACH protocol.
TL;DR: This work proposes a distributed navigation algorithm for emergency situations that quickly separates hazardous areas from safe areas, and the sensors establish escape paths.
Abstract: In an emergency, wireless network sensors combined with a navigation algorithm could help safely guide people to a building exit while helping them avoid hazardous areas. We propose a distributed navigation algorithm for emergency situations. At normal time, sensors monitor the environment. When the sensors detect emergency events, our protocol quickly separates hazardous areas from safe areas, and the sensors establish escape paths. Simulation and implementation results show that our scheme achieves navigation safety and quick convergence of the navigation directions. We based our protocol on the temporally ordered routing algorithm for mobile ad hoc networks. TORA assigns mobile nodes temporally ordered sequence numbers to support multipath routing from a source to a specific destination node
TL;DR: In this paper, the authors propose a mathematical framework in which security can be precisely defined and routing protocols for mobile ad hoc networks can be proved to be secure in a rigorous manner.
Abstract: Routing is one of the most basic networking functions in mobile ad hoc networks. Hence, an adversary can easily paralyze the operation of the network by attacking the routing protocol. This has been realized by many researchers and several "secure" routing protocols have been proposed for ad hoc networks. However, the security of those protocols has mainly been analyzed by informal means only. In this paper, we argue that flaws in ad hoc routing protocols can be very subtle, and we advocate a more systematic way of analysis. We propose a mathematical framework in which security can be precisely defined and routing protocols for mobile ad hoc networks can be proved to be secure in a rigorous manner. Our framework is tailored for on-demand source routing protocols, but the general principles are applicable to other types of protocols too. Our approach is based on the simulation paradigm, which has already been used extensively for the analysis of key establishment protocols, but, to the best of our knowledge, it has not been applied in the context of ad hoc routing so far. We also propose a new on-demand source routing protocol, called endairA, and we demonstrate the use of our framework by proving that it is secure in our model
18 Apr 2006
TL;DR: This paper presents a novel anonymous on demand routing scheme for MANETs and identifies a number of problems of previously proposed works and proposes an efficient solution that provides anonymity in a stronger adversary model.
Abstract: Due to the nature of radio transmissions, communications in wireless networks are easy to capture and analyze. Next to this, privacy enhancing techniques (PETs) proposed for wired networks such as the Internet often cannot be applied to mobile ad hoc networks (MANETs). In this paper we present a novel anonymous on demand routing scheme for MANETs. We identify a number of problems of previously proposed works and propose an efficient solution that provides anonymity in a stronger adversary model.
TL;DR: A novel anonymous on-demand routing protocol, termed MASK, which can accomplish both MAC-layer and network-layer communications without disclosing real IDs of the participating nodes under a rather strong adversary model and is resistant to a wide range of attacks.
Abstract: The shared wireless medium of mobile ad hoc networks facilitates passive, adversarial eavesdropping on data communications whereby adversaries can launch various devastating attacks on the target network. To thwart passive eavesdropping and the resulting attacks, we propose a novel anonymous on-demand routing protocol, termed MASK, which can accomplish both MAC-layer and network-layer communications without disclosing real IDs of the participating nodes under a rather strong adversary model. MASK offers the anonymity of senders, receivers, and sender-receiver relationships in addition to node unlocatability and untrackability and end-to-end flow untraceability. It is also resistant to a wide range of attacks. Moreover, MASK preserves the high routing efficiency as compared to previous proposals. Detailed simulation studies have shown that MASK is highly effective and efficient
22 Mar 2006
TL;DR: Performance evaluation results show that the proposed cross-layer protocol significantly improves the communication efficiency and outperforms the traditional layered protocol architecture that has been used so far in WSNs.
Abstract: Severe energy constraints of battery-powered sensor nodes necessitate energy-efficient communication protocols in order to fulfill application objectives of wireless sensor networks (WSN). However, the vast majority of the existing solutions are based on classical layered protocols approach. It is much more resource-efficient to have a unified scheme which melts common protocol layer functionalities into a cross-layer module for resource-constrained sensor nodes. To the best of our knowledge, to date, there is no unified cross-layer communication protocol for efficient and reliable event communication which considers transport, routing, medium access functionalities with physical layer (wireless channel) effects for WSNs. In this paper, a unified cross-layer protocol is developed, which replaces the entire traditional layered protocol architecture that has been used so far in WSNs. Our design principle is complete unified cross-layering such that both the information and the functionalities of traditional communication layers are melted in a single protocol. The objective of the proposed crosslayer protocol is highly reliable communication with minimal energy consumption, adaptive communication decisions and local congestion avoidance. To this end, the protocol operation is governed by the new concept of initiative determination. Based on this concept, the cross-layer protocol performs received based contention, local congestion control, and distributed duty cycle operation in order to realize efficient and reliable communication in WSN. Performance evaluation results show that the proposed cross-layer protocol significantly improves the communication efficiency and outperforms the traditional layered protocol architectures.
TL;DR: In this paper, a multihop virtual multiple-input-multiple-output (MIMO) communication protocol is proposed by the cross-layer design to jointly improve the energy efficiency, reliability, and end-to-end (ETE) QoS provisioning in wireless sensor network.
Abstract: In this paper, a novel multihop virtual multiple-input-multiple-output (MIMO) communication protocol is proposed by the cross-layer design to jointly improve the energy efficiency, reliability, and end-to-end (ETE) QoS provisioning in wireless sensor network (WSN). In the protocol, the traditional low-energy adaptive clustering hierarchy protocol is extended by incorporating the cooperative MIMO communication, multihop routing, and hop-by-hop recovery schemes. Based on the protocol, the overall energy consumption per packet transmission is modeled and the optimal set of transmission parameters is found. Then, the issues of ETE QoS provisioning of the protocol are considered. The ETE latency and throughput of the protocol are modeled in terms of the bit-error-rate (BER) performance of each link. Then, a nonlinear constrained programming model is developed to find the optimal BER performance of each link to meet the ETE QoS requirements with a minimum energy consumption. The particle swarm optimization (PSO) algorithm is employed to solve the problem. Simulation results show the effectiveness of the proposed protocol in energy saving and QoS provisioning
TL;DR: SCAN is a unified network-layer security solution for such networks that protects both routing and data forwarding operations through the same reactive approach and exploits localized collaboration and information cross-validation to protect the network in a self-organized manner.
Abstract: Protecting the network layer from malicious attacks is an important yet challenging security issue in mobile ad hoc networks. In this paper, we describe SCAN, a unified network-layer security solution for such networks that protects both routing and data forwarding operations through the same reactive approach. SCAN does not apply any cryptographic primitives on the routing messages. Instead, it protects the network by detecting and reacting to the malicious nodes. In SCAN, local neighboring nodes collaboratively monitor each other and sustain each other, while no single node is superior to the others. SCAN also adopts a novel credit strategy to decrease its overhead as time evolves. In essence, SCAN exploits localized collaboration and information cross-validation to protect the network in a self-organized manner. Through both analysis and simulation results, we demonstrate the effectiveness of SCAN even in a highly mobile and hostile environment.
TL;DR: It is demonstrated that the performance of the three trust-based reactive routing protocols varies significantly even under similar attack, traffic, and mobility conditions, making them suitable for application in a particular extemporized environment.
Abstract: Ad hoc networks, due to their improvised nature, are frequently established in insecure environments and hence become susceptible to attacks. These attacks are launched by participating malicious nodes against different network services. Routing protocols, which act as the binding force in these networks, are a common target of these nodes. A number of secure routing protocols have recently been proposed, which make use of cryptographic algorithms to secure the routes. However, in doing so, these protocols entail a number of prerequisites during both the network establishment and operation phases. In contrast, trust-based routing protocols locate trusted rather than secure routes in the network by observing the sincerity in participation by other nodes. These protocols thus permit rapid deployment along with a dynamically adaptive operation, which conforms with the current network situation. In this paper, we evaluate the performance of three trust-based reactive routing protocols in a network with varying number of malicious nodes. With the help of exhaustive simulations, we demonstrate that the performance of the three protocols varies significantly even under similar attack, traffic, and mobility conditions. However, each trust-based routing protocol has its own peculiar advantage making it suitable for application in a particular extemporized environment.
TL;DR: It is argued that routing should not only be aware of, but also be adaptive to, network congestion, and proposed a routing protocol (CRP) with such properties is proposed.
Abstract: Mobility, channel error, and congestion are the main causes for packet loss in mobile ad hoc networks. Reducing packet loss typically involves congestion control operating on top of a mobility and failure adaptive routing protocol at the network layer. In the current designs, routing is not congestion-adaptive. Routing may let a congestion happen which is detected by congestion control, but dealing with congestion in this reactive manner results in longer delay and unnecessary packet loss and requires significant overhead if a new route is needed. This problem becomes more visible especially in large-scale transmission of heavy traffic such as multimedia data, where congestion is more probable and the negative impact of packet loss on the service quality is of more significance. We argue that routing should not only be aware of, but also be adaptive to, network congestion. Hence, we propose a routing protocol (CRP) with such properties. Our ns-2 simulation results confirm that CRP improves the packet loss rate and end-to-end delay while enjoying significantly smaller protocol overhead and higher energy efficiency as compared to AODV and DSR
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