Sciweavers

1592 search results - page 206 / 319
» Source-Tree Routing in Wireless Networks
Sort
View
WSNA
2003
ACM
15 years 6 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng
120
Voted
PERCOM
2007
ACM
16 years 9 days ago
Fundamental Mobility Properties for Realistic Performance Analysis of Intermittently Connected Mobile Networks
Traditional mobile ad hoc routing protocols fail to deliver any data in Intermittently Connected Mobile Ad Hoc Networks (ICMN's) because of the absence of complete end-to-end ...
Apoorva Jindal, Konstantinos Psounis
98
Voted
IWIA
2005
IEEE
15 years 6 months ago
SAWAN: A Survivable Architecture for Wireless LANs
This paper1 describes survivability schemes against Access Point (AP) failures in Wireless LANs. It particularly aims for resiliency and survivability against multistage attacks w...
Mohit Virendra, Shambhu J. Upadhyaya, Vivek Kumar,...
MOBIHOC
2004
ACM
16 years 9 days ago
Localized algorithms for energy efficient topology in wireless ad hoc networks
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
Wen-Zhan Song, Yu Wang 0003, Xiang-Yang Li
92
Voted
MOBIHOC
2002
ACM
16 years 9 days ago
Performance analysis of the CONFIDANT protocol
: Mobile ad-hoc networking works properly only if the participating nodes cooperate in routing and forwarding. However, it may be advantageous for individual nodes not to cooperate...
Sonja Buchegger, Jean-Yves Le Boudec