5901 search results - page 604 / 1181 » Algorithms for Wireless Sensor Networks |
151
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
241
click to vote
OL
2011
15 years 1 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
203
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
242
click to vote
OTM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Recent contributions have uncovered the potential of network coding, i.e. algebraic mixing of multiple information flows in a network, to provide enhanced security in pa...
205
click to vote
WISEC
2010
ACM
16 years 12 days ago
2010
ACM
The locations of base stations are critically important to the viability of wireless sensor networks. In this paper, we examine the location privacy problem from both the attack a...