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.
Minimum-latency beaconing scheduling (MLBS) has been well studied when all the nodes are always awake. However, it is well-known that the networking nodes often switch between the active state and the sleep state to save energy. None of the known algorithms for MLBS are suitable for duty-cycled multihop wireless networks. In this paper, we study MLBS in duty-cycled multihop wireless networks (MLBSDC)...
Beaconing is a primitive communication task in which every node locally broadcasts a packet to all of its neighbors within a fixed distance. The problem Minimum Latency Beaconing Schedule (MLBS) seeks a shortest schedule for beaconing subject to the interference constraint. MLBS has been well studied when all the nodes are always awake. However, it is well-known that the networking nodes often switch...
Broadcast, one of the most essential operations in multihop wireless networks, is widely used for routing discovery, data collection, code updating and other network functions. The problem of computing a broadcasting schedule with minimum latency in multihop wireless networks is referred to as Minimum-Latency Broadcasting Schedule (MLBS). Under the assumption that all the nodes are always active,...
In this paper we study the following optimization problem in a plane multihop wireless network under the physical interference model. Given a multihop wireless network and a positive link weight (or demand) function, select a set of independent links whose total weight is maximized. This problem is known to be NP-hard. The best known approximation algorithm for this problem achieves logarithmic factor...
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.