achievable per-node throughput

MOBIHOC
2010
ACM

168views Computer Networks» more MOBIHOC 2010»

Security-capacity trade-off in large wireless networks using keyless secrecy

14 years 1 months ago

We investigate the scalability of a class of algorithms that exploit the dynamics of wireless fading channels to achieve secret communication in a large wireless network of n rando...

Sudarshan Vasudevan, Dennis Goeckel, Donald F. Tow...

claim paper

Read More »

click to vote

IWCMC
2006
ACM

128views Computer Networks» more IWCMC 2006»

Queuing network models for delay analysis of multihop wireless ad hoc networks

14 years 9 months ago

Download www.ecse.rpi.edu

— In this paper we focus on characterizing the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with station...

Nabhendra Bisnik, Alhussein A. Abouzeid

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers