FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1839550314> ?p ?o ?g. }

• W1839550314 abstract "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." @default.
• W1839550314 created "2016-06-24" @default.
• W1839550314 creator A5066370760 @default.
• W1839550314 date "2009-01-01" @default.
• W1839550314 modified "2023-09-24" @default.
• W1839550314 title "Probabilistic route discovery for Wireless Mobile Ad Hoc Networks (MANETs)" @default.
• W1839550314 cites W1495606459 @default.
• W1839550314 cites W1498251919 @default.
• W1839550314 cites W1499602922 @default.
• W1839550314 cites W1549535141 @default.
• W1839550314 cites W1557798631 @default.
• W1839550314 cites W1611665524 @default.
• W1839550314 cites W1743004868 @default.
• W1839550314 cites W1903881788 @default.
• W1839550314 cites W1911099004 @default.
• W1839550314 cites W1969317826 @default.
• W1839550314 cites W1983714506 @default.
• W1839550314 cites W1986246772 @default.
• W1839550314 cites W1988651441 @default.
• W1839550314 cites W1992958648 @default.
• W1839550314 cites W2009138129 @default.
• W1839550314 cites W2014550373 @default.
• W1839550314 cites W2015077925 @default.
• W1839550314 cites W2021200789 @default.
• W1839550314 cites W2022318042 @default.
• W1839550314 cites W2030367023 @default.
• W1839550314 cites W2033901378 @default.
• W1839550314 cites W2035541934 @default.
• W1839550314 cites W2054501422 @default.
• W1839550314 cites W2061687498 @default.
• W1839550314 cites W2077035969 @default.
• W1839550314 cites W2077077053 @default.
• W1839550314 cites W2078635298 @default.
• W1839550314 cites W2092865915 @default.
• W1839550314 cites W2098502330 @default.
• W1839550314 cites W2098714414 @default.
• W1839550314 cites W2099502770 @default.
• W1839550314 cites W2100444839 @default.
• W1839550314 cites W2100451349 @default.
• W1839550314 cites W2101087742 @default.
• W1839550314 cites W2102258543 @default.
• W1839550314 cites W2102430941 @default.
• W1839550314 cites W2102818219 @default.
• W1839550314 cites W2102845021 @default.
• W1839550314 cites W2104652069 @default.
• W1839550314 cites W2105081458 @default.
• W1839550314 cites W2105935781 @default.
• W1839550314 cites W2106820288 @default.
• W1839550314 cites W2107347808 @default.
• W1839550314 cites W2107603739 @default.
• W1839550314 cites W2110981299 @default.
• W1839550314 cites W2111911439 @default.
• W1839550314 cites W2111974899 @default.
• W1839550314 cites W2113119555 @default.
• W1839550314 cites W2113526082 @default.
• W1839550314 cites W2116974264 @default.
• W1839550314 cites W2119710605 @default.
• W1839550314 cites W2120618433 @default.
• W1839550314 cites W2120849907 @default.
• W1839550314 cites W2120926795 @default.
• W1839550314 cites W2122031283 @default.
• W1839550314 cites W2123382041 @default.
• W1839550314 cites W2123717129 @default.
• W1839550314 cites W2124076101 @default.
• W1839550314 cites W2124651399 @default.
• W1839550314 cites W2125398755 @default.
• W1839550314 cites W2128060919 @default.
• W1839550314 cites W2128510915 @default.
• W1839550314 cites W2132932625 @default.
• W1839550314 cites W2133189735 @default.
• W1839550314 cites W2138219179 @default.
• W1839550314 cites W2142076918 @default.
• W1839550314 cites W2145444981 @default.
• W1839550314 cites W2146184701 @default.
• W1839550314 cites W2147016173 @default.
• W1839550314 cites W2147568329 @default.
• W1839550314 cites W2147746912 @default.
• W1839550314 cites W2147954896 @default.
• W1839550314 cites W2148135143 @default.
• W1839550314 cites W2149260865 @default.
• W1839550314 cites W2152259738 @default.
• W1839550314 cites W2156603709 @default.
• W1839550314 cites W2158305426 @default.
• W1839550314 cites W2158324085 @default.
• W1839550314 cites W2158342661 @default.
• W1839550314 cites W2161457646 @default.
• W1839550314 cites W2162338299 @default.
• W1839550314 cites W2163533836 @default.
• W1839550314 cites W2163940596 @default.
• W1839550314 cites W2164231975 @default.
• W1839550314 cites W2164470020 @default.
• W1839550314 cites W2166329551 @default.
• W1839550314 cites W2167603068 @default.
• W1839550314 cites W2168103656 @default.
• W1839550314 cites W2409433878 @default.
• W1839550314 cites W2536543262 @default.
• W1839550314 cites W2536811050 @default.
• W1839550314 cites W2556440686 @default.
• W1839550314 cites W3141863997 @default.
• W1839550314 cites W55832751 @default.

• next