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...
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...
— 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...
—Wireless Mesh Networks represent an interesting technology due to their reliability, broad coverage and relatively easy and inexpensive scalability. The architecture is mainly a...
— Vehicular ad hoc networks using WLAN technology have recently received considerable attention. We present a position-based routing scheme called Connectivity-Aware Routing (CAR...