Sciweavers

2279 search results - page 348 / 456
» Distributed Spectrum-Efficient Routing Algorithms in Wireles...
Sort
View
113
Voted
IPPS
2007
IEEE
15 years 9 months ago
Performance Modelling of Necklace Hypercubes
The necklace hypercube has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology has mainly focused on topo...
Sina Meraji, Hamid Sarbazi-Azad, Ahmad Patooghy
ATAL
2010
Springer
15 years 4 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings
GIS
2008
ACM
16 years 4 months ago
Detecting basic topological changes in sensor networks by local aggregation
Wireless sensor networks (WSNs) can provide real-time information about geospatial environments, and so have the potential to play an important role in the monitoring of geographi...
Jixiang Jiang, Michael F. Worboys
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
15 years 10 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
TON
2010
126views more  TON 2010»
14 years 10 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai