Dynamic User Grouping Research Articles

NOMA in Downlink SDMA With Limited Feedback: Performance Analysis and Optimization

In this paper, the performance of non-orthogonal multiple access (NOMA) is investigated and optimized in a downlink space division multiple access network with a multi-antenna base station and randomly deployed users, under a general channel state information (CSI) limited feedback framework. We first propose a dynamic user scheduling and grouping strategy by leveraging limited feedback. Based on that, an analytical framework is proposed to obtain the outage probability of the network in closed form. The diversity order and the impacts of the number of feedback bits on the outage performance of NOMA are analyzed. Furthermore, the net throughput, which captures the network-wide throughput with the uplink feedback cost considered, is maximized by optimizing the number of feedback bits. Numerical results are demonstrated to verify our analytical findings and show that different from the perfect CSI case, there always exists a performance floor of outage probability in the considered network due to limited feedback. Moreover, the optimal number of feedback bits for net throughput maximization increases as the channel coherence time becomes longer.

Dynamic User Grouping and Joint Resource Allocation With Multi-Cell Cooperation for Uplink Virtual MIMO Systems

This paper proposes a novel joint resource allocation algorithm combining dynamic user grouping, multi-cell cooperation, and resource block (RB) allocation for single carrier-frequency division multiple access uplink in multi-cell virtual MIMO systems. We first develop the dynamic multi-cell user grouping criteria using minimum mean square error equalization and adaptive modulation with bit error rate (BER) constraint. Then, we formulate and solve a new throughput maximization problem whose resource allocation includes cell selection, dynamic user grouping, and RB pattern assignment. Furthermore, to reduce the computational complexity significantly, especially in the case of large numbers of users and RBs, we present an efficient iterative Hungarian algorithm based on user and resource partitions to solve the problem by decomposing the large scale problem into a series of small scale sub-problems, which can obtain close-to-optimal solution with much lower complexity. The simulation results show that our proposed joint resource allocation algorithm with dynamic multi-cell user grouping scheme achieves better system throughput with BER guarantee than fixed user grouping algorithm and other proposed schemes in the literature.

Joint user grouping and resource allocation for uplink virtual MIMO systems

MIMO has become a core technology of 5G network to largely improve system throughput. Due to the cost and size of the user equipment (UE), the application of MIMO uplink is limited by the difficulty in practical implementation at the user side. Virtual MIMO has been widely investigated to solve this problem for wireless uplink systems. However, virtual MIMO transmission leads to performance degradation due to the multiuser interference. To obtain good trade-off between the system throughput and transmission performance, we investigate joint user grouping and resource allocation under the consideration of system throughput and average mean squared error (MSE) performance in SC-FDMA uplink systems. Based on linear MIMO detection, we first develop MSE-oriented user grouping criteria for evaluation of transmission performance, then establish dynamic user grouping and optimal resource allocation problems for hard and elastic average MSE constraints. The proposed joint resource allocation algorithm is evaluated in SC-FDMA uplink scenarios and the results show that it achieves maximum system throughput with average MSE guaranteed for the hard MSE constraint algorithms and the alterable trade-off between system throughput and average MSE for the elastic MSE constraint algorithms.

A Probabilistic Model of $(t,n)$ Visual Cryptography Scheme With Dynamic Group

The (t, n) visual cryptography (VC) is a secret sharing scheme where a secret image is encoded into n transparencies, and the stacking of any t out of n transparencies reveals the secret image. The stacking of t - 1 or fewer transparencies is unable to extract any information about the secret. We discuss the additions and deletions of users in a dynamic user group. To reduce the overhead of generating and distributing transparencies in user changes, this paper proposes a (t, n) VC scheme with unlimited n based on the probabilistic model. The proposed scheme allows n to change dynamically in order to include new transparencies without regenerating and redistributing the original transparencies. Specifically, an extended VC scheme based on basis matrices and a probabilistic model is proposed. An equation is derived from the fundamental definitions of the (t, n) VC scheme, and then the (t, ∞) VC scheme achieving maximal contrast can be designed by using the derived equation. The maximal contrasts with t = 2 to 6 are explicitly solved in this paper.

Self-Healing Key Distribution Schemes for Wireless Networks: A Survey

The objective of self-healing key distribution is to enable group users to recover session keys by themselves, without requesting additional transmissions from the group manager (GM), even when they miss some broadcast messages. One major benefit of the self-healing key distribution mechanism is the reduction of energy consumption due to the elimination of such additional transmission. Also in some applications, e.g., uni-directional broadcast channel from the GM, the self-healing key distribution mechanism seems to be the ideal solution. Desired features of self-healing key distribution schemes include energy awareness, short broadcast message, efficient users addition, revocation and so on. A primary challenge is managing the trade-off between providing an acceptable level of security and conserving scarce resources in particular energy which is critical for wireless network operations. Over a decade, a great number of self-healing key distribution schemes have been proposed for establishing a group key amongst a dynamic group of users over an unreliable, or lossy, network. In this paper a comprehensive survey is conducted on the state-of-the-art in the field of self-healing key distribution. First, we clarify the security requirements of self-healing key distribution scheme for their special application environment. Then, we present a classification of self-healing key distribution schemes according to different cryptographic primitives, and give an insight to their features and goals. Furthermore, we consider several problems, namely authentication on broadcast messages, sponsorization and mutual-healing, related to the robustness of self-healing key distribution schemes. At last, we delineate their similarities and differences and outline several future research directions.

Evaluating Steiner-tree heuristics and diameter variations for application layer multicast

Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups. We focus on application-layer multicast with a centralized approach to the group management. The groups are organized in overlay networks that are created using graph algorithms that create a tree structure for the group. A tree has no cycles and uses a small routing table, as opposed to a connected overlay mesh. We investigated a group of spanning tree problems that are referred to as Steiner-tree problems, and we have a particular focus on reducing the diameter of a tree, which is the maximum pairwise latency in a tree. In addition, we focus on reducing the time it takes to execute membership changes. In that context, we use core-selection heuristics to find well-placed client nodes, and edge-pruning algorithms to reduce the number of edges in an otherwise fully meshed overlay. Our edge-pruning algorithms strongly connect well-placed client nodes to the remaining group members, to create new and pruned group graphs. Consequently, when a tree algorithm is applied to a pruned group graph, it is manipulated into creating trees with a smaller diameter. We devised new Steiner-tree heuristics that reduced the diameter, and also proposed new edge-pruning algorithms to make the tree construction faster. These heuristics and algorithms were implemented and analyzed experimentally along with several spanning-tree and core-selection heuristics found in the literature. We found that a full-mesh of shortest paths makes it difficult for Steiner-tree heuristics to find better trees than spanning tree algorithms . The network seen from the application layer is in fact a full mesh of shortest paths. In addition, we found that faster Steiner-tree heuristics that do not explicitly optimize the diameter are able to compete with slower heuristics that do optimize it.

On Self-Healing Key Distribution Schemes

Self-healing key distribution schemes allow group managers to broadcast session keys to large and dynamic groups of users over unreliable channels. Roughly speaking, even if during a certain session some broadcast messages are lost due to network faults, the self-healing property of the scheme enables each group member to recover the key from the broadcast messages he has received before and after that session. Such schemes are quite suitable in supporting secure communication in wireless networks and mobile wireless ad-hoc networks. Recent papers have focused on self-healing key distribution, and have provided definitions, stated in terms of the entropy function, and some constructions. The contribution of this paper is the following: We analyze current definitions of self-healing key distribution and, for two of them, we show that no protocol can achieve the definition. We show that a lower bound on the size of the broadcast message, previously derived, does not hold. We propose a new definition of self-healing key distribution, and we show that it can be achieved by concrete schemes. We give some lower bounds on the resources required for implementing such schemes, i.e., user memory storage and communication complexity. We prove that the bounds are tight

Design of Self-Healing Key Distribution Schemes

A self-healing key distribution scheme enables dynamic groups of users of an unreliable network to establish group keys for secure communication. In such a scheme, a group manager, at the beginning...