1008 search results - page 161 / 202 » Routing in intermittent network topologies |
118
click to vote
ECRTS
2007
IEEE
15 years 8 months ago
2007
IEEE
Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate ...
136
click to vote
CLUSTER
2002
IEEE
15 years 1 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
113
Voted
CORR
2004
Springer
15 years 1 months ago
2004
Springer
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
105
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
132
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
A growing trend in the development and deployment of grid computing systems is decentralization. Decentralizing these systems helps make them more scalable and robust, but poses s...