Dynamic Probabilistic Routing Discovery and Broadcast Schemes for High Mobility Ad-hoc Networks 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 Dynamic Probabilistic Routing Discovery and Broadcast Schemes for High Mobility Ad-hoc Networks PDF full book. Access full book title Dynamic Probabilistic Routing Discovery and Broadcast Schemes for High Mobility Ad-hoc Networks by Mustafa Bani Khalaf. Download full books in PDF and EPUB format.
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: 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: Aminu Mohammed
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
Broadcasting is one of the fundamental data dissemination mechanisms in mobile ad hoc network (MANET), which is, for instance, extensively used in many routing protocols for route discovery process. The dynamic topology and limitedcommunication bandwidth of such networks pose a number of challenges in designing an efficient broadcasting scheme for MANETs. The simplest approach is flooding, where each node retransmit every unique received packet exactly onceon each outgoing link. Although flooding ensures that broadcast packet is received by all network nodes, it generates many redundant transmissions which can trigger high transmission collision and contention in the network, aphenomenon referred to as the broadcast storm. Several probabilistic broadcast algorithms have been proposed that incur low communication overhead to mitigate the broadcast storm problem and tend to show superior adaptability in changing environments when compared todeterministic (i.e., non-probabilistic) schemes. However, most of these schemes reduce redundant broadcasts at the expense of reachability, a requirement for near-global network topological information or support from additionalhardware. This research argues that broadcast schemes that combine the important features of fixed probabilistic and counter-based schemes can reduce the broadcast storm problem without sacrificing reachability while still achievingbetter end-to-end delay. To this end, the first part of this research investigate the effects of forwarding probabilities and counter threshold values on theperformance of fixed probabilistic and counter-based schemes. The findings of this investigation are exploited to suggest a new hybrid approach, the Probabilistic Counter-Based Scheme (PCBS) that uses the number of duplicatepackets received to estimate neighbourhood density and assign a forwarding probability value to restrict the generation of so many redundant broadcastpackets. The simulation results reveal that under various network conditions PCBS reduces the number of redundant transmissions, collision rate and end-to-end delay significantly without sacrificing reachability when compared against counter-based, fixed probabilistic and flood broadcasting. Often in MANETs, there are regions of different node density due to node mobility. As such, PCBS can suffer from a degree of inflexibility in terms of rebroadcast probability, since each node is assigned the same forwardingprobability regardless of its local neighbourhood conditions. To address this shortcoming, the second part of this dissertation proposes an Adjusted Probabilistic Counter-Based Scheme (APCBS) that dynamically assigns theforwarding probability to a node based on its local node density using a mathematical function. Thus, a node located in a sparse region of the network is assigned a high forwarding probability while a node located in denser region is assigned a relatively lower forwarding probability. These combined effects enhance end-to-end delay, collision rate and reachability compared to PCBSvariant. The performance of most broadcasting schemes that have been suggested for MANETs including those presented here, have been analysed in the context of?pure? broadcast scenarios with relatively little investigation towards theirperformance impact on specific applications such as route discovery process. The final part of this thesis evaluates the performance of the well-known AODV routing protocol when augmented with APCBS route discovery. Results indicate that the resulting route discovery approach reduces the routing overhead, collision rate and end-to-end delay without degrading the overall network throughput compared to the existing approaches based on flooding, counterbased and fixed probabilistic route discovery.
Author: Jamal-deen Abdulai
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
Mobile wireless ad hoc networks (MANETs) have become of increasing interest in view of their promise to extend connectivity beyond traditional fixed infrastructure networks. In MANETs, the task of routing is distributed among network nodes which act as both end points and routers in a wireless multi-hop network environment. To discover a route to a specific destination node, existing on-demand routing protocols employ a broadcast scheme referred to as simple flooding whereby a route request packet (RREQ) originating from a source node is blindly disseminated to the rest of the network nodes. This can lead to excessive redundant retransmissions, causing high channel contention and packet collisions in the network, a phenomenon called a broadcast storm. To reduce the deleterious impact of flooding RREQ packets, a number of route discovery algorithms have been suggested over the past few years based on, for example, location, zoning or clustering. Most such approaches however involve considerably increased complexity requiring additional hardware or the maintenance of complex state information. This research argues that such requirements can be largely alleviated without sacrificing performance gains through the use of probabilistic broadcast methods, where an intermediate node rebroadcasts RREQ packets based on some suitable forwarding probability rather than in the traditional deterministic manner. Although several probabilistic broadcast algorithms have been suggested for MANETs in the past, most of these have focused on Ã'Â"pureÃ'Â" broadcast scenarios with relatively little investigation of the performance impact on specific applications such as route discovery. As a consequence, there has been so far very little study of the performance of probabilistic route discovery applied to the well-established MANET routing protocols. In an effort to fill this gap, the first part of this thesis evaluates the performance of the routing protocols Ad hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) augmented with probabilistic route discovery, taking into account parameters such as network density, traffic density and nodal mobility. The results reveal encouraging benefits in overall routing control overhead but also show that network operating conditions have a critical impact on the optimality of the forwarding probabilities. In most existing probabilistic broadcast algorithms, including the one used here for preliminary investigations, each forwarding node is allowed to rebroadcast a received packet with a fixed forwarding probability regardless of its relative location with respect to the locations of the source and destination pairs. However, in a route discovery operation, if the location of the destination node is known, the dissemination of the RREQ packets can be directed towards this location. Motivated by this, the second part of the research proposes a probabilistic route discovery approach that aims to reduce further the routing overhead by limiting the dissemination of the RREQ packets towards the anticipated location of the destination. This approach combines elements of the fixed probabilistic and flooding-based route discovery approaches. The results indicate that in a relatively dense network, these combined effects can reduce the routing overhead very significantly when compared with that of the fixed probabilistic route discovery. Typically in a MANET there are regions of varying node density. Under such conditions, fixed probabilistic route discovery can suffer from a degree of inflexibility, since every node is assigned the same forwarding probability regardless of local conditions. Ideally, the forwarding probability should be high for a node located in a sparse region of the network while relatively lower for a node located in a denser region of the network. As a result, it can be helpful to identify and categorise mobile nodes in the various regions of the network and appropriately adjust their forwarding probabilities. To this end the research examines probabilistic route discovery methods that dynamically adjust the forwarding probability at a node, based on local node density, which is estimated using number of neighbours as a parameter. Results from this study return significantly superior performance measures compared with fixed probabilistic variants. Although the probabilistic route discovery methods suggested above can significantly reduce the routing control overhead without degrading the overall network throughput, there remains the problem of how to select efficiently forwarding probabilities that will optimize the performance of a broadcast under any given conditions. In an attempt to address this issue, the final part of this thesis proposes and evaluates the feasibility of a node estimating its own forwarding probability dynamically based on locally collected information. The technique examined involves each node piggybacking a list of its 1-hop neighbours in its transmitted RREQ packets. Based on this list, relay nodes can determine the number of neighbours that have been already covered by a broadcast and thus compute the forwarding probabilities most suited to individual circumstances.
Author: Abdalla Musbah Omar Hanashi
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
Broadcasting is an essential and effective data propagation mechanism with several important applications, such as route discovery, address resolution and many other network services. Though data broadcasting has many advantages, it can also cause a high degree of contention, collision and congestion, leading to what is known as 'broadcast storm problems'. Broadcasting has traditionally been based on the flooding protocol, which simply overflows the network with a high number of rebroadcast messages until these reach all the network nodes. A good probabilistic broadcast protocol can achieve high saved rebroadcast (SRB), low collision and a lower number of relays. When a node is in a sparse region of the network, rebroadcasting is relatively more important while the potential redundancy of rebroadcast is low because there are few neighbours which might rebroadcast the packet unnecessarily. Further, in such a situation, contention over the wireless medium resulting from Redundant broadcasts is not as serious as in scenarios with medium or high density node populations. This research proposes a dynamic probabilistic approach that dynamically fine-tunes the rebroadcast probability according to the number of neighbouring nodes distributed in the ad-hoc network for routing request packets (RREQs) without requiring the assistance of distance measurements or location-determination devices. The main goal of this approach is to reduce the number of rebroadcast packets and collisions in the network. The performance of the proposed approach is investigated and compared with simple AODV, fixed-probabilistic and adjusted-probabilistic flooding [1] schemes using the GloMoSim network simulator and a number of important MANET parameters, including node speed, traffic load and node density under a Random Waypoint (RWP) mobility model. Performance results reveal that the proposed approach is able to achieve higher SRB and less collision as well as a lower number of relays than fixed probabilistic, simple AODV and adjusted-probabilistic flooding. In this research, extensive simulation experiments have been conducted in order to study and analyse the proposed dynamic probabilistic approach under different mobility models. The mobility model is designed to describe the movement pattern of mobile customers, and how their position, velocity and acceleration change over time. In this study, a new enhanced dynamic probabilistic flooding scheme is presented. The rebroadcast probability p will be calculated dynamically and the rebroadcasting decision will be based on the average number of nodes in the ad-hoc networks. The performance of the new enhanced algorithm is evaluated and compared to the simple AODV, fixed-probabilistic, adjusted-probabilistic and dynamic-probabilistic flooding schemes. It is demonstrated that the new algorithm has superior performance characteristics in terms of collision, relays and SRB. Finally, the proposed schemes are tested and evaluated through a set of experiments under different mobility models to demonstrate the relative merits and capabilities of these schemes.
Author: Wilfred Githuka Gikaru
Publisher: Cuvillier Verlag
ISBN: 3865372783
Category : Mobile computing
Languages : de
Pages : 145
Get Book Here
Book Description
Author: Sarah Alhumoud
Publisher: LAP Lambert Academic Publishing
ISBN: 9783846585726
Category :
Languages : en
Pages : 128
Get Book Here
Book Description
This research proposes and analyses the Dynamic Counter-Based broadcasting scheme under a range of network operating conditions and applications; and demonstrates a clear benefit of the scheme when compared to its predecessors under a wide range of considered conditions. The first part of the book, sets a baseline study of the counter-based scheme analyzing it under various network operating conditions. The second part, attempts to establish the claim that alleviating existing stochastic counter-based scheme by dynamically setting threshold values according to local neighborhood density improves overall network efficiency. The third part, evaluates dynamic counting and tests its performance in some approximately realistic scenarios. The examples chosen are from the rapidly developing field of Vehicular Ad hoc Networks (VANETs). The last part, shows that routing overhead can be significantly reduced by applying dynamic counting in the route discovery process of a well-known routing protocol. The study shows a clear benefit of the proposed scheme in terms of average collision rate, saved rebroadcasts and end-to-end delay, while maintaining reachability.
Author:
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
In mobile ad hoc networks (MANETs)[1], a mobile station (MS) can communicate with nodes outside of its transmission range by employing intermediate nodes as relays. To find a path to a specific destination node, the source node broadcasts route request packets that are forwarded to all other nodes. A simple flooding scheme is employed in AODV[2], where every node rebroadcasts these route request packets even if some of its neighbors have already broadcast the requests and thus the rebroadcasts may reach no additional nodes. In MANETs, broadcasting is extensively used in route discovery, address resolution, and many other network services. The efficiency of broadcasting protocol can dramatically affect the performance of the entire network. Appropriate use of a probabilistic method can reduce the number of rebroadcasting, therefore reduce the chance of contention and collision among neighboring nodes. A good probabilistic broadcast protocol can achieve higher throughput and lower energy consumption, without sacrificing reachability or having any significant degradation. In this research, we study the problem of using probabilistic approaches to improve broadcasting and route discovery performance in wireless ad hoc and sensor networks. Our contributions can be summarized as follows. First, we propose a selfish node based approach. In this approach, we categorize MSs into normal nodes and selfish nodes. Normal nodes forward packets for other nodes while selfish nodes do not. The advantage of using selfish nodes is that the total rebroadcast traffic can be reduced. The disadvantage is that we may miss the optimal route and suffer from a low delivery rate. In this approach, we use a probabilistic method to set up a proper number of selfish nodes. Using a combination of gossiping and dominating set, we can reduce the route discovery cost by minimizing the number of rebroadcasts, while achieving higher delivery rate due to the reduction of rebroadcast traffic, thereby reducing the number of collisions. Second, we propose a leveled probabilistic approach. In this approach, we use a pre-assigned probability model to avoid redundant packet relays. In our protocol, a MS probabilistically sends relay packets (rebroadcasts) according to its neighborhood information. Our approach categorizes MSs into four groups. For each group of nodes, we assign a specified value of rebroadcasting probability. The MSs with more neighbors are given higher rebroadcasting probability. Using this method, we can reduce routing cost by minimizing the number of rebroadcasts in route discovery phase without significantly affecting the network connectivity. Third, we propose a dynamic probabilistic approach. In this approach, we dynamically adjust the rebroadcasting probability as per the node distribution and node movement. This is conducted based on locally available information. In addition, our approach does not require any assistance from accurate distance measurements or exact location determination. This approach can further reduce routing cost by adapting its behavior according to the environment changes. Fourth, we compare MANETs and WSNs (wireless sensor networks). We realize the difference between MANETs and WSNs in terms of the node characteristics, energy consumption, mobility model and the traffic model. We also evaluate sensing coverage and communication coverage for different sensor range or communication range. Fifth, we propose a broadcasting scheme using connecting areas. We assign/select connecting areas during the network start up period. Only the connecting area head node located inside one of the connecting areas is responsible to rebroadcast the packet while the nodes outside the connecting areas do not rebroadcast. By choosing the size of the connecting area and the placement of the connecting areas, we can reduce the rebroadcasting cost while maintaining the reachability. Sixth, we propose a scheme that is based on redundant degree of each sensor. In this approach, we evaluate the redundant degree value of each sensor node and use this value to decide whether to rebroadcast packet or not. The rebroadcast from a node with high degree of redundancy has high possibility to be redundant. We set up a threshold to allow nodes with low enough degree connectivity to rebroadcast packets. In this work, we first describe the details of our protocols, comparing them with AODV and other protocols, and presenting evaluation results in MANETs. Analytical and simulation results show that our approaches outperform the AODV protocol on several metrics in most cases, including the average number of rebroadcasts, average number of packet collisions, end-to-end delay, and the throughput. We propose broadcasting protocols in wireless sensor networks, and explore other methods to further improve the performance of broadcasting and route discovery in MANETs and WSNs.
Author: Hanashi Abdalla Musbah Omar
Publisher: LAP Lambert Academic Publishing
ISBN: 9783659713057
Category :
Languages : en
Pages : 160
Get Book Here
Book Description
Broadcasting is a basic data propagation technique, which has a number of applications such as route discovery and address resolution. While data broadcasting has many gains, it introduces some problems known as broadcast storm problems, which causing a lot of contention, collision and redundant retransmission. Our objective is to reduce the number of rebroadcast. A good probabilistic broadcast protocol can achieve high save rebroadcast. We propose a probabilistic approach that calculates the rebroadcast probability according to the number of neighbour's nodes when nodes move according to different mobility models and compare it with simple flooding, adjusted probabilistic flooding and dynamic probabilistic flooding schemes. Simulation results show our improved approach performs better than simple flooding, adjusted probabilistic flooding and dynamic probabilistic flooding.
Author: Natarajan Meghanathan
Publisher: Springer
ISBN: 3642144780
Category : Computers
Languages : en
Pages : 654
Get Book Here
Book Description
The Third International Conference on Network Security and Applications (CNSA-2010) focused on all technical and practical aspects of security and its applications for wired and wireless networks. The goal of this conference is to bring together researchers and practitioners from academia and industry to focus on understanding modern security threats and countermeasures, and establishing new collaborations in these areas. Authors are invited to contribute to the conference by submitting articles that illustrate research results, projects, survey work and industrial experiences describing significant advances in the areas of security and its applications, including: • Network and Wireless Network Security • Mobile, Ad Hoc and Sensor Network Security • Peer-to-Peer Network Security • Database and System Security • Intrusion Detection and Prevention • Internet Security, and Applications Security and Network Management • E-mail Security, Spam, Phishing, E-mail Fraud • Virus, Worms, Trojon Protection • Security Threats and Countermeasures (DDoS, MiM, Session Hijacking, Replay attack etc. ) • Ubiquitous Computing Security • Web 2. 0 Security • Cryptographic Protocols • Performance Evaluations of Protocols and Security Application There were 182 submissions to the conference and the Program Committee selected 63 papers for publication. The book is organized as a collection of papers from the First International Workshop on Trust Management in P2P Systems (IWTMP2PS 2010), the First International Workshop on Database Management Systems (DMS- 2010), and the First International Workshop on Mobile, Wireless and Networks Security (MWNS-2010).
Author: G Ram Mohana Reddy
Publisher: CRC Press
ISBN: 1315351633
Category : Computers
Languages : en
Pages : 139
Get Book Here
Book Description
In recent years, a lot of work has been done in an effort to incorporate Swarm Intelligence (SI) techniques in building an adaptive routing protocol for Mobile Ad Hoc Networks (MANETs). Since centralized approach for routing in MANETs generally lacks in scalability and fault-tolerance, SI techniques provide a natural solution through a distributed approach for the adaptive routing for MANETs. In SI techniques, the captivating features of insects or mammals are correlated with the real world problems to find solutions. Recently, several applications of bio-inspired and nature-inspired algorithms in telecommunications and computer networks have achieved remarkable success. The main aims/objectives of this book, "Mobile Ad Hoc Networks: Bio-Inspired Quality of Service Aware Routing Protocols", are twofold; firstly it clearly distinguishes between principles of traditional routing protocols and SI based routing protocols, while explaining in detail the analogy between MANETs and SI principles. Secondly, it presents the readers with important Quality of Service (QoS) parameters and explains how SI based routing protocols achieves QoS demands of the applications. This book also gives quantitative and qualitative analysis of some of the SI based routing protocols for MANETs.
