Sciweavers

2149 search results - page 70 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
INFOCOM
2007
IEEE
15 years 7 months ago
Tradeoff Between Lifetime and Rate Allocation in Wireless Sensor Networks: A Cross Layer Approach
— This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by investigating the interaction between network lifetime max...
Junhua Zhu, Shan Chen, Brahim Bensaou, Ka-Lok Hung
INFOCOM
2012
IEEE
13 years 3 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
CONEXT
2009
ACM
15 years 2 months ago
Traffic management and resource allocation in small wired/wireless networks
We consider the problem of traffic management in small networks with both wireless and wired devices, connected to the Internet through a single gateway. Examples of such networks...
Christos Gkantsidis, Thomas Karagiannis, Peter B. ...
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
15 years 10 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
ADHOCNOW
2005
Springer
15 years 7 months ago
Heuristic Algorithms for Minimum Bandwith Consumption Multicast Routing in Wireless Mesh Networks
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta