Sciweavers

41 search results - page 6 / 9
» Discovering Influence in Communication Networks Using Dynami...
Sort
View
SOCIALCOM
2010
14 years 8 months ago
The Dynamics of Two Cognitive Heuristics for Coordination on Networks
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
Iyad Rahwan, Fatemeh Jahedpari, Sherief Abdallah
INFOCOM
2007
IEEE
15 years 4 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
ISPA
2004
Springer
15 years 3 months ago
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell
102
Voted
MOBICOM
2000
ACM
15 years 2 months ago
Caching strategies in on-demand routing protocols for wireless ad hoc networks
An on-demand routing protocol for wireless ad hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a...
Yih-Chun Hu, David B. Johnson
CAINE
2008
14 years 11 months ago
New Architecture and Protocols for Global-Scale Machine Communities
This article is about the new universal architecture which allows electronic devices of different functionalities and manufacturers, as well as on-line services, to seamlessly int...
Vladimir Krylov, N. Mikhaylov, Dmitry V. Ponomarev