Sciweavers

736 search results - page 13 / 148
» Geometrically aware communication in random wireless network...
Sort
View
ALGOSENSORS
2007
Springer
15 years 3 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
JSAC
2007
128views more  JSAC 2007»
14 years 9 months ago
Location-Aware Services over Vehicular Ad-Hoc Networks using Car-to-Car Communication
Abstract— Recent advances in wireless inter-vehicle communication systems enable the establishment of Vehicular Ad-hoc Networks (VANET) and create significant opportunities for ...
Marios D. Dikaiakos, Andreas Florides, Tamer Nadee...
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
14 years 11 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
CHI
2001
ACM
15 years 9 months ago
ConNexus to awarenex: extending awareness to mobile users
We explored the use of awareness information to facilitate communication by developing a series of prototypes. The ConNexus prototype integrates awareness information, instant mes...
John C. Tang, Nicole Yankelovich, James Begole, Ma...
INFOCOM
2008
IEEE
15 years 3 months ago
Design of a Channel Characteristics-Aware Routing Protocol
Abstract—Radio channel quality of real-world wireless networks tends to exhibit both short-term and long-term temporal variations that are in general difficult to model. To maxi...
Rupa Krishnan, Ashish Raniwala, Tzi-cker Chiueh