scispace - formally typeset
Search or ask a question

Showing papers on "Wireless Routing Protocol published in 2009"


Book
01 Jan 2009
TL;DR: This paper presents a meta-modelling architecture for medium Access Control of Wireless Network Architectures and Protocols using the Bipole Model, and discusses its applications in mobile ad Hoc and land-based networks.
Abstract: Preface. Preface to Volume II. Contents of Volume II. Part IV Medium Access Control 1 Spatial Aloha: the Bipole Model 2 Receiver Selection in Spatial 3 Carrier Sense Multiple 4 Code Division Multiple Access in Cellular Networks Bibliographical Notes on Part IV. Part V Multihop Routing in Mobile ad Hoc Networks: 5 Optimal Routing 6 Greedy Routing 7 Time-Space Routing Bibliographical Notes on Part V. Part VI Appendix:Wireless Protocols and Architectures: 8 RadioWave Propagation 9 Signal Detection 10 Wireless Network Architectures and Protocols Bibliographical Notes on Part VI Bibliography Table of Notation Index.

911 citations


Journal ArticleDOI
TL;DR: A class of routing protocols called road-based using vehicular traffic (RBVT) routing, which outperforms existing routing protocols in city-based vehicular ad hoc networks (VANETs), is presented and designed and implemented and compared them with protocols representative of mobileAd hoc networks and VANets.
Abstract: This paper presents a class of routing protocols called road-based using vehicular traffic (RBVT) routing, which outperforms existing routing protocols in city-based vehicular ad hoc networks (VANETs). RBVT protocols leverage real-time vehicular traffic information to create road-based paths consisting of successions of road intersections that have, with high probability, network connectivity among them. Geographical forwarding is used to transfer packets between intersections on the path, reducing the path's sensitivity to individual node movements. For dense networks with high contention, we optimize the forwarding using a distributed receiver-based election of next hops based on a multicriterion prioritization function that takes nonuniform radio propagation into account. We designed and implemented a reactive protocol RBVT-R and a proactive protocol RBVT-P and compared them with protocols representative of mobile ad hoc networks and VANETs. Simulation results in urban settings show that RBVT-R performs best in terms of average delivery rate, with up to a 40% increase compared with some existing protocols. In terms of average delay, RBVT-P performs best, with as much as an 85% decrease compared with the other protocols.

513 citations


Journal ArticleDOI
TL;DR: An Unequal Cluster-based Routing (UCR) protocol is proposed that mitigates the hot spot problem in multihop sensor networks, and achieves an obvious improvement on the network lifetime.
Abstract: Clustering provides an effective method for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques; selecting cluster heads with more residual energy, and rotating cluster heads periodically to distribute the energy consumption among nodes in each cluster and extend the network lifetime. However, they rarely consider the hot spot problem in multihop sensor networks. When cluster heads cooperate with each other to forward their data to the base station, the cluster heads closer to the base station are burdened with heavier relay traffic and tend to die much faster, leaving areas of the network uncovered and causing network partitions. To mitigate the hot spot problem, we propose an Unequal Cluster-based Routing (UCR) protocol. It groups the nodes into clusters of unequal sizes. Cluster heads closer to the base station have smaller cluster sizes than those farther from the base station, thus they can preserve some energy for the inter-cluster data forwarding. A greedy geographic and energy-aware routing protocol is designed for the inter-cluster communication, which considers the tradeoff between the energy cost of relay paths and the residual energy of relay nodes. Simulation results show that UCR mitigates the hot spot problem and achieves an obvious improvement on the network lifetime.

475 citations


Proceedings ArticleDOI
20 Jun 2009
TL;DR: A case is made for a new approach to designing on-chip interconnection networks that eliminates the need for buffers for routing or flow control and new algorithms for routing without using buffers in router input/output ports are described.
Abstract: Buffers in on-chip networks consume significant energy, occupy chip area, and increase design complexity. In this paper, we make a case for a new approach to designing on-chip interconnection networks that eliminates the need for buffers for routing or flow control. We describe new algorithms for routing without using buffers in router input/output ports. We analyze the advantages and disadvantages of bufferless routing and discuss how router latency can be reduced by taking advantage of the fact that input/output buffers do not exist. Our evaluations show that routing without buffers significantly reduces the energy consumption of the on-chip cache/processor-to-cache network, while providing similar performance to that of existing buffered routing algorithms at low network utilization (i.e., on most real applications). We conclude that bufferless routing can be an attractive and energy-efficient design option for on-chip cache/processor-to-cache networks where network utilization is low.

427 citations


Proceedings ArticleDOI
16 Aug 2009
TL;DR: A new routing protocol, pathlet routing, in which networks advertise fragments of paths that sources concatenate into end-to-end source routes that can emulate the policies of BGP, source routing, and several recent multipath proposals is presented.
Abstract: We present a new routing protocol, pathlet routing, in which networks advertise fragments of paths, called pathlets, that sources concatenate into end-to-end source routes. Intuitively, the pathlet is a highly flexible building block, capturing policy constraints as well as enabling an exponentially large number of path choices. In particular, we show that pathlet routing can emulate the policies of BGP, source routing, and several recent multipath proposals. This flexibility lets us address two major challenges for Internet routing: scalability and source-controlled routing. When a router's routing policy has only "local" constraints, it can be represented using a small number of pathlets, leading to very small forwarding tables and many choices of routes for senders. Crucially, pathlet routing does not impose a global requirement on what style of policy is used, but rather allows multiple styles to coexist. The protocol thus supports complex routing policies while enabling and incentivizing the adoption of policies that yield small forwarding plane state and a high degree of path choice.

320 citations


Proceedings ArticleDOI
19 Apr 2009
TL;DR: This work presents a new DTN routing algorithm, called Encounter-Based Routing (EBR), which maximizes delivery ratios while minimizing overhead and delay, and presents a means of securing EBR against black hole denial- of-service attacks.
Abstract: Current work in routing protocols for delay and disruption tolerant networks leverage epidemic-style algorithms that trade off injecting many copies of messages into the network for increased probability of message delivery. However, such techniques can cause a large amount of contention in the network, increase overall delays, and drain each mobile node's limited battery supply. We present a new DTN routing algorithm, called Encounter-Based Routing (EBR), which maximizes delivery ratios while minimizing overhead and delay. Furthermore, we present a means of securing EBR against black hole denial- of-service attacks. EBR achieves up to a 40% improvement in message delivery over the current state-of-the-art, as well as achieving up to a 145% increase in goodput. Also, we further show how EBR outperforms other protocols by introduce three new composite metrics that better characterize DTN routing performance.

317 citations


Journal ArticleDOI
TL;DR: This paper proposes a simple opportunistic adaptive routing protocol (SOAR) to explicitly support multiple simultaneous flows in wireless mesh networks and shows that SOAR significantly outperforms traditional routing and a seminal opportunistic routing protocol, ExOR, under a wide range of scenarios.
Abstract: Multihop wireless mesh networks are becoming a new attractive communication paradigm owing to their low cost and ease of deployment. Routing protocols are critical to the performance and reliability of wireless mesh networks. Traditional routing protocols send traffic along predetermined paths and face difficulties in coping with unreliable and unpredictable wireless medium. In this paper, we propose a simple opportunistic adaptive routing protocol (SOAR) to explicitly support multiple simultaneous flows in wireless mesh networks. SOAR incorporates the following four major components to achieve high throughput and fairness: 1) adaptive forwarding path selection to leverage path diversity while minimizing duplicate transmissions, 2) priority timer-based forwarding to let only the best forwarding node forward the packet, 3) local loss recovery to efficiently detect and retransmit lost packets, and 4) adaptive rate control to determine an appropriate sending rate according to the current network conditions. We implement SOAR in both NS-2 simulation and an 18-node wireless mesh testbed. Our extensive evaluation shows that SOAR significantly outperforms traditional routing and a seminal opportunistic routing protocol, ExOR, under a wide range of scenarios.

314 citations


Journal ArticleDOI
TL;DR: The improved greedy traffic-aware routing protocol (GyTAR), which is an intersection-based geographical routing protocol that is capable of finding robust and optimal routes within urban environments, is introduced.
Abstract: Vehicular ad hoc networks (VANETs) have received considerable attention in recent times. Multihop data delivery between vehicles is an important aspect for the support of VANET-based applications. Although data dissemination and routing have extensively been addressed, many unique characteristics of VANETs, together with the diversity in promising applications, offer newer research challenges. This paper introduces the improved greedy traffic-aware routing protocol (GyTAR), which is an intersection-based geographical routing protocol that is capable of finding robust and optimal routes within urban environments. The main principle behind GyTAR is the dynamic and in-sequence selection of intersections through which data packets are forwarded to the destinations. The intersections are chosen considering parameters such as the remaining distance to the destination and the variation in vehicular traffic. Data forwarding between intersections in GyTAR adopts an improved greedy carry-and-forward mechanism. Evaluation of the proposed routing protocol shows significant performance improvement in comparison with other existing routing approaches. With the aid of extensive simulations, we also validate the optimality and sensitivity of significant GyTAR parameters.

304 citations


Journal ArticleDOI
TL;DR: This paper presents the design, implementation and evaluation of the context-aware adaptive routing (CAR) protocol for delay tolerant unicast communication in intermittently connected mobile ad hoc networks and discusses the implementation of CAR over an opportunistic networking framework.
Abstract: Most of the existing research work in mobile ad hoc networking is based on the assumption that a path exists between the sender and the receiver. On the other hand, applications of decentralised mobile systems are often characterised by network partitions. As a consequence delay tolerant networking research has received considerable attention in the recent years as a means to obviate to the gap between ad hoc network research and real applications. In this paper we present the design, implementation and evaluation of the context-aware adaptive routing (CAR) protocol for delay tolerant unicast communication in intermittently connected mobile ad hoc networks. The protocol is based on the idea of exploiting nodes as carriers of messages among network partitions to achieve delivery. The choice of the best carrier is made using Kalman filter based prediction techniques and utility theory. We discuss the implementation of CAR over an opportunistic networking framework, outlining possible applications of the general principles at the basis of the proposed approach. The large scale performance of the CAR protocol are evaluated using simulations based on a social network founded mobility model, a purely random one and real traces from Dartmouth College.

304 citations


Journal ArticleDOI
TL;DR: A checklist is provided as a guideline so that a network designer can choose an appropriate multipath routing protocol to meet the network's application objectives.

283 citations


Journal ArticleDOI
26 Oct 2009-Sensors
TL;DR: This paper presents a review of the main routing protocols proposed for wireless sensor networks and includes the efforts carried out by Spanish universities on developing optimization techniques in the area of routing protocols for wireless Sensor networks.
Abstract: The applications of wireless sensor networks comprise a wide variety of scenarios. In most of them, the network is composed of a significant number of nodes deployed in an extensive area in which not all nodes are directly connected. Then, the data exchange is supported by multihop communications. Routing protocols are in charge of discovering and maintaining the routes in the network. However, the appropriateness of a particular routing protocol mainly depends on the capabilities of the nodes and on the application requirements. This paper presents a review of the main routing protocols proposed for wireless sensor networks. Additionally, the paper includes the efforts carried out by Spanish universities on developing optimization techniques in the area of routing protocols for wireless sensor networks.

Journal ArticleDOI
01 Jun 2009
TL;DR: A hybrid routing algorithm for MANETs based on ACO and zone routing framework of bordercasting, HOPNET, based on ants hopping from one zone to the next, consists of the local proactive route discovery within a node's neighborhood and reactive communication between the neighborhoods.
Abstract: Mobile ad hoc network (MANET) is a group of mobile nodes which communicates with each other without any supporting infrastructure. Routing in MANET is extremely challenging because of MANETs dynamic features, its limited bandwidth and power energy. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for MANETs. Swarm intelligence is a computational intelligence technique that involves collective behavior of autonomous agents that locally interact with each other in a distributed environment to solve a given problem in the hope of finding a global solution to the problem. In this paper, we propose a hybrid routing algorithm for MANETs based on ACO and zone routing framework of bordercasting. The algorithm, HOPNET, based on ants hopping from one zone to the next, consists of the local proactive route discovery within a node's neighborhood and reactive communication between the neighborhoods. The algorithm has features extracted from ZRP and DSR protocols and is simulated on GlomoSim and is compared to AODV routing protocol. The algorithm is also compared to the well known hybrid routing algorithm, AntHocNet, which is not based on zone routing framework. Results indicate that HOPNET is highly scalable for large networks compared to AntHocNet. The results also indicate that the selection of the zone radius has considerable impact on the delivery packet ratio and HOPNET performs significantly better than AntHocNet for high and low mobility. The algorithm has been compared to random way point model and random drunken model and the results show the efficiency and inefficiency of bordercasting. Finally, HOPNET is compared to ZRP and the strength of nature-inspired algorithm is shown.

Journal ArticleDOI
TL;DR: This paper proposes a class of routing schemes that can identify the nodes of "highest utility" for routing, improving the delay and delivery ratio by four to five times, and proposes an analytical framework based on fluid models that can be used to analyze the performance of various opportunistic routing strategies, in heterogeneous settings.
Abstract: Communication networks are traditionally assumed to be connected. However, emerging wireless applications such as vehicular networks, pocket-switched networks, etc., coupled with volatile links, node mobility, and power outages, will require the network to operate despite frequent disconnections. To this end, opportunistic routing techniques have been proposed, where a node may store-and-carry a message for some time, until a new forwarding opportunity arises. Although a number of such algorithms exist, most focus on relatively homogeneous settings of nodes. However, in many envisioned applications, participating nodes might include handhelds, vehicles, sensors, etc. These various "classesrdquo have diverse characteristics and mobility patterns, and will contribute quite differently to the routing process. In this paper, we address the problem of routing in intermittently connected wireless networks comprising multiple classes of nodes. We show that proposed solutions, which perform well in homogeneous scenarios, are not as competent in this setting. To this end, we propose a class of routing schemes that can identify the nodes of "highest utilityrdquo for routing, improving the delay and delivery ratio by four to five times. Additionally, we propose an analytical framework based on fluid models that can be used to analyze the performance of various opportunistic routing strategies, in heterogeneous settings.

Journal ArticleDOI
TL;DR: An industrial development of a wireless sensor network technology called OCARI: optimization of communication for ad hoc reliable industrial networks, which targets applications in harsh environments such as power plants and warships is presented.
Abstract: In this paper, we present an industrial development of a wireless sensor network technology called OCARI: optimization of communication for ad hoc reliable industrial networks. It targets applications in harsh environments such as power plants and warships. OCARI is a wireless-communication technology that supports mesh topology and power-aware ad hoc routing protocol aimed at maximizing the network lifetime. It is based on IEEE 802.15.4 physical layer with deterministic media access control layer for time-constrained communication. During the nontime-constrained communication period, its ad hoc routing strategy uses an energy-aware optimized-link state-routing proactive protocol. An OCARI application layer (APL) is based on ZigBee application support sublayer and APL primitives and profiles to provide maximum compatibility with ZigBee applications. To fully assess this technology, extensive tests are done in industrial facilities at ElectricitEacute De France R&D as well as at Direction des Constructions Navales Services. Our objective is then to promote this specification as an open standard of industrial wireless technology.

Proceedings ArticleDOI
11 Dec 2009
TL;DR: A secure and efficient MANET routing protocol, the SAODV protocol, is proposed, which aims to address the security weakness of the A ODV protocol and is capable of withstanding the black hole attack.
Abstract: Ad hoc On-demand Distance Vector routing (AODV) is a widely adopted network routing protocol for Mobile Ad hoc Network (MANET). The design of AODV, however, paid little attention to security considerations, hence resulting in the vulnerability of such MANET to the black hole attack. On the basis of AODV, this paper proposes and implements AODV suffering black hole attack - BAODV (Bad Ad Hoc On-demand Distance Vector Routing suffering black hole attack), which can simulate black hole attack to MANET by one of nodes as a malicious one in network. BAODV can be regarded as AODV, which is used in MANET exited black hole attack. Based on BAODV, this paper also proposes a secure and efficient MANET routing protocol, the SAODV protocol, which aims to address the security weakness of the AODV protocol and is capable of withstanding the black hole attack. Experimental analysis shows that the SAODV routing protocol is more secure than the basic AODV.

Journal ArticleDOI
TL;DR: The basic idea behind opportunistic routing is illustrated, how different protocols work are illustrated, and current research work is categorized based on different criteria to discuss their merits and drawbacks.
Abstract: Opportunistic routing has recently attracted much attention as it is considered a promising direction for improving the performance of wireless ad hoc and sensor networks. With opportunistic routing, intermediate nodes collaborate on packet forwarding in a localized and consistent manner. Opportunistic routing greatly increases transmission reliability and network throughput by taking advantage of the broadcast nature of the wireless medium. In this article we first illustrate the basic idea behind opportunistic routing, and then categorize current research work based on different criteria. We illustrate how different protocols work, and discuss their merits and drawbacks. Finally, we point out potential issues and future directions in opportunistic routing for wireless ad hoc and sensor networks.

01 Jan 2009
TL;DR: The simulations have shown that the conventional routing protocols like DSR have a dramatic decrease in performance when mobility is high, however the AODV and DSDV are perform very well when Mobility is high.
Abstract: Grid computing has recently migrated from traditional high performance and distributed computing to pervasive and utility computing based on the advanced capabilities of the wireless networks and the lightweight, thin devices. This has as result the emergence of a new computing paradigm which is the Mobile Grid. This paper presents the simulation results in order to choose the best routing protocol to give the highest performance when implement the routing protocols in the target mobile grid application. The simulations comparing three ad hoc routing protocols named DSDV, DSR and AODV. The simulations have shown that the conventional routing protocols like DSR have a dramatic decrease in performance when mobility is high. However the AODV and DSDV are perform very well when mobility is high.

Journal ArticleDOI
TL;DR: This paper discusses the design factors of unicast routing protocols for VANETs, and presents a timeline of the development of the existing unicasts, and classify and characterize the existing protocols, and provides a qualitative comparison of them.

Journal Article
TL;DR: Simulation results show that I-DSDV reduces the number of dropped data packets with little increased overhead at higher rates of node mobility but still can’t compete with AODV in higher node speed and number of node.
Abstract: Ad hoc networks are characterized by a lack of infrastructure, and by a random and quickly changing network topology; thus the need for a robust dynamic routing protocol that can accommodate such an environment To improve the packet delivery ratio of Destination Sequenced Distance Vector (DSDV) routing protocol in mobile ad hoc networks with high mobility, a message exchange scheme for its invalid route reconstruction is being used Three protocols AODV, DSDV and I-DSDV were simulated using NS-2 package and were compared in terms of packet delivery ratio, end to end delay and routing overhead in different environment; varying number of nodes, speed and pause time Simulation results show that I-DSDV compared with DSDV, it reduces the number of dropped data packets with little increased overhead at higher rates of node mobility but still can’t compete with AODV in higher node speed and number of node

Journal ArticleDOI
13 Feb 2009-Sensors
TL;DR: A novel routing approach using an Ant Colony Optimization algorithm is proposed for Wireless Sensor Networks consisting of stable nodes, showing that proposed algorithm provides promising solutions allowing node designers to efficiently operate routing tasks.
Abstract: Wireless Sensor Networks consisting of nodes with limited power are deployed to gather useful information from the field. In WSNs it is critical to collect the information in an energy efficient manner. Ant Colony Optimization, a swarm intelligence based optimization technique, is widely used in network routing. A novel routing approach using an Ant Colony Optimization algorithm is proposed for Wireless Sensor Networks consisting of stable nodes. Illustrative examples, detailed descriptions and comparative performance test results of the proposed approach are included. The approach is also implemented to a small sized hardware component as a router chip. Simulation results show that proposed algorithm provides promising solutions allowing node designers to efficiently operate routing tasks.

Proceedings ArticleDOI
Muhammad Ayaz1, Azween Abdullah1
16 Dec 2009
TL;DR: A novel routing protocol, called Hop-by-Hop Dynamic Addressing Based (H2-DAB), in order to provide scalable and time efficient routing for underwater wireless sensor networks, and effectively achieves the goals of higher data deliveries with optimal delays and energy consumptions.
Abstract: Providing an efficient communication for the underwater wireless sensor networks is a significant problem due to the unique characteristics of such environments. Radio signal cannot propagate well in deep water, and we have to replace this with the acoustic channel. This replacement results in many issues like high latency due to less propagation speeds, low bandwidths and high error probability. In addition, new features like node mobility with water currents and 3-dimensional space brings additional challenges to the underwater sensor network (UWSN) protocol design. Many routing protocols have been proposed for such environments but most of them considered that the complete dimensional location of all the sensor nodes is already known through a localization process, which itself is a challenging task in UWSNs. In this paper, we propose a novel routing protocol, called Hop-by-Hop Dynamic Addressing Based (H2-DAB), in order to provide scalable and time efficient routing. Our routing protocol will take advantage of the multiple-sink architecture of the underwater wireless sensor networks. The novelty of H2-DAB is that, it does not require any dimensional location information, or any extra specialized hardware compared to many other routing protocols in the same area. Our results show that H2-DAB effectively achieves the goals of higher data deliveries with optimal delays and energy consumptions.

Journal ArticleDOI
TL;DR: This work exploits cross-layer optimization techniques that extend DSR to improve its routing energy efficiency by minimizing the frequency of recomputed routes and distinguishes between congestion and link failure conditions, and new routes are recalculated only for the latter.
Abstract: The Dynamic Source Routing (DSR) algorithm computes a new route when packet loss occurs. DSR does not have an in-built mechanism to determine whether the packet loss was the result of congestion or node failure causing DSR to compute a new route. This leads to inefficient energy utilization when DSR is used in wireless sensor networks. In this work, we exploit cross-layer optimization techniques that extend DSR to improve its routing energy efficiency by minimizing the frequency of recomputed routes. Our proposed approach enables DSR to initiate a route discovery only when link failure occurs. We conducted extensive simulations to evaluate the performance of our proposed cross-layer DSR routing protocol. The simulation results obtained with our extended DSR routing protocol show that the frequency with which new routes are recomputed is 50% lower compared with the traditional DSR protocol. This improvement is attributed to the fact that, with our proposed cross-layer DSR, we distinguish between congestion and link failure conditions, and new routes are recalculated only for the latter.

Journal ArticleDOI
TL;DR: Simulation and comparison show that the proposed two-hop neighborhood information-based routing protocol has led to lower packet deadline miss ratio and higher energy efficiency than two existing popular schemes.
Abstract: A two-hop neighborhood information-based routing protocol is proposed for real-time wireless sensor networks. The approach of mapping packet deadline to a velocity is adopted as that in SPEED; however, our routing decision is made based on the novel two-hop velocity integrated with energy balancing mechanism. Initiative drop control is embedded to enhance energy utilization efficiency, while reducing packet deadline miss ratio. Simulation and comparison show that the new protocol has led to lower packet deadline miss ratio and higher energy efficiency than two existing popular schemes. The result has also indicated a promising direction in supporting real-time quality-of-service for wireless sensor networks.

Proceedings ArticleDOI
14 Jun 2009
TL;DR: An energy efficient and collision aware (EECA) node-disjoint multipath routing algorithm for wireless sensor networks that attempts to find two collision-free routes using constrained and power adjusted flooding and then transmits the data with minimum power needed through power control component of the protocol.
Abstract: Multipath routing can reduce the need for route updates, balance the traffic load and increase the data transfer rate in a wireless sensor network, improving the utilization of the limited energy of sensor nodes. However, previous multiple path routing methods use flooding for route discovery and transmit data with maximum power regardless of need, which results in waste of energy. Moreover, often a serious problem of collisions among multiple paths arises. In this paper, we propose an energy efficient and collision aware (EECA) node-disjoint multipath routing algorithm for wireless sensor networks. With the aid of node position information, the EECA algorithm attempts to find two collision-free routes using constrained and power adjusted flooding and then transmits the data with minimum power needed through power control component of the protocol. Our preliminary simulation results show that ECCA algorithm results in good overall performance, saving energy and transferring data efficiently.

BookDOI
19 Jan 2009
TL;DR: In this article, the authors present an overview of the security in wireless ad hoc, sensor and mesh networks, focusing on three types of protocols: authentication, authentication, and interference detection.
Abstract: About the Authors. Preface. Acknowledgements. List of Acronyms. Part One Wireless Ad Hoc, Sensor and Mesh Networking. 1 Introduction. 1.1 Information Security. 1.2 Scope of the Book. 1.3 Structure of the Book. 1.4 Electronic Resources for the Book. 1.5 Review Questions. 2 Wireless Ad Hoc, Sensor and Mesh Networks. 2.1 Ad Hoc Networks and Applications. 2.2 Sensor and Actuator Networks. 2.3 Mesh Networks. 2.4 Tactical Communications and Networks. 2.5 Factors Influencing the Design of Wireless Ad Hoc, Sensor and Mesh Networks. .6 Review Questions. 3 The Wireless Medium. 3.1 Wireless Channel Fundamentals and Security. 3.2 Advanced Radio Technologies. 3.3 Review Questions. 4 Medium Access and Error Control. 4.1 Medium Access Control. 4.2 Error Control. 4.3 Wireless Metropolitan Area Networks. 4.4 Wireless Local Area Networks. 4.5 Wireless Personal Area Networks. 4.6 Review Questions. 5 Routing. 5.1 Internet Protocol and Mobile IP. 5.2 Routing in Wireless Ad Hoc Networks. 5.3 Routing in Wireless Sensor and Actuator Networks. 5.4 Review Questions. 6 Reliability, Flow and Congestion Control. 6.1 Reliability. 6.2 Flow and Congestion Control. 6.3 Review Questions. 7 Other Challenges and Security Aspects. 7.1 Localization and Positioning. 7.2 Time Synchronization. 7.3 Addressing. 7.4 Data Aggregation and Fusion. 7.5 Data Querying. 7.6 Coverage. 7.7 Mobility Management. 7.8 Cross-layer Design. 7.9 Review Questions. Part Two Security in Wireless Ad Hoc, Sensor and Mesh Networking. 8 Security Attacks in Ad Hoc, Sensor and Mesh Networks. 8.1 Security Attacks. 8.2 Attackers. 8.3 Security Goals. 8.4 Review Questions. 9 Cryptography. 9.1 Symmetric Encryption. 9.2 Asymmetric Encryption. 9.3 Hash Functions and Message Authentication Code. 9.4 Cascading Hashing. 9.5 Review Questions. 10 Challenges and Solutions: Basic Issues. 10.1 Bootstrapping Security in Ad Hoc Networks. 10.2 Bootstrapping Security in Sensor Networks. 10.3 Key Distribution, Exchange and Management. 10.4 Authentication Issues. 10.5 Integrity. 10.6 Review Questions. 11 Challenges and Solutions: Protection. 11.1 Privacy and Anonymity. 11.2 Intrusion Detection. 11.3 Defense Against Traffic Analysis. 11.4 Access Control and Secure Human-Computer Interaction. 11.5 Software-Based Anti-Tamper Techniques. 11.6 Tamper Resilience: Hardware Protection. 11.7 Availability and Plausibility. 11.8 Review Questions. 12 Secure Routing. 12.1 Defense Against Security Attacks in Ad Hoc Routing. 12.2 Secure Ad Hoc Routing Protocols. 12.3 Further Reading. 12.4 Review Questions. 13 Specific Challenges and Solutions. 13.1 SPINS: Security Protocols for Sensor Networks. 13.2 Quarantine Region Scheme for Spam Attacks. 13.3 Secure Charging and Rewarding Scheme. 13.4 Secure Node Localization. 13.5 Secure Time Synchronization. 13.6 Secure Event and Event Boundary Detection. 13.7 Review Questions. 14 Information Operations and Electronic Warfare. 14.1 Electronic Support. 14.2 Electronic Attack. 14.3 Electronic Protection. 14.4 Review Questions. 15 Standards. 15.1 X.800 and RFC 2828. 15.2 Wired Equivalent Privacy (WEP). 15.3 Wi-Fi Protected Access (WPA). References. Index.

Proceedings ArticleDOI
08 Oct 2009
TL;DR: Three routing protocols are investigated using a real-world testbed to show the multi-hopping performance and the ability of each routing protocol to recover from link failures, and results show that B.A.T.M.N. and BABEL outperform OLSR both in terms of multi- Hopping Performance and in route re-discovery latency.
Abstract: The proliferation of mesh or ad hoc network protocols has lead to a push for protocol standardisation. While there are a number of both open-source and proprietary mesh routing protocols being developed, there is only a small amount of literature available that shows relative strengths and weaknesses of different protocols. This paper investigates the performance of a number of available routing protocols using a real-world testbed. Three routing protocols — Optimised Link State Routing (OLSR), Better Approach To Mobile Ad hoc Network (B.A.T.M.A.N.) and BABEL — were chosen for this study. Our investigations focus on the multi-hopping performance and the ability of each routing protocol to recover from link failures. Our results show that B.A.T.M.A.N. and BABEL outperform OLSR both in terms of multi-hopping performance and in route re-discovery latency.

Journal ArticleDOI
TL;DR: This work argues that in multihop cognitive radio environments no general routing solution can be proposed, but cognitive environments can be classified into three separate categories, each requiring specific routing solutions.
Abstract: Routing is a fundamental issue to consider when dealing with multihop cognitive radio networks. We investigate in this work, the potential routing approaches that can be employed in such adaptive wireless networks. We argue that in multihop cognitive radio environments no general routing solution can be proposed, but cognitive environments can be classified into three separate categories, each requiring specific routing solutions. Basically, this classification is imposed by the activity of the users on the licensed bands that cognitive radios try to access. First, over a relatively static primary band, where primary nodes idleness largely exceeds cognitive users communication durations, static mesh routing solutions can be reused, whereas second, over dynamically available spectrum bands new specific routing solutions have to be proposed, we give some guidelines and insights about designing such solutions. Third, if cognitive radios try to access over highly active and rarely available primary bands, opportunistic forwarding without preestablished routing is to be explored.

Journal ArticleDOI
TL;DR: This paper combines routing and cooperative diversity, with the consideration of a realistic channel model, on a multihop network with multiple relays at each hop, and three routing strategies are designed to achieve the full diversity gain provided by cooperation among the relays.
Abstract: The fading characteristics and broadcast nature of wireless channels are usually not fully considered in the design of routing protocols for wireless networks. In this paper, we combine routing and cooperative diversity, with the consideration of a realistic channel model. We focus on a multihop network with multiple relays at each hop, and three routing strategies are designed to achieve the full diversity gain provided by cooperation among the relays. In particular, an optimal routing strategy is proposed to minimize the end-to-end outage, which requires the channel information of all the links and serves as a performance bound. An ad-hoc routing strategy is then proposed based on a hop-by-hop relay selection, which can be easily implemented in a distributed way. As expected, ad-hoc routing performs worse than optimal routing, especially with a large number of hops. To achieve a good complexity-performance tradeoff, an N-hop routing strategy is further proposed, where a joint optimization is performed every N hops. Simulation results are provided which verify the outage analyses of the proposed routing strategies.

Proceedings ArticleDOI
16 Aug 2009
TL;DR: ROMA is presented, a practical, distributed channel assignment and routing protocol that achieves good multi-hop path performance between every node and one or more designated gateway nodes in a dual-radio network.
Abstract: Realizing the full potential of a multi-radio mesh network involves two main challenges: how to assign channels to radios at each node to minimize interference and how to choose high throughput routing paths in the face of lossy links, variable channel conditions and external load. This paper presents ROMA, a practical, distributed channel assignment and routing protocol that achieves good multi-hop path performance between every node and one or more designated gateway nodes in a dual-radio network. ROMA assigns non-overlapping channels to links along each gateway path to eliminate intra-path interference. ROMA reduces inter-path interference by assigning different channels to paths destined for different gateways whenever possible. Evaluations on a 24-node dual-radio testbed show that ROMA achieves high throughput in a variety of scenarios.

Proceedings ArticleDOI
20 Jun 2009
TL;DR: This paper introduces indirect global adaptive routing (IAR) in which the adaptive routing decision uses information that is not directly available at the source router, and describes four IAR routing methods: credit round trip (CRT), progressive adaptive routing, piggyback routing (PB), and reservation routing (RES).
Abstract: Recently proposed high-radix interconnection networks [10] require global adaptive routing to achieve optimum performance. Existing direct adaptive routing methods are slow to sense congestion remote from the source router and hence misroute many packets before such congestion is detected. This paper introduces indirect global adaptive routing (IAR) in which the adaptive routing decision uses information that is not directly available at the source router. We describe four IAR routing methods: credit round trip (CRT) [10], progressive adaptive routing (PAR), piggyback routing (PB), and reservation routing (RES). We evaluate each of these methods on the dragonfly topology under both steady-state and transient loads. Our results show that PB, PAR, and CRT all achieve good performance. PB provides the best absolute performance, with 2-7% lower latency on steady-state uniform random traffic at 70% load, while PAR provides the fastest response on transient loads. We also evaluate the implementation costs of the indirect adaptive routing methods and show that PB has the lowest implementation cost requiring