Sciweavers

530 search results - page 91 / 106
» Bounds on marginal probability distributions
Sort
View
MOBIHOC
2001
ACM
16 years 5 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...
ICASSP
2009
IEEE
16 years 24 days ago
MIMO decoding based on stochastic reconstruction from multiple projections
Least squares (LS) fitting is one of the most fundamental techniques in science and engineering. It is used to estimate parameters from multiple noisy observations. In many probl...
Amir Leshem, Jacob Goldberger
128
Voted
ICC
2009
IEEE
121views Communications» more  ICC 2009»
16 years 24 days ago
Idle Channel Time Estimation in Multi-Hop Wireless Networks
—This paper presents a theoretical estimation for idle channel time in a multi-hop environment. Idle channel time is the time proportion of a node during which the channel state ...
Simon Odou, Steven Martin, Khaldoun Al Agha
IWCMC
2006
ACM
16 years 1 days ago
Tracers placement for IP traceback against DDoS attacks
This paper explores the tracers deployment problem for IP traceback methods how many and where the tracers should be deployed in the network to be effective for locating the attac...
Chun-Hsin Wang, Chang-Wu Yu, Chiu-Kuo Liang, Kun-M...
ICT
2004
Springer
127views Communications» more  ICT 2004»
15 years 11 months ago
An Interference Avoidance Technique for Ad Hoc Networks Employing Array Antennas
Array antennas have the potential to increase the capacity of wireless networks, but a distributed beamforming algorithm for maximizing the capacity in asynchronous, decentralized ...
T. Hunziker, Jacir Luiz Bordim, T. Ohira, Shinsuke...