Prof. D Manjunath

Areas Of Expertise

• 802-11 protocol
• AD HOC Networks
• Algorithm
• Analysis
• Asymmetric networks
• Bivariate random variables
• Blocking probability
• Boolean field
• Boolean models
• CDMA networks
• Characterization
• Circuit multiplexing
• Components
• Computer networking protocols
• Computer networks
• Connectivity
• Control of queues
• Control theory
• Correlation
• Coverage
• Degree
• Design
• Dynamic pricing
• Edge disjoint path algorithms
• Exponential random geometric graphs
• Exposure
• Fairness bound
• Finite ad hoc networks
• Generalized Processor Sharing (GPS)
• Geometric random graphs
• Health of a wireless sensor network
• IP switching
• K-coverage of paths
• Laplace transform
• Largest nearest-neighbor distance
• Markov process
• Mobility
• Multipath routing
• Network connectivity
• Networks
• Nonhomogeneous queues
• Nonhomogeneous sensor deployment
• Normalizing constant
• OFDMA networks
• One-dimensional ad hoc networks
• Optical burst switching
• Optical networks
• Optimal rate control
• Optimal routing
• Optimization
• Parallel servers
• Parameter estimation
• Path selection policy
• Path tracking
• Performance analysis
• Performance bounds
• Pointwise stationary approximation
• Poisson-Boolean model
• Power control
• Product form solutions
• QoS Provisioning
• Queueing theory
• Queues
• Queuing networks
• Radioactive field estimation
• Random access networks
• Random geometric graphs
• Range Matrices
• Rates
• Resource allocation
• Routing and wavelength assignment
• Scheduling
• Self Tuning of Enterprise Servers
• Self-similar traffic
• Sensor network
• Sensor networks
• Sensor networks coverage
• SoCs
• Stability
• Stochastic processes
• System design
• Target tracking
• Theory
• Topology control
• Topology properties
• Two timescale iterations
• Utility maximization
• Variable length packet switches
• Waiting time distribution
• Weighted Fair Queueing (WFQ)
• Wi-Fi networks
• Wireless networks