Sciweavers

33 search results - page 5 / 7
» Asymptotic critical transmission radius for k-connectivity i...
Sort
View
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 10 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
CISS
2007
IEEE
14 years 2 months ago
Relay Placement and Movement Control for Realization of Fault-Tolerant Ad Hoc Networks
— Wireless communication is a critical component of battlefield networks. Nodes in a battlefield network exist in hostile environments and thus fault-tolerance against node and...
Abhishek Kashyap, Mark A. Shayman
AHSWN
2008
92views more  AHSWN 2008»
13 years 8 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
MSWIM
2004
ACM
14 years 1 months ago
Quantile models for the threshold range for k-connectivity
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
Henri Koskinen
INFOCOM
2007
IEEE
14 years 2 months ago
Broadcast Flooding Revisited: Survivability and Latency
—This paper addresses the dynamics of broadcast flooding in random wireless ad hoc networks. In particular, we study the subset of nodes covered by a flood as well as timing is...
Petteri Mannersalo, Alireza Keshavarz-Haddad, Rudo...