Sciweavers

597 search results - page 77 / 120
» Combinatorial Models for Cooperation Networks
Sort
View
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 3 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
IPPS
2007
IEEE
14 years 3 months ago
Real-Time Distributed Scheduling of Precedence Graphs on Arbitrary Wide Networks
Previous work on scheduling dynamic competitive jobs is focused on multiprocessors configurations. This paper presents a new distributed dynamic scheduling scheme for sporadic re...
Franck Butelle, Mourad Hakem, Lucian Finta
ESAW
2000
Springer
14 years 19 days ago
Models of Coordination
While software is becoming decomposed in more and more finegrained entities, the interactions amongst those become of major importance. While methodologies for building such compon...
Robert Tolksdorf
ICC
2007
IEEE
14 years 3 months ago
Optimizing Zero-Forcing Based Gain Allocation for Wireless Multiuser Networks
— We consider a wireless multiuser network where a number of source/destination pairs communicate concurrently over the same physical channel. A set of amplify-and-forward relay ...
Celal Esli, Stefan Berger, Armin Wittneben
ATAL
2005
Springer
14 years 2 months ago
Data storage in unreliable multi-agent networks
The distributed data storage on unreliable devices, connected by a short-range radio network is analyzed. Failing devices incur loss of data. To prevent the loss, the data is spli...
Filip Miletic, Patrick Dewilde