Download or read book Algorithm Design and Performance Analysis of Routing in Delay Tolerant Networks written by Yun Teng and published by . This book was released on 2005 with total page 122 pages. Available in PDF, EPUB and Kindle. Book excerpt:
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.
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
Download or read book Routing and Performance Evaluation of Disruption Tolerant Networks written by Mouhamad Ibrahim and published by . This book was released on 2008 with total page 133 pages. Available in PDF, EPUB and Kindle. Book excerpt: The thesis contains two parts. The first part of the thesis focuses on the performance evaluation of routing protocols for disruption tolerant networks (DTNs) when these networks are augmented by fixed relays, termed throwboxes. As a first step, we show through extensive simulations that successive instants of meeting between a throwbox and a mobile node moving according to some random mobility model can be well modelled by a Poisson process. We provide explicit formula for the rate of the Poisson process and we show that this rate depends among others on the spatial stationary probability density function of the mobility model as well as on the probability density function of throwboxes spatial distribution. As a second step, we study the impact of adding throwboxes on the performance of two common routing protocols, namely the epidemic and the multicopy two-hop relay protocols. We develop explicit expressions for the distribution and the mean of the delivery time of a packet, as well as for the number of generated copies. Following that, we propose five routing strategies that rely on the presence of throwboxes to perform packet forwarding. We therefore introduce an analytical framework that is based on a markovian model to compute and to compare analytically diverse performance metrics of these strategies. In the second part of the thesis, we concern ourselves with the design and the evaluation of an adaptive mechanism to enhance the performance of the backoff algorithm of IEEE 802.11 standard. We propose an extension of the backoff algorithm where the objective is to enhance the throughput and the delay performances in the case of high number of active uses.
Download or read book Routing Algorithms in Networks on Chip written by Maurizio Palesi and published by Springer Science & Business Media. This book was released on 2013-10-22 with total page 411 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book provides a single-source reference to routing algorithms for Networks-on-Chip (NoCs), as well as in-depth discussions of advanced solutions applied to current and next generation, many core NoC-based Systems-on-Chip (SoCs). After a basic introduction to the NoC design paradigm and architectures, routing algorithms for NoC architectures are presented and discussed at all abstraction levels, from the algorithmic level to actual implementation. Coverage emphasizes the role played by the routing algorithm and is organized around key problems affecting current and next generation, many-core SoCs. A selection of routing algorithms is included, specifically designed to address key issues faced by designers in the ultra-deep sub-micron (UDSM) era, including performance improvement, power, energy, and thermal issues, fault tolerance and reliability.
Download or read book ACM MSWiM 2006 written by Carla-Fabiani Chiasserini and published by . This book was released on 2006 with total page 412 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Performance Evaluation of Forwarding Algorithms for Generalized Storage Aware Routing Protocols written by Nehal Somani and published by . This book was released on 2012 with total page 41 pages. Available in PDF, EPUB and Kindle. Book excerpt: This thesis presents an investigation of the design and evaluation of the generalized storage aware routing (GSTAR) protocol proposed for use in the MobilityFirst future Internet architecture. The GSTAR protocol uses in-network storage to improve service quality and throughput in wireless access networks with varying radio link quality and/or disconnection. These gains are achieved using a combination of short-term buffering at routers to smooth out fluctuations in path quality along with delay-tolerant storage, to overcome total disconnection of the mobile device. The performance of the GSTAR protocol is evaluated for exemplary wireless access network scenarios using ns-3 based simulation models, and key design parameters are investigated. Each node in GSTAR maintains two kinds of topology information. The intra-partition graph contains information about path quality between nodes in the current partition of the network. The path quality is determined using two metrics: short term and long term expected transmission time (SETT and LETT). Every node compares these two metrics using the store/forward decision threshold and stores the data on finding that the path is degraded with the expectation that it may improve in the future. Inter-partition graph gives a probabilistic view of the connection patterns between nodes in the network. It is used in the event of disconnections or partitions. An ns-3 based simulation model is described which includes nodes with storage, hop-by-hop transport, time-varying wireless channels and mobile users with possible disconnection. The model is used to evaluate different forwarding algorithms in GSTAR. Using a baseline threshold scheme where packets are temporarily stored when SETT> 1.1 * LETT, it is shown that the resulting system achieves performance improvements over the baseline with no storage. The threshold algorithm is studied further to consider adaptive settings based on the moving average and other temporal filters of the SETT sequence. The results show that if link quality fluctuations are random, the moving average scheme works well, while an exponentially weighted moving average is recommended for on-off channels with periodic outages. Simulation results are provided in each case, showing the benefit of adaptive threshold settings over the baseline non-adaptive case considered in earlier work.
Download or read book A Routing Architecture for Delay Tolerant Networks written by Justin Wayne Enderle and published by . This book was released on 2011 with total page 194 pages. Available in PDF, EPUB and Kindle. Book excerpt: As the field of Delay Tolerant Networking continues to expand and receive more attention, a new class of routing algorithms have been proposed that are specifically tailored to perform in a network where no end to end paths between devices are assumed to exist. As the number of proposed routing algorithms has grown, it has become difficult to fully understand their similarities and differences. Although published results clearly show different performance results between algorithms, it can be difficult to pinpoint which of their characteristics are most responsible for their performance differences. This thesis proposes an architectural framework to define the underlying features that Delay Tolerant Network routing algorithms are composed of. Popular routing algorithms from research are discussed and shown to be compositions of the proposed architectural features, thereby validating the architecture itself. The architectural framework is also shown to be a useful guide to developing a modular and configurable simulation platform. Algorithms from literature were implemented as a composition of features, which can easily be modified and combined later to define and implement new algorithms. Better understanding the underlying structure and similarities between different routing algorithm approaches is key to truly analyzing their performance and obtaining a deep understanding of which components of an algorithm have the most influence, both positively and negatively, on the results. Armed with this knowledge, designers of Delay Tolerant Networks can more easily determine the proper composition of routing algorithm features to best fit their needs.
Download or read book Modelling Analysis and Simulation of Computer and Telecommunication Systems written by Maria Carla Calzarossa and published by Springer Nature. This book was released on 2021-01-28 with total page 279 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the post proceedings of the 28th International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems, MASCOTS 2020, held online -due to COVID -19- in Nice, France, in November 2020. The 17 full papers presented were carefully reviewed and selected from 124 submissions. The symposium collected the most relevant papers describing state-of-the-art research in the areas of the performance evaluation of computer systems and networks as well as in related areas.
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.
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:
Download or read book Algorithm Development and Performance Analysis of Hierarchical Network Routing Protocols written by Surya Kumar V. Josyula and published by . This book was released on 1992 with total page 202 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Performance Analysis of Routing Algorithms of RD C TDMA Packet Radio Networks Under Dynamic Random Topology written by Chien-Ming Chen and published by . This book was released on 1993 with total page 250 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Algorithms and Architectures for Parallel Processing written by Xiang-he Sun and published by Springer. This book was released on 2014-08-13 with total page 873 pages. Available in PDF, EPUB and Kindle. Book excerpt: This two volume set LNCS 8630 and 8631 constitutes the proceedings of the 14th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2014, held in Dalian, China, in August 2014. The 70 revised papers presented in the two volumes were selected from 285 submissions. The first volume comprises selected papers of the main conference and papers of the 1st International Workshop on Emerging Topics in Wireless and Mobile Computing, ETWMC 2014, the 5th International Workshop on Intelligent Communication Networks, IntelNet 2014, and the 5th International Workshop on Wireless Networks and Multimedia, WNM 2014. The second volume comprises selected papers of the main conference and papers of the Workshop on Computing, Communication and Control Technologies in Intelligent Transportation System, 3C in ITS 2014, and the Workshop on Security and Privacy in Computer and Network Systems, SPCNS 2014.
Download or read book Routing and Network Design in Delay Tolerant Networks written by Wenrui Zhao and published by . This book was released on 2006 with total page 195 pages. Available in PDF, EPUB and Kindle. Book excerpt: Supporting effective communication in DTNs, however, is challenging. First, with intermittent connectivity, DTNs are often extremely resource-limited and not able to deliver performance required by applications. Second, given resource limitations and uncertainty in DTNs, it is critical to deliver data efficiently and robustly. The situation is especially acute for multicast which sends data to multiple destinations.
Download or read book Performance analysis of new alogoritms for routing in mobile ad hoc networks written by Mohamed S. El-Azhari and published by . This book was released on 2010 with total page 146 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Trust Management V written by Ian Wakeman and published by Springer Science & Business Media. This book was released on 2011-06-17 with total page 347 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 5th IFIP WG 11.11 International Conference, IFIPTM 2011, held in Copenhagen, Denmark, in June/July 2011. The 14 revised full papers and 8 short papers presented together with the abstracts of 4 keynote talks were carefully reviewed and selected from 42 submissions. The papers feature both theoretical research and real-world case studies from academia, business and government focusing on areas such as: trust models, social and behavioral aspects of trust, trust in networks, mobile systems and cloud computation, privacy, reputation systems, and identity management.
