Sciweavers

11061 search results - page 2158 / 2213
» Computer Architecture
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
MOBIHOC
2008
ACM
15 years 9 months ago
On exploiting diversity and spatial reuse in relay-enabled wireless networks
Relay-enabled wireless networks (eg. WIMAX 802.16j) represent an emerging trend for the incorporation of multi-hop networking solutions for last-mile broadband access in next gene...
Karthikeyan Sundaresan, Sampath Rangarajan
MOBIHOC
2008
ACM
15 years 9 months ago
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
Christian Scheideler, Andréa W. Richa, Paol...
MOBIHOC
2008
ACM
15 years 9 months ago
Routing performance analysis of human-driven delay tolerant networks using the truncated levy walk model
The routing performance of delay tolerant networks (DTN) is highly correlated with the distribution of inter-contact times (ICT), the time period between two successive contacts o...
Seongik Hong, Injong Rhee, Seong Joon Kim, Kyungha...
MOBIHOC
2006
ACM
15 years 9 months ago
Performance analysis of mobility-assisted routing
Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established. Mobility was considered a necessary evil that inval...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
« Prev « First page 2158 / 2213 Last » Next »