27354 search results - page 4980 / 5471 » Distributed And Parallel Computing |
191
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
Due to hidden terminals and a dynamic topology, contention among stations in an ad-hoc network is not homogeneous. Some stations are at a disadvantage in opportunity of access to ...
196
click to vote
MOBIHOC
2001
ACM
16 years 6 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
199
click to vote
EWSN
2008
Springer
16 years 6 months ago
2008
Springer
Storing and disseminating coded information instead of the original data can bring significant performance improvements to sensor network protocols. Such methods reduce the risk of...
210
click to vote
EWSN
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. We address the problem of designing practical, energy-efficient protocols for data collection in wireless sensor networks using predictive modeling. Prior work has sugges...
191
click to vote
EWSN
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. A theoretical framework is proposed for accurate performance analysis of minimum energy coding schemes in Coded Division Multiple Access (CDMA) wireless sensor networks. ...