Sciweavers

2571 search results - page 222 / 515
» Approximation schemes for wireless networks
Sort
View
EURONGI
2005
Springer
16 years 8 days ago
A Low Computation Cost Algorithm to Solve Cellular Systems with Retrials Accurately
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
Maria José Doménech-Benlloch, Jos&ea...
MDM
2009
Springer
123views Communications» more  MDM 2009»
16 years 1 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
DCOSS
2007
Springer
16 years 28 days ago
Optimal Cluster Association in Two-Tiered Wireless Sensor Networks
Abstract. In this paper, we study the two-tiered wireless sensor network (WSN) architecture and propose the optimal cluster association algorithm for it to maximize the overall net...
Weizhao Wang, Wen-Zhan Song, Xiang-Yang Li, Kousha...
MONET
2006
103views more  MONET 2006»
15 years 6 months ago
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
Ioannis Papadimitriou, Leonidas Georgiadis
CCCG
2007
15 years 8 months ago
Terminal Steiner Tree with Bounded Edge Length
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
Zhiyong Lin