The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Geographic routing with greedy relaying strategies are important routing schemes in sensor networks. These schemes assume that the nodes have perfect information about the location of the destination. When the destination is unit distance away, the asymptotic routing delays are Θ(1/M(n)) , where M(n) is the maximum distance traveled in one hop (transmission range). We consider three scenarios where:...
Routing to mobile nodes in a wireless network is conventionally performed by associating a static IP address (or a geographic location) to each node, and routing to that address using routing tables at intermediate nodes that are updated periodically to reflect mobility-induced network topology changes. This mode of routing works when the mobiles' speeds as well as the number of mobiles are small...
We consider the problem of throughput-optimal routing over large-scale wireless ad-hoc networks. Gupta and Kumar (2000) showed that a throughput capacity (a uniform rate over all source-destination pairs) of thetas( 1/radicn log n ) is achievable in random planar networks, and the capacity is achieved by straight-line routes. In reality, both the network model and the traffic demands are likely to...
Geographic forwarding has been widely studied as a routing strategy for large wireless networks, mainly due to the low complexity of the routing algorithm, scalability of the routing information with network size and fast convergence times of routes. On a planar network with no holes, Gupta and Kumar (2000) have shown that a uniform traffic demand of ominus(1/radicn log n) is achievable. However,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.