Sciweavers

295 search results - page 27 / 59
» An approximation algorithm for the wireless gathering proble...
Sort
View
MOBIHOC
2008
ACM
15 years 9 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
COCOON
2005
Springer
15 years 3 months ago
Fault-Tolerant Relay Node Placement 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 an Euclidean plane, our objective is to place minimum nu...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
COMCOM
2006
120views more  COMCOM 2006»
14 years 9 months ago
Energy efficient routing and scheduling for real-time data aggregation in WSNs
In this paper, we study the problem of constructing an energy efficient data aggregation tree for data gathering in wireless sensor networks. We consider a real-time scenario wher...
Hongwei Du, Xiaodong Hu, Xiaohua Jia
80
Voted
EVOW
2010
Springer
15 years 4 months ago
WiMAX Network Planning Using Adaptive-Population-Size Genetic Algorithm
Abstract. IEEE 802.16, also known as WiMAX, is a new wireless access technology for currently increasing demand of wireless high-speed broadband service. Efficient and effective d...
Ting Hu, Yuanzhu Peter Chen, Wolfgang Banzhaf
JCO
2006
103views more  JCO 2006»
14 years 9 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