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.
Packet routing is important for Vehicular Delay Tolerant Networks (VDTNs).Opportunistic routing algorithms based on historical records are insuciently accurate in forwarder selection due to movement randomness of vehicles. Trajectory-based routing algo- rithms tackle vehicle movement randomness but cannot be directly used in VDTNs due to the dependence on APs. In this paper, we develop a distributed...
Present approaches to achieve k-coverage for Wireless Sensor Networks still rely on centralized techniques. In this paper, we devise a distributed method for this problem, namely Distributed VOronoi based Cooperation scheme (DVOC), where nodes cooperate in hole detection and recovery. In previous Voronoi based schemes, each node only monitors its own critical points. Such methods are inefficient for...
Delay Tolerant Networks (DTNs) have attracted significant interests due to the adaptability in areas without infrastructures. In such scenarios, moving data from one place (landmark) to another place (landmark) is essential for data communication between different areas. However, current DTN routing algorithms either fail to fully utilize node mobility or have additional requirements that cannot be...
In delay tolerant networks (DTNs), enabling a node to search and find an interested mobile node is an important function in many applications. However, the movement of nodes in DTNs makes the problem formidable. Current methods in disconnected networks mainly rely on fixed stations and infrastructure-based communication to collect node position information, which is difficult to implement in DTNs...
In current reputation systems for peer-to-peer (P2P) file sharing networks, reputation querying generates high overhead in file service. Also, a high-reputed node may be reluctant to further increase its reputation in these reputation systems. Recently, social network-based P2P systems that favor file sharing among friends have been proposed for reliable file sharing. However, this approach contradicts...
Due to intermittent connection and limited communication opportunity, routing in Delay Tolerant Networks (DTNs) is usually conducted in a store-carry-forward manner. Consequently, different packet forwarding or storage strategies can lead to different performance objectives, such as minimal average delay, maximal hit rate, and minimal maximal delay, which are desired by applications with different...
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.