Tags
mobile ad hoc networks
graph theory
attacks
chord.
edge induced
hamiltonian graph; finite sequence; algorithm
spanning graph
sensor networks
wireless ad hoc networks
metric dimension
simulation
manet
odd harmonious labeling
applications of random graph theory in ad hoc netw
odd graceful
grid
ad hoc networks
m-shadow graph
data gathering algorithms
the window mean with exponentially weighted moving
collection tree protocol (ctp)
centralized algorithm
fuzzy logic
mobile wireless sensor network
ca-mwsn
np-complete problems
dynamic clustering
cluster-head
m-splitting graph.
packet receive rate (prr)
link quality estimation (lqe)
secure routing algorithms and protocols based on g
algorithms for topology control and power assignme
preliminaries
resolving set
basis
infinite graphs
d g -metric.
bijection
contraction
overlapping
cardinal number.
symmetric product.
m-splitting graph
data gathering algorithms and protocols for sensor
connectivity analysis under different mobility mod
distributed extensions of centralized graph theore
cyclic snakes
subdivision double triangular snakes
pendant edges
routing algorithm
dynamic network
qos assurance
grundy number
wireless network
graph coloring
p4-classes
total graph
mobile network
stability
unicast
routing protocols
survey
minimum-weight path
wireless networks.
cover time
load balancing
power of choice
random walk
intrusion
intrusion detection system
hardware unit
dynamic programming
energy efficiency
multicast routing protocols
psychology
social engineering
scheduling mechanism
queueing
maxmin
wfq
fermat point
wireless adhoc and sensor network(wasn).
geographic routing
collision avoidance
wireless sensor networks
data propagation
energy efficient
ford-fulkerson algorithm
probability
mobility models
k-connectivity
data replication
job scheduling
data grid
cycle
planar
complete
labeling
obility models
routing protocol
multicast communication
topology formation
power optimization
neural networks
ad hoc network routing protocols
mobile ad-hoc sensor network
wireless mobile approaches
vertex labeling
edge labeling
algorithms
modelling
mobile ad hoc
security
mobility
routing
failure recovery
neighborhood broadcast
network protocols
ad-hoc sensor network
fault tolerance
mobile nodes
qos
ims
ngn
gsm n
mobile station
base station controller
mobile switching center
location area
message specific key
neighborhood key
global positioning system (gps)
global system for mobile communication (gsm)
bit error rate
wireless personal area network (wpan)
uwb
coverage and connectivity
See more
Presentations
(2)Documents
(40)Tags
mobile ad hoc networks
graph theory
attacks
chord.
edge induced
hamiltonian graph; finite sequence; algorithm
spanning graph
sensor networks
wireless ad hoc networks
metric dimension
simulation
manet
odd harmonious labeling
applications of random graph theory in ad hoc netw
odd graceful
grid
ad hoc networks
m-shadow graph
data gathering algorithms
the window mean with exponentially weighted moving
collection tree protocol (ctp)
centralized algorithm
fuzzy logic
mobile wireless sensor network
ca-mwsn
np-complete problems
dynamic clustering
cluster-head
m-splitting graph.
packet receive rate (prr)
link quality estimation (lqe)
secure routing algorithms and protocols based on g
algorithms for topology control and power assignme
preliminaries
resolving set
basis
infinite graphs
d g -metric.
bijection
contraction
overlapping
cardinal number.
symmetric product.
m-splitting graph
data gathering algorithms and protocols for sensor
connectivity analysis under different mobility mod
distributed extensions of centralized graph theore
cyclic snakes
subdivision double triangular snakes
pendant edges
routing algorithm
dynamic network
qos assurance
grundy number
wireless network
graph coloring
p4-classes
total graph
mobile network
stability
unicast
routing protocols
survey
minimum-weight path
wireless networks.
cover time
load balancing
power of choice
random walk
intrusion
intrusion detection system
hardware unit
dynamic programming
energy efficiency
multicast routing protocols
psychology
social engineering
scheduling mechanism
queueing
maxmin
wfq
fermat point
wireless adhoc and sensor network(wasn).
geographic routing
collision avoidance
wireless sensor networks
data propagation
energy efficient
ford-fulkerson algorithm
probability
mobility models
k-connectivity
data replication
job scheduling
data grid
cycle
planar
complete
labeling
obility models
routing protocol
multicast communication
topology formation
power optimization
neural networks
ad hoc network routing protocols
mobile ad-hoc sensor network
wireless mobile approaches
vertex labeling
edge labeling
algorithms
modelling
mobile ad hoc
security
mobility
routing
failure recovery
neighborhood broadcast
network protocols
ad-hoc sensor network
fault tolerance
mobile nodes
qos
ims
ngn
gsm n
mobile station
base station controller
mobile switching center
location area
message specific key
neighborhood key
global positioning system (gps)
global system for mobile communication (gsm)
bit error rate
wireless personal area network (wpan)
uwb
coverage and connectivity
See more