706 search results - page 117 / 142 » Routing with guaranteed delivery in ad hoc wireless networks |
135
click to vote
SAINT
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper, we present Hierarchy-Based Anycast Routing (HAR), a routing protocol for collecting data over multi-hop, wireless sensor networks. The design of the protocol aims t...
129
Voted
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 2 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
117
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— Even though multiple non-overlapped channels exist in the 2.4GHz and 5GHz spectrum, most IEEE 802.11-based multi-hop ad hoc networks today use only a single channel. As a resul...
119
click to vote
DIALM
2004
ACM
15 years 7 months ago
2004
ACM
We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the ...
129
click to vote
MOBIHOC
2007
ACM
16 years 1 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...