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.
Greedy geographic routing is widely adopted in practical wireless networks due to its simplicity. However, greedy geographic routing alone cannot guarantee the delivery of packets due to the existence of local minima. A number of solutions have been proposed to address this issue, such as face routing, landmark-based routing, network segmentation or virtual coordinate based methods, etc. However,...
In this paper, we focus on the efficient routing of data among different areas in Delay Tolerant Networks (DTNs). In current algorithms, packets are forwarded gradually through nodes with higher probability of visiting the destination node or area. However, the number of such nodes usually is limited, leading to insufficient throughput performance. To solve this problem, we propose an inter-landmark...
GPS is the premier method of localization and way finding in outdoor environments. Indoor environments prevent GPS from functioning properly or at all. RF-based solutions have been proposed using varieties of radio triangulation and spectral fingerprinting. Such technically attractive methods have not seen widespread adoption in places where the demand is greatest: supermarkets, shopping malls, airports,...
Geographic forwarding has been widely studied as a routing strategy for mobile ad hoc networks, mainly due to the low complexity, scalability of the routing algorithm. However, in a network with routing holes, existing geographic routing schemes such as GPSR, GOAFR could cause the throughput capacity to drop significantly due to concentration of traffic on the face of the holes. The slope-based stateless...
Geographic routing is widely used in wireless sensor networks due to its great efficiency, good scalability and computed routing close to the best possible. However, the problem that geographic routing uses GPS receivers or location algorithms to obtain nodes' geographic information leads to expensive cost and high overhead. Aiming at this problem, we present a Landmark-based Virtual Geographic Routing...
The nodes at the border of the self-configurable wireless network are commonly employed as landmarks for many applications, including infrastructureless localization, border detection, and routing. However, how to identify the best set of nodes as such landmarks is still an open problem. In this paper, we propose three algorithms for border landmark selection, namely: the Convex Hull-Based (CHB) algorithm,...
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.