FRINK Linked Data Fragments server

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

• W137238612 abstract "Ad hoc networks are constructed from a fabric of mobile nodes interconnected by temporary wireless links. Nodes located beyond a single hop are reached using intermediate neighbours to forward messages over long distances. As there is no supporting infrastructure, the task of routing is distributed between the network participants. The problem with this method of communication is that mobility causes the network topology to be unstable. Traditional solutions maintain routes by exchanging information each time the network topology changes. Using traditional methods to maintain routes in highly mobile environments creates a high cost overhead which prohibits scalability. In this thesis we present a new distributed routing algorithm specifically designed to support highly dynamic networks with the aim of minimising the cost overhead and therefore saving power. The proposed solution is a hybrid between active/table-driven and reactive/on demand systems called Localised Demand Driven Routing (LDDR). The aim of LDDR is to reduce the number of cost advertisements flooded onto the network by creating routes on demand. Unlike pure table driven algorithms, our solution does not explicitly discover the next hop to reach the destination. Instead, routes are represented by labelling intermediate nodes to create a chain which links the source and destination together. The main observation of this thesis is that mobile nodes only remain in range for short periods of time. In this type of situation it is futile to construct a next-hop route table. Ad hoc networks require many nearby neighbours to form sufficient connectivity. These neighbours can be used to repair broken routes using localised maintenance at a cost of O(n). The frequency of route maintenance is related to the rate at which the network topology changes. The benefit of this solution is a significantly reduced overhead cost, leading to lower power consumption and greater network scalability. The major contribution of this thesis is the proposal and evaluation of the Localised Demand Driven Routing algorithm. Other contributions include the development of new autonomous simulation tools capable of modelling highly realistic motion and feedback stimulus at very high resolution. A method is provided for analytically comparing the overhead cost of different solutions. Our analysis breaks down the cost of each algorithm into route construction and maintenance. This is done because although some ad hoc routing algorithms do not explicitly perform maintenance, disconnection provokes an equivalent reaction. In our analysis we find that broken routes trigger high cost maintenance reactions because routes are represented using next-hop tables. Each reaction incurs a penalty of O(n) before stabilisation, which is eliminated in LDDR by trading absolute route accuracy for an approximation of the shortest paths. To my friends & family Acknowledgements: I would like to acknowledge my supervisors, David May and Henk Muller for supporting me through this line of research. I would also like to thank Dan Page for pointing me toward a method for simulating realistic mobility." @default.
• W137238612 created "2016-06-24" @default.
• W137238612 creator A5028019201 @default.
• W137238612 date "2005-01-01" @default.
• W137238612 modified "2023-09-23" @default.
• W137238612 title "Localised Demand Driven Routing for Mobile Ad hoc Wireless Networks" @default.
• W137238612 cites W1494290749 @default.
• W137238612 cites W1502346466 @default.
• W137238612 cites W1513792956 @default.
• W137238612 cites W1549535141 @default.
• W137238612 cites W1568911979 @default.
• W137238612 cites W157693642 @default.
• W137238612 cites W159719520 @default.
• W137238612 cites W1623265984 @default.
• W137238612 cites W1726571582 @default.
• W137238612 cites W1728701145 @default.
• W137238612 cites W181596720 @default.
• W137238612 cites W182599932 @default.
• W137238612 cites W1931521890 @default.
• W137238612 cites W1964119857 @default.
• W137238612 cites W1964559511 @default.
• W137238612 cites W1967533244 @default.
• W137238612 cites W1969492090 @default.
• W137238612 cites W1985647316 @default.
• W137238612 cites W1992876548 @default.
• W137238612 cites W1994593991 @default.
• W137238612 cites W1994980566 @default.
• W137238612 cites W1997091410 @default.
• W137238612 cites W2006033216 @default.
• W137238612 cites W2010359062 @default.
• W137238612 cites W2018438786 @default.
• W137238612 cites W2019952623 @default.
• W137238612 cites W2034318182 @default.
• W137238612 cites W2035776116 @default.
• W137238612 cites W2045028348 @default.
• W137238612 cites W2049512073 @default.
• W137238612 cites W2050129924 @default.
• W137238612 cites W2051440630 @default.
• W137238612 cites W2051999750 @default.
• W137238612 cites W2053694592 @default.
• W137238612 cites W2060338634 @default.
• W137238612 cites W2076267162 @default.
• W137238612 cites W2088235978 @default.
• W137238612 cites W2096348875 @default.
• W137238612 cites W2102258543 @default.
• W137238612 cites W2103481940 @default.
• W137238612 cites W2110504193 @default.
• W137238612 cites W2120587714 @default.
• W137238612 cites W2123115882 @default.
• W137238612 cites W2124651399 @default.
• W137238612 cites W2127198770 @default.
• W137238612 cites W2130403046 @default.
• W137238612 cites W2132932625 @default.
• W137238612 cites W2133520751 @default.
• W137238612 cites W2133794215 @default.
• W137238612 cites W2134127549 @default.
• W137238612 cites W2135035173 @default.
• W137238612 cites W2136032111 @default.
• W137238612 cites W2139249490 @default.
• W137238612 cites W2142076918 @default.
• W137238612 cites W2147277176 @default.
• W137238612 cites W2148135143 @default.
• W137238612 cites W2148929515 @default.
• W137238612 cites W2150847784 @default.
• W137238612 cites W2157457404 @default.
• W137238612 cites W2160558706 @default.
• W137238612 cites W2161457646 @default.
• W137238612 cites W2167627514 @default.
• W137238612 cites W2169528473 @default.
• W137238612 cites W2169746237 @default.
• W137238612 cites W2248064281 @default.
• W137238612 cites W2325187468 @default.
• W137238612 cites W2341171179 @default.
• W137238612 cites W2511894128 @default.
• W137238612 cites W2753542457 @default.
• W137238612 cites W3217029243 @default.
• W137238612 cites W37280751 @default.
• W137238612 hasPublicationYear "2005" @default.
• W137238612 type Work @default.
• W137238612 sameAs 137238612 @default.
• W137238612 citedByCount "0" @default.
• W137238612 crossrefType "journal-article" @default.
• W137238612 hasAuthorship W137238612A5028019201 @default.
• W137238612 hasConcept C104954878 @default.
• W137238612 hasConcept C111919701 @default.
• W137238612 hasConcept C120314980 @default.
• W137238612 hasConcept C158379750 @default.
• W137238612 hasConcept C184896649 @default.
• W137238612 hasConcept C199845137 @default.
• W137238612 hasConcept C2779960059 @default.
• W137238612 hasConcept C31258907 @default.
• W137238612 hasConcept C41008148 @default.
• W137238612 hasConcept C48044578 @default.
• W137238612 hasConcept C555944384 @default.
• W137238612 hasConcept C74172769 @default.
• W137238612 hasConcept C76155785 @default.
• W137238612 hasConcept C77088390 @default.
• W137238612 hasConcept C91280400 @default.
• W137238612 hasConcept C94523657 @default.
• W137238612 hasConceptScore W137238612C104954878 @default.

• next