Sciweavers

867 search results - page 24 / 174
» Network Robustness and Graph Topology
Sort
View
WWW
2004
ACM
14 years 8 months ago
SPT-based topology algorithm for constructing power efficient wireless ad hoc networks
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
Szu-Chi Wang, David S. L. Wei, Sy-Yen Kuo
HYBRID
2007
Springer
13 years 11 months ago
Solving Coverage Problems with Embedded Graph Grammars
We show how Embedded Graph Grammars (EGGs) are used to specify local interaction rules between mobile robots in a natural manner. This formalism allows us to treat local network to...
John-Michael McNew, Eric Klavins, Magnus Egerstedt
AI
2002
Springer
13 years 7 months ago
Emergence of social conventions in complex networks
The emergence of social conventions in multi-agent systems has been analyzed mainly in settings where every agent may interact either with every other agent or with nearest neighb...
Jordi Delgado
INFOCOM
2007
IEEE
14 years 1 months ago
Face Tracing Based Geographic Routing in Nonplanar Wireless Networks
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...
Fenghui Zhang, Hao Li, Anxiao Jiang, Jianer Chen, ...
IJON
2010
94views more  IJON 2010»
13 years 6 months ago
Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...
Fabrice Rossi, Nathalie Villa-Vialaneix