Sciweavers

710 search results - page 30 / 142
» On Minimum Power Connectivity Problems
Sort
View
INFOCOM
2003
IEEE
14 years 27 days ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
JCO
2006
103views more  JCO 2006»
13 years 7 months ago
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
JGT
2007
68views more  JGT 2007»
13 years 7 months ago
Forcing highly connected subgraphs
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
Maya Jakobine Stein
JPDC
2007
191views more  JPDC 2007»
13 years 7 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
MOBIQUITOUS
2007
IEEE
14 years 1 months ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt