Joint Association and Beamforming Design for Cooperative ISAC Systems
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Electrical Engineering. The day in electrical engineering: signals, systems and the hardware that carries them.
Rosa: We're looking at the paper: "Joint Association and Beamforming Design for Cooperative ISAC Systems".
Dev: Here's the gist of the paper. Cooperation among multiple base stations (BSs) improves both communication and sensing in integrated sensing and communication (ISAC) networks <ref:2611.06853#pg2>.
Rosa: This work considers joint BS–CU and BS–target association, and beamforming for a general cooperative ISAC system, overcoming prior simplifications such as single-user/target setups, fixed BS roles, coherent radar or separate waveforms <ref:2611.06853#pg2>.
Dev: The paper proposes maximizing a joint communication rate and position Cramer-Rao lower bound (CRLB) based tradeoff utility while guaranteeing a minimum service per-CU using a data queue model <ref:2611.06853#pg2>.
Rosa: System Model Description The system is modeled in a bounded space O ⊂ R 2 with a fixed set of BSs B at known locations <ref:2611.06853#pg3>.
Title and authors: Rosa: So we're looking at this paper called "Joint Association and Beamforming Design for Cooperative ISAC Systems" by Rajasekaran and Karbalayghareh. It tackles the problem of coordinating multiple base stations to do both communication and sensing better than they can alone.
Dev: Exactly, it focuses on figuring out which base station serves which communication user, along with how each of those base stations should beamform its signal for both tasks simultaneously. It sets up a general cooperative system, moving past older setups where you had only one user or target and fixed roles for the base stations.
Taro: I wonder if this addresses the real-world messiness of deciding those associations when things are constantly changing in a dynamic environment outside of a perfect lab setting.
Rosa: That's what it tries to do by proposing joint association, which means linking the communication user to a specific base station and the sensing target to another base station all at once. It then optimizes both that link decision and the beamforming weights together.
Dev: The core goal here is maximizing a combined utility function that balances two things: the communication data rate and some measure of how accurately you can pinpoint where things are, which they call the Cramer-Rao lower bound or CRLB.
Rosa: And it’s not just about getting both high, though. They also make sure that every single communication user gets at least a minimum amount of service using a data queue model, which is important for real networks where you can't just let everyone go hungry.
Taro: So, beyond just maximizing the metrics on paper, what does this actually mean when we take it out into the field? Does it handle when the target knowledge is imperfect?
Dev: It looks at both perfect and imperfect target knowledge in their analysis of the paper "Joint Association and Beamforming Design for Cooperative ISAC Systems". They use a data queue model to guarantee that you hit that minimum service level for every user, even with uncertainty.
Title and authors: Rosa: And the way they tackle those uncertainties is interesting. They develop a successive convex approximation based beamforming method that uses closed-form updates, which is meant to avoid needing really complicated and slow semidefinite programming solvers.
Taro: Avoiding those heavy solvers sounds like a good thing for real-time control loops, especially if we are trying to run this on hardware that isn't super powerful.
Dev: Right, because they achieve that by transforming the continuous beamforming problem into a sequence of simpler problems using techniques like quadratic transforms and Lagrangian dual transforms. This gives them those closed-form updates for the communication and sensing beamformers, which is key for low-complexity operation.
Rosa: I'm curious how this dynamic association strategy works in practice. They suggest a dynamic association strategy that uses an overarching low-complexity algorithm to solve the discrete decision problem after each beamforming update based on a CRLB based sensing utility.
Taro: That layering—dynamic association on top of the iterative beamforming—does it mean that if you have one bad measurement or one target gets lost, the system can quickly adjust its communication and sensing links?
Dev: Precisely, that's the point. The dynamic association strategy allows for fixing communication user associations based on distance while dynamically updating sensing associations as an overarching low-complexity layer after each beamforming update based on a CRLB based sensing utility.
Rosa: So, the performance results are pretty encouraging. They show that their proposed dynamic association outperforms a fixed association approach in terms of sensing accuracy, even if the communication rate is similar.
Taro: That's important because in ISAC, we often have to trade off between communicating well and sensing well. If you can get similar rates but better sensing with the same setup, that’s a big win for integrated systems.
Dev: They found that under imperfect sensing conditions, their scheme shows a steeper slope for the tradeoff parameter rho when rho is between zero point one and zero point five compared to when it's between zero point five and zero point nine. This suggests it handles uncertainty in a specific way.
Rosa: The simulation also points to an optimal configuration where they achieve the best zero point seven seven five m CRLB and a communication rate of seven point nine bits per hertz when rho is balanced at zero point seven. That's a concrete number showing how good their system can get under ideal conditions.
Title and authors: Taro: So, the paper suggests that this iterative, successive convex approximation based beamforming approach with closed-form updates avoids costly semidefinite programming solvers by replacing quadratic gains in the Fisher information matrix with their bounds and using fractional programming to remove logarithms and decouple the gamma k ratio in communication rate Rk.
Dev: That way they get a tractable solution for what is usually a non-convex problem, which makes it runnable on actual hardware. They also claim that this method can perform joint communication rate maximization and position Cramer-Rao lower bound utility maximization while guaranteeing a minimum service per CU using a data queue model, considering both perfect and imperfect target knowledge.
Rosa: The main thing I want to say is that they propose an iterative, SCA based, low complexity beamforming approach with closed-form updates to avoid costly SDP solvers. This is a big step for making these kinds of complex joint systems practical.
Taro: It seems like the dynamic association strategy is really effective in balancing communication and sensing gains under various system configurations, which is what we need when deploying these things outside of controlled test environments.
Dev: So, to wrap up on "Joint Association and Beamforming Design for Cooperative ISAC Systems", they establish the superiority of their scheme through simulation results. The authors propose an iterative, SCA-based, low complexity beamforming approach with closed-form updates to avoid costly SDP solvers.
Rosa: They show that the dynamic association strategy is effective in balancing communication and sensing gains under various system configurations. It’s a solid piece of work for moving these concepts from theory into something that can actually run.
Taro: I just hope they find ways to test this kind of graceful recovery when the world misbehaves, because that's where my interest lies next.
Dev: Yeah, the paper shows how to manage those trade-offs iteratively. It gives us a concrete framework for designing systems that need to do both sensing and communication at the same time effectively.
The paper's summary: Rosa: So, we're looking at this paper called "Joint Association and Beamforming Design for Cooperative ISAC Systems." It looks at how multiple base stations can work together to do both communication and sensing better than they can alone.
Dev: Yeah, the main thing is figuring out which base station serves which communication user while also deciding how each of those stations should beamform its signal for both tasks at the same time.
Rosa: They take a general cooperative system, meaning they aren't just looking at one user or one target setup anymore. They solve that joint association and beamforming problem to maximize a combined utility function that balances communication rate and position accuracy.
Dev: That utility function is what they call the communication rate and the position Cramer-Rao lower bound, or CRLB, tradeoff utility. And they tie it all together by making sure every single communication user gets at least a minimum service level using a data queue model.
Rosa: It’s interesting because they tackle both perfect and imperfect target knowledge in their analysis of the paper "Joint Association and Beamforming Design for Cooperative ISAC Systems." They show how the system handles uncertainty in both sensing and communication simultaneously.
Dev: And to make this all runnable on actual hardware, they use a successive convex approximation based beamforming method with closed-form updates. This avoids needing those really heavy semidefinite programming solvers you often see in these kinds of optimization problems.
Rosa: That's a big deal for me because it means we can actually design systems that do both sensing and communication at the same time without needing super powerful computers just to calculate the settings.
Dev: Exactly, and they achieve that by transforming the continuous beamforming problem into a sequence of simpler ones using quadratic transforms and Lagrangian dual transforms. That gives them those closed-form updates for the communication and sensing beamformers.
Rosa: The results are pretty solid, showing that their proposed dynamic association outperforms a fixed association approach in terms of sensing accuracy even when the communication rate is similar.
Dev: They found that under imperfect sensing conditions, their scheme shows a steeper slope for the tradeoff parameter rho when rho is between zero point one and zero point five, compared to when it's between zero point five and zero point nine. That suggests it handles uncertainty in a specific way that’s worth looking at.
Rosa: The simulation also points to an optimal configuration where they achieve the best zero point seven seven five m CRLB and a communication rate of seven point nine bits per hertz when rho is balanced at zero point seven. That's a concrete number showing how good their system can get under ideal conditions.
Dev: So, to wrap up on "Joint Association and Beamforming Design for Cooperative ISAC Systems", they establish the superiority of their scheme through simulation results. The authors propose an iterative, successive convex approximation based beamforming approach with closed-form updates to avoid costly semidefinite programming solvers.
Rosa: They show that the dynamic association strategy is effective in balancing communication and sensing gains under various system configurations. It’s a solid piece of work for moving these concepts from theory into something that can actually run.
Dev: And the main thing I want to say is that they propose an iterative, SCA based, low complexity beamforming approach with closed-form updates to avoid costly SDP solvers. This is a big step for making these kinds of complex joint systems practical.
Rosa: The paper shows how to manage those trade-offs iteratively by layering the dynamic association on top of the iterative beamforming. It gives us a concrete framework for designing systems that need to do both sensing and communication at the same time effectively.
Dev: It's a solid piece of work for moving these concepts from theory into something that can actually run, especially when you look at how they handle those imperfect target knowledge scenarios with guaranteed minimum service levels.
The paper's improvements: Rosa: So, we're talking about how they improve things in this paper called "Joint Association and Beamforming Design for Cooperative ISAC Systems." The authors suggest a few key ways to make this whole setup better than what you’d see in a basic system.
Dev: Yeah, one big improvement is that the dynamic association strategy can be layered on top of the iterative beamforming. So, they fix the communication user assignments based on distance while dynamically updating the sensing assignments after each beamforming step based on how good their sensing utility is.
Rosa: That layering means if you have one bad measurement or one target gets lost, the system can quickly adjust its communication and sensing links automatically in a low-complexity way.
Dev: Right, that addresses the real-time loop issue because it lets the system react fast to environmental changes without needing to re-solve massive optimization problems every time.
Rosa: Another improvement is how they handle the beamforming calculation itself. They use a successive convex approximation based method with closed-form updates, which means they completely avoid those incredibly slow and expensive semidefinite programming solvers that usually block real-time applications.
Dev: That’s huge for me because if the latency of those solvers is too high, you can’t run this on actual hardware for something like a fifty millisecond loop rate. Closed-form updates keep the math tractable.
Rosa: And they did something clever with the math in the beamforming part. They replace those quadratic gains in the Fisher information matrix with their bounds and use fractional programming to get rid of logarithms and decouple that gamma k ratio in communication rate calculations.
Dev: So, they managed to tame a non-convex problem by transforming it into something solvable iteratively, which is what makes this whole scheme work for maximizing both communication rate and that position accuracy lower bound simultaneously.
Rosa: It changes how we think about design because instead of solving one massive optimization problem all at once, you can solve smaller problems repeatedly to get a very good result in a reasonable amount of time.
Dev: And when you look at the results, they showed that this entire scheme performs better in sensing than fixed association methods do, even when the communication rate is held relatively steady.
Rosa: It shows that by coordinating the association and beamforming decisions dynamically, you get better performance across both communication and sensing goals without having to drastically change your hardware setup.
Dev: So they’ve made a significant step in making these cooperative ISAC systems practical for real-world deployment by focusing on low complexity and dynamic adaptation. This opens up new possibilities for integrated 6G networks that need to be flexible.
Conclusion: Rosa: So we’ve covered how "Joint Association and Beamforming Design for Cooperative ISAC Systems" works by looking at their dynamic association strategy and low-complexity beamforming approach.
Dev: Right, it boils down to using successive convex approximation with closed-form updates to avoid those heavy semidefinite programming solvers, which keeps the latency manageable in real-time loops.
Rosa: And they showed that this iterative process successfully balances maximizing both the communication rate and the position accuracy lower bound under various conditions.
Dev: The implication is that we can move toward more flexible integrated sensing and communication systems where decisions are made on a fast, iterative loop rather than waiting for a massive, slow global optimization to finish.
Rosa: It means we get better performance in both tasks because the system adjusts dynamically based on how well it’s sensing things in real-time.
Dev: That's exactly what it suggests for the safety case of these systems, Rosa; we can have a framework where the control loop rate is high, and even if the target knowledge is imperfect, the system still maintains minimum communication service.
Rosa: I think that’s a big win for field robotics because it means the robot can keep communicating and sensing its surroundings even when things get noisy or uncertain out there in the open.
Dev: It’s about making those complex joint systems practical for deployment, which is what this paper does by focusing on tractability through those specific transforms.
Rosa: So, to wrap up, "Joint Association and Beamforming Design for Cooperative ISAC Systems" gives us a concrete framework for designing cooperative systems that handle communication and sensing trade-offs without needing super powerful computers to run the calculations.
Dev: It’s a solid piece of work because it shows how iterative methods can actually yield good results when you have complex constraints like minimum service guarantees layered on top of dynamic associations.
Taro: From my side, I’m interested in seeing how this dynamic layer handles sudden, unexpected changes in the environment or target movements that aren't predicted by the initial distance-based association.
Rosa: That’s a good point for future work, Taro; exploring how gracefully it recovers when the world misbehaves beyond just handling imperfect knowledge is where we need to go next.
Dev: Yeah, I think that’s the next logical step—testing those failure modes in scenarios where the system has to make rapid adjustments mid-loop.
Taro: It seems like this paper sets up a really good baseline for what a robust cooperative ISAC system should look like when we start testing it in more challenging, unpredictable real-world settings.
Abhishek Rajasekaran, Mehdi Karbalayghareh, Xiaoyan Ma, David J. Love, Christopher G. Brinton
Purdue University
eess.SP
Submitted: 2026-11-04
Updated: 2026-11-04
Comments: 6 pages, 5 figures
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
Importance score: 83/100
The gist: Cooperation among multiple base stations (BSs) improves both communication and sensing in integrated sensing and communication (ISAC) networks <ref:2611.06853#pg2>.
Key concepts
- Integrated Sensing and Communication (ISAC)
- ISAC combines communication (sending data) with sensing (detecting targets). This system uses multiple base stations to achieve both goals simultaneously. The key challenge is coordinating the signals from these different stations so they can effectively transmit information and accurately locate objects in the environment.
- Dynamic Association (DA)
- This strategy decides which base station serves each communication user (CU) and which BS observes each target. It is designed to be low-complexity by fixing some associations based on distance initially, then updating sensing associations dynamically after beamforming adjustments, balancing communication and sensing needs.
- Cramer-Rao Lower Bound (CRLB)
- The CRLB provides the theoretical minimum variance for estimating a target's position. In this paper, it is used to quantify the localization accuracy achievable by the system's sensing observations. Maximizing this bound helps in designing optimal beamforming weights for precise target detection.
- Successive Convex Approximation (SCA)
- SCA is an iterative optimization technique used to solve complex, non-convex problems by breaking them down into a sequence of simpler, convex subproblems. This approach allows the authors to design a low-complexity beamforming algorithm that avoids needing computationally expensive solvers like SDP.
Terminology
Summary
Cooperation among multiple base stations (BSs) improves both communication and sensing in integrated sensing and communication (ISAC) networks <ref:2611. p. 0 Brinton
Electrical and Computer Engineering, Purdue University, IN 47907, USA
Email:{rajasek1, mkarbala, ma946, djlove, cgb}@purdue. edu
Abstract—Cooperation among multiple base stations (BSs) improves both communication and sensing in integrated sensing and
communication (ISAC) networks. However, it requires deciding
which BSs serve each communication user (CU) and each target,
and how each BS beamforms. In this work, we consider joint
BS–CU and BS–target association, and beamforming for a general
cooperative ISAC system, overcoming prior simplifications such
as single-user/target setups, fixed BS roles, coherent radar or
separate waveforms. In this work, we consider joint
BS–CU and BS–target association, and beamforming for a general
cooperative ISAC system, overcoming prior simplifications such
as single-user/target setups, fixed BS roles, coherent radar or
separate waveforms. We maximize a joint communication rate
and position Cramer-Rao lower bound (CRLB) based tradeoff ´
utility while guaranteeing a minimum service per-CU using a
data queue model.Where the paper says it
Where the paper says it
Where the paper says it
System Model Description
The system is modeled in a bounded space O ⊂ R 2 with a fixed set of BSs B at known locations <ref:2611.06853#pg3>. Each BS has Nt transmit and Nr receive antennas and is connected to the core network (CN) through wired backhaul <ref:2611. p. 1 SYSTEM MODEL
Consider an ISAC network in a bounded space O ⊂ R
2 with
a fixed set of BSs B at known locations {o
(b)
BS | b ∈ B} ⊂ O. Each BS has Nt transmit and Nr receive antennas and is
connected to the core network (CN) through wired backhaul. The sets of BSs that serve CU k
and target m in slot t are Ck(t) = {b ∈ B : ab,k(t) = 1} and
Sm(t) = {b ∈ B : zb,m(t) = 1}, respectively. The baseband
signal from by each BS b is 2
xb(t) = X
k∈K(t)
wb,k(t)sk(t) + X
m∈M(t)
vb,m(t)qb,m(t), (1)
where sk(t) is the information for CU k and qb,m(t) is the
sampled radar signal3
. The received signal at CU k is
yk(t) = X
b∈B
h
H
b,k(t)xb(t) + nk(t),
(2)
where nk(t) ∼ CN (0, N0). Since we assumed wired backhauls
and full CSI at CN, we assume coherent communication.Where the paper says it
Where the paper says it
Where the paper says it
Cooperative Communication Framework
The achievable rate for CU k is defined by equation (4) <ref:2611.06853#pg3>. The data queue model dictates that the number of delivered bits Dk(t) satisfies 0 ≤ Dk(t) ≤ min[Qk(t), Rk∆] <ref:2611. p. 1 Let Qk(t), Ak(t) and Dk(t) respectively
denote the number of pending data bits to be delivered to,
number of bits arriving for, and number of bits delivered to
CU k in the current slot t. Then Dk(t) satisfies
0 ≤ Dk(t) ≤ min{Qk(t), Rk(t)∆}.Where the paper says it
Cooperative Sensing Framework
The sensing observation at BS ur,m is given by equation (8) <ref:2611.06853#pg4>. The Fisher information matrix Jm(t) is defined in equation (9) <ref:2611. p. 2 We get scalar observation
yer,m(t, τ ) = X
b∈Sm
αeb,r,m(t)qb,m(t, τ − τb,r,m) + ner,m(t, τ ),
(8)
where αeb,r,m(t) = u
H
r,mαb,r,m(t)vb,m(t) and ner,m(t, τ ) ∼
CN (0, N0). Assuming non-coherent processing, for unknowns
[o
(m)
TG (t)(0), o
(m)
TG (t)(1), Re{αb,r,m(t), Im{αb,r,m(t)}] [16]
Jm(t) = 1
κ
X
b,r∈Sm
|αeb,r,m(t)|
2zb,r,m(t)zb,r,m(t)
T, (9)
is the Fisher information matrix (FIM), where zb,r,m(t) =
[cos θb,m(t) + cos θr,m(t),sin θb,m(t) + sin θr,m(t)]T. We observe that zb,r,mz
T
b,r,m ⪰ 0 for any zb,r,m, so Jm(t) ⪰ 0. The
CRLB for the variance of estimation of o
(m)
TG (t) after accounting
unknowns is CRLBm(t) = Jm(t)
−1 under Jm(t) ≻ 0.Where the paper says it
Where the paper says it
Proposed Optimization Strategy
The objective function U(t) balances communication rate and localization accuracy through the tradeoff parameter ρ <ref:2611.06853#pg5>. The problem is formulated as maximizing U(t) subject to power constraints, minimum service guarantees, and association limits <ref:2611. p. 0 Therefore, there is a clear research gap for a low-complexity
joint beamforming and association algorithm that works for
the most general setup of the cooperative ISAC problem with
multiple BSs, CUs, and targets, while guaranteeing minimum
service under queue limits. Outline of Methodology and Contributions
To address this gap, we propose the maximization of the joint
sum-rate and inverse CRLB based utility with data service,
power, and association guarantees for a general multi-BS,
cooperative joint CoMP communication and cooperative noncoherent detection setup. Fixed distance-based
association (FA) where each CU and target are mapped to their
nearest BSs subject to (11g), (11h), (11i) is noted optimal for
pathloss dependent CUs, though there are other geometric and
random factors to be considered for sensing [6]. Therefore, we propose a dynamic association (DA) which
also assumes A, Z are fixed by and initialized by distanceWhere the paper says it
Where the paper says it
Low-Complexity Beamforming Algorithm
The beamforming design employs a successive convex approximation (SCA)-based approach with closed-form updates <ref:2611.06853#pg5>. The algorithm alternates between solving transformed problems using quadratic transform (QT) and Lagrangian dual transform (LDT) <ref:2611. p. 3 We then apply fractional programming to remove the logarithm
and decouple the γk ratio in Rk. Rk after applying Lagrangian
dual transform (LDT) is [19]
Re(i)
k
(W,V)= Bc
ln 2
h
ln(1+η
(i)
k
)−η
(i)
k +(1 + η
(i)
k
)
γk
1 + γk
i
. Further, we apply successive convex
approximations (SCA) to the objective and derive closed-form
updates for the communication and sensing beamformers, and
the auxiliary variables introduced. An iterative algorithm is
listed for the beamforming problem.Where the paper says it
Where the paper says it
Performance Evaluation
Simulation results show that the proposed DA outperforms FA in sensing (with similar rate). The scheme exhibits robustness under imperfect sensing (IS) and demonstrates a steeper slope for ρ ∈ [0. p. 4 Due to our sensing emphasis (Rref, dref), Fig. 3 exhibits a
steeper slope for ρ ∈ [0. 7] due to higher Lmax = 4 and earlier saturation
in sensing gain. Finally, the (8, 8, 8) case achieves the best
0. Finally, the (8, 8, 8) case achieves the best
0. 775 m RCRLB and 7. Finally, the (8, 8, 8) case achieves the best
0. 775 m RCRLB and 7. 775 m RCRLB and 7. 9 bps/Hz rate at a balanced ρ = 0. 775 m RCRLB and 7. 9 bps/Hz rate at a balanced ρ = 0.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Conclusion
The paper concludes by establishing the superiority of the proposed scheme through simulation results. The authors propose an iterative, SCA-based, low-complexity beamforming approach with closed-form updates to avoid costly SDP solvers <ref:2611. p. 5 We proposed a dynamic strategy to solve a
specific per-CU, per-target, and per-BS association problem. We
proposed an iterative, SCA-based, low-complexity beamforming approach with closed-form updates to avoid costly SDP
solvers. We proposed a dynamic strategy to solve a
specific per-CU, per-target, and per-BS association problem. We
proposed an iterative, SCA-based, low-complexity beamforming approach with closed-form updates to avoid costly SDP
solvers. CONCLUSION
In this paper, we investigated the rate-RCRLB trade-off
by optimizing communication and sensing beamformers for a
cooperative multi-BS ISAC system under perfect and imperfect
target knowledge. We proposed a dynamic strategy to solve a
specific per-CU, per-target, and per-BS association problem. CONCLUSION
In this paper, we investigated the rate-RCRLB trade-off
by optimizing communication and sensing beamformers for a
cooperative multi-BS ISAC system under perfect and imperfect
target knowledge. We proposed a dynamic strategy to solve a
specific per-CU, per-target, and per-BS association problem.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
References
[1] ITU-R, “Framework and overall objectives of the future development of IMT for 2030 and beyond,” International Telecommunication Union, Recommendation ITU-R M.2160-0, Nov. p. 5 REFERENCES
[1] ITU-R, “Framework and overall objectives of the future development
of IMT for 2030 and beyond,” International Telecommunication Union,
Recommendation ITU-R M. 2160-0, Nov.Where the paper says it
[2] F. Liu et al., “Integrated Sensing and Communications: Toward DualFunctional Wireless Networks for 6G and Beyond,” in IEEE Journal on Selected Areas in Communications, vol. p. 5 2160-0, Nov. , “Integrated Sensing and Communications: Toward DualFunctional Wireless Networks for 6G and Beyond,” in IEEE Journal on
Selected Areas in Communications, vol. , “Integrated Sensing and Communications: Toward DualFunctional Wireless Networks for 6G and Beyond,” in IEEE Journal on
Selected Areas in Communications, vol. 1728-1767, 2022.Where the paper says it
Where the paper says it
[3] C. G. Brinton et al. p. 0 Love, and Christopher G. Brinton
Electrical and Computer Engineering, Purdue University, IN 47907, USA
Email:{rajasek1, mkarbala, ma946, djlove, cgb}@purdue. Brinton et al. , “Key Focus Areas and Enabling Technologies for
6G,” in IEEE Communications Magazine, vol. , “Key Focus Areas and Enabling Technologies for
6G,” in IEEE Communications Magazine, vol. 84-91, Mar.Where the paper says it
Where the paper says it
Where the paper says it
[4] N. Gonzalez-Prelcic et al. p. 5 84-91, Mar. Gonzalez-Prelcic et al. Gonzalez-Prelcic et al. , ”The Integrated Sensing and Communication ´
Revolution for 6G: Vision, Techniques, and Applications,” in Proceedings
of the IEEE, vol. , ”The Integrated Sensing and Communication ´
Revolution for 6G: Vision, Techniques, and Applications,” in Proceedings
of the IEEE, vol. 676-723, Jul.Where the paper says it
Where the paper says it
Where the paper says it
[5] Next G Alliance, “Integrated sensing and communications readiness report, phase I,” Alliance for Telecommunications Industry Solutions (ATIS), Washington, DC, USA, Tech. p. 5 676-723, Jul. [5] Next G Alliance, “Integrated sensing and communications
readiness report, phase I,” Alliance for Telecommunications
Industry Solutions (ATIS), Washington, DC, USA, Tech.Where the paper says it
[6] K. Meng, C. Masouros, A. p. 5 org/white papers/
integrated-sensing-and-communications-readiness-report-phase-i/
[6] K. Masouros, A. org/white papers/
integrated-sensing-and-communications-readiness-report-phase-i/
[6] K. Masouros, A. Masouros, A. Petropulu and L. Masouros, A. Petropulu and L. Petropulu and L. Hanzo, “Cooperative ISAC
Networks: Opportunities and Challenges,” in IEEE Wireless Communications, vol. Hanzo, “Cooperative ISAC
Networks: Opportunities and Challenges,” in IEEE Wireless Communications, vol. 212-219, Jun.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
[7] H. Wymeersch, J. p. 5 212-219, Jun. Wymeersch, J. Wymeersch, J. Lien and M. Lien and M. Win, “Cooperative Localization in
Wireless Networks,” in Proceedings of the IEEE, vol. Win, “Cooperative Localization in
Wireless Networks,” in Proceedings of the IEEE, vol. 427-
450, Feb.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
[8] K. Meng, C. Masouros, A. P. Petropulu and L. Hanzo, “Cooperative ISAC Networks: Performance Analysis, Scaling Laws, and Optimization,” in IEEE Transactions on Wireless Communications, vol. p. 5 Petropulu and L. Hanzo, “Cooperative ISAC
Networks: Performance Analysis, Scaling Laws, and Optimization,” in
IEEE Transactions on Wireless Communications, vol. Hanzo, “Cooperative ISAC
Networks: Performance Analysis, Scaling Laws, and Optimization,” in
IEEE Transactions on Wireless Communications, vol. 877-
892, Feb.Where the paper says it
Where the paper says it
[9] Y. Wang, M. Tao and S. Sun, “Cramer-Rao Bound Analysis and Beamforming Design for Integrated Sensing and Communication With Extended Targets,” in IEEE Transactions on Wireless Communications, vol. p. 5 877-
892, Feb. Sun, “Cramer-Rao Bound Analysis and ´
Beamforming Design for Integrated Sensing and Communication With
Extended Targets,” in IEEE Transactions on Wireless Communications,
vol. Sun, “Cramer-Rao Bound Analysis and ´
Beamforming Design for Integrated Sensing and Communication With
Extended Targets,” in IEEE Transactions on Wireless Communications,
vol. 15987-16000, Nov.Where the paper says it
Where the paper says it
[10] U. Demirhan and A. p. 5 15987-16000, Nov. Demirhan and A. Demirhan and A. Alkhateeb, “Cell-Free ISAC MIMO Systems: Joint
Sensing and Communication Beamforming,” in IEEE Transactions on
Communications, vol. Alkhateeb, “Cell-Free ISAC MIMO Systems: Joint
Sensing and Communication Beamforming,” in IEEE Transactions on
Communications, vol. 4454-4468, Jun.Where the paper says it
Where the paper says it
Where the paper says it
[11] N. Babu, C. Masouros, C. p. 5 org/white papers/
integrated-sensing-and-communications-readiness-report-phase-i/
[6] K. Masouros, A. Masouros, C. Papadias and Y. Papadias and Y. Eldar, “Precoding
for Multi-Cell ISAC: From Coordinated Beamforming to Coordinated
Multipoint and Bi-Static Sensing,” in IEEE Transactions on Wireless
Communications, vol. Eldar, “Precoding
for Multi-Cell ISAC: From Coordinated Beamforming to Coordinated
Multipoint and Bi-Static Sensing,” in IEEE Transactions on Wireless
Communications, vol. 14637-14651, Oct.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
[12] J. Chen and X. p. 5 14637-14651, Oct. Chen and X. Chen and X. Wang, “Radiation Footprint Control in Cell-Free Cooperative ISAC: Optimal Joint BS Activation and Beamforming Coordination,”
in IEEE Transactions on Communications, vol. Wang, “Radiation Footprint Control in Cell-Free Cooperative ISAC: Optimal Joint BS Activation and Beamforming Coordination,”
in IEEE Transactions on Communications, vol. 14874-
14889, Dec.Where the paper says it
Where the paper says it
Where the paper says it
[13] Y. Xu, D. Xu, L. Xie and S. Song, “Joint User Association and Beamforming Design for Network Integrated Sensing and Communication,” GLOBECOM 2023 - 2023 IEEE Global Communications Conference, Kuala Lumpur, Malaysia, 2023, pp. p. 5 14874-
14889, Dec. Song, “Joint BS Selection, User Association,
and Beamforming Design for Network Integrated Sensing and Communication,” GLOBECOM 2023 - 2023 IEEE Global Communications
Conference, Kuala Lumpur, Malaysia, 2023, pp.Where the paper says it
[14] H. Li, M. Xiao, K. Wang, R. Schober, D. p. 5 Song, “Joint BS Selection, User Association,
and Beamforming Design for Network Integrated Sensing and Communication,” GLOBECOM 2023 - 2023 IEEE Global Communications
Conference, Kuala Lumpur, Malaysia, 2023, pp. Schober, D. Schober, D. In Kim and Y. In Kim and Y. Liang Guan,
“Joint User Association and Beamforming Design for ISAC Networks
With Large Language Models,” in IEEE Open Journal of the Communications Society, vol. Liang Guan,
“Joint User Association and Beamforming Design for ISAC Networks
With Large Language Models,” in IEEE Open Journal of the Communications Society, vol. 7620-7644, Sep.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
[15] X. Gao, X. Hu, W. Wang, K.-K. Wong, K. Yang and C. p. 5 7620-7644, Sep. Yang and C. Yang and C. Chae, ”Integrated Sensing, Communications, and Computation in Edge-Intelligent
Networks: An Online Resource Management Approach,” in IEEE Transactions on Wireless Communications, vol. Chae, ”Integrated Sensing, Communications, and Computation in Edge-Intelligent
Networks: An Online Resource Management Approach,” in IEEE Transactions on Wireless Communications, vol. 16578-16595, May
2026.Where the paper says it
Where the paper says it
Where the paper says it
[16] H. Godrich, A. p. 5 16578-16595, May
2026. Godrich, A. Godrich, A. Haimovich and R. Haimovich and R. Blum, “Target Localization
Accuracy Gain in MIMO Radar-Based Systems,” in IEEE Transactions
on Information Theory, vol. Blum, “Target Localization
Accuracy Gain in MIMO Radar-Based Systems,” in IEEE Transactions
on Information Theory, vol. 2783-2803, Jun.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
[17] Y. Sun, P. Babu and D. p. 5 2783-2803, Jun. Babu and D. Babu and D. Palomar, “Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning,”
in IEEE Transactions on Signal Processing, vol. Palomar, “Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning,”
in IEEE Transactions on Signal Processing, vol. 794-816,
Feb.Where the paper says it
Where the paper says it
Where the paper says it
[18] S. Boyd and L. p. 5 794-816,
Feb. Boyd and L. Boyd and L. Vandenberghe, Convex Optimization. Vandenberghe, Convex Optimization. Cambridge, U. Cambridge, U. :
Cambridge Univ. :
Cambridge Univ. Press, 2004.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
[19] K. Shen and W. p. 5 Press, 2004. Shen and W. Press, 2004. Shen and W. Shen and W. Yu, “Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching,” in IEEE Transactions
on Signal Processing, vol. Yu, “Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching,” in IEEE Transactions
on Signal Processing, vol. 2631-2644, May 2018.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
[20] K. Shen and W. Yu, “Fractional Programming for Communication Systems—Part I: Power Control and Beamforming,” in IEEE Transactions on Signal Processing, vol. p. 5 Shen and W. Yu, “Fractional Programming for Communication Systems—Part I: Power Control and Beamforming,” in IEEE Transactions
on Signal Processing, vol. Yu, “Fractional Programming for Communication Systems—Part I: Power Control and Beamforming,” in IEEE Transactions
on Signal Processing, vol. 2616-2630, May 2018.Where the paper says it
Where the paper says it
[21] Futher Advancements for E-UTRA Physical Layer Aspects (Release 9), Standard TS 36. p. 5 2616-2630, May 2018. [21] Futher Advancements for E-UTRA Physical Layer Aspects (Release 9),
Standard TS 36. [21] Futher Advancements for E-UTRA Physical Layer Aspects (Release 9),
Standard TS 36. 814, 3GPP, 2010.Where the paper says it
Where the paper says it
Brave token BARE
--- Page 1 ---
Joint Association and Beamforming Design for Cooperative ISAC Systems Abhishek Rajasekaran, Mehdi Karbalayghareh, Xiaoyan Ma, David J. Love, and Christopher G. p. 0 Joint Association and Beamforming Design for
Cooperative ISAC Systems
Abhishek Rajasekaran, Mehdi Karbalayghareh, Xiaoyan Ma, David J. Love, and Christopher G. Love, and Christopher G. Brinton
Electrical and Computer Engineering, Purdue University, IN 47907, USA
Email:{rajasek1, mkarbala, ma946, djlove, cgb}@purdue. Brinton
Electrical and Computer Engineering, Purdue University, IN 47907, USA
Email:{rajasek1, mkarbala, ma946, djlove, cgb}@purdue. edu
Abstract—Cooperation among multiple base stations (BSs) improves both communication and sensing in integrated sensing and
communication (ISAC) networks. edu
Abstract—Cooperation among multiple base stations (BSs) improves both communication and sensing in integrated sensing and
communication (ISAC) networks. However, it requires deciding
which BSs serve each communication user (CU) and each target,
and how each BS beamforms. However, it requires deciding
which BSs serve each communication user (CU) and each target,
and how each BS beamforms. In this work, we consider joint
BS–CU and BS–target association, and beamforming for a general
cooperative ISAC system, overcoming prior simplifications such
as single-user/target setups, fixed BS roles, coherent radar or
separate waveforms. In this work, we consider joint
BS–CU and BS–target association, and beamforming for a general
cooperative ISAC system, overcoming prior simplifications such
as single-user/target setups, fixed BS roles, coherent radar or
separate waveforms. We maximize a joint communication rate
and position Cramer-Rao lower bound (CRLB) based tradeoff ´
utility while guaranteeing a minimum service per-CU using a
data queue model.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Pruning redundant reasoning tokens
The paper investigates the rate-CRLB trade-off by optimizing communication and sensing beamformers for a cooperative multi-BS ISAC system under perfect and imperfect target knowledge. The proposed dynamic strategy to solve a specific per-CU, per-target, and per-BS association problem is presented. p. 5 CONCLUSION
In this paper, we investigated the rate-RCRLB trade-off
by optimizing communication and sensing beamformers for a
cooperative multi-BS ISAC system under perfect and imperfect
target knowledge. We proposed a dynamic strategy to solve a
specific per-CU, per-target, and per-BS association problem.Where the paper says it
How the training signal is built
The continuous beamforming subproblem is transformed by replacing the quadratic gains pb,r,m in Jm with its bound [17] <ref:2611.06853#pg5>. This replacement ensures that Sei(V) remains concave as desired under Je(i)m ≻ 0 <ref:2611. p. 3 pe
(i)
b,r,m is affine in vb,m and
correspondingly Je
(i)
m = ge(V m) ⪯ Jm is in V m. So, the
composition 1/
q
Tr{(Je
(i)
m )−1} = h ◦ ge(V m) and hence
Sei(V ) = P
m∈M ℓm/(
q
Tr{(Je
(i)
m )−1}) is concave as desired
under Je
(i)
m ≻ 0. We then apply fractional programming to remove the logarithm
and decouple the γk ratio in Rk. Rk after applying Lagrangian
dual transform (LDT) is [19]
Re(i)
k
(W,V)= Bc
ln 2
h
ln(1+η
(i)
k
)−η
(i)
k +(1 + η
(i)
k
)
γk
1 + γk
i
.Where the paper says it
Where the paper says it
Where the gains come from
The proposed DA outperforms FA in sensing (with similar rate). The algorithm achieves the best 0. p. 5 7] due to higher Lmax = 4 and earlier saturation
in sensing gain. Finally, the (8, 8, 8) case achieves the best
0. 8, the rate saturates as some CU queue(s) are
depleted. Across all cases, the proposed DA outperforms FA in
sensing (with similar rate), with an even wider margin under
IS as DA dynamically selects better associations to compensate
for target uncertainty.Where the paper says it
Where the paper says it
The paper investigates the rate-CRLB trade-off by optimizing communication and sensing beamformers for a cooperative multi-BS ISAC system under perfect and imperfect target knowledge. The authors propose an iterative, SCA-based, low-complexity beamforming approach with closed-form updates to avoid costly SDP solvers <ref:2611.06853#pg5>. The dynamic association strategy is shown to be effective in balancing communication and sensing gains under various system configurations.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Dynamic association strategy (DA) allows for fixing CUs associations based on distance while dynamically updating sensing associations as an overarching low-complexity layer after each beamforming update based on a CRLB based sensing utility. This addresses the research gap by proposing a low-complexity joint beamforming and association algorithm for the most general setup.
-
The proposed iterative, SCA-based, low-complexity beamforming approach with closed-form updates avoids costly SDP solvers by replacing quadratic gains in Jm with their bounds and using fractional programming to remove logarithms and decouple the gamma k ratio in Rk. This results in a tractable solution for the non-convex problem.
-
The improved system can perform joint communication rate maximization and position Cramer-Rao lower bound utility maximization while guaranteeing a minimum service per CU using a data queue model, considering both perfect and imperfect target knowledge.
Abstract
Cooperation among multiple base stations (BSs) improves both communication and sensing in integrated sensing and communication (ISAC) networks. However, it requires deciding which BSs serve each communication user (CU) and each target, and how each BS beamforms. In this work, we consider joint BS-CU and BS-target association, and beamforming for a general cooperative ISAC system, overcoming prior simplifications such as single-user or target setups, fixed BS roles, coherent radar or separate waveforms. We maximize a joint communication rate and position Cramer-Rao lower bound (CRLB) based tradeoff utility while guaranteeing a minimum service per-CU using a data queue model. We develop a successive convex approximation (SCA)-based beamforming with closed-form updates. The discrete association problem is solved as an overarching layer using a low-complexity algorithm. Numerical results validate the effectiveness of the algorithm and unveil benefits of cooperative communication and sensing.
Related papers
- Open-H-RF: A Large-Scale Ultrasound Raw Channel Dataset Initiative
- Scalable Attention for 5G NR Channel Estimation
- Low-Altitude Wireless Networks: A Comprehensive Survey
- Sensing-Assisted OFDM with Index Modulation: A Waveform for Optical Wireless Integrated Communication and Localisation
- Iteration-Free Candidate Pruning and an Index-Domain VLSI Architecture for Sort-Free MIMO Box Decoding up to 1024-QAM
- A Foundation Model for Large-Scale Wireless Network Planning, Operation and Optimization