Sciweavers

868 search results - page 109 / 174
» Dynamic Connectivity: Connecting to Networks and Geometry
Sort
View
BIOWIRE
2007
Springer
14 years 3 months ago
Coalition Games and Resource Allocation in Ad-Hoc Networks
In this paper we explore some of the connections between cooperative game theory and the utility maximization framework for routing and flow control in networks. Central to both a...
Richard J. Gibbens, Peter B. Key
GC
2004
Springer
14 years 2 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
INFOCOM
2003
IEEE
14 years 2 months ago
Distributed Construction of Random Expander Networks
— We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globall...
Ching Law, Kai-Yeung Siu
CN
2008
126views more  CN 2008»
13 years 9 months ago
Design and evaluation of flow handoff signalling for multihomed mobile nodes in wireless overlay networks
With the increasing deployment of wireless overlay networks, a mobile node with a range of network interfaces can be connected to multiple heterogeneous or homogeneous access netw...
Qi Wang, Robert Atkinson, John Dunlop
PERVASIVE
2008
Springer
13 years 8 months ago
Context-aware routing in wireless mesh networks
Wireless mesh networks promise to deliver resilient connectivity among network nodes, allowing data to be relayed seamlessly between mobile clients and infrastructure. Routing is ...
Peizhao Hu, Marius Portmann, Ricky Robinson, Jadwi...