Sciweavers

298 search results - page 35 / 60
» Minimizing Flow Time in the Wireless Gathering Problem
Sort
View
WALCOM
2007
IEEE
151views Algorithms» more  WALCOM 2007»
13 years 8 months ago
Base Station Placement Problem on the Boundary of a Convex Region
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. ...
INFOCOM
2009
IEEE
14 years 2 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
JNW
2008
103views more  JNW 2008»
13 years 7 months ago
Avoidance Mechanism of Redundant Transmissions in Content Cruising System
"Content Cruising System (CCS)" is developed as a decentralized and autonomous distribution system for location-based contents. The content put into CCS carries itself to...
Takaaki Ishida, Keijiro Ehara, Seiichiro Toda, Yas...
CEE
2006
75views more  CEE 2006»
13 years 7 months ago
Survivability and performance optimization of mobile wireless communication networks in the event of base station failure
In this paper, we investigate the survivability of mobile wireless communication networks in the event of base station (BS) failure. A survivable network is modeled as a mathemati...
Kuo-Chung Chu, Frank Yeong-Sung Lin
PDCN
2007
13 years 8 months ago
One-to-all personalized communication in torus networks
Given a multicomputer system of parallel processors connected in a torus network, the one-to-all personalized communication is to send from the root processor unique data to each ...
Weizhen Mao, Jie Chen, William A. Watson III