Sciweavers

1835 search results - page 330 / 367
» Security-aware ad hoc routing for wireless networks
Sort
View
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
14 years 11 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
IWSOS
2009
Springer
15 years 4 months ago
A Self-organizing Approach to Activity Recognition with Wireless Sensors
Abstract. In this paper, we describe an approach to activity recognition, which is based on a self-organizing, ad hoc network of body-worn sensors. It makes best use of the availab...
Clemens Holzmann, Michael Haslgrübler
MOBIHOC
2005
ACM
15 years 9 months ago
Timed grid routing (TIGR) bites off energy
Energy efficiency and collisions avoidance are both critical properties to increase the lifetime and effectiveness of wireless networks. This paper proposes a family of algorithms...
Roy Friedman, Guy Korland
70
Voted
ICPPW
2003
IEEE
15 years 3 months ago
Perfect Secrecy in Wireless Networks
In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The ...
Phillip G. Bradford, Olga V. Gavrylyako, Randy K. ...
86
Voted
INFOCOM
2005
IEEE
15 years 3 months ago
Random-access scheduling with service differentiation in wireless networks
— Recent years have seen tremendous growth in the deployment of Wireless Local Area Networks (WLANs). An important design issue in such networks is that of distributed scheduling...
Piyush Gupta, Yogesh Sankarasubramaniam, Alexander...