Sciweavers

706 search results - page 117 / 142
» Routing with guaranteed delivery in ad hoc wireless networks
Sort
View
SAINT
2005
IEEE
14 years 1 months ago
HAR: Hierarchy-Based Anycast Routing Protocol for Wireless Sensor Networks
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...
Niwat Thepvilojanapong, Yoshito Tobe, Kaoru Sezaki
ICDCS
2010
IEEE
13 years 7 months ago
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
—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...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
INFOCOM
2005
IEEE
14 years 1 months ago
Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network
— 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...
Ashish Raniwala, Tzi-cker Chiueh
DIALM
2004
ACM
124views Algorithms» more  DIALM 2004»
14 years 25 days ago
Localized techniques for broadcasting in wireless sensor networks
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 ...
Lorenzo Orecchia, Alessandro Panconesi, Chiara Pet...
MOBIHOC
2007
ACM
14 years 7 months ago
Scalable routing in delay tolerant networks
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...
Cong Liu, Jie Wu