2572 search results - page 451 / 515 » Identification in Ad Hoc Networks |
176
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The transmission capacity of an ad-hoc network is the maximum density of active transmitters in an unit area, given an outage constraint at each receiver for a fixed rate of transm...
203
click to vote
IJITN
2010
15 years 3 months ago
2010
With the proliferation of inexpensive cameras and the availability of high-speed wired and wireless networks, systems of distributed cameras are becoming an enabling technology fo...
197
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...
182
click to vote
MOBIHOC
2001
ACM
16 years 5 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
156
click to vote
INFOCOM
2009
IEEE
16 years 24 days 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 ...