Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dhadesugoor R. Vaman

dblp:05/5525 · DBLP profile ↗
← Back
21ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 15Human-computer interaction and ubiquitous computing · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Cellular and mobile networks · 33% Wireless networking · 29% Physical-layer communications · 25%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
interference management
0.112010
Cross-layer distributed joint power control and scheduling for delay-constrained applications over CDMA-based wireless ad-hoc networks · IEEE Trans. Commun. 2010
Wireless networking
mobile ad hoc networks
0.112010
Cross-layer distributed joint power control and scheduling for delay-constrained applications over CDMA-based wireless ad-hoc networks · IEEE Trans. Commun. 2010
Cellular and mobile networks › interference management
multiple-access interference
0.112010
Cross-layer distributed joint power control and scheduling for delay-constrained applications over CDMA-based wireless ad-hoc networks · IEEE Trans. Commun. 2010
Wireless networking
cognitive radio
0.112008
Cognitive Radio Based Multi-User Resource Allocation in Mobile Ad Hoc Networks Using Multi-Carrier CDMA Modulation · IEEE J. Sel. Areas Commun. 2008
Physical-layer communications
power allocation
0.112008
Cognitive Radio Based Multi-User Resource Allocation in Mobile Ad Hoc Networks Using Multi-Carrier CDMA Modulation · IEEE J. Sel. Areas Commun. 2008
Network optimization and economics › resource allocation
spectrum allocation
0.112008
Cognitive Radio Based Multi-User Resource Allocation in Mobile Ad Hoc Networks Using Multi-Carrier CDMA Modulation · IEEE J. Sel. Areas Commun. 2008
Physical-layer communications
code-division multiple access
0.012010
Cross-layer distributed joint power control and scheduling for delay-constrained applications over CDMA-based wireless ad-hoc networks · IEEE Trans. Commun. 2010
Physical-layer communications › fading channels
frequency-selective fading
0.012008
Cognitive Radio Based Multi-User Resource Allocation in Mobile Ad Hoc Networks Using Multi-Carrier CDMA Modulation · IEEE J. Sel. Areas Commun. 2008
Physical-layer communications › spread spectrum
multicarrier CDMA
0.012008
Cognitive Radio Based Multi-User Resource Allocation in Mobile Ad Hoc Networks Using Multi-Carrier CDMA Modulation · IEEE J. Sel. Areas Commun. 2008

Methods — techniques the papers use, named apart from their topics

doppler spread mitigation · 0.1distributed power control · 0.1coding and interleaving · 0.1distributed resource allocation · 0.1channel sensing · 0.1
YearPublicationVenuePosition
2011 Adaptive Multiresolution Modulation for multimedia traffic
abstract
Future wireless communication systems and networks will be required to support a multitude of services with different reliability requirements. However, achieving such flexible systems are challenging in Mobile Ad-hoc Networks (MANET) due to limited battery resources at mobile nodes. However, by employing adaptive signaling techniques with Unequal Error Protection (UEP), we strive to improve the energy efficiency and increase the data rate (spectral efficiency) over a fading channel. In this article, we demonstrate the efficacy of the exponential approximation for the Adaptive Multiresolution Modulation (AMM) scheme in terms of PER using the asymmetric Phase-Shift Keying (PSK) and Quadrature Amplitude Modulation (QAM).
Justin James, Olusegun O. Odejide, Annamalai Annamalai, Dhadesugoor R. Vaman
CCNC4
2011 Improving the Spectral Efficiency of Adaptive Modulation in Amplify-and-Forward Cooperative Relay Networks with an Adaptive ARQ Protocol
abstract
This paper investigates the effectiveness of a cross-layer design that combines adaptive modulation (AM) at the physical layer with an adaptive truncated automatic repeat request (ARQ) protocol at the data link layer to maximize the throughput of cooperative amplify-and-forward (CAF) relay networks under prescribed delay and/or error performance constraints. A by-product of our proposed analytical framework, that involves evaluation of the marginal moment generating function (MGF) of the end-to-end signal-to-noise ratio (SNR), for computing the average throughput and average packet error rate performance metrics is the unification and generalization of existing studies on cross-layer combining of AM and truncated ARQ for non-cooperative diversity systems to generalized fading channels. Our analytical methodology is motivated by the fact that the MGF of end-to-end SNR for multi-relay CAF networks is either available in the research literature (for certain fading environments) or it can be computed much more conveniently than its PDF, while the desired marginal MGF can be evaluated efficiently using a multi-precision Laplace inversion formula of an auxiliary MGF function. The efficacy of an adaptive Rmax(maximum retransmission limit) strategy over the classical fixed Rmaxscheme is also examined.
Bhuvan Modi, Oluwatobi Olabiyi, Annamalai Annamalai, Dhadesugoor R. Vaman
GLOBECOM4
2011 Unified analysis of energy detection of unknown signals over generalized fading channels
abstract
Reliable spectrum sensing is the very task upon which the entire operation of cognitive radio rests. Blind sensing of spectral-holes using a radiometer (energy detectors) is one of the solutions that have been proposed for enabling opportunistic spectrum access. This article revisits the problem of energy detection of an unknown deterministic signal over a myriad of fading environments. Specifically, a new approach (based on the canonical series representations of the generalized Marcum Q-function of real order in conjunction with the derivatives of the moment generating function of signal-to-noise ratio) is proposed to analyze the performance of maximal-ratio combining (MRC) and square-law combining (SLC) energy detectors with independent but non-identically distributed (i.n.d) fading statistics, including Rice and mixed-fading channels. Our analytical framework is also capable of treating the Nakagami-m channels with non-integer fading severity indices as well as halfodd integer values for the time-bandwidth product u. Many of these cases were either intractable with the classical probability density function/contour integral approaches, or that heretofore had resisted simple/computationally efficient solutions. Selected numerical results are also provided for the receiver operating characteristic (ROC) of MRC and SLC diversity energy detectors over Rice and Nakagami-m channels.
Annamalai Annamalai, Oluwatobi Olabiyi, Shumon Alam, Olusegun O. Odejide, Dhadesugoor R. Vaman
IWCMC5
2010 Distributed Cognitive Sensing for Time Varying Channels: Exploration and Exploitation
abstract
Spectrum under-utilization calls for the open and dynamic spectrum access mechanism, which allows the unlicensed user equipped with cognitive radios to opportunistically sense and access the spectrum that not occupied by primary users. In practice due to the hardware limitations, each cognitive radio user may be only able to sense a portion of the interested wide span spectrum. Hence, a hardware-constrained cognitive MAC to conduct efficient and intelligent spectrum sense decision is desired. In this paper, we formulate the cognitive radio spectrum sensing problem under time-varying channels as an adversarial bandit problem without any assumption of the channel statistics. A fully distributed strategy is proposed to address the fundamental tradeoff between spectrum exploration and spectrum exploitation during the sensing periods. Simulation results demonstrate that significant performance gain can be achieved by the proposed algorithm when the channels are time-varying on small time-scales. A coordination scheme for the multi-user case is also presented and the effectiveness is also demonstrated by the simulation results.
Song Gao 0002, Lijun Qian, Dhadesugoor R. Vaman, Zhu Han 0001
WCNC3
2010 Cross-layer distributed joint power control and scheduling for delay-constrained applications over CDMA-based wireless ad-hoc networks
abstract
In this paper, we propose a cross-layer distributed power control and scheduling protocol for delay-constrained applications over mobile CDMA-based ad hoc wireless networks. Herein, we propose a novel scheme where power control is employed to combat delay occurring on multi-hop wireless ad hoc networks via cross-layer information exchange. Based on that, a distributed power control and scheduling protocol is proposed to control the incurred delay as well as the multiple access interference (MAI). Unlike other previous work on power control and scheduling, we also investigate the impact of Doppler spread upon the system performance, and provide a robust system which employs a combination of power control, and coding/interleaving to combat the effects of Doppler spread by exploiting the time diversity when the Doppler spread gets large. Hence, our proposed approach can function appropriately over a wide range of channel conditions.
Qi Qu, Laurence B. Milstein, Dhadesugoor R. Vaman
IEEE Trans. Commun.3
2010 Cooperative and Constrained MIMO Communications in Wireless Ad Hoc/Sensor Networks
abstract
In this paper, we investigate the issue of cooperative node selection in MIMO communications for wireless ad hoc/sensor networks, where a source node is surrounded by multiple neighbors and all of them are equipped with a single antenna. Given energy, delay and data rate constraints, a source node dynamically chooses its cooperating nodes from its neighbors to form a virtual MIMO system with the destination node (which is assumed to have multiple antennas), as well as adaptively allocates the power level and adjusts the constellation size for each of the selected cooperative nodes. In order to optimize system performance, we jointly consider the optimization of all these parameters, given the aforementioned system constraints. We assume that the source node either has CSI, or has no CSI. Heuristic algorithms, such as maximal channel gain (MCG) and least channel correlation (LCC) algorithms are proposed in order to exploit available system information and to solve the constrained optimization problem.
Qi Qu, Laurence B. Milstein, Dhadesugoor R. Vaman
IEEE Trans. Wirel. Commun.3
2009 Cross-Layer Design of Embedded Modulation and Retransmission Diversity for Prioritized Packet Transmission in Wireless Networks
abstract
The current and future wireless systems need to support a multitude of services with a wide range of data rates and reliability requirements. The limited battery resource at the mobile terminals coupled with the hostile multipath fading channel makes the problem of providing reliable multimedia services challenging. In this article, we develop a novel method to mechanize a prioritized unicast transmission at the physical layer in response to the disparate quality of service requirements for multimedia traffic (imposed by upper layers) and investigate how the unequal bit error protection offered by multiresolution modulation is capitalized at the data link layer to yield a substantial throughput gain and minimize the packet loss probability of the "more important" packets in an integrated voice/data and delay-sensitive applications (especially in poor and moderate channel conditions). However, there exists a slight throughput penalty in the high signal-to-noise ratio regime due to competitive nature of the "optimal reliable signaling rate " in an unknown time-varying channel.
Annamalai Annamalai, Dhadesugoor R. Vaman, John D. Matyjas, Michael J. Medley
CCNC2
2009 A Simple and Least Complex KV Transform Coding Technique with Low BER Performance at Low Eb/No for Multi-Tiered Applications in Power and Bandwidth Constrained MANET/Sensor Networks
abstract
This paper presents a novel idea of Koay-Vaman (KV) transform coding technique which is based on block coding technique. It provides the ability to detect errors, correct errors and identifies the remaining block error in each of the transmission ensembles. Exploiting this property will allow design of bandwidth efficient MANET and sensor networks to support provisioning of multi-service applications. Moreover, KV Transform technique permits recovery of end user information at low Eb/N0 which is typically observed in a heavy multi-path fading environment, which is suitable for both in-door and out-door real time applications. It addresses the challenges of MANETs that require bandwidth and power efficiency, quality of service (QoS) provisioning of multi-services and scalability. KV transform technology is based on discrete sample orthogonal and invertible transform using time-frequency variation analysis. This paper presents BER performance (-7) on Rayleigh fading channel using the proposed KV transform technique with sample error correction, single selective retransmission of blocks that are in error and sample interleaving at very low Eb/No.
Dhadesugoor R. Vaman, S. T. Koay, Annamalai Annamalai, N. Agarwal
SMC1
2009 Distributed energy efficient spectrum access in cognitive radio wireless ad hoc networks
abstract
In this paper, energy efficient spectrum access is considered for a wireless cognitive radio ad hoc network, where each node is equipped with cognitive radio, has limited energy, and the network is an OFDMA system operating on time slots. In each slot, the users with new traffic demand will sense the spectrum and locate the available subcarrier set. Given the data rate requirement and maximal power limit, a constrained optimization problem is formulated for each individual user to minimize the energy consumption per bit over all selected subcarriers, while avoid introducing harmful interference to the existing users. Because of the multi-dimensional and non-convex nature of the problem, a fully distributed subcarrier selection and power allocation algorithm is proposed by combining an unconstrained optimization method with a constrained partitioning procedure. Due to the non-cooperative behavior among new users, they will execute distributed power control to manage the co-channel interference when needed. Simulation results demonstrate that the proposed scheme performs tightly to the global optimal solution. In addition, the comparison between the proposed energy efficient allocation scheme and the well established rate or power efficient allocation algorithms is carried out to demonstrate the advantage of the proposed scheme in terms of network lifetime.
Song Gao 0002, Lijun Qian, Dhadesugoor R. Vaman
IEEE Trans. Wirel. Commun.3
2008 Cooperative virtual MIMO transmissions in wireless networks with system constraints
abstract
In this paper, we investigate the issue of cooperative node selection in MIMO communications for wireless ad hoc/sensor networks, where a source node is surrounded by multiple neighbors and all of them are equipped with a single antenna. Given energy, delay and data rate constraints, a source node dynamically chooses its cooperating nodes from its neighbors to form a virtual MIMO system with the destination node (which is assumed to have multiple antennas), as well as adaptively allocates the power level and adjusts the constellation size for each of the selected cooperative nodes. In order to optimize system performance, we jointly consider the optimization of all these parameters, given the aforementioned system constraints. We assume that the source node either has CSI, or has no CSI. Heuristic algorithms, such as maximal channel gain (MCG) and least channel correlation (LCC) algorithms are proposed in order to exploit available system information and to solve the constrained optimization problem.
Qi Qu, Laurence B. Milstein, Dhadesugoor R. Vaman
SMC3
2008 Cognitive radio mixed sensor and Mobile Ad Hoc Networks (SMANET) for dual use applications
abstract
In this paper, we investigate the issues of survivability and efficiency in a heterogeneous mobile ad hoc network (MANET) and Sensor network as a combined network where the communications is achieved using a mixed MANET and Sensor Network, referred to as SMANET for supporting mission critical applications. Using the cluster managed SMANET where, heterogeneous nodes with different capabilities and nodes from different organizations deployed within the same geographical area will support variety of multi-service mission critical applications while increasing the network lifetime. In this network, nodes from different organizations collaborate with each other for mission critical data to be delivered using multi-hop radio-sensor-radio type path routing while keeping the tactical operations supported by the battlefield command control structure transparent. While keeping the collaborative encounters, it is important to keep cross-organization data transfer at the lowest possible level for minimal disruption of the traffic within each organization and for security reasons. Assuming that all nodes are equipped with cognitive radio capability maintaining interoperability, we propose a novel routing metric that maximize the benefits from the collaboration of heterogeneous nodes and take the organizational constraints into account. Furthermore, we propose joint design of cognitive radio and multi-carrier modulation to maximize the bandwidth utilization and energy efficiency in SMANET. Simulation results demonstrate that the proposed method provide much needed survivability and efficiency in battlefield environment while keeping the cross-organization data transfer at the lowest possible level as a value added enhancement compared to homogeneous MANET or sensor networks. Same network design can also find use in civilian environment for supporting applications such as emergency preparedness management and traffic efficiency in congested transportation systems.
Dhadesugoor R. Vaman, Lijun Qian
SMC1
2008 Distributed Energy Efficient Spectrum Access in Wireless Cognitive Radio Sensor Networks
abstract
In this paper, a wireless cognitive radio sensor network is considered, where each sensor node is equipped with cognitive radio and the network is a multi-carrier system operating on time slots. In each slot, the users with new traffic demand will sense the entire spectrum and locate the available subcarrier set. Given the required data rate and power bound, a fully distributed subcarrier selection and power allocation algorithm is proposed for each individual user to minimize the energy consumption per bit over all subcarriers, while avoid introducing harmful interference to the existing users. The multi-dimensional and non-quasi-convex/concave nature of the energy efficiency optimization problem in multi-carrier systems makes it more challenging than throughput/power optimization problems or the energy efficiency problem in the single carrier system. The optimal solution is derived by using a two-stage algorithm where the original problem is decoupled into an unconstrained problem and branch and bound method is applied thereafter to reduce the search space. In addition, a distributed power control is performed to manage the co-channel interference among new users when needed. Simulation results demonstrate that the proposed approach performs close to the centralized optimal solution, and it provides prolonged network lifetime.
Song Gao 0002, Lijun Qian, Dhadesugoor R. Vaman
WCNC3
2008 Cognitive Radio Based Multi-User Resource Allocation in Mobile Ad Hoc Networks Using Multi-Carrier CDMA Modulation
abstract
In this paper, we propose a cognitive radio based multi-user resource allocation framework for mobile ad hoc networks using multi-carrier DS CDMA modulation over a frequency-selective fading channel. In particular, given preexisting communications in the spectrum where the system is operating, in addition to potential narrow-band interference, a channel sensing and estimation mechanism is provided to obtain information such as subcarrier availability, noise power and channel gain. Given this information, both frequency spectrum and power are allocated to emerging new users (i.e., cognitive radio users), based on a distributed multi-user resource allocation framework, in order to satisfy a target data rate and a power constraint of each cognitive radio user, while attempting to avoid interference to the existing communications as well as to minimize total power consumption of the cognitive radio users.
Qi Qu, Laurence B. Milstein, Dhadesugoor R. Vaman
IEEE J. Sel. Areas Commun.3
2007 Energy Efficient Adaptive Modulation in Wireless Cognitive Radio Sensor Networks
abstract
In this paper, we consider the lifetime maximization problem in a wireless cognitive radio sensor network, where the joint design of cognitive radio and multi-carrier modulation is proposed to achieve high power efficiency. Sensor nodes first sense the entire spectrum and locate the available subcarriers based on a pilot tone detection scheme. After each node locates the available subcarrier set, information is transmitted over the favorite channel that has the largest channel gain. Under this setting, an adaptive modulation strategy is proposed to maximize the network lifetime by selecting the optimal constellation size. Simulation results demonstrate the effectiveness of our approach. In addition, the impact of conflicting transmissions upon the network lifetime is also investigated.
Song Gao 0002, Lijun Qian, Dhadesugoor R. Vaman, Qi Qu
ICC3
2006 Joint Power Control and Proportional Fair Scheduling with Minimum Rate Constraints in Cluster Based MANET
Lijun Qian, Xiangfang Li, Dhadesugoor R. Vaman, Zoran Gajic
MSN3
2006 Joint power control and maximally disjoint routing for reliable data delivery in multihop CDMA wireless ad hoc networks
abstract
In this paper, joint power control and maximally disjoint routing is proposed for multihop CDMA wireless ad hoc networks. A framework of power control with QoS constraints in CDMA wireless ad hoc networks is introduced and the feasibility condition of the power control problem is identified. Both centralized solution and distributed implementations are derived to calculate the transmission power given required throughput and the set of transmitting nodes. Then a joint power control and maximally disjoint routing scheme is proposed for routing data traffic with minimum rate constraint while maintaining high energy efficiency and prolonged network lifetime. Furthermore, in order to provide reliable end-to-end data delivery, the proposed joint power control and maximally disjoint routing scheme is augmented by a dynamic traffic switching mechanism to mitigate the effect of node mobility or node failure. Simulation results demonstrate the effectiveness of the proposed scheme
Lijun Qian, Dhadesugoor R. Vaman, Xiangfang Li, Zoran Gajic
WCNC3
2006 Power control and proportional fair scheduling with minimum rate constraints in clustered multihop TD/CDMA wireless ad hoc networks
abstract
In order to achieve high end-to-end throughput in a multihop wireless ad hoc network, TD/CDMA has been chosen as the medium access control (MAC) scheme due to its support for high network throughput in a multihop environment. The associated power control and scheduling problem needs to be addressed to optimize the operations of TD/CDMA. In this paper, cluster based architecture is introduced to provide centralized control within clusters, and the corresponding power control and scheduling schemes are derived to maximize a network utility function and guarantee the minimum rate required by each traffic session. Because the resulted optimal power control reveals bang-bang characteristics, i.e., scheduled nodes transmit with full power while other nodes remain silent, the joint power control and scheduling problem is reduced to a scheduling problem. In order to achieve a balance between throughput and fairness, proportional fair scheduling is considered. The multi-link version of the proportional fair scheduling algorithms for multihop wireless ad hoc networks are proposed. In addition, a generic token counter mechanism is employed to satisfy the minimum rate requirements. Approximation algorithms are suggested to reduce the computational complexity. In networks that are lack of centralized control, distributed scheduling algorithms are also derived and fully distributed implementation is provided. Simulation results demonstrate the effectiveness of the proposed schemes
Lijun Qian, Dhadesugoor R. Vaman, Xiangfang Li, Zoran Gajic
WCNC3
2006 Power control and scheduling with minimum rate constraints in clustered multihop TD/CDMA wireless ad hoc networks
abstract
Abstract In order to achieve high end‐to‐end throughput in a multihop wireless ad hoc network, TD/CDMA has been chosen as the Medium Access Control (MAC) scheme due to its support for high network throughput in a multihop environment. The associated power control and scheduling problem needs to be addressed to optimize the operations of TD/CDMA. In this paper, cluster‐based architecture is introduced to provide centralized control within clusters, and the corresponding power control and scheduling schemes are derived to maximize a network utility function and guarantee the minimum rate required by each traffic session, given routes for multiple end‐to‐end multihop traffic sessions. Because the resulted optimal power control reveals bang‐bang characteristics, that is, scheduled nodes transmit with full power while other nodes remain silent, the joint power control and scheduling problem is reduced to a scheduling problem. The multi‐link version of the throughput‐optimal and the proportional fair scheduling algorithms for multihop wireless ad hoc networks are proposed. In addition, a generic token counter mechanism is employed to satisfy the minimum rate requirements. By ensuring different minimum rate for different traffic sessions, service differentiation is also achieved. Approximation algorithms are suggested to reduce the computational complexity. In networks that are lack of centralized control, distributed scheduling algorithms are also derived and fully distributed implementation is provided. Simulation results demonstrate the effectiveness of the proposed schemes. Copyright © 2006 John Wiley & Sons, Ltd.
Lijun Qian, Dhadesugoor R. Vaman, Xiangfang Li, Zoran Gajic
Wirel. Commun. Mob. Comput.2
1997 Reconfiguration for Service and Self-Healing in ATM Networks Based on Virtual Paths
Tai H. Noh, Dhadesugoor R. Vaman, Xuedao Gu
Comput. Networks ISDN Syst.2
1991 A Performance Management Framework to Provide Bounded Packet Delay and Variance in Packet Switched Networks
Saimin Jin, Dhadesugoor R. Vaman, Divyendu Sinha
Comput. Networks ISDN Syst.2
1986 Design & Performance Evaluation of a Dual-Channel Based Local Area Network (DC-LAN) System
Chin T. Wu, Dhadesugoor R. Vaman
ICC2