Sciweavers

3638 search results - page 226 / 728
» Optimization via communication networks
Sort
View
MOBIHOC
2001
ACM
16 years 6 months ago
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
Seapahn Meguerdichian, Sasha Slijepcevic, Vahag Ka...
ISNN
2005
Springer
16 years 4 days ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
JSAC
2008
125views more  JSAC 2008»
15 years 6 months ago
Optimal Competitive Algorithms for Opportunistic Spectrum Access
We consider opportunistic spectrum access (OSA) strategies for a transmitter in a multichannel wireless system, where a channel may or may not be available and the transmitter must...
Nicholas B. Chang, Mingyan Liu
DATE
2005
IEEE
143views Hardware» more  DATE 2005»
16 years 8 days ago
galsC: A Language for Event-Driven Embedded Systems
— We introduce galsC, a language designed for programming event-driven embedded systems such as sensor networks. galsC implements the TinyGALS programming model. At the local lev...
Elaine Cheong, Jie Liu
SIAMAM
2011
14 years 9 months ago
On the Optimal Receiver Activation Function for Distance-Based Geographic Transmissions
In wireless networks, the channels are often subject to random variations that limit the reliability of communications between any two radios. Geographic transmission strategies ca...
Murali Rao, Tathagata D. Goswami, Joseph Glover, J...