Sciweavers

1330 search results - page 21 / 266
» Node Connectivity Analysis in Multi-Hop Wireless Networks
Sort
View
ICC
2009
IEEE
121views Communications» more  ICC 2009»
14 years 7 months ago
Throughput Scaling of Wireless Networks With Random Connections
This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connec...
Shengshan Cui, Alexander M. Haimovich, Oren Somekh...
PERCOM
2007
ACM
15 years 9 months ago
Fundamental Mobility Properties for Realistic Performance Analysis of Intermittently Connected Mobile Networks
Traditional mobile ad hoc routing protocols fail to deliver any data in Intermittently Connected Mobile Ad Hoc Networks (ICMN's) because of the absence of complete end-to-end ...
Apoorva Jindal, Konstantinos Psounis
MOBIHOC
2012
ACM
12 years 12 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
DCOSS
2011
Springer
13 years 9 months ago
Construction of connected dominating sets in large-scale MANETs exploiting self-stabilization
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
Stefan Unterschutz, Volker Turau
INFOCOM
2003
IEEE
15 years 2 months ago
Design and Analysis of an MST-Based Topology Control Algorithm
— In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this al...
Ning Li, Jennifer C. Hou, Lui Sha