Sciweavers

118 search results - page 21 / 24
» Randomness in Wireless Networks: How to Deal with It
Sort
View
IPSN
2007
Springer
15 years 3 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
IJNSEC
2006
143views more  IJNSEC 2006»
14 years 9 months ago
Password Authentication Schemes: Current Status and Key Issues
Password authentication is one of the simplest and the most convenient authentication mechanisms to deal with secret data over insecure networks. It is more frequently required in...
Chwei-Shyong Tsai, Cheng-Chi Lee, Min-Shiang Hwang
TON
2008
107views more  TON 2008»
14 years 9 months ago
Efficient routing in intermittently connected mobile networks: the multiple-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
TMC
2008
210views more  TMC 2008»
14 years 9 months ago
Adaptive Cluster-Based Data Collection in Sensor Networks with Direct Sink Access
Recently wireless sensor networks featuring direct sink access have been studied as an efficient architecture to gather and process data for numerous applications. In this paper, w...
Mahdi Lotfinezhad, Ben Liang, Elvino S. Sousa
WIOPT
2006
IEEE
15 years 3 months ago
Analyzing the impact of neighbor sensing on the performance of the OLSR protocol
— This paper presents an analysis of several neighbor sensing approaches for the OLSR routing protocol. While several performance studies of OLSR proceed this work, few attention...
Michael Voorhaen, Chris Blondia