Download Free Secure Routing In Multi Hop Wireless Networks Book in PDF and EPUB Free Download. You can read online Secure Routing In Multi Hop Wireless Networks and write the review.

Routing is a fundamental networking function in every communication system, and multi-hop wireless networks are no exceptions. Attacking the routing service, an adversary can easily paralyse the operation of an entire network. The malicious manipulation of some routing messages results in the dissemination of incorrect routing information which can eventually lead to network malfunction. Even more, intermediate nodes can be corrupted, and thus, exhibit arbitrary behavior. Due to the subtle nature of attacks against routing protocols, informal reasoning about wireless routing security is an error-prone method. In this work, I develop a formal framework in which precise definitions of secure routing can be given, and secure routing protocols proposed for multi-hop wireless networks can be rigorously analysed. I demonstrate the usefulness of this framework in two ways: first, I prove the security of several existing routing protocols. Second, applying the design principles that were identified during the analyses, I propose novel routing protocols for wireless ad hoc and sensor networks and I prove that they are secure in my model.
This Springer Brief discusses efficient security protocols and schemes for multi-hop wireless networks. It presents an overview of security requirements for these networks, explores challenges in securing networks and presents system models. The authors introduce mechanisms to reduce the overhead and identify malicious nodes that drop packets intentionally. Also included is a new, efficient cooperation incentive scheme to stimulate the selfish nodes to relay information packets and enforce fairness. Many examples are provided, along with predictions for future directions of the field. Security for Multi-hop Wireless Networks demonstrates recent research that enhances the efficiency and safety of these key networks. Concise and practical, it is a useful tool for researchers and professionals working in network security. It is also a valuable resource for advanced-level students interested in wireless communications and networking.
Security for Multihop Wireless Networks provides broad coverage of the security issues facing multihop wireless networks. Presenting the work of a different group of expert contributors in each chapter, it explores security in mobile ad hoc networks, wireless sensor networks, wireless mesh networks, and personal area networks. Detailing technologies and processes that can help you secure your wireless networks, the book covers cryptographic coprocessors, encryption, authentication, key management, attacks and countermeasures, secure routing, secure medium access control, intrusion detection, epidemics, security performance analysis, and security issues in applications. It identifies vulnerabilities in the physical, MAC, network, transport, and application layers and details proven methods for strengthening security mechanisms in each layer. The text explains how to deal with black hole attacks in mobile ad hoc networks and describes how to detect misbehaving nodes in vehicular ad hoc networks. It identifies a pragmatic and energy efficient security layer for wireless sensor networks and covers the taxonomy of security protocols for wireless sensor communications. Exploring recent trends in the research and development of multihop network security, the book outlines possible defenses against packet-dropping attacks in wireless multihop ad hoc networks.Complete with expectations for the future in related areas, this is an ideal reference for researchers, industry professionals, and academics. Its comprehensive coverage also makes it suitable for use as a textbook in graduate-level electrical engineering programs.
Doctoral Thesis / Dissertation from the year 2011 in the subject Computer Science - Internet, New Technologies, Lille 1 University (Laboratoire d'Informatique Fondamentale de Lille), course: Security in Wireless Multi-hop Networks, language: English, abstract: While the rapid proliferation of mobile devices along with the tremendous growth of various applications using wireless multi-hop networks have significantly facilitate our human life, securing and ensuring high quality services of these networks are still a primary concern. In particular, anomalous protocol operation in wireless multi-hop networks has recently received considerable attention in the research community. These relevant security issues are fundamentally different from those of wireline networks due to the special characteristics of wireless multi-hop networks, such as the limited energy resources and the lack of centralized control. These issues are extremely hard to cope with due to the absence of trust relationships between the nodes. To enhance security in wireless multi-hop networks, this dissertation addresses both MAC and routing layers misbehaviors issues, with main focuses on thwarting black hole attack in proactive routing protocols like OLSR, and greedy behavior in IEEE 802.11 MAC protocol. Our contributions are briefly summarized as follows. As for black hole attack, we analyze two types of attack scenarios: one is launched at routing layer, and the other is cross layer. We then provide comprehensive analysis on the consequences of this attack and propose effective countermeasures. As for MAC layer misbehavior, we particularly study the adaptive greedy behavior in the context of Wireless Mesh Networks (WMNs) and propose FLSAC (Fuzzy Logic based scheme to Struggle against Adaptive Cheaters) to cope with it. A new characterization of the greedy behavior in Mobile Ad Hoc Networks (MANETs) is also introduced. Finally, we design a new backoff scheme to quickly detect the greedy nodes that
This book provides an introduction to opportunistic routing an emerging technology designed to improve the packet forwarding reliability, network capacity and energy efficiency of multihop wireless networks This book presents a comprehensive background to the technological challenges lying behind opportunistic routing. The authors cover many fundamental research issues for this new concept, including the basic principles, performance limit and performance improvement of opportunistic routing compared to traditional routing, energy efficiency and distributed opportunistic routing protocol design, geographic opportunistic routing, opportunistic broadcasting, and security issues associated with opportunistic routing, etc. Furthermore, the authors discuss technologies such as multi-rate, multi-channel, multi-radio wireless communications, energy detection, channel measurement, etc. The book brings together all the new results on this topic in a systematic, coherent and unified presentation and provides a much needed comprehensive introduction to this topic. Key Features: Addresses opportunistic routing, an emerging technology designed to improve the packet forwarding reliability, network capacity and energy efficiency of multihop wireless networks Discusses the technological challenges lying behind this new technology, and covers a wide range of practical implementation issues Explores many fundamental research issues for this new concept, including the basic principles of opportunistic routing, performance limits and performance improvement, and compares them to traditional routing (e.g. energy efficiency and distributed opportunistic routing protocol design, broadcasting, and security issues) Covers technologies such as multi-rate, multi-channel, multi-radio wireless communications, energy detection, channel measurement, etc. This book provides an invaluable reference for researchers working in the field of wireless networks and wireless communications, and Wireless professionals. Graduate students will also find this book of interest.
The focus of this brief is to identify what unifies and what distinguishes the routing functions in four wireless multi-hop network paradigms. The brief introduces a generic routing model that can be used as a foundation of wireless multi-hop routing protocol analysis and design. It demonstrates that such model can be adopted by any wireless multi-hop routing protocol. Also presented is a glimpse of the ideal wireless multi-hop routing protocol along with several open issues.
With the advance of wireless networks, building reliable and secured network connections is becoming extremely important. On the other hand, ad hoc networks become especially important and have many useful applications. The primary focus of this book is to present these two hot and rapidly evolving areas in wireless networks. Security and scheduling/routing in wireless networks remain challenging research problems due to the complexity involved. How to develop more efficient and reliable wireless networks remains a hot research area. It is this realisation that has motivated the editing of this book. The goal of the book is to serve as a reference for both security in wireless networks and channel access, scheduling, and routing in ad hoc networks. In this book, the authors review important developments and new strategies for these topics. Important features and limitations of methods and models are identified. Consequently, this book can serve as a useful reference for researchers, educators, graduate students, and practitioners in the field of wireless networks. This book contains 14 invited chapters from prominent researchers working in this area around the world. All of the cha
Abstract: Opportunistic routing (OR) takes advantages of the spatial diversity and broadcast nature of wireless networks to combat the time-varying links by involving multiple neighboring nodes (forwarding candidates) for each packet relay. This dissertation studies the properties, energy efficiency, capacity, throughput, protocol design and security issues about OR in multihop wireless networks. Firstly, we study geographic opportunistic routing (GOR), a variant of OR which makes use of nodes' location information. We identify and prove three important properties of GOR. The first one is on prioritizing the forwarding candidates according to their geographic advancements to the destination. The second one is on choosing the forwarding candidates based on their advancements and link qualities in order to maximize the expected packet advancement (EPA) with different number of forwarding candidates. The third one is on the concavity of the maximum EPA in respect to the number of forwarding candidates. We further propose a local metric, EPA per unit energy consumption, to tradeoff the routing performance and energy efficiency for GOR. Leveraging the proved properties of GOR, we propose two efficient algorithms to select and prioritize forwarding candidates to maximize the local metric. Secondly, capacity is a fundamental issue in multihop wireless networks. We propose a framework to compute the end-to-end throughput bound or capacity of OR in single/multirate systems given OR strategies (candidate selection and prioritization). Taking into account wireless interference and unique properties of OR, we propose a new method of constructing transmission conflict graphs, and we introduce the concept of concurrent transmission sets to allow the proper formulation of the maximum end-to-end throughput problem as a maximum-flow linear programming problem subject to the transmission conflict constraints. We also propose two OR metrics: expected medium time (EMT) and expected advancement rate (EAR), and the corresponding distributed and local rate and candidate set selection schemes, the Least Medium Time OR (LMTOR) and the Multirate Geographic OR (MGOR). We further extend our framework to compute the capacity of OR in multi-radio multi-channel systems with dynamic OR strategies. We study the necessary and sufficient conditions for the schedulability of a traffic demand vector associated with a transmitter to its forwarding candidates in a concurrent transmission set. We further propose an LP approach and a heuristic algorithm to obtain an opportunistic forwarding strategy scheduling that satisfies a traffic demand vector. Our methodology can be used to calculate the end-to-end throughput bound of OR in multi-radio/channel/rate multihop wireless networks, as well as to study the OR behaviors (such as candidate selection and prioritization) under different network configurations. Thirdly, protocol design of OR in a contention-based medium access environment is an important and challenging issue. In order to avoid duplication, we should ensure only the "best" receiver of each packet to forward it in an efficient way. We investigate the existing candidate coordination schemes and propose a "fast slotted acknowledgment" (FSA) to further improve the performance of OR by using a single ACK to coordinate the forwarding candidates with the help of the channel sensing technique. Furthermore, we study the throughput of GOR in multi-rate and single-rate systems. We introduce a framework to analyze the one-hop throughput of GOR, and provide a deeper insight on the trade-off between the benefit (packet advancement, bandwidth, and transmission reliability) and cost (medium time delay) associated with the node collaboration. We propose a local metric named expected one-hop throughput (EOT) to balance the benefit and cost. Finally, packet reception ratio (PRR) has been widely used as an indicator of the link quality in multihop wireless networks. Many routing protocols including OR in wireless networks depend on the PRR information to make routing decision. Providing accurate link quality measurement (LQM) is essential to ensure the right operation of these routing protocols. However, the existing LQM mechanisms are subject to malicious attacks, thus can not guarantee to provide correct link quality information. We analyze the security vulnerabilities in the existing link quality measurement (LQM) mechanisms and propose an efficient broadcast-based secure LQM (SLQM) mechanism, which prevents the malicious attackers from reporting a higher PRR than the actual one. We analyze the security strength and the cost of the proposed mechanism.
Routing in wireless sensor, mobile ad-hoc, and vehicular networks is a crucial operation having significantly attracted scientists' attention during the past years. Opportunistic routing, however, is a novel and promising approach, which is still an ongoing research paradigm. The purpose of opportunistic routing protocols is to increase the reliability of delivering data packets to their destination by utilizing the broadcast nature of wireless networks and selecting a set of nodes, instead of only one, as potential next-hop candidates. Apart from the reliability, security and trustworthiness of communications is also a challenging task. More specifically, almost all traditional and opportunistic routing protocols require cooperation of all network nodes to complete the routing process. However, some nodes in the network may be compromised and avoid collaboration with others due to various selfish or malicious motivations. The focus of this thesis is on modeling security challenges and developing trust-based opportunistic routing protocols. This way, communication between nodes will not only benefit from the reliability of opportunistic routing methods, but also from the security of trust and reputation management schemes. For this purpose, a novel trust-based opportunistic routing protocol is proposed that introduces three different candidate selection metrics known as RTOR, TORDP, and GEOTOR. Such metrics have been designed to address specific characteristics of opportunistic routing protocols. In continue, a watchdog mechanism is proposed to assist nodes in monitoring their candidates, recalculating their trust value, and finally replacing malicious candidates with benign ones. Afterwards, an analytical approach is introduced using Discrete-Time Markov Chain to demonstrate the effect of malicious nodes on different parameters of a wireless network that uses opportunistic routing. In this model, a new method of calculating packet drop ratio is introduced to represent the effect of attackers. The model is then applied on different well-known opportunistic routing protocols and results of the model are verified by simulation. Finally, the proposed analytical model is extended to include a defensive mechanism against adversary nodes. In fact, a packet salvaging mechanism is developed through which backup candidates attempt to save some of the maliciously dropped data packets. Different related network parameters such as delivery ratio, salvage ratio, direct-delivery ratio, etc. are then introduced, calculated, and reported using the introduced model.