Sciweavers

5068 search results - page 396 / 1014
» Basic Computations in Wireless Networks
Sort
View
AUTONOMICS
2008
ACM
15 years 8 months ago
QoS-aware ant routing with colored pheromones in wireless mesh networks
Inspired by the collective foraging behavior of specific ant species, ant-based routing algorithms are able to find optimal or near optimal packet routes for Wireless Mesh Network...
Martina Umlauft, Wilfried Elmenreich
ICDCN
2011
Springer
14 years 10 months ago
Deterministic Dominating Set Construction in Networks with Bounded Degree
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
Roy Friedman, Alex Kogan
UIC
2007
Springer
16 years 27 days ago
Gateway Zone Multi-path Routing in Wireless Mesh Networks
Internet and multimedia services are widely-provided in All-IP based networks. There has been growing demand for mobile users to get those services. The Wireless Mesh Network (WMN...
Eric Hsiao-Kuang Wu, Wei-Li Chang, Chun-Wei Chen, ...
CLUSTER
2002
IEEE
15 years 6 months ago
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
Susanta Datta, Ivan Stojmenovic, Jie Wu
ECCC
2000
158views more  ECCC 2000»
15 years 6 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass