Sciweavers

2343 search results - page 347 / 469
» The Locomotive Routing Problem
Sort
View
CISS
2008
IEEE
15 years 11 months ago
Peer-to-Peer utility maximization
—In this paper, we study the problem of utility maximization in Peer-to-Peer (P2P) systems, in which aggregate utilities are maximized by running distributed algorithms on P2P no...
Minghua Chen, Sudipta Sengupta, Miroslav Ponec, Ph...
IWCMC
2006
ACM
15 years 11 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras

Publication
247views
17 years 3 months ago
A Survey of Protocols and Open Issues in ATM Multipoint Communication
Asynchronous transfer mode (ATM) networks must define multicast capabilities in order to efficiently support numerous applications, such as video conferencing and distributed appli...
Sonia Fahmy, Raj Jain, Shivkumar Kalyanaraman, Roh...
MOBIHOC
2002
ACM
16 years 4 months ago
Performance evaluation of a fair backoff algorithm for IEEE 802.11 DFWMAC
Due to hidden terminals and a dynamic topology, contention among stations in an ad-hoc network is not homogeneous. Some stations are at a disadvantage in opportunity of access to ...
Zuyuan Fang, Brahim Bensaou, Yu Wang
ATAL
2009
Springer
15 years 11 months ago
Stigmergic reasoning over hierarchical task networks
Stigmergy is usually associated with semantically simple problems such as routing. It can be applied to more complex problems by encoding them in the environment through which sti...
H. Van Dyke Parunak, Theodore C. Belding, Robert B...