2572 search results - page 248 / 515 » Identification in Ad Hoc Networks |
202
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
213
click to vote
AINA
2005
IEEE
16 years 9 days ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
164
click to vote
ADHOCNOW
2004
Springer
16 years 2 days ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
212
click to vote
ADHOCNOW
2004
Springer
16 years 2 days ago
2004
Springer
Recent theoretical results show that it is optimal to allow interfering sources to transmit simultaneously as long as they are outside a well-defined exclusion region around a de...
160
click to vote
IJAHUC
2010
15 years 1 months ago
2010
Abstract: The unique characteristics of space networks lead to different research approaches from those in terrestrial networks. In this paper, a routing framework called Space Gat...