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.
Quality of Service (QoS) routing is known to be an NP-hard problem in case of two or more additive constraints and several exact algorithms and heuristics have been proposed to address this issue. In this work, we consider a particular two-Constrained Quality of Service Routing Problem where one constraint is superlative and the other is comparative. We consider the superlative constraint to represent...
The notion of vertex sparsification (in particular cut-sparsification) is introduced in, where it was shown that for any graph G = (V, E) and any subset of k terminals K ⊂ V, there is a polynomial time algorithm to construct a graph H = (K, EH) on just the terminal set so that simultaneously for all cuts (A,K-A), the value of the minimum cut in G separating A from K-A is approximately the same as...
Indoor Wireless sensor networks require a highly dynamic, adaptive routing scheme to deal with the high rate of topology changes due to fading of indoor wireless channels. Besides that, energy consumption rate needs to be consistently distributed among sensor nodes and efficient utilization of battery power is essential. If only the link reliability metric is considered in the routing scheme, it may...
Is the temporal dimension alone sufficient to characterize contacts in opportunistic networks? Several studies analyze the temporal aspect of contacts with significant results concerning contact and inter-contact distributions. Nevertheless, only the temporal dimension does not give a complete overview of contact characterization. In this paper, we propose the surround indicator as a metric to exhibit...
In wireless sensor networks, with respect to a desired time deadline real-time data dissemination schemes achieve that by a spatiotemporal communication approach forwarding data from a source to a destination with a delivery speed. The delivery speed is typically obtained from both the static distance from the source to the destination and the interval of the time deadline. However, in case of real-time...
Delay tolerant networks (DTNs) are a class of networks that experience frequent and long-duration partitions due to sparse distribution of nodes. DTN multicasting is a desirable feature for applications where some form of group communication is needed. In this paper, we examine multicasting in DTNs using controlled flooding schemes. Specifically, we analyze basic multicast routing schemes for fundamental...
Wireless sensor networks (WSNs) consists of unattended sensors with limited storage, energy (battery power) and computation and communication capabilities. So, energy-efficient mechanism for wireless communication on each sensor node is so crucial for wireless sensor networks. This paper firstly makes a summary to power control and the existing routing metrics then finds the several key characteristics...
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.