Peng-Jun Wan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Peng-Jun Wan has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Jianhua Yang
TSYS School of Computer Science, Columbus State University, Columbus, GA 31907, USA
2 shared publications Pengpeng Chen
Department of Computer and Information Sciences, Webster University, St. Louis, MO, USA
2 shared publications- Xiaohua Xu
School of Computer Science and Technology, University of Science and Technology of China, Hefei, China
2 shared publications Boliu Xu
Department of Computer Science, Illinois Institute of Technology
1 shared publication- Chao Ma
Wuhan University
1 shared publication Frances Yao
Department of Computer Science, City University of Hong Kong, China
1 shared publication
Latest Publications
- 9 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (3) , 2245-2256
Maximizing Weighted Energy Efficiency Over Parallel Gaussian Broadcast Channels
A power assignment over parallel Gaussian broadcast channels splits a power budget at the access point among all channel-user pairs subject to per-channel upper-bounds on the sum-power, and yields a rate allocation to all channel-user pairs. Its weighted energy efficiency (WEE) is the ratio of its weighted sum-rate over its sum-power plus a fixed positive overhead. The problem Max-WEE seeks a power assignment maximizing the WEE. Special variants of Max-WEE with unit weights or two users per channel have been extensively studied in the literature. But none of the existing algorithms for those special variants have known bounds on running time, mainly because they follow the general-purposed methods for fractional programming. In this paper, we first derive fundamental properties and closed-form expressions of maximum WEE. Then we devise a simple water-filling algorithm for Max-WEE. Assuming all users are presorted by weight, the water-filling algorithm has linear complexity in the number of channel-user pairs. Under a mild presorting condition, we further develop a linear-complexity algorithm for Max-WEE subject to rate demand.
- 9 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (3) , 2245-2256
Maximizing Weighted Energy Efficiency Over Parallel Gaussian Broadcast Channels
A power assignment over parallel Gaussian broadcast channels splits a power budget at the access point among all channel-user pairs subject to per-channel upper-bounds on the sum-power, and yields a rate allocation to all channel-user pairs. Its weighted energy efficiency (WEE) is the ratio of its weighted sum-rate over its sum-power plus a fixed positive overhead. The problem Max-WEE seeks a power assignment maximizing the WEE. Special variants of Max-WEE with unit weights or two users per channel have been extensively studied in the literature. But none of the existing algorithms for those special variants have known bounds on running time, mainly because they follow the general-purposed methods for fractional programming. In this paper, we first derive fundamental properties and closed-form expressions of maximum WEE. Then we devise a simple water-filling algorithm for Max-WEE. Assuming all users are presorted by weight, the water-filling algorithm has linear complexity in the number of channel-user pairs. Under a mild presorting condition, we further develop a linear-complexity algorithm for Max-WEE subject to rate demand.
- 5 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (4) , 2922-2935
Maximizing Weighted Sum-Rate Over Gaussian Broadcast Channels
A power assignment over Gaussian broadcast channels splits the power budget at the access point among all user-channel pairs subject to per-channel upper-bounds on the sum-power, and is optimal if it maximizes the weighted sum-rate (WSR). In this paper we first present a geometric algorithm for computing an optimal power assignment over single Gaussian broadcast channel, which has linear complexity if all users are presorted either by weight or by noise. We also provide an intuitively appealing water-filling interpretation of this geometric algorithm. By leveraging such water-filling interpretation, we develop a water-filling algorithm for computing an optimal power assignment over parallel Gaussian broadcast channels, whose complexity is linear in the number of user-channel pairs if all users are presorted by weight. From these algorithmic studies, we derive clean and simple expressions of the maximum WSR in both integral forms and sum forms. By exploiting the rich property of those forms, we further give a linear-complexity algorithm for computing a power budget at the access point, subject to a given upper bound, which maximizes the difference between the maximum WSR and a linear cost of the power budget. The algorithmic studies in this paper also reveal that a single Gaussian broadcast channel can be decomposed into parallel Gaussian single-user channels which preserve the maximum WSR.
- 5 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (4) , 2922-2935
Maximizing Weighted Sum-Rate Over Gaussian Broadcast Channels
A power assignment over Gaussian broadcast channels splits the power budget at the access point among all user-channel pairs subject to per-channel upper-bounds on the sum-power, and is optimal if it maximizes the weighted sum-rate (WSR). In this paper we first present a geometric algorithm for computing an optimal power assignment over single Gaussian broadcast channel, which has linear complexity if all users are presorted either by weight or by noise. We also provide an intuitively appealing water-filling interpretation of this geometric algorithm. By leveraging such water-filling interpretation, we develop a water-filling algorithm for computing an optimal power assignment over parallel Gaussian broadcast channels, whose complexity is linear in the number of user-channel pairs if all users are presorted by weight. From these algorithmic studies, we derive clean and simple expressions of the maximum WSR in both integral forms and sum forms. By exploiting the rich property of those forms, we further give a linear-complexity algorithm for computing a power budget at the access point, subject to a given upper bound, which maximizes the difference between the maximum WSR and a linear cost of the power budget. The algorithmic studies in this paper also reveal that a single Gaussian broadcast channel can be decomposed into parallel Gaussian single-user channels which preserve the maximum WSR.
- 30 July 2022
- Published by Elsevier in Theoretical Computer Science
- Vol. 931, 78-92
Gaussian downlink user selection subject to access limit, power budget, and rate demands
- 30 July 2022
- Published by Elsevier in Theoretical Computer Science
- Vol. 931, 78-92
Gaussian downlink user selection subject to access limit, power budget, and rate demands
- Open Access
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Mining Network Traffic with the k‐Means Clustering Algorithm for Stepping‐Stone Intrusion Detection
Intruders on the Internet usually launch network attacks through compromised hosts, called stepping stones, in order to reduce the chance of being detected. With stepping‐stone intrusions, an attacker uses tools such as SSH to log in several compromised hosts remotely and create an interactive connection chain and then sends attacking packets to a target system. An effective method to detect such an intrusion is to estimate the length of a connection chain. In this paper, we develop an efficient algorithm to detect stepping‐stone intrusion by mining network traffic using the k‐means clustering. Existing approaches for connection‐chain‐based stepping‐stone intrusion detection either are not effective or require a large number of TCP packets to be captured and processed and, thus, are not efficient. Our proposed detection algorithm can accurately determine the length of a connection chain without requiring a large number of TCP packets being captured and processed, so it is more efficient. Our proposed detection algorithm is also easier to implement than all existing approaches for stepping‐stone intrusion detection. The effectiveness, correctness, and efficiency of our proposed detection algorithm are verified through well‐designed network experiments.
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Open AccessMining Network Traffic with the k‐Means Clustering Algorithm for Stepping‐Stone Intrusion Detection
Intruders on the Internet usually launch network attacks through compromised hosts, called stepping stones, in order to reduce the chance of being detected. With stepping‐stone intrusions, an attacker uses tools such as SSH to log in several compromised hosts remotely and create an interactive connection chain and then sends attacking packets to a target system. An effective method to detect such an intrusion is to estimate the length of a connection chain. In this paper, we develop an efficient algorithm to detect stepping‐stone intrusion by mining network traffic using the k‐means clustering. Existing approaches for connection‐chain‐based stepping‐stone intrusion detection either are not effective or require a large number of TCP packets to be captured and processed and, thus, are not efficient. Our proposed detection algorithm can accurately determine the length of a connection chain without requiring a large number of TCP packets being captured and processed, so it is more efficient. Our proposed detection algorithm is also easier to implement than all existing approaches for stepping‐stone intrusion detection. The effectiveness, correctness, and efficiency of our proposed detection algorithm are verified through well‐designed network experiments.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 170-175
Minimum-Latency Data Gathering Scheduling in Multi-Channel Wireless Sensor Networks Using Only Secure Links
Many applications of wireless sensor networks (WSNs) are time-critical as well as requiring secure operations, and have serious consequences if the network is compromised. WSNs are often deployed in hostile environments where communication is monitored and the sensor nodes are subject to be compromised or manipulated by adversaries. For such WSNs, it is very important to have secure communications among the sensors. The m-composite key pre-distribution schemes proposed in [3] is one of the most popular mechanisms for communication security of WSNs. With such a security scheme, two nodes within each other's transmission range have a secure link between them if their key rings have at least m keys in common. In this paper, we develop an efficient scheduling algorithm for data gathering on secure WSNs. The link between two nearby sensors may not be secure and cannot be used for communication. Such a nature of secure WSNs makes the analysis of any scheduling algorithm for gathering much more challenging than on WSNs that can be modeled as disk graphs. To the best of our knowledge, this is the first paper that develops fast gathering schedules for multihop WSNs where the network topology cannot be modeled as a disk graph.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 170-175
Minimum-Latency Data Gathering Scheduling in Multi-Channel Wireless Sensor Networks Using Only Secure Links
Many applications of wireless sensor networks (WSNs) are time-critical as well as requiring secure operations, and have serious consequences if the network is compromised. WSNs are often deployed in hostile environments where communication is monitored and the sensor nodes are subject to be compromised or manipulated by adversaries. For such WSNs, it is very important to have secure communications among the sensors. The m-composite key pre-distribution schemes proposed in [3] is one of the most popular mechanisms for communication security of WSNs. With such a security scheme, two nodes within each other's transmission range have a secure link between them if their key rings have at least m keys in common. In this paper, we develop an efficient scheduling algorithm for data gathering on secure WSNs. The link between two nearby sensors may not be secure and cannot be used for communication. Such a nature of secure WSNs makes the analysis of any scheduling algorithm for gathering much more challenging than on WSNs that can be modeled as disk graphs. To the best of our knowledge, this is the first paper that develops fast gathering schedules for multihop WSNs where the network topology cannot be modeled as a disk graph.
- Open Access
- 1 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7 (10636927) , 507-516
Weighted Restless Bandit and Its Applications
Motivated by many applications such as cognitive radio spectrum scheduling, downlink fading channel scheduling, and unmanned aerial vehicle dynamic routing, we study two restless bandit problems. Given a bandit consisting of multiple restless arms, the state of each arm evolves as a Markov chain. Assume each arm is associated with a positive weight. At each step, we select a subset of arms to play such that the weighted sum of the selected arms cannot exceed a limit. The reward of playing each arm varies according to the arm's state. The exact state of each arm is only revealed when the arm is played. The problem weighted restless bandit aims to maximize the expected average reward over the infinite horizon. We also study an extended problem called multiply-constrained restless bandit where each time there are two simultaneous constraints on the selected arms. First, the weighted sum of the selected arms cannot exceed a limit, Second, the number of the selected arms is at most a constant K. The objective of multiply-constrained restless bandit is to maximize the long term average reward. Both problems are partially observable Markov decision processes and have been proved to be PSPACE-hard even in their special cases. We propose constant approximation algorithms for both problems. Our method involves solving a semi-infinite program, converting back to a low-complexity policy, and accounting for the average reward via a Lyapunov function analysis.
- 1 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7 (10636927) , 507-516
Open AccessWeighted Restless Bandit and Its Applications
Motivated by many applications such as cognitive radio spectrum scheduling, downlink fading channel scheduling, and unmanned aerial vehicle dynamic routing, we study two restless bandit problems. Given a bandit consisting of multiple restless arms, the state of each arm evolves as a Markov chain. Assume each arm is associated with a positive weight. At each step, we select a subset of arms to play such that the weighted sum of the selected arms cannot exceed a limit. The reward of playing each arm varies according to the arm's state. The exact state of each arm is only revealed when the arm is played. The problem weighted restless bandit aims to maximize the expected average reward over the infinite horizon. We also study an extended problem called multiply-constrained restless bandit where each time there are two simultaneous constraints on the selected arms. First, the weighted sum of the selected arms cannot exceed a limit, Second, the number of the selected arms is at most a constant K. The objective of multiply-constrained restless bandit is to maximize the long term average reward. Both problems are partially observable Markov decision processes and have been proved to be PSPACE-hard even in their special cases. We propose constant approximation algorithms for both problems. Our method involves solving a semi-infinite program, converting back to a low-complexity policy, and accounting for the average reward via a Lyapunov function analysis.
- Open Access
- 1 April 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2009 (0743166X) , 135-139
Maximizing wireless network capacity with linear power: Breaking the logarithmic barrier
Maximizing the wireless network capacity under physical interference model is notoriously hard due to the nonlocality and the additive nature of the wireless interference under the physical interference model. This problem has been extensively studied recently with the achievable approximation bounds progressively improved from the linear factor to logarithmic factor. It has been a major open problem whether there exists a constant-approximation approximation algorithm for maximizing the wireless network capacity under the physical interference model. In this paper, we improve the status quo for the case of linear transmission power assignment, which is widely adopted due to its advantage of energy conservation. By exploring and exploiting the rich nature of the wireless interference with the linear power assignment, we develop constant-approximation algorithms for maximizing the wireless network capacity with linear transmission power assignment under the physical interference model, in both the unidirectional mode and the bidirectional mode.
- 1 April 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2009 (0743166X) , 135-139
Open AccessMaximizing wireless network capacity with linear power: Breaking the logarithmic barrier
Maximizing the wireless network capacity under physical interference model is notoriously hard due to the nonlocality and the additive nature of the wireless interference under the physical interference model. This problem has been extensively studied recently with the achievable approximation bounds progressively improved from the linear factor to logarithmic factor. It has been a major open problem whether there exists a constant-approximation approximation algorithm for maximizing the wireless network capacity under the physical interference model. In this paper, we improve the status quo for the case of linear transmission power assignment, which is widely adopted due to its advantage of energy conservation. By exploring and exploiting the rich nature of the wireless interference with the linear power assignment, we develop constant-approximation algorithms for maximizing the wireless network capacity with linear transmission power assignment under the physical interference model, in both the unidirectional mode and the bidirectional mode.
- Open Access
- 1 April 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0743166X,p. 846-854
Multiflows in multi-channel multi-radio multihop wireless networks
This paper studies maximum multiflow (MMF) and maximum concurrent multiflow (MCMF) in muliti-channel multi-radio multihop wireless networks under the 802.11 interference model or the protocol interference model. We introduce a fine-grained network representation of multi-channel multi-radio multihop wireless networks and present some essential topological properties of its associated conflict graph. By exploiting these properties, we develop practical polynomial approximation algorithms for MMF and MCMF with constant approximation bounds regardless of the number of channels and radios. Under the 802.11 interference model, their approximation bounds are at most 20 in general and at most 8 with uniform interference radii; under the protocol interference model, if the interference radius of each node is at least c times its communication radius, their approximation bounds are at most 2 (⌈π/ arcsin c-1/2c⌉ + 1). In addition, we also prove that if the number of channels is bounded by a constant (which is typical in practical networks), both MMF and MCMF admit a polynomial-time approximation scheme under the 802.11 interference model or under the protocol interference model with some additional mild conditions.
- 1 April 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0743166X,p. 846-854
Open AccessMultiflows in multi-channel multi-radio multihop wireless networks
This paper studies maximum multiflow (MMF) and maximum concurrent multiflow (MCMF) in muliti-channel multi-radio multihop wireless networks under the 802.11 interference model or the protocol interference model. We introduce a fine-grained network representation of multi-channel multi-radio multihop wireless networks and present some essential topological properties of its associated conflict graph. By exploiting these properties, we develop practical polynomial approximation algorithms for MMF and MCMF with constant approximation bounds regardless of the number of channels and radios. Under the 802.11 interference model, their approximation bounds are at most 20 in general and at most 8 with uniform interference radii; under the protocol interference model, if the interference radius of each node is at least c times its communication radius, their approximation bounds are at most 2 (⌈π/ arcsin c-1/2c⌉ + 1). In addition, we also prove that if the number of channels is bounded by a constant (which is typical in practical networks), both MMF and MCMF admit a polynomial-time approximation scheme under the 802.11 interference model or under the protocol interference model with some additional mild conditions.
- 1 October 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21556806,p. 526-533
Fast group communications in multihop wireless networks subject to physical interference
In this paper, we present short communication schedules for broadcast, data aggregation, data gathering, and gossiping in multihop wireless networks subject to physical interference. We assume that all communications proceed in synchronous time-slots, each node can transmit at most one packet of fixed size in each time-slot, and all nodes have fixed and equal transmission power. Under mild assumptions, all of our communication schedules for those four group communications have constant approximation bounds. These communication schedules are built upon a general technique which enables a unified graph-theoretic treatment of the communication scheduling subject to the physical interference constraint.
- 1 October 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21556806,p. 526-533
Fast group communications in multihop wireless networks subject to physical interference
In this paper, we present short communication schedules for broadcast, data aggregation, data gathering, and gossiping in multihop wireless networks subject to physical interference. We assume that all communications proceed in synchronous time-slots, each node can transmit at most one packet of fixed size in each time-slot, and all nodes have fixed and equal transmission power. Under mild assumptions, all of our communication schedules for those four group communications have constant approximation bounds. These communication schedules are built upon a general technique which enables a unified graph-theoretic treatment of the communication scheduling subject to the physical interference constraint.