Sciweavers

296 search results - page 6 / 60
» An Upper Bound on Network Size in Mobile Ad-Hoc Networks
Sort
View
WIOPT
2011
IEEE
13 years 22 days ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...
INFOCOM
2005
IEEE
14 years 2 months ago
Bounding the power rate function of wireless ad hoc networks
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
Yunnan Wu, Qian Zhang, Wenwu Zhu, Sun-Yuan Kung
SWAT
2004
Springer
138views Algorithms» more  SWAT 2004»
14 years 2 months ago
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
Leszek Gasieniec, Tomasz Radzik, Qin Xin
NETWORK
2006
218views more  NETWORK 2006»
13 years 9 months ago
Quality of service for packet telephony over mobile ad hoc networks
IP telephony over mobile ad hoc networks is a topic of emerging interest in the research arena as one of the paths toward the fixed-mobile convergence in telecommunications networ...
Paolo Giacomazzi, Luigi Musumeci, Giuseppe Caizzon...
TPDS
2008
231views more  TPDS 2008»
13 years 9 months ago
Anonymous Geo-Forwarding in MANETs through Location Cloaking
In this paper, we address the problem of destination anonymity for applications in mobile ad hoc networks where geographic information is ready for use in both ad hoc routing and I...
Xiaoxin Wu, Jun Liu, Xiaoyan Hong, Elisa Bertino