Sciweavers

267 search results - page 9 / 54
» Generalization of Sorting in Single Hop Wireless Networks
Sort
View
IJSNET
2006
133views more  IJSNET 2006»
13 years 7 months ago
On the hop count statistics for randomly deployed wireless sensor networks
: In this paper we focus on exploiting the information provided by a generally accepted and largely ignored hypothesis (the random deployment of the nodes of an ad hoc or wireless ...
Stefan Dulman, Michele Rossi, Paul J. M. Havinga, ...
HICSS
2002
IEEE
212views Biometrics» more  HICSS 2002»
14 years 12 days ago
Connectivity-Based k-Hop Clustering in Wireless Networks
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
Geng Chen, Fabian Garcia Nocetti, Julio Solano-Gon...
MOBICOM
2010
ACM
13 years 7 months ago
Achieving single channel, full duplex wireless communication
This paper discusses the design of a single channel fullduplex wireless transceiver. The design uses a combination of RF and baseband techniques to achieve full-duplexing with min...
Jung Il Choi, Mayank Jain, Kannan Srinivasan, Phil...
INFOCOM
2007
IEEE
14 years 1 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
GLOBECOM
2007
IEEE
14 years 1 months ago
On the Expected Connection Lifetime and Stochastic Resilience of Wireless Multi-Hop Networks
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
Fei Xing, Wenye Wang