1592 search results - page 72 / 319 » Source-Tree Routing in Wireless Networks |
184
Voted
OL
2011
14 years 10 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
107
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract-- We study routing for massively dense wireless networks, i.e., wireless networks that contain so many nodes that, in addition to their usual microscopic description, a no...
134
click to vote
ITIIS
2010
15 years 1 months ago
2010
Data routing in wireless sensor networks must be energy-efficient because tiny sensor nodes have limited power. A cluster-based hierarchical routing is known to be more efficient ...
135
Voted
ACIIDS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Wireless sensor networks(WSNs) have been regarded as an incarnation of Ad Hoc Networks for a specific application. Since a WSN consists of potentially hundreds of low c...
143
click to vote
ICDCIT
2007
Springer
15 years 9 months ago
2007
Springer
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...