Demo Data from VLDB 2026 / reviewers in the wild / expert
Nasreen Badruddin
dblp:22/7883
· DBLP profile ↗
9ranked-venue papers
4as first author
0since 2021 · last 2018
0000-0002-5666-3984ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 6 · 4 first-authorArtificial intelligence and machine learning · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1
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.
| Theoretical computer science
1 paper |
Information theory · 50% Mathematical optimization · 50% | |
| Computer networks
1 paper |
Network optimization and economics · 50% Physical-layer communications · 50% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications
power allocation |
0.1 | 1 | 2010 | Maximizing the sum rate in symmetric networks of interfering links · IEEE Trans. Inf. Theory 2010 |
Network optimization and economics
resource allocation |
0.1 | 1 | 2010 | Maximizing the sum rate in symmetric networks of interfering links · IEEE Trans. Inf. Theory 2010 |
Information theory › network information theory
interference channel |
0.1 | 1 | 2010 | Maximizing the sum rate in symmetric networks of interfering links · IEEE Trans. Inf. Theory 2010 |
Information theory
network information theory |
0.1 | 1 | 2010 | Maximizing the sum rate in symmetric networks of interfering links · IEEE Trans. Inf. Theory 2010 |
Mathematical optimization
nonconvex optimization |
0.1 | 1 | 2010 | Maximizing the sum rate in symmetric networks of interfering links · IEEE Trans. Inf. Theory 2010 |
Mathematical optimization › constrained optimization
sum-rate maximization |
0.1 | 1 | 2010 | Maximizing the sum rate in symmetric networks of interfering links · IEEE Trans. Inf. Theory 2010 |
Methods — techniques the papers use, named apart from their topics
frequency division multiplexing · 0.2convex relaxation · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Unsupervised Eye Blink Artifact Identification in ElectroencephalogramabstractThe most prominent type of artifact contaminating electroencephalogram (EEG) signals is the eye blink (EB) artifact. Hence, EB artifact detection is one of the most crucial pre-processing step in EEG signal processing before this artifact can be removed. In this work, an approach that identifies EB artifacts without human supervision and automated varying threshold setting is proposed and evaluated. The algorithm functions on the basis of correlation between two EEG electrodes, Fp1 and Fp2, followed by EB artifact threshold determination utilizing the amplitude displacement from the mean. The proposed approach is validated and evaluated in terms of accuracy and error rate in detecting events of EB artifacts in EEG signals. Analysis has revealed that the proposed approach achieved an average of 96.6% accuracy compared to a conventional method of identifying EB artifacts with a fixed constant threshold. Ashvaany Egambaram, Nasreen Badruddin, Vijanth S. Asirvadam, Eric Fauvet, Christophe Stolz, Tahamina Begum |
TENCON | 2 |
| 2017 | Congestion Detection and Alleviation in Multihop Wireless Sensor NetworksabstractMultiple traffic flows in a dense environment of a mono-sink wireless sensor network (WSN) experience congestion that leads to excessive energy consumption and severe packet loss. To address this problem, a Congestion Detection and Alleviation (CDA) mechanism has been proposed. CDA exploits the features and the characteristics of the sensor nodes and the wireless links between them to detect and alleviate node- and link-level congestion. Node-level congestion is detected by examining the buffer utilisation and the interval between the consecutive data packets. However, link-level congestion is detected through a novel procedure by determining link utilisation using back-off stage of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). CDA alleviates congestion reactively by either rerouting the data traffic to a new less congested, more energy-efficient route or bypassing the affected node/link through ripple-based search. The simulation analysis performed in ns-2.35 evaluates CDA with Congestion Avoidance through Fairness (CAF) and with No Congestion Control (NOCC) protocols. The analysis shows that CDA improves packet delivery ratio by 33% as compared to CAF and 54% as compared to NOCC. CDA also shows an improvement in throughput by 16% as compared to CAF and 36% as compared to NOCC. Additionally, it reduces End-To-End delay by 17% as compared to CAF and 38% as compared to NOCC. Muhammad Omer Chughtai, Nasreen Badruddin, Maaz Rehan, Abid Khan |
Wirel. Commun. Mob. Comput. | 2 |
| 2014 | Binary Power Allocation in Symmetric Wyner-Type Interference NetworksabstractThe Wyner interference network is a popular model used in research on cellular networks due to its simplicity and analytical tractability. In this paper, the optimal power allocation strategies in symmetric one- and two-sided Wyner models are investigated. We determine a sufficient condition for binary power control (BPC) to be optimal that can be applied to the one-sided symmetric model. We consider binary power schemes for the symmetric two-sided Wyner network. Using a method of grouping links and performing a piecewise comparison of the group rates, we are able to determine the optimal power policy that maximizes the network sum rate. The result of the optimization can be expressed as follows for both types of networks: When the interfering channel gain √ϵ is small, it is optimal (in the class of binary schemes) to have all links on; otherwise, alternate links are switched off to remove interference. We characterize the critical values of ϵ where the transitions occur. Nasreen Badruddin, Jamie S. Evans, Stephen Vaughan Hanly |
IEEE Trans. Wirel. Commun. | 1 |
| 2013 | Dynamics of Scalp Potential and Autonomic Nerve Activity during Intelligence Test
Hafeez Ullah Amin, Aamir Saeed Malik, Ahmad Rauf Subhani, Nasreen Badruddin, Weng-Tink Chooi |
ICONIP (1) | 4 |
| 2010 | On Optimal Power Allocation for a Class of Interference NetworksabstractBinary power control has been shown to be optimal in a variety of network conditions. In the context of sumrate maximisation in interference networks, our main result states that the optimal power policy for a link is binary if it only interferes with one other link in the network. Examples of networks which have at least one link with this attribute include the two-link interference channel (IC), the one-sided Wyner network and the many-to-one interference channel. Previous works have fully characterised the optimal power scheme for the two-link IC and they agree with our results. For the one-sided Wyner network, our main result leads to a problem which is tractable and can be solved using dynamic programming methods. Nasreen Badruddin, Jamie S. Evans, Stephen Vaughan Hanly |
GLOBECOM | 1 |
| 2010 | Optimal Binary Power Allocation for Wireless Networks with Local InterferenceabstractIn a Wyner model each link only interferes with links adjacent to it. We consider the problem of finding the optimal power allocation which maximizes the sum-rate of such a network. Each link has a maximum power constraint and the power allocation is assumed to be time and frequency flat. In the case of 3- and 4-link Wyner models, we show that the optimal power schemes are in fact binary, i.e. a link is either switched off or turned on at full power. The problem is then extended to larger-sized Wyner models by limiting to optimal binary power schemes. Interesting phase transitions are observed as the interference cross-gain, ε, traverses various thresholds. Nasreen Badruddin, Stephen Vaughan Hanly, Jamie S. Evans |
ICC | 1 |
| 2010 | Maximizing the sum rate in symmetric networks of interfering linksabstractWe consider the power optimization problem of maximizing the sum rate of a symmetric network of interfering links in Gaussian noise. All transmitters have an average transmit power constraint, the same for all transmitters. This problem has application to DSL, as well as wireless networks. We solve this nonconvex problem by indentifying some underlying convex structure. In particular, we characterize the maximum sum rate of the network, and show that there are essentially two possible states at the optimal solution depending on the cross-gain (√ε) between the links, and/or the average power constraint: the first is a wideband (WB) state, in which all links interfere with each other, and the second is a frequency division multiplexing (FDM) state, in which all links operate in orthogonal frequency bands. The FDM state is optimal if the cross-gain between the links is above 1/√2. If √ε <; 1/√2, then FDM is still optimal provided the SNR of the links is sufficiently high. With √ε <; 1/√2, the WB state occurs when the SNR is low, but as we increase the SNR from low to high, there is a smooth transition from the WB state to the FDM state: For intermediate SNR values, the optimal configuration is a mixture, with some fraction of the bandwidth in the WB state, and the other fraction in the FDM state. We also consider an alternative formulation in which the power is mandated to be frequency flat. In this formulation, the optimal configuration is either all links at full power, or just one link at full power. In this setting, there is an abrupt phase transition between these two states. Sibi Raj Bhaskaran, Stephen Vaughan Hanly, Nasreen Badruddin, Jamie S. Evans |
IEEE Trans. Inf. Theory | 3 |
| 2009 | Maximizing the Sum Rate in Symmetric Networks of Interfering LinksabstractWe consider the power optimization problem of maximizing the sum rate of a symmetric network of interfering links in Gaussian noise. All transmitters have an average transmit power constraint, the same for all transmitters. We solve this nonconvex problem by indentifying some underlying convex structure. In particular, we characterize the maximum sum rate of the network, and show that there are essentially two possible states at the optimal solution depending on the cross-gain (radicisin) between the links, and/or the average power constraint: the first is a wideband (WB) state , in which all links interfere with each other, and the second is a frequency division multiplexing (FDM) state, in which all links operate in orthogonal frequency bands. The FDM state is optimal if the cross-gain between the links is above 1/radic2. If isin < 1/2, then FDM is still optimal provided the average power of the links is sufficiently high. With e < 1/2, the WB state occurs when the average power level is low (relative to the noise and the cross-gain factor), but as we increase the average power level from low to high, there is a smooth transition from the WB state to the FDM state: For intermediate average power levels, the optimal configuration is a mixture, with some fraction of the bandwidth in the WB state, and the other fraction in the FDM state. This work has applications to DSL, as well as to wireless networks. Sibi Raj Bhaskaran, Stephen Vaughan Hanly, Nasreen Badruddin, Jamie S. Evans |
ICC | 3 |
| 2004 | Capacity improvement in a CDMA system using relayingabstractThis paper presents an approach that uses relaying to increase CDMA cellular capacity (spectral efficiency). The key insight is that, since the power received by the mobile falls off rapidly, as a function to distance to the base station, relaying could potentially be used to eliminate the out-of-cell interference, thus increasing the cellular capacity. However, as the paper shows, achieving the increase in capacity requires a specific relaying architecture, which can successfully control the interference at the relay stations. This architecture is shown to achieve up to 20% increase in CDMA cellular capacity, when shadowing effects are absent. Nasreen Badruddin, Rohit Negi |
WCNC | 1 |