Sciweavers

2354 search results - page 182 / 471
» Radio number for trees
Sort
View
IS
2010
15 years 5 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
SENSYS
2004
ACM
15 years 12 months ago
Mitigating congestion in wireless sensor networks
Network congestion occurs when offered traffic load exceeds available capacity at any point in a network. In wireless sensor networks, congestion causes overall channel quality t...
Bret Hull, Kyle Jamieson, Hari Balakrishnan
JSAC
2008
165views more  JSAC 2008»
15 years 6 months ago
Energy-Efficient Routing Schemes for Underwater Acoustic Networks
Interest in underwater acoustic networks has grown rapidly with the desire to monitor the large portion of the world covered by oceans. Fundamental differences between underwater a...
Michele Zorzi, Paolo Casari, Nicola Baldo, Albert ...
NETWORK
2007
167views more  NETWORK 2007»
15 years 6 months ago
Sensor Localization under Limited Measurement Capabilities
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
Chen Wang, Li Xiao
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 10 months ago
Decentralized Online Learning Algorithms for Opportunistic Spectrum Access
—The fundamental problem of multiple secondary users contending for opportunistic spectrum access over multiple channels in cognitive radio networks has been formulated recently ...
Yi Gai, Bhaskar Krishnamachari