736 search results - page 124 / 148 » Geometrically aware communication in random wireless network... |
106
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
114
click to vote
INFOCOM
2010
IEEE
15 years 11 days ago
2010
IEEE
—This paper studies the delay constrained multicast capacity of large scale mobile ad hoc networks (MANETs). We consider a MANET that consists of ns multicast sessions. Each mult...
123
click to vote
MOBICOM
2006
ACM
15 years 7 months ago
2006
ACM
In this work, we develop a CSMA-based MAC protocol to avoid reader-reader and reader-tag collisions in a dense RFID network. The network is implemented using mote-based RFID reade...
NOMS
2008
IEEE
15 years 8 months ago
2008
IEEE
—In this paper∗ , we devise a novel method for bottleneck analysis of UDP networks based on the concept of network utility maximization. To determine the losses on the links in...
146
click to vote
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...