Multi-Retransmission Route Discovery Schemes for Ad Hoc Wireless Network with a Realistic Physical Layer PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Multi-Retransmission Route Discovery Schemes for Ad Hoc Wireless Network with a Realistic Physical Layer PDF full book. Access full book title Multi-Retransmission Route Discovery Schemes for Ad Hoc Wireless Network with a Realistic Physical Layer by Xiangyang Jin. Download full books in PDF and EPUB format.
Author: Xiangyang Jin
Publisher:
ISBN: 9780494869765
Category :
Languages : en
Pages :
Get Book Here
Book Description
Author: Xiangyang Jin
Publisher:
ISBN: 9780494869765
Category :
Languages : en
Pages :
Get Book Here
Book Description
Author: Miguel Elias Mitre Campista
Publisher: John Wiley & Sons
ISBN: 1118984927
Category : Technology & Engineering
Languages : en
Pages : 149
Get Book Here
Book Description
This text introduces the principles of routing protocols and metrics as they affect wireless networking environments, specifically in urban areas. Timely because of the recent rise in small city life, this topic includes the consideration of ad hoc, mesh, vehicular, sensor, and delay tolerant networks. These approaches are each unique, and author Miguel Mitre Campista provides a thorough, but accessible, explanation of their individual characteristics for engineers, computer scientists, IT professionals, and curious Internet users.
Author: Johnson Kuruvila
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 0
Get Book Here
Book Description
Author: Sherin Abdel Hamid
Publisher: Springer Science & Business Media
ISBN: 1461463572
Category : Computers
Languages : en
Pages : 81
Get Book Here
Book Description
The focus of this brief is to identify what unifies and what distinguishes the routing functions in four wireless multi-hop network paradigms. The brief introduces a generic routing model that can be used as a foundation of wireless multi-hop routing protocol analysis and design. It demonstrates that such model can be adopted by any wireless multi-hop routing protocol. Also presented is a glimpse of the ideal wireless multi-hop routing protocol along with several open issues.
Author: Xiao Huang
Publisher:
ISBN:
Category :
Languages : en
Pages : 258
Get Book Here
Book Description
Author: Ivan Stojmenovic
Publisher: John Wiley & Sons
ISBN: 0471462985
Category : Computers
Languages : en
Pages : 664
Get Book Here
Book Description
The huge and growing demand for wireless communication systems has spurred a massive effort on the parts of the computer science and electrical engineering communities to formulate ever-more efficient protocols and algorithms. Written by a respected figure in the field, Handbook of Wireless Networks and Mobile Computing is the first book to cover the subject from a computer scientist's perspective. It provides detailed practical coverage of an array of key topics, including cellular networks, channel assignment, queuing, routing, power optimization, and much more.
Author:
Publisher:
ISBN:
Category : Electronic books
Languages : en
Pages : 116
Get Book Here
Book Description
The use of frequency division duplex (FDD) communication in a multihop wireless network partitions the nodes in two operating modes (or genders), depending on the frequency bands used for the transmission and reception. Since the FDD nodes of the same gender, located in a 1-hop neighborhood, cannot communicate with each other, it can limit the availability of communication links between the neighboring nodes and leads to network partitioning. Therefore, the operating mode of these nodes should be selected such that every node can establish links with its 1-hop neighbors. The multihop network of static FDD nodes is modeled as a graph, and a novel, distributed bipartite graph coloring scheme, for mode selection of FDD nodes is designed. Unlike the existing graph coloring schemes, which use the entire network topology and yet do not ensure network connectivity, this scheme requires only the local information of the 1-hop neighborhood of each node in a distributed manner. The proposed mode selection algorithm ensures that every FDD node can establish the communication links with approximately half of its 1-hop neighbors for omni as well as directional communication, without introducing any disconnected node. This mode selection algorithm has lower computational complexity and provides robust network connectivity, which would help in fault tolerance and establishing stable routes in the network. Next, a novel, distributed, low-complexity mode reassignment (MR) scheme is designed for maintaining connectivity among the mobile FDD nodes in a decentralized, multihop wireless network. Since it is not practical to know the complete topology of such a network in real-time, the proposed scheme is fully distributed, relies only on the local node information, and is applied only on those nodes whose connectivity drops below a threshold. Besides maintaining a desired value of connectivity degree for each node at all time steps, the proposed MR scheme minimizes the impact of mode change on the existing links and ongoing data transmissions. A Kalman filter based node mobility prediction and link failure prediction scheme is designed to select the best candidate nodes for mode change. Several novel measurements are introduced to evaluate the performance of our MR scheme. The optimality and error control bounds of the proposed MR scheme show that it consistently increases the nodes’ connectivity degree (achieves optimal connectivity for most nodes) while requiring a low number of nodes undergoing the mode change at each MR round. This MR scheme has low computational complexity and would help in establishing stable routes in a mobile network. Next, a mobile wireless ad-hoc network equipped with full-duplex nodes is considered. The full-duplex capability can be provided either by transmitting and receiving data simultaneously in a given frequency band by canceling the self-interference or can be provided by utilizing two separate frequency channels for transmission and reception at the same time in the FDD node. In either case, the full-duplex capability allows the formation of bidirectional routes, where every forward and reverse route between a source and destination pair completely overlaps. These completely overlapped bidirectional routes can support efficient transmission of bidirectional flows between a pair of source and destination nodes. In this dissertation, a novel routing protocol, called as bidirectional AOMDV (BAOMDV) is proposed, that discovers multiple, link-disjoint, bidirectional routes in the network, to make efficient use of full-duplex nodes. This routing protocol overcomes the limitations of existing AOMDV based protocols in finding the bidirectional routes. Additionally, the effect of route break in the presence of multiple active routes among source and destination pairs is considered and a novel bidirectional local route repair scheme called BAOMDV-LR is proposed in this dissertation. This scheme is capable of locally repairing routes formed based on the proposed BAOMDV protocols while preserving the link-disjoint and bidirectional nature of the routes, and can avoid the expensive route discovery procedure in the mobile ad-hoc networks. The scheme helps to maintain multiple active bidirectional routes for longer duration and reduce the need for frequent route discovery. The proposed BAOMDV-LR scheme is able to increase the overall network performance especially at higher data rates, and node speeds.
Author: Atif A. Alghamdi
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
Author: Mustafa Bani Khalaf
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
Mobile Ad-hoc Networks (MANETs) have lately come to be widely used in everyday applications. Their usability and capability have attracted the interest of both commercial organizations and research communities. Recently, the Vehicular Ad-hoc Network (VANET) is a promising application of MANETs. It has been designed to offer a high level of safety for the drivers in order to minimize a number of roads accidents. Broadcast communication in MANETs and VANETs, is essential for a wide range of important services such as propagating safety messages and Route REQuest (RREQ) packets. Routing is one of the most challenging issues in MANETs and VANETs, which requires high efficient broadcast schemes. The primitive and widely deployed method of implementing the broadcast is simple 'flooding'. In this approach, each node 'floods' the network, with the message that it has received, in order to guarantee that other nodes in the network have been successfully reached. Although flooding is simple and reliable, it consumes a great deal of network resources, since it swamps the network with many redundant packets, leading to collisions contention and huge competition, while accessing the same shared wireless medium. This phenomenon is well-known in MANETs, and is called the Broadcast Storm Problem. The first contribution of this thesis is to design and develop an efficient distributed route discovery scheme that is implemented based on the probabilistic concept, in order to suppress the broadcast storm problem. The proposed scheme is called a Probabilistic Disturbed Route Discovery scheme (PDRD), and it prioritizes the routing operation at each node with respect to different network parameters such as the number of duplicated packets, and local and global network density. The performance of the proposed scheme PDRD has been examined in MANETs, in terms of a number of important metrics such as RREQ rebroadcast number and RREQ collision number. Experimental results confirm the superiority of the proposed scheme over its counterparts, including the Hybrid Probabilistic-Based Counter (HPC) scheme and the Simple Flooding (SF) scheme. The second contribution of this thesis is to tackle the frequent link breakages problem in MANETs. High mobility nodes often have frequent link breakages; this potentially leads to re-discovery of the same routes. Although different probabilistic solutions have been suggested to optimize the routing in MANETs, to the best of our knowledge they have not focused on the problem of frequent link breakages and link stability. II Unlike other existing probabilistic solutions, this thesis proposes a new Velocity Aware-Probabilistic (VAP) route discovery scheme, which can exclude unstable nodes from constructing routes between source and destination. The main idea behind the proposed schemes is to use velocity vector information to determine the stable nodes and unstable nodes. A proper rebroadcast probability and timer are set dynamically according to the node stability. Simulation results confirm that the new proposed scheme has much better performance in terms of end-to-end delay, RREQ rebroadcast number and link stability. The routing in VANETs is very critical and challenging in terms of the number of broken links and packet overheads. This is mainly due to the fast vehicles' speed and different vehicles' movement directions. A large number of routing protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR) have been proposed to deal with the routing in MANETs. However, these protocols are not efficient and cannot be applied directly to VANETs context due to its different characteristics. Finally toward this end, this thesis proposes new probabilistic and timer probabilistic routing schemes in order to improve the routing in VANETs. The main aim of the proposed schemes is to set up the most stable routes to avoid any possible link breakage. These schemes also enhance the overall network performance by suppressing the broadcast storm problem, which occurs during the route discovery process. The proposed schemes also make AODV protocol suitable and applicable for VANETs. Simulation results show the benefit of the new routing schemes in terms of a number of metrics such as RREQ rebroadcast number, link stability and end-to-end delay.
Author: Carlos de Morais Cordeiro
Publisher: World Scientific
ISBN: 9814338885
Category : Computers
Languages : en
Pages : 663
Get Book Here
Book Description
This book provides a comprehensive yet easy coverage of ad hoc and sensor networks and fills the gap of existing literature in this growing field. It emphasizes that there is a major interdependence among various layers of the network protocol stack. Contrary to wired or even one-hop cellular networks, the lack of a fixed infrastructure, the inherent mobility, the wireless channel, and the underlying routing mechanism by ad hoc and sensor networks introduce a number of technological challenges that are difficult to address within the boundaries of a single protocol layer. All existing textbooks on the subject often focus on a specific aspect of the technology, and fail to provide critical insights on cross-layer interdependencies. To fully understand these intriguing networks, one need to grasp specific solutions individually, and also the many interdependencies and cross-layer interactions.
