Sciweavers

838 search results - page 1 / 168
» On the Robustness of Complex Networks by Using the Algebraic...
Sort
View
NETWORKING
2008
13 years 6 months ago
On the Robustness of Complex Networks by Using the Algebraic Connectivity
The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, plays a special role for the robustness of complex networks since it measures the ...
A. Jamakovic, Piet Van Mieghem
INFOCOM
2002
IEEE
13 years 9 months ago
Beyond Routing: An Algebraic Approach to Network Coding
Abstract— In this paper we consider the issue of network capacity. The recent work by Li and Yeung examined the network capacity of multicast networks and related capacity to cut...
Muriel Médard, Ralf Koetter
TWC
2008
80views more  TWC 2008»
13 years 4 months ago
Robust connectivity-aware energy-efficient routing for wireless sensor networks
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
Charles Pandana, K. J. Ray Liu
SEFM
2008
IEEE
13 years 11 months ago
Restricted Broadcast Process Theory
We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols. In our algebra we model the essential modeling concepts of ad ho...
Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar
BIB
2007
99views more  BIB 2007»
13 years 4 months ago
Towards a calculus of biomolecular complexes at equilibrium
An overview is presented of the construction and use of algebraic partition functions to represent the equilibrium statistical mechanics of multimolecular complexes and their acti...
Eric Mjolsness