Sciweavers

767 search results - page 138 / 154
» A Performance Comparison of Multi-Hop Wireless Ad Hoc Networ...
Sort
View
WINET
2010
185views more  WINET 2010»
13 years 5 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Sinem Coleri Ergen, Pravin Varaiya
MOBICOM
2003
ACM
14 years 24 days ago
Geographic routing without location information
For many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e....
Ananth Rao, Christos H. Papadimitriou, Scott Shenk...
ESAS
2006
Springer
13 years 11 months ago
So Near and Yet So Far: Distance-Bounding Attacks in Wireless Networks
Distance-bounding protocols aim to prevent an adversary from pretending that two parties are physically closer than they really are. We show that proposed distance-bounding protoco...
Jolyon Clulow, Gerhard P. Hancke, Markus G. Kuhn, ...
PERCOM
2007
ACM
14 years 7 months ago
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
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 many real ...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
GLOBECOM
2009
IEEE
14 years 2 months ago
PreDA: Predicate Routing for DTN Architectures over MANET
—We consider a Delay Tolerant Network (DTN) whose users (nodes) are connected by an underlying Mobile Ad hoc Network (MANET) substrate. Users can declaratively express high-level...
Flavio Esposito, Ibrahim Matta