Skip to main navigation
Skip to search
Skip to main content
Ariel University Home
Help & FAQ
English
עברית
العربية
Home
Profiles
Research units
Research output
Prizes
Activities
Search by expertise, name or affiliation
The (K, l) coredian tree for ad hoc networks
Amit Dvir
, Michael Segal
Research output
:
Contribution to journal
›
Article
›
peer-review
2
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The (K, l) coredian tree for ad hoc networks'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Centdian
100%
Ad Hoc Networks
100%
Tree Network
66%
QoS Requirements
33%
Wireless
33%
Construction Algorithm
33%
Node number
33%
Efficient Strategy
33%
Cluster Covering
33%
Cluster Head
33%
Time Construction
33%
Internal Nodes
33%
Random Geometric Graph
33%
K-cluster
33%
Connected Network
33%
Critical Transmission Range
33%
Computer Science
ad-hoc network
100%
Tree Network
100%
Quality of Service
50%
Construction Algorithm
50%
Geometric Graph
50%
Transmission Range
50%
cluster-head
50%
Connected Network
50%
Mathematics
Minimizes
100%
Tree Network
66%
Lower and upper bounds
33%
Connected Network
33%
Transmission Range
33%