Sciweavers

1783 search results - page 280 / 357
» Low-Complexity Distributed Scheduling Algorithms for Wireles...
Sort
View
ATAL
2009
Springer
15 years 8 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...
CN
2007
148views more  CN 2007»
15 years 1 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel
IDEAS
2008
IEEE
256views Database» more  IDEAS 2008»
15 years 8 months ago
WIDS: a sensor-based online mining wireless intrusion detection system
This paper proposes WIDS, a wireless intrusion detection system, which applies data mining clustering technique to wireless network data captured through hardware sensors for purp...
Christie I. Ezeife, Maxwell Ejelike, Akshai K. Agg...
MOBIHOC
2008
ACM
16 years 1 months ago
Bubble rap: social-based forwarding in delay tolerant networks
In this paper we seek to improve our understanding of human mobility in terms of social structures, and to use these structures in the design of forwarding algorithms for Pocket S...
Pan Hui, Jon Crowcroft, Eiko Yoneki
112
Voted
QUESTA
2010
131views more  QUESTA 2010»
15 years 9 days ago
Asymptotically optimal parallel resource assignment with interference
Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous servi...
Maaike Verloop, R. Núñez Queija