Sciweavers

890 search results - page 7 / 178
» On the attractiveness of the star network
Sort
View
SENSYS
2006
ACM
15 years 3 months ago
StarDust: a flexible architecture for passive localization in wireless sensor networks
The problem of localization in wireless sensor networks where nodes do not use ranging hardware, remains a challenging problem, when considering the required location accuracy, en...
Radu Stoleru, Pascal Vicaire, Tian He, John A. Sta...
IPPS
2007
IEEE
15 years 3 months ago
A Combinatorial Analysis of Distance Reliability in Star Network
This paper addresses a constrained two-terminal reliability measure referred to as Distance Reliability (DR) between the source node u and the destination node I with the shortest...
Xiaolong Wu, Shahram Latifi, Yingtao Jiang
JSAC
2006
157views more  JSAC 2006»
14 years 9 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
IPPS
1999
IEEE
15 years 1 months ago
Optimal Scheduling Algorithms in WDM Optical Passive Star Networks
All-to-all broadcast scheduling problems are considered in WDM optical passive star networks where k wavelengths are available in the network. It is assumed that each node has exac...
Hongjin Yeh, Kyubum Wee, Manpyo Hong
76
Voted
TC
1998
14 years 9 months ago
Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks
—We consider the problem of realizing several common communication structures in the all-optical Partitioned Optical Passive Stars (POPS) topology. We show that, often, the obvio...
Greg Gravenstreter, Rami G. Melhem