Sciweavers

2149 search results - page 3 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
14 years 11 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
TWC
2008
103views more  TWC 2008»
14 years 9 months ago
Semi-Distributed User Relaying Algorithm for Amplify-and-Forward Wireless Relay Networks
In this paper, designing an effective user relaying algorithm, in terms of relay node selection and power allocation, is discussed for amplify-and-forward wireless relay networks. ...
Jun Cai, Xuemin Shen, Jon W. Mark, Attahiru Sule A...
INFOCOM
2008
IEEE
15 years 3 months ago
A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...
Ramin Khalili, James F. Kurose
TON
2008
122views more  TON 2008»
14 years 9 months ago
Distributed throughput maximization in wireless mesh networks via pre-partitioning
Abstract-- This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number ...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
73
Voted
OPODIS
2008
14 years 11 months ago
Distributed Approximation of Cellular Coverage
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...
Boaz Patt-Shamir, Dror Rawitz, Gabriel Scalosub