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.
We study the spectrum market equilibrium where multiple spectrum channels are available, and each of the secondary users has an initial endowment. Assume that each user, with a given endowment, is interested in buying spectrum channels over a specified set of geometric regions in the Euclidean plane. Regions may overlap, thus creating sub- regions where each subregion has a unique set of users interested...
In this paper, we study the spectrum assignment problem for wireless access networks. We assume that each secondary user will bid a certain value for exclusive usage of some spectrum channels for a certain time period or for a certain time duration. A secondary user may also require the exclusive usage of a subset of channels, or require the exclusive usage of a certain number of channels. Thus, several...
Efficient collision detection is a fundamental and very challenging problem in real-time surgery simulation. This paper presents a novel collision detection algorithm to detect collision and self-collision, between complex models undergoing rigid motion and deformation. The algorithm relies on a hierarchical model representation using axis-aligned bounding boxes (AABBs) and sort algorithm. Two main...
In this paper, we study efficient data collection in wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum number of messages to be sent by all nodes, or the minimum total energy costs by all nodes. We analytically prove that all proposed methods are either optimum or within constants factor of the optimum. We then investigate the...
In this paper, we study efficient data collection and aggregation problem in wireless sensor networks. We first propose efficient distributed algorithms for data collection problem with approximately the minimum delay, or the minimum number of messages to be sent by all wireless nodes, or the minimum total energy consumption by all wireless nodes respectively. For example, given an algorithm A for...
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.