Peng-Jun Wan

Peng-Jun Wan

Auto-generated profile, based on publicly available information

Peng-Jun Wan

Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2011
Verified
Conference Paper
Open access
PWPeng-Jun Wan
Peng-Jun Wan
YCYu Cheng
Yu Cheng
ZWZhu Wang
Zhu Wang
FYFrances Yao
Frances Yao
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
Verified
Conference Paper
Closed access
PWPeng-Jun Wan
Peng-Jun Wan
STShang Tai
Shang Tai
OFOphir Frieder
Ophir Frieder
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 January 2021 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
Lixin WangLixin Wang
Lixin Wang
Jianhua YangJianhua Yang
Jianhua Yang
XXXiaohua Xu
Xiaohua Xu
PWPeng‐Jun Wan
Peng‐Jun Wan
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 April 2013
Verified
Conference Paper
Open access
PWPeng-Jun Wan
Peng-Jun Wan
Lei WangLei Wang
Lei Wang
CMChao Ma
Chao Ma
Zhu WangZhu Wang
Zhu Wang
BXBoliu Xu
Boliu Xu
MLMinming Li
Minming Li
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.

5 September 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
PWPeng-Jun Wan
Peng-Jun Wan
PCPengpeng Chen
Pengpeng Chen
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.

1 June 2015
Verified
Conference Paper
Open access
PWPeng-Jun Wan
Peng-Jun Wan
XXXiaohua Xu
Xiaohua Xu
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.