Sciweavers

522 search results - page 41 / 105
» Connected k-Hop Clustering in Ad Hoc Networks
Sort
View
ADHOC
2007
173views more  ADHOC 2007»
13 years 7 months ago
An adaptive transmission-scheduling protocol for mobile ad hoc networks
Transmission-scheduling protocols can support contention-free link-level broadcast transmissions and delay sensitive traffic in mobile, multiple-hop packet radio networks. Use of t...
Praveen K. Appani, Joseph L. Hammond, Daniel L. No...
ICDCS
2008
IEEE
14 years 2 months ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 7 months ago
Information-theoretic Capacity of Clustered Random Networks
Abstract-We analyze the capacity scaling laws of clustered ad hoc networks in which nodes are distributed according to a doubly stochastic shotnoise Cox process. We identify five d...
Michele Garetto, Alessandro Nordio, Carla-Fabiana ...
ICC
2011
IEEE
253views Communications» more  ICC 2011»
12 years 7 months ago
Geo-Assisted Multicast Inter-Domain Routing (GMIDR) Protocol for MANETs
Abstract— Large military ad hoc networks are often characterized by the interconnection of heterogeneous domains. The same trend is emerging in civilian MANETs (e.g., search and ...
Konglin Zhu, Biao Zhou, Xiaoming Fu, Mario Gerla
ADHOC
2007
107views more  ADHOC 2007»
13 years 7 months ago
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
Weifa Liang, Yuzhen Liu