EBookClubs

Read Books & Download eBooks Full Online

EBookClubs

Read Books & Download eBooks Full Online

Book Efficient Routing Algorithm for Delay Tolerant Networks

Download or read book Efficient Routing Algorithm for Delay Tolerant Networks written by Mehul Shah and published by LAP Lambert Academic Publishing. This book was released on 2014-10-08 with total page 76 pages. Available in PDF, EPUB and Kindle. Book excerpt: A Delay Tolerant Networks (DTNs), also known as intermittently connected wireless mobile networks, works effectively at the time of discontinuous network connectivity between two nodes. A communication network which is capable of storing packets momentarily in intermediate nodes and conveys the packets when end-to-end route is re-established or regenerated is known as a delay tolerant network/ disruption tolerant networks. Many routing protocols have been developed for DTN based on movement pattern of the nodes. In this book we presents a novel routing protocol which exploits mobility characteristics of human walk. We evaluate a novel Human Mobility based Spray & Wait Routing protocol (HMSaW) under human mobility as per Truncated Levy Walk (TLW) mobility model. HMSaW is more efficient compared to existing Spray and Wait routing protocol for mode movements as per human walk. The presented HMSaW protocol perform better in terms of delivery ratio and communication overhead compared to existing spray and wait Routing protocol with marginal reduction in delivery delay. MATLAB code of the presented simulation results are also provided in this book.

Book Design and Implementation of Efficient Routing Protocols in Delay Tolerant Networks

Download or read book Design and Implementation of Efficient Routing Protocols in Delay Tolerant Networks written by Cong Liu and published by . This book was released on 2009 with total page 164 pages. Available in PDF, EPUB and Kindle. Book excerpt: Delay tolerant networks (DTNs) are occasionally-connected networks that may suffer from frequent partitions. DTNs provide service despite long end to end delays or infrequent connectivity. One fundamental problem in DTNs is routing messages from their source to their destination. DTNs differ from the Internet in that disconnections are the norm instead of the exception. Representative DTNs include sensor-based networks using scheduled intermittent connectivity, terrestrial wireless networks that cannot ordinarily maintain end-to-end connectivity, satellite networks with moderate delays and periodic connectivity, underwater acoustic networks with moderate delays and frequent interruptions due to environmental factors, and vehicular networks with cyclic but nondeterministic connectivity. The focus of this dissertation is on routing protocols that send messages in DTNs. When no connected path exists between the source and the destination of the message, other nodes may relay the message to the destination. This dissertation covers routing protocols in DTNs with both deterministic and non-deterministic mobility respectively. In DTNs with deterministic and cyclic mobility, we proposed the first routing protocol that is both scalable and delivery guaranteed. In DTNs with non-deterministic mobility, numerous heuristic protocols are proposed to improve the routing performance. However, none of those can provide a theoretical optimization on a particular performance measurement. In this dissertation, two routing protocols for non-deterministic DTNs are proposed, which minimizes delay and maximizes delivery rate on different scenarios respectively. First, in DTNs with non-deterministic and cyclic mobility, an optimal single-copy forwarding protocol which minimizes delay is proposed. In DTNs with non-deterministic mobility, an optimal multi-copy forwarding protocol is proposed. which maximizes delivery rate under the constraint that the number of copies per message is fixed. Simulation evaluations using both real and synthetic trace are conducted to compare the proposed protocols with the existing ones.

Book Delay Tolerant Networks

    Book Details:
  • Author : Athanasios V. Vasilakos
  • Publisher : CRC Press
  • Release : 2016-04-19
  • ISBN : 1439811121
  • Pages : 362 pages

Download or read book Delay Tolerant Networks written by Athanasios V. Vasilakos and published by CRC Press. This book was released on 2016-04-19 with total page 362 pages. Available in PDF, EPUB and Kindle. Book excerpt: A class of Delay Tolerant Networks (DTN), which may violate one or more of the assumptions regarding the overall performance characteristics of the underlying links in order to achieve smooth operation, is rapidly growing in importance but may not be well served by the current end-to-end TCP/IP model. Delay Tolerant Networks: Protocols and Applicat

Book Designing Efficient Routing Protocols in Delay Tolerant Networks

Download or read book Designing Efficient Routing Protocols in Delay Tolerant Networks written by Yunsheng Wang and published by . This book was released on 2013 with total page 177 pages. Available in PDF, EPUB and Kindle. Book excerpt: This thesis presents the design and evaluation of routing protocols for efficient content delivery and dissemination in delay tolerant networks. With the advancement in technology, the communication devices with wireless interfaces become more and more universal. Delay tolerant networks (DTNs) are characterized by intermittent connectivity and limited network capacity. There exist several different application scenarios: connectivity of developing countries, vehicular DTN road communications, and social contact networks. In this thesis, we explore the characteristics in DTNs, such as mobility pattern, contact history information, and social feature information, to design efficient routing schemes. The research reported in this thesis investigates the technical challenges and their solutions of applying different DTN routing protocols. We design multicast schemes to forward the information to a group of destinations in DTN environment. We extend the delegation forwarding scheme in DTN multicasting. An non-replication multicast tree is also studied in this report. We also apply ticket-based and social-tie-based approaches in content distribution systems. We leverage the users' social feature information to study the hypercube-based routing schemes in social contact networks. We also study the resource management problem in DTNs. We design a joint replication-migration-based scheme to solve the storage congestion. These techniques are evaluated comprehensively in realistic simulation studies, by comparing the performance with state-of-the-art approaches in both synthetic and real traces.

Book Efficient Routing in Delay Tolerant Networks   Analysis and Design

Download or read book Efficient Routing in Delay Tolerant Networks Analysis and Design written by Aysha Al-Hinai and published by . This book was released on 2013 with total page 162 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Book Algorithms and Protocols for Wireless and Mobile Ad Hoc Networks

Download or read book Algorithms and Protocols for Wireless and Mobile Ad Hoc Networks written by Azzedine Boukerche and published by John Wiley & Sons. This book was released on 2008-11-03 with total page 520 pages. Available in PDF, EPUB and Kindle. Book excerpt: Learn the fundamental algorithms and protocols for wireless and mobile ad hoc networks Advances in wireless networking and mobile communication technologies, coupled with the proliferation of portable computers, have led to development efforts for wireless and mobile ad hoc networks. This book focuses on several aspects of wireless ad hoc networks, particularly algorithmic methods and distributed computing with mobility and computation capabilities. It covers everything readers need to build a foundation for the design of future mobile ad hoc networks: Establishing an efficient communication infrastructure Robustness control for network-wide broadcast The taxonomy of routing algorithms Adaptive backbone multicast routing The effect of inference on routing Routing protocols in intermittently connected mobile ad hoc networks and delay tolerant networks Transport layer protocols ACK-thinning techniques for TCP in MANETs Power control protocols Power saving in solar powered WLAN mesh networks Reputation and trust-based systems Vehicular ad hoc networks Cluster interconnection in 802.15.4 beacon enabled networks The book is complemented with a set of exercises that challenge readers to test their understanding of the material. Algorithms and Protocols for Wireless and Mobile Ad Hoc Networks is appropriate as a self-study guide for electrical engineers, computer engineers, network engineers, and computer science specialists. It also serves as a valuable supplemental textbook in computer science, electrical engineering, and network engineering courses at the advanced undergraduate and graduate levels.

Book Social Networking and Computational Intelligence

Download or read book Social Networking and Computational Intelligence written by Rajesh Kumar Shukla and published by Springer Nature. This book was released on 2020-03-21 with total page 789 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book presents a selection of revised and extended versions of the best papers from the First International Conference on Social Networking and Computational Intelligence (SCI-2018), held in Bhopal, India, from October 5 to 6, 2018. It discusses recent advances in scientific developments and applications in these areas.

Book Routing in Opportunistic Networks

Download or read book Routing in Opportunistic Networks written by Isaac Woungang and published by Springer Science & Business Media. This book was released on 2013-09-10 with total page 421 pages. Available in PDF, EPUB and Kindle. Book excerpt: Routing in Opportunistic Networks focuses on the basics of opportunistic networks, modeling and communication in opportunistic networks, routing in opportunistic networks, and collaboration and cooperation in opportunistic networks. The editors will cover such topics as mobility characterization and discovery in opportunistic networks, scheduling and medium access control in opportunistic networks as well as testbed, tools, and measurements for opportunistic networks.

Book Advances in Delay Tolerant Networks  DTNs

Download or read book Advances in Delay Tolerant Networks DTNs written by Joel J.P.C. Rodrigues and published by Woodhead Publishing. This book was released on 2020-11-20 with total page 324 pages. Available in PDF, EPUB and Kindle. Book excerpt: Advances in Delay-Tolerant Networks: Architecture and Enhanced Performance, Second Edition provides an important overview of delay-tolerant networks (DTNs) for researchers in electronics, computer engineering, telecommunications and networking for those in academia and R&D in industrial sectors. Part I reviews the technology involved and the prospects for improving performance, including different types of DTN and their applications, such as satellite and deep-space communications and vehicular communications. Part II focuses on how the technology can be further improved, addressing topics, such as data bundling, opportunistic routing, reliable data streaming, and the potential for rapid selection and dissemination of urgent messages. Opportunistic, delay-tolerant networks address the problem of intermittent connectivity in a network where there are long delays between sending and receiving messages, or there are periods of disconnection. Reviews the different types of DTN and shows how they can be applied in satellite and deep-space communications, vehicular communications (including unmanned aerial), and during large-scale disasters Considers security concerns for DTN and potential for rapid selection and dissemination of urgent messages Reviews the breadth of areas in which DTN is already providing solutions Covers the prospects for DTN's wider adoption and development of standards

Book Opportunistic Networks

Download or read book Opportunistic Networks written by Anshul Verma and published by CRC Press. This book was released on 2021-08-19 with total page 409 pages. Available in PDF, EPUB and Kindle. Book excerpt: The opportunistic network is an emerging and recent area of research. To make this research area more adaptable for practical and industrial use, there is a need to further investigate several research challenges in all aspects of opportunistic networks. Therefore, Opportunistic Networks: Fundamentals, Applications and Emerging Trends provides theoretical, algorithmic, simulation, and implementation-based research developments related to fundamentals, applications, and emerging research trends in opportunistic networks. The book follows a theoretical approach to describe fundamentals to beginners and incorporates a practical approach depicting the implementation of real-life applications to intermediate and advanced readers. This book is beneficial for academicians, researchers, developers, and engineers who work in or are interested in the fields related to opportunistic networks, delay tolerant networks, and intermittently connected ad hoc networks. This book also serves as a reference book for graduate and postgraduate courses in computer science, computer engineering, and information technology streams.

Book Flows in Networks

    Book Details:
  • Author : Lester Randolph Ford (Jr.)
  • Publisher :
  • Release : 1974
  • ISBN :
  • Pages : 194 pages

Download or read book Flows in Networks written by Lester Randolph Ford (Jr.) and published by . This book was released on 1974 with total page 194 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Book Network Routing

    Book Details:
  • Author :
  • Publisher : Elsevier
  • Release : 2010-07-19
  • ISBN : 0080474977
  • Pages : 958 pages

Download or read book Network Routing written by and published by Elsevier. This book was released on 2010-07-19 with total page 958 pages. Available in PDF, EPUB and Kindle. Book excerpt: Network routing can be broadly categorized into Internet routing, PSTN routing, and telecommunication transport network routing. This book systematically considers these routing paradigms, as well as their interoperability. The authors discuss how algorithms, protocols, analysis, and operational deployment impact these approaches. A unique feature of the book is consideration of both macro-state and micro-state in routing; that is, how routing is accomplished at the level of networks and how routers or switches are designed to enable efficient routing. In reading this book, one will learn about 1) the evolution of network routing, 2) the role of IP and E.164 addressing in routing, 3) the impact on router and switching architectures and their design, 4) deployment of network routing protocols, 5) the role of traffic engineering in routing, and 6) lessons learned from implementation and operational experience. This book explores the strengths and weaknesses that should be considered during deployment of future routing schemes as well as actual implementation of these schemes. It allows the reader to understand how different routing strategies work and are employed and the connection between them. This is accomplished in part by the authors' use of numerous real-world examples to bring the material alive. Bridges the gap between theory and practice in network routing, including the fine points of implementation and operational experience Routing in a multitude of technologies discussed in practical detail, including, IP/MPLS, PSTN, and optical networking Routing protocols such as OSPF, IS-IS, BGP presented in detail A detailed coverage of various router and switch architectures A comprehensive discussion about algorithms on IP-lookup and packet classification Accessible to a wide audience due to its vendor-neutral approach

Book Proceedings of ICETIT 2019

Download or read book Proceedings of ICETIT 2019 written by Pradeep Kumar Singh and published by Springer Nature. This book was released on 2019-09-23 with total page 1144 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book presents high-quality, original contributions (both theoretical and experimental) on Information Security, Machine Learning, Data Mining and Internet of Things (IoT). It gathers papers presented at ICETIT 2019, the 1st International Conference on Emerging Trends in Information Technology, which was held in Delhi, India, in June 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, data analytics and cloud computing, security and privacy, and next generation computing technologies.

Book Design and Performance Analysis of Opportunistic Routing Protocols for Delay Tolerant Networks

Download or read book Design and Performance Analysis of Opportunistic Routing Protocols for Delay Tolerant Networks written by Tamer Abdel-kader and published by . This book was released on 2012 with total page 122 pages. Available in PDF, EPUB and Kindle. Book excerpt: Delay Tolerant Networks (DTNs) are characterized by the lack of continuous end-to-end connections because of node mobility, constrained power sources, and limited data storage space of some or all of its nodes. Applications of DTNs include vehicular networks and sensor networks in suburban and rural areas. The intermittent connection in DTNs creates a new and challenging environment that has not been tackled before in wireless and wired networks. Traditional routing protocols fail to deliver data packets because they assume the existence of continuous end-to-end connections. To overcome the frequent disconnections, a DTN node is required to store data packets for long periods of time until it becomes in the communication range of other nodes. In addition, to increase the delivery probability, a DTN node spreads multiple copies of the same packet on the network so that one of the copies reaches the destination. Given the limited storage and energy resources of DTN nodes, there is a trade off between maximizing delivery and minimizing storage and energy consumption. DTN routing protocols can be classified as either blind routing, in which no information is provided to select the next node in the path, or guided routing, in which some network information is used to guide data packets to their destinations. In addition they differ in the amount of overhead they impose on the network and its nodes. The objective of DTN routing protocols is to deliver as many packets as possible. Acquiring network information helps in maximizing packet delivery probability and minimizing the network overhead resulting from replicating many packet copies. Network information could be node contact times and durations, node buffer capacities, packet lifetimes, and many others. The more information acquired, the higher performance could be achieved. However, the cost of acquiring the network information in terms of delay and storage could be high to the degree that render the protocol impractical. In designing a DTN routing protocol, the trade-off between the benefits of acquiring information and its costs should be considered. In this thesis, we study the routing problem in DTN with limited resources. Our objective is to design and implement routing protocols that effectively handles the intermittent connection in DTNs to achieve high packet delivery ratios with lower delivery cost.

Book A Reinforcement Learning Network based Novel Adaptive Routing Algorithm for Wireless Ad Hoc Network

Download or read book A Reinforcement Learning Network based Novel Adaptive Routing Algorithm for Wireless Ad Hoc Network written by Jagrut Solanki and published by GRIN Verlag. This book was released on 2015-02-24 with total page 11 pages. Available in PDF, EPUB and Kindle. Book excerpt: Scientific Essay from the year 2015 in the subject Engineering - Communication Technology, , language: English, abstract: Mobile communication has enjoyed an incredible rise in quality throughout the last decade. Network dependability is most important concern in wireless Ad-hoc network. a serious challenge that lies in MANET (Mobile Ad-hoc network) is that the unlimited mobility and lots of frequent failure because of link breakage. Standard routing algorithms are insufficient for Ad-hoc networks. as a results of major drawback in MANET is limited power provide, dynamic networking. In MANET each node works as a router and autonomously performs mobile practicality. The link connectivity changes ceaselessly because of mobility to reflect this routing information additionally needs to get changed ceaselessly. AODV protocol is projected for this extraordinarily mobile network. In ancient AODV if any node fails in middle of transmission the method starts from the source node but in our propose scheme the transmission starts from the closest neighbor node therefore shows very important reduction in delay and improvement in packet delivery ratio are achieved. It also reduces the routing overhead by reducing the frequency of route discovery process.

Book Social context Based Routing and Security in Delay Tolerant Networks

Download or read book Social context Based Routing and Security in Delay Tolerant Networks written by Roy Alan Cabaniss and published by . This book was released on 2013 with total page 166 pages. Available in PDF, EPUB and Kindle. Book excerpt: "Delay Tolerant Networks (DTNs) were originally intended for interplanetary communications and have been applied to a series of difficult environments: wireless sensor networks, unmanned aerial vehicles, and short-range personal communications. There is a class of such environments in which nodes follow semi-predictable social patterns, such as wildlife tracking or personal devices. This work introduces a series of algorithms designed to identify the social patterns present in these environments and apply this data to difficult problems, such as efficient message routing and content distribution. Security is also difficult in a mobile environment. This is especially the case in the event that a large portion of the network is unreliable, or simply unknown. As the network size increases nodes have difficulty in securely distributing keys, especially using low powered nodes with limited keyspace. A series of multi-party security algorithms were designed to securely transmit a message in the event that the sender does not have access to the destinations public key. Messages are routed through a series of nodes, each of which partially decrypts the message. By encrypting for several proxies, the message can only be intercepted if all those nodes have been compromised. Even a highly compromised network has increased security using this algorithm, with a trade-off of reduced delivery ratio and increased delivery time"--Abstract, page iv.

Book Towards Efficient Content Dissemination Over Disruption Tolerant Networks

Download or read book Towards Efficient Content Dissemination Over Disruption Tolerant Networks written by Amir Krifa and published by . This book was released on 2012 with total page 246 pages. Available in PDF, EPUB and Kindle. Book excerpt: The rapid proliferation of advanced mobile devices has created a growing demand for data content. Existing approaches cannot keep up with the large volume of content generated and requested, without the deployment of new expensive infrastructure. Exchanging content of interest opportunistically, when two nodes are in range, presents a low cost and high bandwidth alternative for popular, bulky content? Yet, efficiently collecting, storing, and sharing the content while preventing selfish users from impairing collaborative ones, poses major challenges. In this thesis, we start by discussing the state of the art in terms of proposed solutions for both point-to-point content routing and point-to-multipoint content sharing solutions in DTN(s) (Delay Tolerant Network). Our main observations were i) despite a large amount of effort invested in the design of efficient routing protocols for DTN, there has not been a similar focus on storage management and scheduling policies, and (ii) in addition to dealing with the resources management challenges, distributed (or peer-to-peer) content sharing systems over non-altruistic mobile devices have one more important issue to deal with : to ensure enough nodes collaborate to make the system interesting to participants. This latter goal is often conflicting with optimal resources management policies. Following this preliminary study, we try to solve the highlighted problems in their foundations. We focus furst on the problem of optimal resource management in the context point-to-point content routing through a DTN. This problem was first studied in scenarios related to environment and habitat monitoring based on sensor networks, in project willing to connect rural villages, and even in scenarios related to space technologies based on DTN protocols. We propose a practical and efficient joint scheduling and drop policy that can optimize different performance metrics, such as average delay and delivery probability. We first use the theory of encounter-based message dissemination to derive the optimal policy based on global knowledge about the network (GBSD, Global knowledge Based Scheduling and Drop). Then, we introduce a method that estimates all necessary parameters using locally collected statistics. Based on this, we derive a distributed scheduling and drop policy that can approximate the performance of the optimal policy in practice (HBSD, History Based Scheduling and Drop). Finally, we study how sample statistics can reduce the signaling overhead of our algorithm and examine its behavior under different congestion regimes. In a second effort, we revisit the problem of optimal resource management in the context of large scale interests-driven content sharing over non-altruistic mobile devices. Our ultimate goal is to enable people, through channel based architecture to express their interests, head out in the real world and wait to get notified whenever a content that matches their interests is retrieved. To achieve this, we propose Mobi'Trade as candidate architecture. Mobi'Trade is a utility driven trading system for efficient content sharing on top of a DTN. It does not only take care of the network and device resources, but also carefully considers : (i) the propagation of interests of participating users, (ii) the matching of these interests to individual node mobility patterns, and (iii) the willingness of involved users to collaborate. While simple tit-for-tat (TFT) mechanisms can force nodes to give one to get one, dealing with the inherent tendency of peers to take much but give back little, they can quickly lead to deadlocks when some (or most) of interesting content must be somehow fetched across the network. To resolve this, Mobi'Trade relies on a trading mechanism that allows a node merchant to buy, store and carry content for other nodes (its clients) so that it can later trade it for content it is personally interested in. To exploit this extra degree of freedom, Mobi'Trade nodes continuously profile the type of content requested and the collaboration level of encountered devices. An appropriate utilily function is then used to collect n optimal inventory that maximizes the expected value of stored content for future encounters, matched to the observed mobility patterns, interest patterns, and collaboration levels of encountered nodes. Both of resources management solutions for point-to-point DTN routing (HBSD) and our channel base content sharing architecture (Mobi'Trade) have been validated respectively through extensive NS-2 and NS-3 simulations along with a multitude of synthetic mobility models and real mobility traces. Furthermore, in order to ensure the feasibility of our protocols and offer them to users, we implemented respectively HBSD and Mobi'Trade for the DTN2 reference architecture and on real Android powered mobile devices and did further experiment in real environments.