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 0 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Scientific and Technical Aerospace Reports written by and published by . This book was released on 1985 with total page 1076 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Performance Analysis and Optimal Routing in Packet Radio Networks written by Hsien-Chuen Yu and published by . This book was released on 1989 with total page 234 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Performance Analysis of New Algorithms for Routing in Mobile Ad hoc Networks The Development and Performance Evaluation of Some New Routing Algorithms for Mobile Ad hoc Networks Based on the Concepts of Angle Direction and Node Density written by Mohamed S. Elazhari and published by . This book was released on 2011 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: Mobile Ad hoc Networks (MANETs) are of great interest to researchers and have become very popular in the last few years. One of the great challenges is to provide a routing protocol that is capable of offering the shortest and most reliable path in a MANET in which users are moving continuously and have no base station to be used as a reference for their position. This thesis proposes some new routing protocols based on the angles (directions) of the adjacent mobile nodes and also the node density. In choosing the next node in forming a route, the neighbour node with the closest heading angle to that of the node of interest is selected, so the connection between the source and the destination consists of a series of nodes that are moving in approximately the same direction. The rationale behind this concept is to maintain the connection between the nodes as long as possible. This is in contrast to the well known hop count method, which does not consider the connection lifetime. We propose three enhancements and modifications of the Ad-hoc on demand distance vector (AODV) protocol that can find a suitable path between source and destination using combinations and prioritization of angle direction and hop count. Firstly, we consider that if there are multiple routing paths available, the path with the minimum hop count is selected and when the hop counts are the same the path with the best angle direction is selected. Secondly, if multiple routing paths are available the paths with the best angle direction are chosen but if the angles are the same (fall within the same specified segment), the path with minimum hop count is chosen. Thirdly, if there is more than one path available, we calculate the average of all the heading angles in every path and find the best one (lowest average) from the source to the destination. In MANETs, flooding is a popular message broadcasting technique so we also propose a new scheme for MANETS where the value of the rebroadcast packets for every host node is dynamically adjusted according to the number of its neighbouring nodes. A fixed probabilistic scheme algorithm that can dynamically adjust the rebroadcasting probability at a given node according to its ID is also proposed; Fixed probabilistic schemes are one of the solutions to reduce rebroadcasts and so alleviate the broadcast storm problem. Performance evaluation of the proposed schemes is conducted using the Global Mobile Information System (GloMoSim) network simulator and varying a number of important MANET parameters, including node speed, node density, number of nodes and number of packets, all using a Random Waypoint (RWP) mobility model. Finally, we measure and compare the performance of all the proposed approaches by evaluating them against the standard AODV routing protocol. The simulation results reveal that the proposed approaches give relatively comparable overall performance but which is better than AODV for almost all performance measures and scenarios examined.

Download or read book Interconnection algorithms in multi hop packet radio topologies written by P. Papantoni-Kazakos and published by . This book was released on 1988 with total page 80 pages. Available in PDF, EPUB and Kindle. Book excerpt: We consider a two-cluster system in multi-hop packet radio topologies. Each cluster deploys a limited sensing random access algorithm, and contains local users who transmit their packets only via the algorithm in their own cluster. The system also contains marginal users, who may transmit their packers via either one of the algorithms in the two clusters. For the above system, we adopt a limited sensing random access algorithm per cluster that has been previously studied. This algorithm utilizes binary, collision versus noncollision, feedback per slot, and in the presence of the limit Poisson user model and the absence of marginal back per slot, and in the presence of the limit Poisson user model and the absence of marginal users its throughout is 0.43. We consider a dynamic interconnection policy for the marginal users, and we then study the overall system performance in the presence of limit Poisson user populations. Specifically, we study the stability regions of the system and the per packet expected delays. Our interconnection policy accelerates the marginal users, presenting them with a significant delay advantage over the local users. This is desirable when the marginal users transmit high priority data, for example. (rrh).

Download or read book Performance of On demand Routing Algorithms in Dense Constrained Networks written by Scott Edwin Goering and published by . This book was released on 2005 with total page 160 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Design and Analysis of a Speed Aware Routing Protocol for Mobile Ad Hoc Networks written by Kirthana Akunuri and published by . This book was released on 2011 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: "The flexibility of movement for the wireless ad hoc devices, referred to as node mobility, introduces challenges such as dynamic topological changes, increased frequency of route disconnections and high packet loss rate in Mobile Ad hoc Wireless Network (MANET) routing. This research proposes a novel on-demand routing protocol, Speed-Aware Routing Protocol (SARP) to mitigate the effects of high node mobility by reducing the frequency of route disconnections in a MANET. SARP identifies a highly mobile node which forms an unstable link by predicting the link expiration time (LET) for a transmitter and receiver pair. When the nodes have high relative velocity, the LET calculated is a small value; this means that the link is predicted to disconnect before the successful transmission of a specific demand. SARP omits such a packet-sending node from the link route during the route discovery phase. The omission of such unstable links helps SARP limit the flooding of control packets during route maintenance and reduces the overall control overhead generated in on-demand routing protocols. NS2 was used to implement the SARP with ad hoc on-demand vector (AODV) as the underlying routing algorithm. Extensive simulations were then conducted using Random Waypoint Mobility model to analyze the performance of SARP. The results from these simulations demonstrated that SARP reduced the overall control traffic of the underlying protocol AODV significantly in situations of high mobility and dense networks; in addition, it showed only a marginal difference as compared to AODV, in all aspects of quality-of-service (QOS) in situations of low mobility and sparse networks"--Abstract, leaf iii

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.

Download or read book Performance Analysis of Mobile Ad hoc Routing Protocols by Varying Mobility Speed and Network Load written by Nilotpal Dev Sarmah and published by . This book was released on 2014 with total page 81 pages. Available in PDF, EPUB and Kindle. Book excerpt: One of the most promising network that has emerged from the technology world is the mobile ad-hoc network or MANET. It is a type of multi-hop network. Wireless by nature, MANETs do not have a specific network infrastructure. It is a collection of wireless mobile devices that communicate with each other without the help of any third party backbone like a base-station or a router. It can be hard to imagine how every node in this type of network communicate with one another without having a router. In MANETs, nodes change locations with time, configure themselves and get the information transmitted from source to destination without the help of any router or base station. Hence, for efficient data transmission, it is critical to understand the type of routing that is being used by these networks. Since they have no specific routers to handle these tasks, it can be a monumental task for the nodes to efficiently determine a path to forward and route their packets when they are at constant motion. This research makes a comprehensive performance analysis of the various mobile ad-hoc routing protocols. Over 160 simulation scenarios have been conducted and as many as 6 performance parameters are analyzed and compared in three different scales of network to make it a comprehensive analysis. Significant work is done in this area for more than a decade and researchers around the world have come up with a wide range of results. In this research, the results from previous work are taken into account for comparison and a wide analysis is made to carve out the most efficient routing algorithm under various mobility scenarios. All the major proactive and reactive routing protocols viz. Destination sequenced distance vector (DSDV), Optimized Link State Routing (OLSR), Dynamic Source Routing (DSR) and Ad-hoc On-demand Distance Vector (AODV) protocols are compared in three different phases - mobility, speed and network load. Simulation results show that dynamic source routing protocol (DSR) performs the best in small networks while ad-hoc on demand distance vector (AODV) routing protocol performs the best in medium and large networks. Although OLSR fails to cope with the level of AODV, it can be a superior protocol having demonstrated comparable performance to AODV and its proactive nature of routing packets.

Download or read book A Time Slot Assignment Algorithm for a TDMA Packet Radio Network written by William Karl Tritchler and published by . This book was released on 1983 with total page 156 pages. Available in PDF, EPUB and Kindle. Book excerpt: An algorithm for the assignment of time slots within a Time Division Multiple Access (TDMA) scheme for an integrated voice and packet radio network is implemented in, and studied by, a computer simulation. The slot assignment scheme is applied both to a static network, where 'best path' routes ae held constant, and also to a network where the 'best path' routes are permitted to change dynamically during the simulation as communications capability at various nodes approaches saturation. The Dijkstra algorithm is used to determine and modify 'shortest distance' routes, and the sensitivity of performance to various parameters used in defining the link 'distance function' is investigated. The major conclusion is that it is possible to route in a way that reduces the average energy transmitted per message without substantially decreasing the network throughput. (Author).

Download or read book Performance Analysis of Multihop Packet Radio Networks Under Slotted Frequency Hopping Access Scheme written by Hahan Rahardjo and published by . This book was released on 1987 with total page 152 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Routing in Communications Networks written by Martha E. Steenstrup and published by . This book was released on 1995 with total page 424 pages. Available in PDF, EPUB and Kindle. Book excerpt: An edited collection of self-contained papers written by leaders in the field of routing, this book supplies details on the routing techniques currently employed in large operational networks or slated for introduction into such networks. Comprises four major parts covering routing in circuit-switching, packet-switching, high-speed, and mobile networks.

Download or read book Evaluation of node weight based congestion adaptive routing algorithm in MANET packet routing written by Rebecca Nyasuguta Arika and published by GRIN Verlag. This book was released on 2017-10-24 with total page 27 pages. Available in PDF, EPUB and Kindle. Book excerpt: Research Paper (postgraduate) from the year 2017 in the subject Instructor Plans: Computing / Data Processing / IT / Telecommunication, , language: English, abstract: Mobile ad-hoc networks are valuable in situations where communication support is required but there are no fixed infrastructures that are in existence and movement of communicating parties is permitted. This is a typical case in the military where the personnel move randomly in the battle field but need to maintain constant communication to the commanding stations. Unfortunately, mobile ad-hoc networks exhibit unexpected behavior when transmitting multiple data streams under heavy traffic load, more so when these data streams are destined to common terminal. Therefore, congestion is one of the most limiting factors for efficient packet transmissions over wireless ad-hoc networks. This is because it introduces problems such as long delay, high overhead and low throughput over the communication channels. To surmount these issues, researchers have proposed many congestion aware and congestion adaptive routing protocols. One of such a congestion control algorithm is the one based on node weight for the computation of usable network routes. To achieve this objective, number of dead links, um of energy for packet transmission over a mobile ad hoc network, and the number of packets delivered over the network were used as performance metrics. The results obtained indicated that the node weight-based path calculation approach yields better performance compared to the existing congestion control algorithms.

Download or read book On the Throughput of Multihop Receiver Directed CDMA Packet Radio Networks with Dynamic Random Topology written by Jeffrey Carl Dill and published by . This book was released on 1987 with total page 340 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Design and Analysis of Distributed Routing Algorithms written by Shree N. Murthy and published by . This book was released on 1994 with total page 150 pages. Available in PDF, EPUB and Kindle. Book excerpt: Route assignment is one of the operational problems of communication network, and adaptive routing schemes are required to achieve real time performance. This thesis introduces, verifies and analyses two new distributed, shortest-path routing algorithms, which are called, Path-Finding Algorithm (PFA) and Loop-Free Path-Finding Algorithm (LPA). Both algorithms require each routing node to know only the distance and the second-to-last-hop (or predecessor) node to each destination. In addition to the above information, LPA uses an efficient inter-neighbor coordination mechanism spanning over a single hop. PFA reduces the formation of temporary loops significantly, while LPA achieves loop-freedom at every instant by eliminating temporary loops. The average performance of these two algorithms is compared with the Diffusing Update Algorithm (DUAL) and an ideal link state (ILS) using Dijkstra's shortest-path algorithm by simulation; this performance comparison is made in terms of time taken for convergence, number of packets exchanged and the total number of operations required for convergence by each of the algorithms. The simulations were performed using a C-based simulation tool called Drama, along with a network simulation library. The results indicated that the performance of PFA is comparable to that of DUAL and ILS and that a significant improvement in performance can be achieved with LPA over DUAL and ILS.

Download or read book Throughput Behavior of the N ary Stack Algorithm in Mobile Networks with Capture written by International Business Machines Corporation. Research Division and published by . This book was released on 1995 with total page 14 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "The emergence of wireless and personal communication networks has brought random access protocols for packet radio networks back to the research forefronts. Most such protocols are based on the ever popular ALOHA protocol. Unfortunately, this protocol is inherently unstable and requires sophisticated schemes to stabilize it. Another class of random access schemes, called limited sensing or stack algorithms, has been proposed that is stable and allows for the dynamic incorporation of new stations into the network. In this paper, we will review the simple to implement n-ary Stack Algorithm, and we will demonstrate its performance in the presence of capture under various system parameters. As a by- product of this work, we will show that random access schemes have throughput conditions that are sensitive to the traffic generation process."

Download or read book A Comparative Study of Routing Protocols in MANETs written by Muhammad Ali and published by . This book was released on 2003 with total page 170 pages. Available in PDF, EPUB and Kindle. Book excerpt: Mobile Ad Hoc networks are emerging area of mobile computing. A "mobile ad hoc network" (MANET) is composed of mobile routers and associated hosts connected by wireless links. The routers are free to move randomly and organize themselves arbitrarily, thus, the network's wireless topology may change rapidly and unpredictably. In fact, it is considered that each node would have some capacity to relay the information thus constrained by computational power, battery life and increasingly complex routing with added functionality of a router. Nodes may keep joining and leaving an ad hoc network. Such a network may operate in a stand alone fashion, or may be connected to the larger Internet. Lack of infrastructure in ad hoc networks sets new challenges for routing algorithms where the network is formed by a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. A number of routing protocols like Dynamic Source Routing (DSR), Ad Hoc On-Demand Distance Vector Routing (AODV), Destination-Sequenced Distance-Vector (DSDV), Zone Routing Protocol (ZRP) and Temporally Ordered Routing Algorithm (TORA) have been implemented. In this thesis an attempt has been made to compare the performance of prominent on-demand reactive routing protocols for mobile ad hoc networks (AODV and TORA), along with the traditional proactive DSDV protocol. Although AODV and TORA share similar on-demand behavior, the differences in the protocol mechanics can lead to significant performance differentials. The performance differentials are analyzed using varying network loads, mobilities, and network sizes. These simulations are carried out using network simulator (ns-2.1b9a) to run mobile ad hoc network simulations.