Sciweavers

11381 search results - page 98 / 2277
» Connectivity
Sort
View
96
Voted
SOFSEM
2009
Springer
15 years 9 months ago
-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
Nguyen Kim Thang
114
Voted
AINA
2008
IEEE
15 years 7 months ago
Geographical Routing in Intermittently Connected Ad Hoc Networks
In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destinat...
Erik Kuiper, Simin Nadjm-Tehrani
92
Voted
VTC
2008
IEEE
114views Communications» more  VTC 2008»
15 years 7 months ago
Improving Ad Hoc Networks Capacity and Connectivity Using Dynamic Blind Beamforming
— We propose a dynamic blind beamforming scheme which allows to benefit from antenna directivity in large mobile ad hoc networks while avoiding heavy feedback to track mobile no...
Nadia Fawaz, Zafer Beyaztas, David Gesbert, M&eacu...
ICC
2007
IEEE
148views Communications» more  ICC 2007»
15 years 7 months ago
On Connectivity and Capacity of Wireless Mesh Networks
—Wireless Mesh Networks represent an interesting technology due to their reliability, broad coverage and relatively easy and inexpensive scalability. The architecture is mainly a...
Ernesto Miorando, Fabrizio Granelli
102
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
Connectivity-Aware Routing (CAR) in Vehicular Ad-hoc Networks
— Vehicular ad hoc networks using WLAN technology have recently received considerable attention. We present a position-based routing scheme called Connectivity-Aware Routing (CAR...
Valery Naumov, Thomas R. Gross