FRINK Linked Data Fragments server

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

• W1590582691 abstract "Embedded wireless networks find a broad spectrum of applications in transportation, environmental monitoring, logistics, supply chain management, and pocketswitched communication. The node mobility patterns in these applications tend to give rise to spatially heterogeneous node distributions, which may cause network partitions. In this thesis, we consider the problem of routing in mobile networks under such challenging conditions. More specifically, we endeavor to identify features of mobility common to different applications, in order to devise routing methods that are tailored to exploit these features. We explore two features in particular, (i) predictability and (ii) stable and heterogeneous spatial node distribution. A mobility process is predictable if the future location of a node can be well estimated, given knowledge of its current and past locations and possibly other statistics. We show how the performance of routing can be improved by explicitly incorporating mobility prediction. Specifically, we consider the performance of Last Encounter Routing (LER) under a simple synthetic random waypoint (RWP) mobility model. We extend the LER algorithm so that it takes into account predicted node trajectories when making routing decisions, and we show that this significantly improves its performance. A mobility process has a stable spatial node distribution if, informally, the node density remains the same over time, even though individual nodes are not constrained in space. This is a common feature of many mobility patterns because the spatial distribution is determined by the natural or constructed environment, regardless of the behavior of individual nodes. This typically leads to heterogeneous connectivity and to network partition, where highly connected clusters are interspersed with low-connectivity regions. We model such a situation with a set of stable concentration points (CPs) characterized by high node density, and with a mobility process that describes how nodes move between these islands of connectivity. We study two instances of this model: the G-model, where the CPs and the flow of nodes are abstracted as a graph, and the H-model, where nodes perform heterogeneous random walks on the plane. We exploit the presence of this stable CP topology in order to develop an efficient routing algorithm under these two mobility models. Our routing algorithm, Island Hopping (IH), exploits knowledge of the CP topology to make routing decisions. IH achieves a very good delay-throughput trade-off compared with several other existing routing algorithms, and it scales well with the network size. In many situations, it would be unrealistic to assume that CPs and the flows of mobile nodes among them are known a-priori. We develop methods, collectively called Collaborative Graph Discovery (COGRAD), that allow the nodes to discover the CP graph without any explicit signals from the environment (such as GPS coordinates or fixed beacons). We show that COGRAD can replace an oracle with knowledge of the CP topology after a sufficient warm-up period, allowing IH to operate even in scenarios without any cues from the environment." @default.
• W1590582691 created "2016-06-24" @default.
• W1590582691 creator A5089809124 @default.
• W1590582691 date "2010-01-01" @default.
• W1590582691 modified "2023-09-23" @default.
• W1590582691 title "Collaborative routing in mobile partitioned networks" @default.
• W1590582691 cites W1488160161 @default.
• W1590582691 cites W1502694642 @default.
• W1590582691 cites W151467418 @default.
• W1590582691 cites W1519038128 @default.
• W1590582691 cites W1549535141 @default.
• W1590582691 cites W1551486829 @default.
• W1590582691 cites W1572481965 @default.
• W1590582691 cites W1585776999 @default.
• W1590582691 cites W1591710988 @default.
• W1590582691 cites W1642251103 @default.
• W1590582691 cites W1761863136 @default.
• W1590582691 cites W1946651478 @default.
• W1590582691 cites W1966518282 @default.
• W1590582691 cites W1976013238 @default.
• W1590582691 cites W1982904338 @default.
• W1590582691 cites W1994980566 @default.
• W1590582691 cites W2002199299 @default.
• W1590582691 cites W2009155608 @default.
• W1590582691 cites W2010634640 @default.
• W1590582691 cites W2017277760 @default.
• W1590582691 cites W2024315730 @default.
• W1590582691 cites W2025782074 @default.
• W1590582691 cites W2028923768 @default.
• W1590582691 cites W2035827576 @default.
• W1590582691 cites W2037508129 @default.
• W1590582691 cites W2039157284 @default.
• W1590582691 cites W2041499139 @default.
• W1590582691 cites W2044630035 @default.
• W1590582691 cites W2050218995 @default.
• W1590582691 cites W2053694592 @default.
• W1590582691 cites W2071738571 @default.
• W1590582691 cites W2073452344 @default.
• W1590582691 cites W2074739868 @default.
• W1590582691 cites W2077897483 @default.
• W1590582691 cites W2082025042 @default.
• W1590582691 cites W2087159834 @default.
• W1590582691 cites W2094734495 @default.
• W1590582691 cites W2096509679 @default.
• W1590582691 cites W2100468043 @default.
• W1590582691 cites W2101963262 @default.
• W1590582691 cites W2102258543 @default.
• W1590582691 cites W2103344667 @default.
• W1590582691 cites W2104333072 @default.
• W1590582691 cites W2106061413 @default.
• W1590582691 cites W2107930846 @default.
• W1590582691 cites W2111621673 @default.
• W1590582691 cites W2112316694 @default.
• W1590582691 cites W2120498409 @default.
• W1590582691 cites W2120822931 @default.
• W1590582691 cites W2124651399 @default.
• W1590582691 cites W2125957038 @default.
• W1590582691 cites W2129028537 @default.
• W1590582691 cites W2129849999 @default.
• W1590582691 cites W2133520751 @default.
• W1590582691 cites W2134744973 @default.
• W1590582691 cites W2137475084 @default.
• W1590582691 cites W2138148348 @default.
• W1590582691 cites W2140403911 @default.
• W1590582691 cites W2140525529 @default.
• W1590582691 cites W2140531391 @default.
• W1590582691 cites W2140534206 @default.
• W1590582691 cites W2148135143 @default.
• W1590582691 cites W2153297552 @default.
• W1590582691 cites W2157457404 @default.
• W1590582691 cites W2160494326 @default.
• W1590582691 cites W2160742791 @default.
• W1590582691 cites W2162076967 @default.
• W1590582691 cites W2164192722 @default.
• W1590582691 cites W2167627514 @default.
• W1590582691 cites W2171503138 @default.
• W1590582691 cites W2171970784 @default.
• W1590582691 cites W2180449651 @default.
• W1590582691 cites W2685601886 @default.
• W1590582691 cites W2912808400 @default.
• W1590582691 cites W2914989796 @default.
• W1590582691 cites W3021559346 @default.
• W1590582691 cites W3041700000 @default.
• W1590582691 cites W3217199848 @default.
• W1590582691 doi "https://doi.org/10.5075/epfl-thesis-4599" @default.
• W1590582691 hasPublicationYear "2010" @default.
• W1590582691 type Work @default.
• W1590582691 sameAs 1590582691 @default.
• W1590582691 citedByCount "1" @default.
• W1590582691 countsByYear W15905826912018 @default.
• W1590582691 crossrefType "journal-article" @default.
• W1590582691 hasAuthorship W1590582691A5089809124 @default.
• W1590582691 hasConcept C104954878 @default.
• W1590582691 hasConcept C120314980 @default.
• W1590582691 hasConcept C127413603 @default.
• W1590582691 hasConcept C191485582 @default.
• W1590582691 hasConcept C204948658 @default.
• W1590582691 hasConcept C2781271823 @default.
• W1590582691 hasConcept C31258907 @default.
• W1590582691 hasConcept C41008148 @default.

• next