Sciweavers

1426 search results - page 140 / 286
» Broadcasting on networks of workstations
Sort
View
MOBIQUITOUS
2008
IEEE
16 years 26 days ago
Exploiting Schelling behavior for improving data accessibility in mobile peer-to-peer networks
In 1969, Thomas Schelling proposed one of the most cited models in economics to explain how similar people (e.g. people with the same race, education, community) group together in...
Long Vu, Klara Nahrstedt, Matthias Hollick
WCNC
2010
IEEE
15 years 10 months ago
Many-To-Many Communications via Space-Time Network Coding
—In this paper, the mutual cooperative communication between multiple nodes in a wireless network is efficiently achieved through a novel concept of Space-Time Network Coding (S...
Mohammed W. Baidas, Hung-Quoc Lai, K. J. Ray Liu
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 8 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
ICC
2007
IEEE
171views Communications» more  ICC 2007»
16 years 25 days ago
Progressive Route Calculation Protocol for Wireless Mesh Networks
—Although network-wide flooding in reactive routing protocols like AODV [1] facilitates the discovery of optimal routes, they engender large control overhead. Some efficient floo...
Xuhui Hu, Myung J. Lee, Tarek N. Saadawi
SSS
2007
Springer
117views Control Systems» more  SSS 2007»
16 years 18 days ago
Distributed Synthesis of Fault-Tolerant Programs in the High Atomicity Model
In this paper, we concentrate on distributed algorithms for automated synthesis of fault-tolerant programs in the high atomicity model, where all processes can read and write all p...
Borzoo Bonakdarpour, Sandeep S. Kulkarni, Fuad Abu...