Sciweavers

5451 search results - page 47 / 1091
» Connectivity of a Gaussian network
Sort
View
FOCS
2009
IEEE
15 years 6 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov
103
Voted
EURONGI
2008
Springer
15 years 1 months ago
Connectivity Gateway Discovery in MANETs
Abstract. The integration of mobile ad hoc networks into IP-based access networks demands the presence of a gateway which is responsible for propagating some configuration paramete...
Antonio J. Yuste, Alicia Triviño-Cabrera, F...
ICC
2008
IEEE
15 years 6 months ago
Sizes of Minimum Connected Dominating Sets of a Class of Wireless Sensor Networks
— We consider an important performance measure of wireless sensor networks, namely, the least number of nodes, N, required to facilitate routing between any pair of nodes, allowi...
Ji Li, Chuan Heng Foh, Lachlan L. H. Andrew, Moshe...
PERCOM
2006
ACM
15 years 11 months ago
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks
Consider a placement of heterogeneous, wireless sensors that can vary the transmission range by increasing or decreasing power. The problem of determining an optimal assignment of ...
Kenneth A. Berman, Fred S. Annexstein, Aravind Ran...
ICPPW
2009
IEEE
15 years 6 months ago
Link and Route Availability for Inter-working Multi-hop Wireless Networks
— In inter-working multi-hop wireless networks, establishing resilient connectivity between source-destination node pairs is a major issue. The issues of connectivity in multihop...
Oladayo Salami, Antoine B. Bagula, H. Anthony Chan