EBookClubs

Read Books & Download eBooks Full Online

EBookClubs

Read Books & Download eBooks Full Online

Book Trust Management and Security Analysis of Opportunistic Routing Protocols in Multihop Wireless Networks

Download or read book Trust Management and Security Analysis of Opportunistic Routing Protocols in Multihop Wireless Networks written by Mahmood Salehi and published by . This book was released on 2017 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Book Opportunistic Routing in Multihop Wireless Networks

Download or read book Opportunistic Routing in Multihop Wireless Networks written by Kai Zeng and published by . This book was released on 2008 with total page 402 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Book Security for Multihop Wireless Networks

Download or read book Security for Multihop Wireless Networks written by Shafiullah Khan and published by CRC Press. This book was released on 2014-04-15 with total page 518 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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

Book Performance Analysis and Protocol Design of Opportunistic Routing in Multi hop Wireless Networks

Download or read book Performance Analysis and Protocol Design of Opportunistic Routing in Multi hop Wireless Networks written by Chun Pong Luk and published by . This book was released on 2008 with total page 250 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Book Secure Routing in Multi Hop Wireless Networks

Download or read book Secure Routing in Multi Hop Wireless Networks written by Gergely Acs and published by LAP Lambert Academic Publishing. This book was released on 2010-08 with total page 116 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Book Performance Evaluation of Opportunistic Routing Protocols for Multi hop Wireless Networks

Download or read book Performance Evaluation of Opportunistic Routing Protocols for Multi hop Wireless Networks written by Sergio Rolando Guercin and published by . This book was released on 2019 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: Nowadays, Opportunistic Routing (OR) is widely considered to be the most important paradigm for Multi-hop wireless networks (MWNs). It exploits the broadcast nature of wireless medium to propagate information from one point to another within the network. In OR scheme, when a node has new information to share, it rst needs to set its forwarding list which include the IDs and/or any relevant information to its best suited neighboring nodes. This operation is supported by the use of appropriate metrics. Then, it executes a coordination algorithm allowing transmission reliability and high throughput among the next-hop forwarders. In this paper, we provide a comprehensive guide to understand the characteristics and challenges faced in the area of opportunistic routing protocols in MWNs. Moreover, since the planet we live on is largely covered by water, OR protocols have gained much attention during the last decade in real-time aquatic applications, such as oil/chemical spill monitoring, ocean resource management, anti-submarine missions and so on. One of the major problems in Underwater Wireless Sensor Network (UWSNs) is determining an e cient and reliable routing methodology between the source node and the destination node. Therefore, designing e cient and robust routing protocols for UWSNs became an attractive topic for researchers. This paper seeks to address in detail the key factors of underwater sensor network. Furthermore, it calls into question 5 state-of-the-art routing protocols proposed for UWSN: The Depth-Based Routing protocol (DBR), the Energy-E cient Depth-Based Routing protocol (EEDBR), the Hydraulic-pressure-based anycast routing protocol (Hydrocast), the Geographic and opportunistic routing protocol with Depth Adjustment for mobile underwater sensor networks (GEDAR), and the Void- Aware Pressure Routing for underwater sensor networks (VAPR). Finally, it covers the performance of those protocol through the use of the R programming language.

Book Rate Adaptive Opportunistic Routing in Multi hop Wireless Networks

Download or read book Rate Adaptive Opportunistic Routing in Multi hop Wireless Networks written by Shriniwas B. Kulkarni and published by . This book was released on 2008 with total page 124 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Book Multi hop Routing for Wireless Mesh Networks

Download or read book Multi hop Routing for Wireless Mesh Networks written by Abhijeet Bhorkar and published by . This book was released on 2012 with total page 138 pages. Available in PDF, EPUB and Kindle. Book excerpt: Wireless Mesh networks have the potential to provide inexpensive and quick access to the internet for military communications, surveillance, education, healthcare and disaster management. This work caters to the growing high-bandwidth demands by providing low delay and high throughput by designing efficient, robust routing algorithms for wireless mesh networks. Chapters 2 and 3 of this dissertation describe adaptive routing algorithms that opportunistically route the packets in the absence of reliable knowledge about channel statistics and the network model. We design two adaptive routing algorithms, Distributed Opportunistic Routing (d-AdaptOR) and No Regret Routing (NRR), which minimize the expected number of transmissions and thus improving the throughput. The remainder of the dissertation concerns with the design routing algorithms to avoid congestion in the network. In Chapter 4, we describe a Distributed Opportunistic Routing algorithm with Congestion Diversity (ORCD) which employs receiver diversity and minimizes end-end delay. In Chapter 5, we present the Congestion Diversity Protocol (CDP), a distributed routing protocol for 802.11-based multi-hop wireless networks that combines important aspects of shortest-path and back-pressure routing to achieve improved end-end delay performance. This work reports on a practical (hardware and software) implementation of CDP in an indoor Wi-Fi testbed.

Book MAC and Routing Protocols for Multi hop Wireless Networks

Download or read book MAC and Routing Protocols for Multi hop Wireless Networks written by Chih-Yuan Liao and published by . This book was released on 2004 with total page 51 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "Wireless systems for industry have mostly used cellular-phone-style radio links, using point-to-point or point-to-multipoint transmission. Past research has indicated that these network architectures are not suitable for several industrial applications because of their rigid structure, meticulous planning requirements, and dropped signals. In contrast, wireless mesh networks are multi-hop systems in which devices assist each other in transmitting packets through the network, and they provide a reliable, flexible system that can be extended to thousands of devices. Some inherent advantages with mesh networks are scalability, non line-of-sight communications, high data rates, and low-cost deployment. Mesh networks have been deployed by MIT researchers and a few companies on a small scale. Mesh networks have not been deployed widely, in part because of some fundamental problems with the current protocols with regards to QoS support and scalability. To meet these requirements, the MAC protocol should be able to guarantee near constant capacity for networks of different sizes, and the routing protocol should perform admission control. Current CSMA-based MAC protocols have been shown to perform inadequately in terms of throughput and scalability in multi-hop deployments. The key problem with using protocols like IEEE 802.11 is that the link throughput is affected severely due to the exposed terminal problem, uncoordinated contentions, and wasteful backoffs. With the 802.11 MAC protocol, our results show that the capacity falls to about 1/10th for a chain and below 1/20th for a grid with horizontal constant bit rate flows. We have developed the WisperNet MAC and routing protocols, which provide end-to-end QoS guarantees over a multi-hop mesh network. By exploiting the topology information and the fact that fixed wireless nodes separated by 3 hops or more can transmit simultaneously, we eliminate collisions and maximize network utilization. The WisperNet routing protocol performs admission control. We show that the WisperNet MAC protocol can guarantee up to 9 times more capacity than IEEE 802.11, and this capacity remains nearly constant as the network grows. Also included is a performance analysis of different routing policies, and their effect on network utilization."

Book Opportunistic Routing and Network Coding in Multi hop Wireless Mesh Networks

Download or read book Opportunistic Routing and Network Coding in Multi hop Wireless Mesh Networks written by Chen Zhang and published by . This book was released on 2018 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: The rapid advancements in communication and networking technologies boost the capacity of wireless networks. Multi-hop wireless networks are extremely exciting and rapidly developing areas and have been receiving an increasing amount of attention by researchers. Due to the limited transmission range of the nodes, end-to-end nodes may situate beyond direct radio transmission ranges. Intermediate nodes are required to forward data in order to enable the communication between nodes that are far apart. Routing in such networks is a critical issue. Opportunistic routing has been proposed to increase the network performance by utilizing the broadcast nature of wireless media. Unlike traditional routing, the forwarder in opportunistic routing broadcasts date packets before the selection of the next hop. Therefore, opportunistic routing can consider multiple downstream nodes as potential candidate nodes to forward data packets instead of using a dedicated next hop. Instead of simply forwarding received packets, network coding allows intermediate nodes to combine all received packets into one or more coded packets. It can further improve network throughput by increasing the transmission robustness and efficiency. In this dissertation, we will study the fundamental components, related issues and associated challenges about opportunistic routing and network coding in multi-hop wireless networks. Firstly, we focus on the performance analysis of opportunistic routing by the Discrete Time Markov Chain (DTMC). Our study demonstrates how to map packet transmissions in the network with state transitions in a Markov chain. We will consider pipelined data transfer and evaluate opportunistic routing in different wireless networks in terms of expected number of transmissions and time slots. Secondly, we will propose a regional forwarding schedule to optimize the coordination of opportunistic routing. In our coordination algorithm, the forwarding schedule is limited to the range of the transmitting node rather than among the entire set of forwarders. With such an algorithm, our proposal can increase the throughput by deeper pipelined transmissions. Thirdly, we will propose a mechanism to support TCP with opportunistic routing and network coding, which are rarely incorporated with TCP because the frequent occurrences of out-of-order arrivals in opportunistic routing and long decoding delay in network coding overpower TCP congestion control. Our solution completes the control feedback loop of TCP by creating a bridge between the sender and the receiver. The simulation result shows that our protocol significantly outperforms TCP/IP in terms of network throughput in different topologies of wireless networks.

Book Opportunistic Routing in Wireless Networks

Download or read book Opportunistic Routing in Wireless Networks written by Tara Javidi and published by . This book was released on 2016 with total page 137 pages. Available in PDF, EPUB and Kindle. Book excerpt: Wireless multi-hop networks have become an important part of many modern communication systems. Opportunistic routing aims to overcome the deficiencies of conventional routing on wireless multi-hop networks, by specifically utilizing wireless broadcast opportunities and receiver diversity. Opportunistic routing algorithms, which are specifically optimized to incorporate into the routing decisions a model of wireless transmission, take advantage of scheduling, multi-user, and receiver diversity gains and result in significant reduction in the expected cost of routing per packet. The ability of the algorithm to take advantage of the aspects of wireless transmission, however, depends on the scalability and the additional overhead associated with the opportunistic routing as well as the availability of side information regarding wireless channel statistics, topology, etc. This monograph sheds light on the performance gains associated with incorporating into the routing strategy the nature of wireless transmission. This monograph first provides an overview of various opportunistic distance-vector algorithms that have been developed to incorporate wireless transmission and routing opportunities. Furthermore, an optimal opportunistic distance metric is proposed whose performance is examined against the performance of several routing algorithms from the literature. The performance is examined first in analytical examples, then via simulation to identify the strengths of the optimal opportunist routing algorithm. To allow for a scalable and distributed solution, the distributed computation of this optimal distance-metric is provided. The performance of a distributed implementation of the optimal opportunistic routing algorithm is also examined via simulation. In addition to the construction of the opportunistic schemes in centralized and distributed fashions, this monograph also addresses how learning the wireless medium can be efficiently incorporated in the structure of routing algorithm. Finally, this monograph examines the dynamic congestion-based distance metric and its performance against other congestion aware solutions in the literature.

Book Security for Multihop Wireless Networks

Download or read book Security for Multihop Wireless Networks written by Shafiullah Khan and published by CRC Press. This book was released on 2014-04-15 with total page 540 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Book Proceedings of ICRIC 2019

Download or read book Proceedings of ICRIC 2019 written by Pradeep Kumar Singh and published by Springer Nature. This book was released on 2019-11-21 with total page 897 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book presents high-quality, original contributions (both theoretical and experimental) on software engineering, cloud computing, computer networks & internet technologies, artificial intelligence, information security, and database and distributed computing. It gathers papers presented at ICRIC 2019, the 2nd International Conference on Recent Innovations in Computing, which was held in Jammu, India, in March 2019. This conference series represents a targeted response to the growing need for research that reports on and assesses the practical implications of IoT and network technologies, AI and machine learning, cloud-based e-Learning and big data, security and privacy, image processing and computer vision, and next-generation computing technologies.

Book Internet of Things and Analytics for Agriculture  Volume 2

Download or read book Internet of Things and Analytics for Agriculture Volume 2 written by Prasant Kumar Pattnaik and published by Springer Nature. This book was released on 2019-10-24 with total page 288 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book addresses major challenges faced by farmers and the technological solutions based on Internet of Things (IoT). A major challenge in agriculture is cultivating and supplying high-quality produce at the best. Currently, around 50% of global farm produce never reaches the end consumer due to wastage and suboptimal prices. The book presents solutions that reduce the transport costs, improve the predictability of prices based on data analytics and the current market conditions, and reduce the number of middle steps and agents between the farmer and the end consumer. It discusses the design of an IoT-based monitoring system to analyze crop environments and a method to improve the efficiency of decision-making by analyzing harvest statistics. Further, it explores climate-smart methods, known as smart agriculture, that have been adopted by a number of Indian farmers.

Book Future Intent Based Networking

Download or read book Future Intent Based Networking written by Mikhailo Klymash and published by Springer Nature. This book was released on 2021-12-09 with total page 531 pages. Available in PDF, EPUB and Kindle. Book excerpt: So-called Intent-Based Networking (IBN) is founded on well-known SDN (Software-Defined Networking) and represents one of the most important emerging network infrastructure opportunities. The IBN is the beginning of a new era in the history of networking, where the network itself translates business intentions into appropriate network configurations for all devices. This minimizes manual effort, provides an additional layer of network monitoring, and provides the ability to perform network analytics and take full advantage of machine learning. The centralized, software-defined solution provides process automation and proactive problem solving as well as centralized management of the network infrastructure. With software-based network management, many operations can be performed automatically using intelligent control algorithms (artificial intelligence and machine learning). As a result, network operation costs, application response times and energy consumption are reduced, network reliability and performance are improved, network security and flexibility are enhanced. This will be a benefit for existing networks as well as evolved LTE-based mobile networks, emerging Internet of Things (IoT), Cloud systems, and soon for the future 5G/6G networks. The future networks will reach a whole new level of self-awareness, self-configuration, self-optimization, self-recovery and self-protection. This volume consists of 28 chapters, based on recent research on IBN.The volume is a collection of the most important research for the future intent-based networking deployment provided by different groups of researchers from Ukraine, Germany, Slovak Republic, Switzerland, South Korea, China, Czech Republic, Poland, Brazil, Belarus and Israel. The authors of the chapters from this collection present in depth extended research results in their scientific fields.The presented contents are highly interesting while still being rather practically oriented and straightforward to understand. Herewith we would like to wish all our readers a lot of inspiration by studying of the volume!

Book Trusted Computing and Information Security

Download or read book Trusted Computing and Information Security written by Huanguo Zhang and published by Springer. This book was released on 2019-01-08 with total page 410 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the Chinese Conference on Trusted Computing and Information Security, CTCIS 2018, held in Wuhan, China, in October 2018. The 24 revised full papers presented were carefully reviewed and selected from 73 submissions. The papers are centered around cryptography, systems security, trusted computing, information security, and network security.