1 January 2021 in Wireless Communications and Mobile Computing
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.
5 September 2023 in IEEE Transactions on Information Theory
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.