Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 728 papers for “message splitting”

Sys-Log Database Manipulation Security Protocol by Message splitting

Somchai Prakancharoen · 2011

Cited by 0

Message-Splitting for Interference Cancellation in Multibeam Satellite Systems

Tomás Ramírez, Carlos Mosquera, Màrius Caus et al. · Ghent University Academic Bibliography (Ghent University) · 2018

This paper investigates a novel technique to deal with the interference in the forward link of multibeam satellite systems when aggressive frequency reuse schemes are employed. Taking into account only magnitude information about the forward channel, the gateway judiciously splits the messages to be transmitted into private and public parts. At the receive terminals, partial cancellation of the public messages is applied prior to private message detection. The practical significance of the absence of channel phase information is stressed and complemented by some additional insights on the implementation. Our numerical results show that, in terms of average total throughput, this technique combined with a 2-colour frequency reuse scheme can outperform a classic orthogonal system with a conservative 4-colour frequency reuse scheme, despite the additional co-channel interference.

Cited by 7Open access

Sub-Messages Scheduling in GNSS Packet Broadcasting By Message Splitting

Francesco Ardizzon, Nicola Laurenti, Stefano Tomasin · 2020

Recently, global navigation satellite systems (GNSSs) have started offering additional services to improve the precision of positioning, authenticate the GNSS signal, and broadcast messages (e.g., almanacs or information needed for search and rescue purposes). In all these scenarios, possibly long messages must be broadcast over the low-rate satellite-ground communication link. By splitting the message into sub-messages, each transmitted by a different satellite, the receiver can decode them simultaneously, achieving a higher equivalent data rate. In this paper we address the problem of scheduling sub-message transmissions on a constellation of satellites for transmission over error-free and erasure channels. For the error-free case we aim at maximizing the area over the earth, where the entire message can be decoded. Both optimal (by binary linear programming) and sub-optimal low-complexity solutions are investigated. For erasure channels we consider two possible targets: either the minimization of the maximum packet error rate (PER) on the earth surface, or, in a dual fashion, the maximization of the area where all sub-messages are received with PER below a given threshold. Both problems are framed as integer linear programming problems, and again suboptimal, less computationally demanding solutions are also developed.

Cited by 2

Rate Splitting for Multi-Group Multicasting With a Common Message

Ahmet Zahid Yalcin, Melda Yüksel, Bruno Clerckx · IEEE Transactions on Vehicular Technology · 2020

In this letter, precoding for max-min fairness (MMF) for multi-group multicasting with a common message is studied. The MMF problem is converted into a weighted mean square error minimization problem. A rate-splitting solution is proposed. In rate-splitting, multicast messages for each group are divided into private and common parts, and these common parts, together with the original common message are combined as a super common message. This super common message is superposed on or concatenated to the private multicast data vector, or it is transmitted via a mixed scheme. Simulations show that RS demonstrates significant gains especially in overloaded systems.

Cited by 1Open access

Message Splitting: Using Attention-Grabbing Material to Increase Prosocial Behavior

Nathanael J. Fast, Jonah Berger · ScholarlyCommons (University of Pennsylvania) · 2010

This article examines whether drawing attention to specific parts of appeals for prosocial behavior (i.e., “message splitting”) can increase their effectiveness. Results of four experiments support this idea. Using attention-grabbing cues to guide attention toward the benefits of compliance and away from the costs increased message recipients’ willingness to donate cans of food to a community food drive (Experiment 1), volunteer time to help improve the environment (Experiments 2 and 3) and volunteer time to help further scientific inquiry (Experiment 4). Results of Experiment 4 underscore the proposed mechanism by showing that this message splitting technique reduces, rather than increases, compliance when used to direct attention toward the costs of compliance. Implications for research on information processing, helping behavior, and influence are discussed.

Cited by 1Open access

Rate Splitting and Common Message Decoding for MIMO C-RAN Systems

Alaa Alameer Ahmad, Jaber Kakar, Hayssam Dahrouj et al. · 2019

In this paper, we study the benefits of rate-splitting (RS) in multiple-input multiple-output (MIMO) cloud radio access networks (C-RAN). For this setting, we propose a stream-based transmission scheme in which user's messages are divided into a private and a common part, each of which is encoded into multiple streams. Under this stream-based strategy, we formulate a weighted sum-rate maximization problem subject to backhaul capacity and transmit power constraints. We determine the beamforming vectors of private and common streams of this non-convex optimization problem via a proposed iterative algorithm based on the fractional programming (FP) framework. Numerical results show gains of up to 27% of RS-MIMO over the baseline scheme of treating interference as noise (TIN). Particularly, at large backhaul capacities and specific antenna settings at which interference levels are maximal, rate splitting along with common message decoding is a viable option for effective interference management in MIMO C-RAN.

Cited by 16

Energy Efficiency in C-RAN using Rate Splitting and Common Message Decoding

Alaa Alameer Ahmad, Bho Matthiesen, Aydin Sezgin et al. · 2020

Energy efficiency (EE) has become vital in assessing the performance of modern communication network. With a tremendous increase in the data traffic it is important to keep the energy consumption manageable. This paper studies the EE maximization problem in C-RAN which adopts rate splitting (RS). The cloud is connected to a set of base stations (BSs) via limited capacity fronthaul links. To this end, the paper considers optimization of the power control in the BSs subject to common fronthaul constraints capacity and per-BS transmit power constraints. The problem is non-convex and difficult to solve. We propose to solve the problem using iterative approach merging Dinkelbach Algorithm and successive convex approximations (SCA). The solution is guaranteed to converge to a stationary point of the original problem. To evaluate the quality of the first-order optimal approach, we employ the recently proposed mixed monotonic programming framework to solve this problem with global optimality. Numerical results show a gain of up to 97% in EE when employing RS instead of simply treating interference as noise and good performance of the polynomial complexity algorithm compared to the global optimal solution.

Cited by 27

Coordinated Rate-Splitting Multiple Access for Integrated Satellite-Terrestrial Networks With Super-Common Message

Juhwan Lee, Jungwoo Lee, Longfei Yin et al. · IEEE Transactions on Vehicular Technology · 2023

Rate-splitting multiple access (RSMA) is an emerging multiple access technique for multi-antenna networks that splits messages into common and private parts for flexible interference mitigation. Motivated by its robustness and scalability, it is promising to employ RSMA in integrated satellite-terrestrial networks (ISTN), where a satellite serves satellite users (SUs) broadly with a multibeam multicast transmission while terrestrial base station (BS) serves cellular users (CUs) with a unicast transmission, operating in the same frequency band. To avoid the data exchange between satellite/cellular networks via backhaul, we assume a coordinated ISTN relying on imperfect channel state information. We put forth a coordinated RSMA framework tailored to the coordinated ISTN by applying <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">inter-network rate-splitting (RS) with a super-common message on top of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">intra-network RS with common/private messages. With the unified RS design for inter- and intra-networks, we jointly optimize the precoding and power allocation of the private/common/super-common messages to achieve max-min fairness among all SUs and CUs through successive convex approximation. By doing so, the power of the super-common message can be adjusted according to interference levels of the satellite towards CUs, thereby potentially mitigating inter-network interference. Simulation results demonstrate the superiority and robustness of our approach to cope with various interference and propagation conditions.

Cited by 16

Abstract Iterative Type Analysis and Extended Message Splitting: Optimizing Dynamically-Typed Object-Oriented Programs

Craig Chambers, David Ungar · 2008

Object-oriented languages have suffe=d from poor perfor-mance caused by frequent and slow dynamically-bound pro-cedure calls. The best way to speed up a procedure call is to compile it out, but dynamic binding of object-oriented pro-cedure calls without static receiver type information pre-eludes inlining. Iterative type analysis and extended mes-sage splitting are new compilation techniques that extract much of the necessary type information and make it possible to hoist run-time type tests out of loops. Our system compiles code on-the-fly that is customized to the actual data types used by a running program, The com-piler constructs a control flow graph annotated with type in-formation by simultaneously performing type analysis and Wining. Extended message splitting preserves type infonna-tion that would otherwise be lost by a control-flow merge by duplicating all the code between the merge and the place that uses the information. Iterative type analysis computes the types of variables used in a loop by repeatedly recompiling the loop until the computed types reach a fix-point. Together these two techniques enable our SELF compiler to split off a copy of an entire loop, optimized for the common-case types. By the time our SELF compiler generates code for the graph, it has eliminated many dynamically-dispatched procedure calls and type tests. The resulting machine code is twice as fast as that generated by the p~vious SELF compiler, four times faster than ParcPlace Systems SmalltalHO, * the fast-est commercially available dynamically-typed object-orient-ed language implementation, and nearly half the speed of op-timized C. Iterative type analysis and extended message splitting have cut the performance penalty for dynamically-typed object-oriented languages in half. l SmaLltaJk-80 is a trademark of ParcPlace Systems, Inc. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct com-mercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is

Cited by 0

Interference Mitigation via Rate-Splitting and Common Message Decoding\n in Cloud Radio Access Networks

Alaa Alameer Ahmad, Hayssam Dahrouj, Anas Chaaban et al. · arXiv (Cornell University) · 2019

Cloud-radio access networks (C-RAN) help overcoming the scarcity of radio\nresources by enabling dense deployment of base-stations (BSs), and connecting\nthem to a central-processor (CP). This paper considers the downlink of a C-RAN,\nwhere the cloud is connected to the BSs via limited-capacity backhaul links.\nThe paper proposes splitting the message of each user into two parts, a private\npart decodable at the intended user only, and a common part which can be\ndecoded at a subset of users, as a means to enable large-scale interference\nmanagement in CRAN. To this end, the paper optimizes a transmission scheme that\ncombines rate splitting (RS), common message decoding (CMD), clustering and\ncoordinated beamforming. The paper focuses on maximizing the weighted sum-rate\nsubject to per-BS backhaul capacity and transmit power constraints, so as to\njointly determine the RS-CMD mode of transmission, the cluster of BSs serving\nprivate and common messages of each user, and the associated beamforming\nvectors of each user private and common messages. The paper proposes solving\nsuch a complicated non-convex optimization problem using $l_0$-norm relaxation\ntechniques, followed by inner-convex approximations (ICA), so as to achieve\nstationary solutions to the relaxed non-convex problem. Numerical results show\nthat the proposed method provides significant performance gain as compared to\nconventional interference mitigation techniques in CRAN which treat\ninterference as noise (TIN).\n

Cited by 0Open access

On the Security of Key-Based Interval Splitting Arithmetic Coding With Respect to Message Indistinguishability

R. Katti, Aida Vosoughi · IEEE Transactions on Information Forensics and Security · 2012

Key-based interval splitting arithmetic coding (KSAC) has been proposed to improve the security of traditional arithmetic coding (AC). Chosen-plaintext attacks have been proposed for KSAC when the same key is used to encrypt different messages. In this paper, we consider a stronger version of KSAC, where different keys are used to encrypt different messages. We then use message indistinguishability to prove that this version of KSAC is insecure under ciphertext-only attacks, a weaker form of attack than chosen-plaintext attacks. Indistinguishability in the presence of an eavesdropper is a security definition equivalent to semantic security. We prove the insecurity over the alphabet {A,B} with p B =(1/2(1+2 s )) and p A =1- p B where p A and p B are the probabilities of the source generating A and B, respectively, and s is the number of bits in each splitting key.

Cited by 10

On the Achievable Rate Region of the K-Receiver Broadcast Channels via Exhaustive Message Splitting.

Rui Tang, Songjie Xie, Youlong Wu · PubMed · 2021

This paper focuses on K-receiver discrete-time memoryless broadcast channels (DM-BCs) with private messages, where the transmitter wishes to convey K private messages to K receivers. A general inner bound on the capacity region is proposed based on an exhaustive message splitting and a K-level modified Marton's coding. The key idea is to split every message into ∑j=1KKj-1 submessages each corresponding to a set of users who are assigned to recover them, and then send these submessages via codewords chosen from a K-level structure codebooks. To guarantee the joint typicality among all transmitted codewords, a sufficient condition on the subcodebooks' sizes is derived through a newly establishing hierarchical covering lemma, which extends the 2-level multivariate covering lemma to the K-level case with more intricate dependences. As the number of auxiliary random variables and rate conditions both increase exponentially with K, the standard Fourier-Motzkin elimination procedure becomes infeasible when K is large. To tackle this problem, we obtain a closed form of achievable rate region with a special observation of disjoint unions of sets that constitute the power set of {1,⋯,K}. The proposed achievable rate region allows arbitrary input probability mass functions and improves over previously known achievable (closed form) rate regions for K-receiver (K≥3) BCs.

Cited by 4Open access

Energy-Spectrum Efficient Content Distribution in Fog-RAN Using Rate-Splitting, Common Message Decoding, and 3D-Resource Matching

Md. Zoheb Hassan, Md. Jahangir Hossain, Julian Cheng et al. · IEEE Transactions on Wireless Communications · 2021

Multi-objective resource allocation is studied for edge-caching enabled fog-radio access network. Notably, joint maximization of the energy-efficiency (EE) and spectrum-efficiency (SE) and interference management are investigated for distributing contents from the cache-enabled fog access points (F-APs) and cloud base station (CBS) to the user devices (UDs). In our envisioned system, the UDs are grouped into multiple non-overlapping device-clusters based on their locations. A rate-splitting with common message decoding based transmission strategy is applied to enable UDs of each device-cluster to receive data from a suitably selected F-AP and CBS over the same radio resource blocks. To maximize system EE and SE jointly, a multi-objective optimization problem (MOOP) is formulated and it is solved in three stages. At first, by employing the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula> -constraint method, the MOOP is converted to an EE-SE trade-off optimization problem. Then, by leveraging iterative function evaluation based power control and generalized 3D-resource matching, the EE-SE trade-off optimization problem is solved and a novel resource allocation algorithm is proposed to obtain near-optimal Pareto-front for the proposed MOOP. To reduce the complexity of obtaining near-optimal Pareto-front, a sub-optimal resource allocation algorithm is proposed as well. Finally, a low-complexity algorithm is devised to select a suitable operating EE-SE pair from the obtained Pareto-front. The conducted simulations demonstrate that the proposed resource allocation schemes achieve substantial improvement of system EE and SE over the benchmark schemes.

Cited by 14

Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual Cryptography for Security of Handwritten Images

Sugianto Sugianto, Suharjito Suharjito, Nico Surantha · TELKOMNIKA (Telecommunication Computing Electronics and Control) · 2018

The secret sharing is a method to protect confidentiality and integrity of the secret messages by distributing the message shares into several recipients. The secret message could not be revealed unless the recipients exchange and collect shares to reconstruct the actual message. Even though the attacker obtain shares shadow during the share exchange, it would be impossible for the attacker to understand the correct share. There are few algorithms have been developed for secret sharing, e.g. secret splitting, Asmuth-Bloom secret sharing protocol, visual cryptography, etc. There is an unanswered question in this research about which method provides best level of security and efficiency in securing message. In this paper, we evaluate the performance of three methods, i.e. secret splitting, secret sharing, and recursive threshold visual cryptography for handwritten image security in terms of execution time and mean squared error (MSE) simulation. Simulation results show the secret splitting algorithm produces the shortest time of execution. On the other hand, the MSE simulation result that the three methods can reconstruct the original image very well.

Cited by 2Open access

Multiuser Cognitive Radio Networks: An Information Theoretic Perspective

Nagananda, K. G., Mohapatra, Parthajit, Murthy, Chandra R. et al. · arXiv (Cornell University) · 2011

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different ways of message-sharing between the primary and secondary (or cognitive) transmitters. Three natural extensions of unidirectional message-sharing from two users to three users are introduced: (i) Cumulative message sharing; (ii) primary-only message sharing; and (iii) cognitive-only message sharing. To emphasize the notion of interference management, channels are classified based on different rate-splitting strategies at the transmitters. Standard techniques, superposition coding and Gel'fand-Pinsker's binning principle, are employed to derive an achievable rate region for each of the cognitive interference channels. Simulation results for the Gaussian channel case are presented; they enable visual comparison of the achievable rate regions for different message-sharing schemes along with the outer bounds. These results also provide useful insights into the effect of rate-splitting at the transmitters, which aids in better interference management at the receivers.

Cited by 0Open access

Message Passing Algorithms for Optimization

Ruozzi, Nicholas Robert

The max-product algorithm, which attempts to compute the most probable assignment (MAP) of a given probability distribution via a distributed, local message passing scheme, has recently found applications in convex minimization and combinatorial optimization. Unfortunately, the max-product algorithm is not guaranteed to converge and, even if it does, is not guaranteed to produce the MAP assignment. Many alternative message passing schemes have been proposed to overcome these difficulties (e.g. TEMP, MPLP, max-sum diffusion). These algorithms can be viewed as coordinate ascent schemes over different duals of a linear programming formulation of the MAP problem. If these algorithms converge to a unique assignment, then this assignment is guaranteed to be the maximum of the objective function. Although these algorithms provide stronger guarantees than max-product upon convergence, they do not always converge to a unique assignment, and in some instances, the dual optimization problem that results provides a trivial upper bound on the maximizing assignment. In this work, we provide a systematic study of message passing algorithms for the related problem of minimizing an arbitrary real-valued objective function: from graphical models to reparameterization, reparameterization to lower bounds, and from lower bounds to convergent message passing algorithms. We generalize the known results by providing conditions under which the assignments produced by message passing algorithms can correspond to local and global optima, by providing a combinatorial characterization of when these message passing schemes can actually solve the minimization problem, and by providing a new convergent and correct message passing algorithm, called the splitting algorithm, that contains many of the known convergent message passing algorithms as a special case. These ideas allow us to expand the usefulness of the splitting algorithm beyond the limits of other message passing algorithms. We show that there are examples of convex minimization problems on which convergent message passing algorithms fail to produce a minimizing assignment but that the splitting algorithm succeeds. We use graph covers and our conditions for local optimality to provide conditions under which the splitting algorithm can be used to solve general convex (as well as submodular) minimization problems. These observations lead us to a generalization of diagonal dominance for arbitrary convex functions.

Cited by 0

Age of Information in Short Packet Multi-Connectivity Links

Wegener, Mojan, Mross, Marcel A., Jorswieck, Eduard A. · ArXiv.org · 2025

In this paper, we investigate multi-connectivity schemes in the context of status update systems with short payloads. As the performance metric, we use the Age of Information (AoI). Due to short payloads, transmission errors must be taken into account. In addition to the well-known schemes of packet duplication, message splitting, and multiplexing, we propose a codeword splitting scheme, where each status update is jointly encoded across multiple channels. We derive closed-form expressions for the average AoI for the different schemes and optimize their corresponding parameters. We show that the AoI of the multiplexing scheme is a convex function in the offset parameters and use this result to prove that for homogeneous channels, the multiplexing scheme outperforms the packet duplication scheme, which is outperformed by the codeword splitting scheme. Analytical comparisons and numerical evaluations show that the codeword splitting scheme achieves the lowest average AoI when joint coding is feasible. In scenarios where joint coding is not feasible, whether message splitting or multiplexing results in a lower average AoI depends on the specific parameters.

Cited by 0Open access

On Optimizing Rate Splitting in Laser-based Optical Wireless Networks

Khulood D. Alazwary, Ahmad Adnan Qidan, Taisir E. H. El-Gorashi et al. · arXiv (Cornell University) · 2021

Optical wireless communication (OWC) is a promising technology that has the potential to provide Tb/s aggregate rates. In this paper, interference management is studied in a Laser-based optical wireless network where vertical-cavity surface-emitting (VCSEL) lasers are used for data transmission. In particular, rate splitting (RS) and hierarchical rate splitting (HRS) are proposed to align multi-user interference, while maximizing the multiplexing gain of the network. Basically, RS serves multiple users simultaneously by splitting a message of a user into common and private messages, each message with a certain level of power, while on the other side users decode their messages following a specific methodology. The performance of the conventional RS scheme is limited in high density wireless networks. Therefore, the HRS scheme is developed aiming to achieve high rates where users are divided into multiple groups, and a new message called outer common message is used for managing inter-group interference. We formulate an optimization problem that addresses power allocation among the messages of the HRS scheme to further enhance the performance of the network. The results show that the proposed approach provides high achievable rates compared with the conventional RS and HRS schemes in different scenarios.

Cited by 0Open access

Robust Design of Rate-Splitting Multiple Access With Imperfect CSI for Cell-Free MIMO Systems

Daesung Yu, Seok-Hwan Park, Osvaldo Simeone et al. · 2022 IEEE International Conference on Communications Workshops (ICC Workshops) · 2022

Rate-Splitting Multiple Access (RSMA) for multi-user downlink operates by splitting the message for each user equipment (UE) into a private message and a set of common messages, which are simultaneously transmitted by means of su-perposition coding. The RSMA scheme can enhance throughput and connectivity as compared to conventional multiple access techniques by optimizing the rate-splitting ratios along with the corresponding downlink beamforming vectors. This work examines the impact of erroneous channel state information (CSI) on the performance of RSMA in cell-free multiple-input multiple-output (MIMO) systems. An efficient robust optimization algorithm is proposed by using closed-form lower bound expressions on the expected data rates. Extensive numerical results show the importance of robust design in the presence of CSI errors and how the performance gain of RSMA over conventional schemes is affected by CSI imperfection.

Cited by 12

A new achievable rate region for the discrete memoryless X channel

O. Ozan Koyluoglu, Mohammad Shahmohammadi, Hesham El Gamal · 2009

We consider the discrete memoryless X channel, a communication model with two transmitters and two receivers in which every transmitter has a message for every receiver. We propose an achievable scheme, based on the message splitting and binning techniques, which results in the best inner bound on the capacity region of the X channel to date.

Cited by 11