Next Article in Journal
Environmental Factors in Structural Health Monitoring—Analysis and Removal of Effects from Resonance Frequencies
Next Article in Special Issue
Lower-Complexity Multi-Layered Security Partitioning Algorithm Based on Chaos Mapping-DWT Transform for WA/SNs
Previous Article in Journal
Optimizing Sensor Locations for Electrodermal Activity Monitoring Using a Wearable Belt System
Previous Article in Special Issue
Key Enabling Technologies for 6G: The Role of UAVs, Terahertz Communication, and Intelligent Reconfigurable Surfaces in Shaping the Future of Wireless Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Robust Distributed Collaborative Beamforming for WSANs in Dual-Hop Scattered Environments with Nominally Rectangular Layouts

by
Oussama Ben Smida
1,*,
Sofiène Affes
1,*,
Dushantha Jayakody
2,3,4 and
Yoosuf Nizam
5
1
EMT Centre, INRS, University of Quebec, Montreal, QC H5A 1K6, Canada
2
COPELABS, Lusofona University, 1749-024 Lisbon, Portugal
3
Center of Technology and Systems (UNINOVA-CTS) and Associated Lab of Intelligent Systems (LASI), 2829-516 Caparica, Portugal
4
CIET/DEEE, Faculty of Engineering, Sri Lanka Institute of Information Technology, Colombo 10115, Sri Lanka
5
Faculty of Engineering, Science, and Technology, The Maldives National University, Sosunge, Sosunmagu, Malé 20068, Maldives
*
Authors to whom correspondence should be addressed.
J. Sens. Actuator Netw. 2025, 14(2), 32; https://doi.org/10.3390/jsan14020032
Submission received: 29 January 2025 / Revised: 9 March 2025 / Accepted: 11 March 2025 / Published: 19 March 2025

Abstract

:
We introduce a robust distributed collaborative beamforming (RDCB) approach for addressing channel estimation challenges in dual-hop transmissions within wireless sensor and actuator networks (WSANs) of K nodes. WSANs enhance wireless communication by reducing data transmission, latency, and energy consumption while optimizing network load through integrated sensing and actuation. The source S transmits signals to the WSAN, where nodes relay them to the destination D using beamforming weights to minimize noise and preserve signal integrity. These weights depend on channel state information (CSI), where estimation errors degrade performance. We develop RDCB solutions for three first-hop propagation scenarios—monochromatic [line-of-sight (LoS)] or “M”, bichromatic (moderately scattered) or “B”, and polychromatic (highly scattered) or “P”—while assuming a monochromatic LoS or “M” link for the second hop between the nodes and the far-field destination. Termed MM-RDCB, BM-RDCB, and PM-RDCB, respectively (“X” and “Y” in XY-RDCB—for X { M , B , P } and Y { M } —refer to the chromatic natures of the first- and second-hop channels, respectively, to which a specific RDCB solution is tailored), these solutions leverage asymptotic approximations for large K values and the nodes’ geometric symmetries. Our distributed solutions allow local weight computation, enhancing spectral and power efficiency. Simulation results show significant improvements in the signal-to-noise ratio (SNR) and robustness versus WSAN node placement errors, making the solutions well suited for emerging 5G and future 5G+/6G and Internet of Things (IoT) applications for different challenging environments.

1. Introduction

A wireless sensor–actuator network (WSAN) is a network of sensors and actuators linked by wireless communication. Sensors are typically compact, stationary devices with constrained power and computational capabilities, responsible for monitoring the surrounding environment. Actuators, in contrast, are resource-rich devices that can move and carry out appropriate actions or control devices based on the data collected. In WSANs, sensors and actuators work together: sensors gather environmental data, while actuators process this information to make decisions and respond effectively [1]. WSANs are applicable in various fields, including environmental monitoring, battlefield surveillance, space missions, etc., where timely responses to detected events are crucial. These networks are also vital in sectors requiring continuous monitoring and control, such as smart grids, automated industrial systems, and precision agriculture. However, WSANs face limitations, including restricted energy resources, bandwidth constraints, and the need for reliable, real-time communication, particularly in dynamic or complex settings [1,2,3,4].
Collaborative beamforming (CB) is an effective strategy for enhancing transmission range, connection reliability, and network capacity in wireless sensor networks [5,6,7,8,9,10,11,12]. In this approach, K autonomous sensor nodes work together to relay information between a source–destination pair ( S , D ) via two-hop communication by assessing and transmitting weighted copies of the desired signal during two time slots. CB is applicable across various fields, including environmental monitoring, agriculture, remote sensing, healthcare, safety, transportation, smart homes, entertainment, defense, and crisis management. Its versatility has drawn the attention of researchers, expanding its use from line-of-sight to more complex scattered environments [5,9,10,11,12]. CB thus addresses some key limitations of WSANs, such as interference management, energy constraints, and the need for reliable, real-time communication.
However, implementing CB necessitates prior knowledge of all other nodes’ information, resulting in significant data exchange among nodes. To tackle this shortcoming, distributed CB (DCB) solutions can be developed by relying solely on the information locally available at each node, enabling an approximation of the optimal beamforming weights. Recent advances have further refined decentralized beamforming techniques, improving frequency alignment and increasing network robustness [13,14,15].
Despite this, the effectiveness of beamforming weights hinges on the accuracy of locally estimated or fed-back channel state information (CSI) parameters, with potential errors that can degrade performance. Several studies [16,17,18,19,20,21,22,23,24,25,26,27] have introduced robust CB (RCB or RDCB) approaches to mitigate these errors, categorized into worst-case and stochastic approaches. These methods either deal with maximum error scenarios—often proving inefficient in real-world situations—or rely on iterative greedy algorithms that explore numerous potential solutions, which can overwhelm the computational and power resources of WSAN nodes. Recent studies have explored alternative robust beamforming strategies that balance performance with computational efficiency [20,22]. Moreover, novel approaches use distributed beamforming to reconnect separated sensor nodes in mobile networks and conceal base station locations, improving network robustness and security against tracking and interference [14,28].
Existing beamforming techniques face high computational complexity, limiting real-time use in large-scale systems. Scalability challenges arise as managing multiple nodes increases system complexity. Thus, this work (supported by the Discovery Grants (DGs) and CREATE PERSWADE (<www.create-perswade.ca>) Programs of NSERC) aims to develop RDCB solutions that effectively address channel node placement errors with minimal overhead, computation, and power costs. We specifically seek new solutions for structured WSANs with deterministic spatial distributions as opposed to unstructured WSANs, which have random spatial arrangements [29,30]. In structured WSANs, nodes are strategically placed to enhance coverage, resulting in lower costs and easier maintenance compared to unstructured networks [29,30]. For instance, structured WSANs are well suited for multimedia applications requiring affordable sensors equipped with cameras and microphones, arranged to optimize coverage for collecting and processing audio, video, and image data. In contrast, unstructured WSANs randomly place nodes, complicating tasks like connectivity, failure detection, and network management [29,30]. Such networks are more prone to connectivity issues due to their random configurations, making effective management challenging. To enhance connectivity in these environments, mobile nodes may be utilized. In this work, we concentrate on the advantages of structured WSANs, leveraging their potential for wide coverage at a low cost.
We introduce an RDCB solution designed to address significant channel estimation issues in dual-hop transmissions across a WSAN with K nodes arranged in a nominally rectangular or square layout. The process begins with the source S transmitting its signal to the WSAN. WSANs achieve higher efficiency in wireless communications by minimizing data transmission, reducing latency, conserving energy, and optimizing network loads through the integration of both sensing and actuation capabilities, making it optimal in our application. After receiving the signal, each node transmits it to the destination D, applying a selected beamforming weight to minimize noise power and ensure that the desired signal remains equal to unity at D. The selected weights rely on CSI parameters, necessitating local estimation or feedback at each node, which can lead to estimation or feedback errors, thereby degrading the DCB performance.
In light of the extensive connectivity offered by emerging 5G and future 5G+/6G technologies, along with the IoT, we propose alternative RDCB strategies that are adaptable to various propagation scenarios, including monochromatic (LoS), bichromatic (slightly to moderately scattered), and polychromatic (highly scattered) ones, during the first hop, with an LoS link assumed for the second hop. In [31], we developed preliminary RDCB designs that are suitable for slightly to moderately scattered scenarios. (This article is a revised and expanded version of a paper entitled “Dual-Hop Robust Distributed Collaborative Beamforming Over Nominally Rectangular WSNs in Slightly to Moderately Scattered Environments”, which was presented at the IEEE IWCMC 2023, Marrakesh, Morocco, 19–23 June 2023.) In this paper, we further extend that work by developing new RDCB solutions that perfectly cope with more complex and practical environments as well. Referred to as MM-RDCB, BM-RDCB, and PM-RDCB for the mono-, bi-, and polychromatic cases, respectively, they utilize highly efficient asymptotic approximations for a large number of nodes, K, and exploit the geometric symmetries present in their rectangular or square configurations. Furthermore, they are designed to be distributed, enabling each terminal to locally compute its weights. This significantly enhances both spectral and power efficiency within the WSAN. Our RDCB approach enhances robustness by mitigating CSI estimation errors without high computational costs. It improves computational efficiency through asymptotic approximations, making it ideal for large-scale WSANs, and ensures scalability by leveraging WSAN structures. Simulation results indicate notable improvements in the signal-to-noise ratio (SNR) and increased resilience to errors in node placement.
The structure of this paper is the following: Section 2 outlines the system model for dual-hop source-to-destination communication in a WSAN. Section 3 presents the proposed RDCB techniques. Simulation results are discussed in Section 4, followed by concluding remarks in Section 5.
Notation: Bold uppercase and lowercase letters represent matrices and column vectors, respectively. [ . ] i and [ . ] i l are the i t h entry of a vector and ( i , l ) t h entry of a matrix, respectively. The operators ( . ) * , ( . ) T , and ( . ) H denote the complex conjugate, the transpose, and the complex conjugate transpose or Hermitian, respectively. T r ( . ) is the trace of a matrix. The operator | | . | | represents the two-norm of a vector, whereas | . | denotes the absolute value. The symbol ⊙ indicates the element-wise product. E { . } expresses the the statistical expectation, and J 1 ( . ) stands for the first-order Bessel function of the first kind. To assist the reader, Table 1 provides the definitions of the most commonly used acronyms in this paper.

2. System Model

As shown in Figure 1, we are examining a system that features a WSAN with K hybrid nodes (sensors/actuators), each possessing a single isotropic antenna both at the transmit and receive sides, that are capable of sensing and collecting data, have computational and actuation capabilities, and are able to transmit/receive different signals. The nodes are positioned with inter-distances of d 1 and d 2 along the x and y axes, respectively, and are uniformly arranged in a rectangular (i.e., K = K 1 × K 2 ) or square grid (i.e., K 1 = K 2 = K 0 ; K = K 0 2 ; and d 1 = d 2 = d 0 ). The configuration includes a reference center, O, a source, S, and a destination, D, all located on a single plane (2D representation). Assuming that S and D are significantly separated, the cluster of K WSAN nodes operates in the far field relative to each terminal, enabling data relaying through a dual-hop communication scheme, S-WSAN-D, or otherwise, D-WSAN-S (i.e., by reciprocity). In the remainder of this paper, we assume without loss of generality that D is the one located in the far field relative to the WSAN.
Let the pair ( A S , ϕ S ) represent the polar coordinates of the source S, with s being its narrow-band unit-power signal, and let the polar coordinates of the destination D be ( A D , ϕ D ) . Since the WSAN is assumed to operate in the far field relative to both terminals, A S and A D must be both significantly larger than the physical dimensions of the WSAN, K 1 d 1 and K 2 d 2 , meaning that A * K i d i for * S , D and i 1 , 2 .
For simplicity, the source S is positioned at ϕ S = 0 . The coordinates of the k-th node, ( k 1 , k 2 ) , are represented in polar form as ( r k , ψ k ) and in Cartesian form as [ k 1 d 1 , k 2 d 2 ] T . It can be easily verified that ψ k = arctan k 2 d 2 k 1 d 1 and r k = ( k 1 d 1 ) 2 + ( k 2 d 2 ) 2 . As noted earlier, this work considers potential placement errors for the nodes, defined in terms of the Cartesian coordinates as d 1 δ k 1 and d 2 δ k 2 , both assumed to be independent and uniformly distributed, with variances of d 1 2 σ x 2 and d 2 2 σ y 2 along the x and y axes, respectively.
Additionally, let [ g ] k , [ g ] p , k and [ f ] k represent the desired backward, the interfering backward, and the forward channels, respectively, where k = k 1 + ( K 1 + 1 ) / 2 + K 1 × ( k 2 + ( K 2 1 ) / 2 ) for k 1 = K 1 + 1 2 , K 1 + 3 2 , , K 1 1 2 and k 2 = K 2 + 1 2 , K 2 + 3 2 , , K 2 1 2 .
We consider that scattering over the S-WSAN hop, characterized by the angular spread (AS) σ g , can be classified into the following scenarios: (i) negligible with σ g 0 (i.e., LoS or monochromatic), in which case it can be approximated by a single ray with a complex gain, α = ρ e x p ( i θ ) , where θ is uniformly distributed over π , π and originates from the angle Φ S ; (ii) slight to moderate with σ g 20 degrees when it can to be modeled as bichromatic propagation involving two equal-power rays having complex gains, α i = ρ i exp ( j θ i ) , for i 1 , 2 , where ρ i represents two equal-power amplitudes satisfying E ρ i 2 = 1 2 and θ i is uniformly distributed over π , π and originates from the angles ϕ i = ϕ S ± σ g [9,32]; or (iii) high with σ g > 20 degrees when it can be well approximated by polychromatic propagation [11] involving L equal-power rays with complex gains, α i = ρ i exp ( j θ i ) , for i 1 , 2 , , L , where ρ i represents L equal-power amplitudes with E ρ i 2 = 1 L and θ i is uniformly distributed over π , π and originates from the angles ϕ i s uniformly distributed over Φ S 3 σ g , Φ S + 3 σ g such that σ g < π / 3 . As mentioned earlier, we assume that scattering over the WSAN-D hop is always negligible with σ f 0 since D is located in the far field relative to the WSAN. Additionally, we assume that all WSAN nodes experience identical path loss over both the backward and forward hops. Accordingly, the model conforms to the framework of phased arrays.
In this work, as the WSAN nodes are assumed to function independently from a “communications” standpoint, each k-th WSAN node has knowledge solely of its own nominal Cartesian location coordinates and has no knowledge of the locations of other nodes in the WSAN. The only shared CSI among the nodes consists of nominal global parameters values that characterize the entire WSAN and its dual-hop propagation environment. These parameters include the grid distances d 1 and d 2 , the grid dimensions K, K 1 , and/or K 2 , the AoA from the source S ϕ S , the AoD to the destination D ϕ D , the AS σ g , the wavelength λ , the angle ϕ l , and the complex gains α l of the backward channel g when scattering occurs during the first hop. Additionally, they share the normalized location error variances σ x 2 and σ y 2 when implementing RDCB solutions.
Based on its knowledge of these parameters with a given accuracy, each WSAN node with the index k ( k 1 , k 2 ) is capable of independently and locally reconstructing its nominal backward and forward channel coefficients (i.e., without any communication with other nodes) as follows:
[ g ¯ ] k = l = 1 L α l exp j 2 π λ r k cos ϕ l ψ k = l = 1 L α l exp j 2 π λ | k 1 | d 1 cos ( ϕ l ) + k 2 d 2 sin ( ϕ l ) ,
and
[ f ¯ ] k = exp j 2 π λ r k cos ϕ D ψ k = exp j 2 π λ | k 1 | d 1 cos ( ϕ D ) + k 2 d 2 sin ( ϕ D ) .
In environments with slight to moderate scattering, it should be noted that (1) simplifies to
[ g ¯ ] k = α 1 exp j 2 π λ r k cos σ g ψ k + α 2 exp j 2 π λ r k cos σ g + ψ k = α 1 exp j 2 π λ | k 1 | d 1 cos ( σ g ) + k 2 d 2 sin ( σ g ) + α 2 exp j 2 π λ | k 1 | d 1 cos ( σ g ) k 2 d 2 sin ( σ g ) ,
In environments with no scattering, where σ g = 0, it should be noted that (3) simplifies to
[ g ¯ ] k = α exp j 2 π λ r k cos ( ψ k ) exp j 2 π d 1 λ | k 1 | ,
where α = α 1 + α 2 in (4) with a unitary power is a common multiplicative factor that can be ultimately neglected for simplification without consequences.
A dual-hop communication link is established between the source S and the destination D. During the first time slot, S transmits its signal, s, to the WSAN. Let y be the signal vector received by the WSAN nodes, represented by
y = g ¯ s + v ,
where g ¯ [ [ g ¯ ] 1 [ g ¯ ] K ] T is the nominal backward channel vector, and v represents the i.i.d. Gaussian noise vector, where each element has the same element-wise variance, σ v 2 .
During the second time slot, the k-th node applies the complex conjugate of the beamforming weight w k to its received signal and then transmits the processed signal to the destination D. From (5), the signal received at the destination D is given by
r = f ¯ T w * y + n = s w H h ¯ + w H ( f ¯ v ) + n ,
where w [ w 1 w K ] represents the beamforming vector, h ¯ f ¯ g ¯ is the nominal dual-hop channel vector, and f ¯ [ [ f ¯ ] 1 [ f ¯ ] K ] T is the nominal forward channel vector. Additionally, n denotes the scalar Gaussian noise received at the destination D with the variance σ n 2 .
Let P ¯ w , S represent the total received power from the forwarded copies of the source S by the WSAN and P ¯ w , n denote the total received noise power, which results from the scalar noise n at the destination D and the noise vector v transmitted from the WSAN nodes. From (6), we have the following relationship:
P ¯ w , S = w H h ¯ 2 ,
P ¯ w , n = σ v 2 w H Λ ¯ w + σ n 2 ,
where Λ ¯ diag { | [ f ¯ ] 1 | 2 | [ f ¯ ] K | 2 } . We propose in this work a solution that aims to minimize the total noise power while ensuring that the beamforming response w H h ¯ remains unchanged, thereby keeping the power received at the destination D equal to unity. This approach essentially corresponds to the well-known minimum-variance distortionless response (MVDR) beamforming criterion with a relaxed constraint on the distortionless response [33]. Mathematically, this can be formulated as the following constrained optimization problem:
w ¯ = arg max w H h ¯ h ¯ H w w H Λ ¯ w s . t . w H h ¯ 2 = 1 .
The optimal solution to the convex optimization problem outlined above can be derived as
w ¯ = Λ ¯ 1 h ¯ h ¯ H Λ ¯ 1 h ¯ ,
and, as a result, the weight of the k-th node is determined by
w ¯ k = [ Λ ¯ 1 h ¯ ] k h ¯ H Λ ¯ 1 h ¯ .

3. Proposed RDCB Techniques

3.1. Placement-Error-Free Implementation Scenarios

In the ideal scenario when there are no errors related to node placement (i.e., σ x = σ y = δ k 1 = δ k 2 = 0 ), the nominal channel coefficients from (1), (2), (3), and (4) are exactly the same as the actual coefficients. As a result, in dual-hop polychromatic–monochromatic propagation scenarios, the optimal CB solution given in (11) takes the form of w ¯ PM DCB in (A1) (see Appendix A). In dual-hop bichromatic–monochromatic and monochromatic–monochromatic propagation scenarios, the optimal CB solution in (11) simplifies to w ¯ BM DCB in (A2) and w ¯ MM DCB in (A4) (see Appendix A).
It is easy to verify that w ¯ PM DCB and w ¯ BM DCB reduce to w ¯ MM DCB in a scattering-free environment (i.e., when σ g = 0 ). In the subsequent section on simulation results, we will demonstrate that their performances degrade in more realistic scenarios when there are node placement errors unaccounted for in their design, thereby leading to channel mismatch.

3.2. Placement-Error-Prone Implementation Scenarios

In practical scenarios where node placement errors are present, we derive the expressions for the true channel coefficients to replace the nominal ones defined earlier in (1), (2), (3), and (4) as follows, respectively:
[ g ] k = l = 1 L α l exp j 2 π λ | k 1 | d 1 cos ( ϕ l ) + k 2 d 2 sin ( ϕ l ) × exp j 2 π λ δ k 1 d 1 cos ( ϕ l ) + δ k 2 d 2 sin ( ϕ l ) ,
[ f ] k = exp j 2 π λ | k 1 | d 1 cos ( ϕ D ) + k 2 d 2 sin ( ϕ D ) × exp j 2 π λ ( d 1 cos ( ϕ D ) δ k 1 + d 2 sin ( ϕ D ) δ k 2 ) = [ f ¯ ] k δ f k ,
[ g ] k = α 1 exp j 2 π λ | k 1 | d 1 cos ( σ g ) + k 2 d 2 sin ( σ g ) × exp j 2 π λ δ k 1 d 1 cos ( σ g ) + δ k 2 d 2 sin ( σ g ) + α 2 exp j 2 π λ | k 1 | d 1 cos ( σ g ) k 2 d 2 sin ( σ g ) × exp j 2 π λ δ k 1 d 1 cos ( σ g ) δ k 2 d 2 sin ( σ g ) ,
and
[ g ] k = exp j 2 π d 1 λ | k 1 | exp j 2 π d 1 λ δ k 1 = [ g ¯ ] k δ g k .
If, in an ideal scenario, the WSAN had perfect knowledge of the true channel coefficients with their placement errors relative to their nominal positions, the constrained optimization problem in (9) and its corresponding optimal solution in (11) would be reformulated as
w ˘ = arg max w H h h H w w H Λ w s . t . w H h 2 = 1 ,
and
w ˘ = Λ 1 h h H Λ 1 h ,
thereby resulting in the “genie-type” beamformer w ˘ PM DCB , w ˘ BM DCB , or w ˘ MM DCB when plugging into (17) the expression for the true forward channel coefficients in (13) and one of the three expressions for the true backward channel coefficients in (12), (14), or (15), respectively. However, w ˘ PM DCB , w ˘ BM DCB , and w ˘ MM DCB cannot be practically implemented as the WSAN is unaware of the precise expressions for the location-error-sensitive backward and forward channels g and f , respectively.
In the following, we introduce new RDCB approaches that are robust to node placement errors in scattered environments. Our approach leverages the following: (i) highly efficient asymptotic approximations for large numbers, K, of WSAN nodes, (ii) the inherent geometric symmetries of the deterministic rectangular grid layout, and (iii) prior information about the variances σ x 2 and σ y 2 , which describe the second-order statistics of the placement errors with respect to their nominal positions. By performing so, we derive new solutions in closed form that account for the inevitable phase jitter caused by node placement errors and, hence, incorporate their impact into the CB design. This is accomplished by loosening the optimization criterion in (16) to incorporate all possible placement error scenarios through averaging both the numerator and denominator while keeping the relaxed distortionless response constraint intact:
w = arg max E δ k 1 , δ k 2 [ w H h h H w ] E δ k 1 , δ k 2 [ w H Λ w ] s . t . w H h 2 = 1 .
It can be demonstrated that the optimization problem in (18) simplifies to a combined version of (9) and (16):
w = arg max w H h ¯ h ¯ H w w H Λ ¯ w s . t . w H h 2 = 1 .
The resulting optimal robust beamforming vector is expressed as
w RDCB = Λ ¯ 1 h ¯ | h ¯ H Λ ¯ 1 h | ·
We observe from (20) that w RDCB involves both the true and nominal channel values. However, since the nodes are unaware of the true channel, it is necessary to replace h ¯ H Λ ¯ 1 h with an equivalent approximation, Ξ M , with { P , B , M } for the poly-, bi-, and monochromatic cases, respectively, that relies only on parameters available at each node of the WSAN, i.e., for { P , B , M } we have:
w M RDCB = Λ ¯ 1 h ¯ Ξ M ·
To achieve this, we define the comprehensive substitute Ξ M as the asymptotic expression of h ¯ H Λ ¯ 1 h derived and validated through numerical methods at reasonably large values of K. Specifically, by applying the law of large numbers, one can demonstrate the expressions of Ξ M with { P , B , M } in (A5)–(A7) (see Appendix B) for large values of K in dual-hop polychromatic–monochromatic, bichromatic–monochromatic, and monochromatic–monochromatic propagation scenarios, respectively.
Since WSANs usually consist of a large number of nodes, we can replace (A5), (A6), or (A7) in (21) to derive w PM RDCB , w BM RDCB , or w MM RDCB , respectively.
Thus, it can be concluded that w PM RDCB , w BM RDCB , and w MM RDCB rely exclusively on locally available information at each node, specifically [ h ¯ ] k , σ x , and σ y . The first is reconstructed directly at the k-th node, while σ x and σ y can be broadcast across the WSAN with minimal overhead, computational cost, and power consumption. This inherent feature of DCB eliminates the need for inter-node communication, thus saving energy resources and improving the overall spectral efficiency of the WSAN. It is also noteworthy that when there is no scattering over the first hop, w PM RDCB and w BM RDCB reduce to w MM RDCB , and that w PM RDCB , w BM RDCB , and w MM RDCB further simplify to w ˘ PM DCB = w ¯ PM DCB , w ˘ BM DCB = w ¯ BM DCB , and w ˘ MM DCB = w ¯ MM DCB , respectively, when there are no placement errors among the nodes.

4. Numerical Evaluation Results

This section presents a numerical evaluation of the performance improvements achieved by the proposed RDCB solutions against the nominal optimal CB approaches w ¯ MM opt , w ¯ BM opt , and w ¯ PM opt derived from (10). The simulation setup parameters are specified in Table 2 where, unless specified otherwise, we consider by default K 1 = K 2 = K 0 = K for K = 64 , 256 , 1024 , and 4096 ; d 1 = d 2 = d = λ / 2 when d is fixed; both σ n 2 and σ v 2 set to 10 dB below the source transmit power; and ϕ D 17 degrees.
We chose the average-signal-to-average-noise ratio (ASANR) as our performance metric over the average signal-to-noise ratio (ASNR), primarily because the derivation of the ASNR is notably intricate. The ASANR provides a practical and efficient alternative, particularly for very large K, as previously validated in [5]. We conducted Monte Carlo simulations with averages computed over M c = 10 5 independent random realizations.
Figure 2 illustrates both nominal and true WSAN grid positions with K 1 = K 2 = 8 (K = 64) and σ x = σ y set to 0.1 or 0.25 in sub-plots (a) and (b), respectively. It indicates that the grid becomes significantly distorted at 0.1. Yet, we consider values as high as 0.25 and even beyond where the grid basically loses its deterministic geometric structure. In the following, we assess the impact of multiple parameters while accounting for varying levels of placement errors.
In Table 3, the ASANR values corresponding to w PM RDCB are reported for dual-hop polychromatic–monochromatic configurations. These results consider three distinct values of ϕ D , representing the AoA at the destination D, with parameters set as K = 4096 ; d / λ = 0.5 ; σ g = 60 degrees; and σ x = σ y = 0.1 . Regardless of the angle (whether extreme fire-end or broadside), the ASANR remains consistently close to optimal at around 10 dB; this outcome confirms (i) the accuracy of the analytical calculations, independent of the chosen ϕ D values, and (ii) the soundness of assuming the AoD at the source S to be ϕ S = 0 , without any loss of generality or impact on the results.
Figure 3, Figure 4 and Figure 5 plot the performance of the proposed w MM RDCB in terms of the analytical ASANR, numerical ASNR, and analytical ASANR gains against the nominal w ¯ MM DCB versus σ x = σ y for various values of K 1 > K 2 (For the sake of conciseness, we did not include in this article similar results obtained in the case of K 2 < K 1 (i.e., landscape-oriented rectangular grids).). The results indicate that as K increases, both the ASANR and ASNR improve until they reach their optimal values. Additionally, the analytical ASANR and numerical ASNR align perfectly, corroborating the appropriateness of our selected performance metric. We further observe that both square and rectangular WSAN layouts lead to the same observations. The plots also reveal significant ASANR gains of up to 18 dB across the evaluated range of σ x = σ y . Specifically, we reach an ASANR gain up to 1.7 dB and 15.6 dB for σ x = σ y = 0.1 and 0.25 , respectively. These results, coupled with earlier findings, reinforce the efficiency and robustness of w MM RDCB against node placement errors and further verify our theoretical models.
Figure 6, Figure 7 and Figure 8 display the performance of the proposed w BM RDCB in terms of the analytical ASANR, numerical ASNR, and analytical ASANR gains against the nominal w ¯ BM DCB versus σ x = σ y for various values of K. Given the slight to moderate scattering present in the S-WSAN communication link, higher values of K are needed for the ASANR to reach optimal performance and ensure its alignment with the ASNR. This trend can be attributed to the fact that larger node arrays allow for more precise spatial beamforming, effectively mitigating the detrimental effects of node placement errors. At lower values of K, the degradation in the ASANR highlights the sensitivity of w ¯ BM DCB to spatial errors, emphasizing the need for tighter node placement control in practical implementations. This is mainly due to the law of large numbers used to calculate the beamforming weights. Assuming large values for K is a valid hypothesis when considering the massive connectivity typical of new 5G and future 5G+/6G wireless technologies as well as of the IoT. Specifically, Figure 6 shows that K = 256 or higher can achieve nearly optimal performance. The plots also reveal significant ASANR gains of up to 17 dB across the evaluated range of σ x = σ y . Specifically, we reach an ASANR gain of up to 2 dB and 15 dB for σ x = σ y = 0.1 and 0.25 , respectively. It is worth noting from Figure 7 that the ASANR gain reaches up to 14 dB when K 2 = 4 K 1 .
Figure 9, Figure 10 and Figure 11 plot the performance of the proposed w PM RDCB in terms of the analytical ASANR, numerical ASNR, and analytical ASANR gains against the nominal w ¯ PM DCB versus σ x = σ y for various values of K. Figure 11 shows that even relatively low K values can achieve nearly optimal performance for the three tested WSAN layouts. The plots also reveal significant ASANR gains of up to 10 dB across the evaluated range of σ x = σ y . Specifically, we reach an ASANR gain of up to 1.5 dB and 9.2 dB for σ x = σ y = 0.1 and 0.25 , respectively. This difference with w ¯ BM DCB suggests that while w ¯ PM DCB maintains stability under varying conditions, it does not achieve the same peak performance as w ¯ BM DCB in the absence of severe placement errors. This trade-off highlights the need to balance robustness and gain efficiency when choosing between different RDCB techniques for practical applications.
Moreover, the analytical ASANR and numerical ASNR align perfectly, corroborating the appropriateness of our selected performance metric. This observation further reinforces the soundness of our mathematical assumptions, while also highlighting the robustness of the proposed RDCB solutions.
Figure 12 and Figure 13 investigate how the ratio of d / λ affects the analytical ASANR, numerical ASNR, and analytical ASANR gains of the proposed w PM RDCB versus the nominal w ¯ PM DCB against σ x = σ y for K = 1024 (Similar results were obtained in the less adverse and challenging mono- and bichromatic cases, indicating the same trends and observations, which are not included here for the sake of conciseness). The results indicate that w PM RDCB reaches near-optimal SNR performance at 10 dB (see Figure 12) for all tested d / λ values, even those that deviate from the standard half-wavelength spacing of 0.5. Additionally, the gains over w ¯ PM DCB increase with larger d / λ values, reaching up to 21 dB at 0.8 (see Figure 13). Specifically, we reach an ASANR gain up to 3.5 dB and 20.5 dB for σ x = σ y = 0.1 and 0.25 , respectively. This trend underscores a key trade-off: while increasing d / λ improves the ASANR, practical deployments must consider hardware constraints and synchronization requirements that may limit the feasibility of large node separations.
Figure 14, Figure 15 and Figure 16 examine the impact of the Rx noise power at both the destination D and WSAN nodes. All three results confirm the consistent behavior of w MM RDCB , w BM RDCB , and w PM RDCB across the three tested noise levels. The three techniques demonstrate robustness against σ x and σ y , validating their resilience in different noisy environments.
Figure 17, Figure 18 and Figure 19 analyze the performance of w MM RDCB , w BM RDCB , and w PM RDCB , respectively, as a function of the angular spread σ g . Figure 19 shows that the ASANR performance of w PM RDCB loses only a fraction of the SNR for K = 256 and reaches optimal performance for higher K across all tested σ g values, validating the robustness of the polychromatic technique. On the other hand, Figure 18 shows that w BM RDCB underperforms at very high σ g values (starting from 20 degrees) for high values of K, as the approximation is designed for low to moderate AS values, and also struggles at very low AS values for only K as low as 64. For K higher than 256, the approximation holds and is robust to node placement errors. Figure 17 shows that for σ g 0.7 degrees, w MM RDCB can achieve quasi-optimal performance for K as low as 256, making the monochromatic approximation suitable over this very small range of the angular spread. Additionally, w BM RDCB achieves quasi-optimal performance for σ g 0.7 degrees and σ g 20 degrees, where the bichromatic approximation outperforms w MM RDCB , which fails to perform well unless σ g and K are small. In conclusion, the analysis confirms the robustness of the polychromatic approach, achieving near-optimal ASANR performance across all tested σ g values with minimal SNR loss. The bichromatic approximation performs well for moderate σ g but struggles at high values, while the monochromatic approach excels for small σ g . Each technique is effective within its validity range, offering a good trade-off between performance and complexity.

5. Conclusions

We introduce an RDCB solution designed to address significant channel estimation issues in dual-hop transmissions across a wireless sensor and actuator network (WSAN) with K nodes arranged in a nominally rectangular or square layout. The process begins with the source S transmitting its signal to the WSAN. WSANs achieve higher efficiency in wireless communications by minimizing data transmission, reducing latency, conserving energy, and optimizing network loads through the integration of both sensing and actuation capabilities. Next, the process continues with each node then forwarding its received signal to the destination D after applying a selected beamforming weight to minimize the noise power while ensuring a distortionless response to the desired signal at the destination D. These weights rely on CSI parameters, necessitating local estimation or feedback at each node. However, such estimation or feedback may introduce errors, which can degrade the performance of DCB. In light of the extensive connectivity offered by emerging 5G and future 5G+/6G technologies, along with the IoT, we propose alternative RDCB strategies that are adaptable to various propagation scenarios—monochromatic (line-of-sight or no AS), bichromatic (slightly to moderately scattered or small to medium AS values), and polychromatic (highly scattered or large AS values)—during the first hop, with an LoS link assumed for the second hop. These solutions are designated as MM-RDCB, BM-RDCB, and PM-RDCB, respectively. Our methodology utilizes highly efficient asymptotic approximations for a large number of nodes, K, and exploits the geometric symmetries present in their rectangular or square configurations. Furthermore, the MM-RDCB, BM-RDCB, and PM-RDCB solutions are designed to be distributed, enabling each terminal to locally compute its weights. This significantly enhances both spectral and power efficiency within the WSAN. Our RDCB approach enhances robustness by mitigating CSI estimation errors without high computational costs. It improves computational efficiency through asymptotic approximations, making it ideal for large-scale WSANs, and ensures scalability by leveraging WSAN structures. Simulation results indicated notable improvements in the SNR and increased resilience to errors in node placement. Future research directions include the following: (1) addressing additional scenarios and imperfections (such as phase jitter and interference from external sources), as summarized in Table 4, while shifting the performance evaluation focus from SNR gains to link- and system-level throughput, which will involve incorporating the overhead from inter-node communications and any source- and/or destination-nodes’ feedback; (2) exploring new challenges such as the use of Reconfigurable Intelligent Surface (RIS) and unmanned aerial vehicle (UAV) communications; (3) computing closed-form solutions in multi-source environments; and (4) pursuing hardware prototyping, experimental validation, and real-time performance evaluation for the new RDCB designs in realistic conditions, including testing in over-the-air and real-time scenarios.

Author Contributions

Conceptualization, O.B.S. and S.A.; Funding acquisition, S.A.; Investigation, O.B.S.; Methodology, O.B.S.; Project administration, S.A.; Resources, S.A.; Software, O.B.S.; Supervision, S.A.; Validation, O.B.S., S.A., D.J. and Y.N.; Writing—original draft, O.B.S.; Writing—review and editing, S.A., D.J. and Y.N. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Discovery Grants (DGs) and CREATE PERSWADE (<www.create-perswade.ca>) Programs of NSERC.

Data Availability Statement

The raw data supporting the conclusions of this article will be made available by the authors on request.

Conflicts of Interest

The authors declare no conflicts of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

Appendix A

In dual-hop polychromatic–monochromatic propagation scenarios, the optimal CB solution given in (11) takes the following form:
w ¯ PM DCB = Λ ¯ 1 h ¯ l , m = 1 L α l * α m sin K 2 P 2 , l , m 2 sin P 2 , l , m 2 1 + 2 sin K 1 1 4 P 1 , l , m sin P 1 , l , m 2 exp j K 1 + 1 4 P 1 , l , m ,
where P 1 , l , m = 2 π d 1 λ cos ( ϕ l ) cos ( ϕ m ) and P 2 , l , m = 2 π d 2 λ s i n ( ϕ l ) sin ( ϕ m ) for { l , m } { 1 , 2 , , L } .
In dual-hop bichromatic–monochromatic propagation scenarios, the optimal CB solution in (11) simplifies to the following form:
w ¯ BM DCB = Λ ¯ 1 h ¯ K ( ρ 1 2 + ρ 2 2 ) + 2 K 1 ρ 1 ρ 2 cos ( θ 1 θ 2 ) Π ( K 2 ) ,
where
Π ( K 2 ) = q = 1 K 2 cos 4 π d 2 λ sin ( σ g ) q K 2 + 1 2 = sin K 2 4 π d 2 λ sin ( σ g ) 2 sin 4 π d 2 λ sin ( σ g ) 2 , if exp j 4 π d 2 λ sin ( σ g ) 1 K 2 , otherwise .
In dual-hop monochromatic–monochromatic propagation scenarios, the formulation in (11) simplifies to the following DCB beamformer:
w ¯ MM DCB = Λ ¯ 1 h ¯ K .

Appendix B

The expressions of Ξ M with { P , B , M } for large values of K in dual- hop polychromatic–monochromatic, bichromatic–monochromatic, and monochromatic– monochromatic propagation scenarios, respectively, are given by the following expressions:
Ξ P M 2 ( K 1 , K 2 , d 1 , d 2 , σ x , σ y , α i , ϕ i , Φ D ) = lim K h ¯ H Λ ¯ 1 h 2 = l , m , n , o = 1 L α l α m * α n * α o sinc ( ( P 3 , l , D P 3 , n , D ) 3 σ x ) sinc ( ( P 4 , l , D P 4 , n , D ) 3 σ y ) × sin K 2 ( P 2 , l , m P 2 , n , o ) 2 sin P 2 , l , m P 2 , n , o 2 1 + 2 sin ( K 1 1 ) ( P 1 , l , m P 1 , n , o ) 4 sin P 1 , l , m P 1 , n , o 2 exp j K 1 + 1 4 ( P 1 , l , m P 1 , n , o ) + sinc ( P 3 , l , D 3 σ x ) sinc ( P 3 , n , D 3 σ x ) sinc ( P 4 , l , D 3 σ y ) sinc ( P 4 , n , D 3 σ y ) × sin K 2 2 P 2 , l , m sin P 2 , l , m 2 sin K 2 2 P 2 , n , o sin P 2 , n , o 2 1 + 2 sin ( K 1 1 ) P 1 , l , m 4 sin P 1 , l , m 2 exp j K 1 + 1 4 P 1 , l , m × 1 + 2 sin ( K 1 1 ) P 1 , n , o 4 sin P 1 , n , o 2 exp j K 1 + 1 4 P 1 , n , o sin K 2 ( P 2 , l , m P 2 , n , o ) 2 sin P 2 , l , m P 2 , n , o 2 × 1 + 2 sin ( K 1 1 ) ( P 1 , l , m P 1 , n , o ) 4 sin P 1 , l , m P 1 , n , o 2 exp j K 1 + 1 4 ( P 1 , l , m P 1 , n , o ) .
Ξ B M 2 ( K 1 , K 2 , d 1 , d 2 , σ x , σ y , σ g , ρ 1 , ρ 2 , θ 1 , θ 2 , Φ D ) = lim K h ¯ H Λ ¯ 1 h 2 = K ( ρ 1 2 + ρ 2 2 ) 2 + 2 K ρ 1 2 ρ 2 2 C y 1 + 2 ρ 1 ρ 2 ( ρ 1 2 + ρ 2 2 ) cos ( θ 1 θ 2 ) K 1 B ( A ) ( C y 1 + 1 ) + K 1 B ( 2 A ) C y 1 × ( 2 ρ 1 2 ρ 2 2 cos ( 2 ( θ 1 θ 2 ) ) ) + C x 2 K ( K 1 ) ( ρ 1 2 C y 2 + ρ 2 2 C y 3 ) 2 + G ( A ) 2 ρ 1 ρ 2 cos ( θ 1 θ 2 ) × ρ 1 2 C y 2 2 + ρ 2 2 C y 3 2 + ( ρ 1 2 + ρ 2 2 ) C y 2 C y 3 + E ( A ) ( 2 ρ 1 2 ρ 2 2 cos ( 2 ( θ 1 θ 2 ) ) C y 2 C y 3 ) + F ( A ) ρ 1 2 ρ 2 2 C y 2 2 + C y 3 2
Ξ M M 2 ( K , d 1 , d 2 , σ x , σ y , Φ D ) = lim K h ¯ H Λ ¯ 1 h 2 = K + K ( K 1 ) sin 2 π d 1 ( 1 + cos ( ϕ D ) ) λ 3 σ x 2 2 π d 1 ( 1 + cos ( ϕ D ) ) λ 3 σ x 2 sin 2 π d 2 sin ( ϕ D ) λ 3 σ y 2 2 π d 2 sin ( ϕ D ) λ 3 σ y 2 .
We define in (A5) and (A6) the following terms:
P 3 , l , D = 2 π d 1 λ cos ( ϕ l ) + cos ( ϕ D ) for l { 1 , 2 , , L } , P 4 , l , D = 2 π d 2 λ sin ( ϕ l ) + sin ( ϕ D ) for l { 1 , 2 , , L } , A = 4 π d 2 λ sin ( σ g ) , C x = sinc 2 π d 1 λ [ cos ( σ g ) + cos ( ϕ D ) ] 3 σ x , C y 1 = sinc A 3 σ y , C y 2 = sinc 2 π d 2 λ [ sin ( σ g ) + sin ( ϕ D ) ] 3 σ y , C y 3 = sinc 2 π d 2 λ [ sin ( ϕ D ) sin ( σ g ) ] 3 σ y , B ( A ) = sin K 2 A / 2 sin ( A / 2 ) , E ( A ) = K 1 2 B ( A ) 2 K 1 B ( 2 A ) , F ( A ) = K 1 2 B ( A ) 2 K , G ( A ) = K K 1 B ( A ) K 1 B ( A ) .

References

  1. Janardhan, N.; Nandhini, K. Wireless Sensor and Actuator Networks (WSANs): Insights and Scope of Research. Int. J. Innov. Technol. Explor. Eng. 2019, 8, 1607–1615. [Google Scholar] [CrossRef]
  2. Ngai, E.C.; Lyu, M.R.; Liu, J. A Real-Time Communication Framework for Wireless Sensor-Actuator Networks. In Proceedings of the IEEE Aerospace Conference 2006, Big Sky, MT, USA, 4–11 March 2006. [Google Scholar]
  3. Verdone, R.; Dardari, D.; Mazzini, G.; Conti, A. Wireless Sensor and Actuator Networks: Technologies, Analysis and Design; Academic Press: Cambridge, MA, USA, 2010. [Google Scholar]
  4. Xia, F. QoS Challenges and Opportunities in Wireless Sensor/Actuator Networks. Sensors 2008, 8, 1099–1110. [Google Scholar] [CrossRef] [PubMed]
  5. Ben Smida, O.; Zaidi, S.; Affes, S.; Valaee, S. Robust Distributed Collaborative Beamforming for Wireless Sensors Networks with Channel Parameter Estimation Errors. Sensors 2019, 19, 1061. [Google Scholar] [CrossRef] [PubMed]
  6. Huang, J.; Wang, P.; Wan, Q. Collaborative Beamforming for Wireless Sensor Networks with Arbitrary Distributed Sensors. IEEE Commun. Lett. 2012, 16, 1118–1120. [Google Scholar] [CrossRef]
  7. Zou, J.; Sun, S.; Masouros, C.; Cui, Y.; Liu, Y.F.; Ng, D.W.K. Energy-Efficient Beamforming Design for Integrated Sensing and Communications Systems. IEEE Trans. Commun. 2024, 72, 3766–3782. [Google Scholar] [CrossRef]
  8. Zarifi, K.; Zaidi, S.; Affes, S. A Distributed Amplify-and-Forward Beamforming Technique in Wireless Sensor Networks. IEEE Trans. Sig. Proc. 2011, 59, 3657–3674. [Google Scholar] [CrossRef]
  9. Zaidi, S.; Affes, S. Distributed Collaborative Beamforming in the Presence of Angular Scattering. IEEE Trans. Commun. 2014, 462, 1668–1680. [Google Scholar] [CrossRef]
  10. Zaidi, S.; Affes, S. Distributed Collaborative Beamforming Design for Maximized Throughput in Interfered and Scattered Environments. IEEE Trans. Commun. 2015, 63, 4905–4919. [Google Scholar] [CrossRef]
  11. Zaidi, S.; Affes, S. SNR and Throughput Analysis of Distributed Collaborative Beamforming in Locally-Scattered Environments. Wirel. Commun. Mob. Comp. 2012, 12, 1620–1633. [Google Scholar] [CrossRef]
  12. Zaidi, S.; Ben Smida, O.; Affes, S.; Valaee, S. Distributed Zero-Forcing AF Beamforming for Energy-Efficient Communications in Networked Smart Cities. In Proceedings of the IEEE PIMRC 2017, Montreal, QC, Canada, 8–13 October 2017. [Google Scholar]
  13. Ouassal, H.; Yan, M.; Nanzer, J.A. Decentralized Frequency Alignment for Collaborative Beamforming in Distributed Phased Arrays. IEEE Trans. Wirel. Commun. 2021, 20, 6269–6281. [Google Scholar] [CrossRef]
  14. Mirzaei, A.; Zandiyan, S. A Novel Approach for Establishing Connectivity in Partitioned Mobile Sensor Networks using Beamforming Techniques. arXiv 2023, arXiv:2308.04797. [Google Scholar] [CrossRef]
  15. He, M.; Chen, Y.; Liu, M.; Fan, X.; Zhu, Y. Reliable and Energy-Efficient Communications in Mobile Robotic Networks by Collaborative Beamforming. ACM Trans. Sens. Netw. 2024, 20, 1–24. [Google Scholar] [CrossRef]
  16. Chen, P.; Yang, Y.; Wang, Y.; Ma, Y. Robust Adaptive Beamforming with Sensor Position Errors Using Weighted Subspace Fitting-Based Covariance Matrix Reconstruction. Sensors 2018, 18, 1476. [Google Scholar] [CrossRef] [PubMed]
  17. Wang, R.; Jiang, Y.; Zhang, W. A Distributed MIMO Relay Scheme Inspired by Backpropagation Algorithm. In Proceedings of the 2021 IEEE Global Communications Conference (GLOBECOM), Madrid, Spain, 7–11 December 2021; pp. 1–6. [Google Scholar]
  18. Jafri, M.; Anand, A.; Srivastava, S.; Jagannatham, A.K.; Hanzo, L. Robust Distributed Hybrid Beamforming in Coordinated Multi-User Multi-Cell Mmwave MIMO Systems Relying on Imperfect CSI. IEEE Trans. Commun. 2022, 70, 8123–8137. [Google Scholar] [CrossRef]
  19. Ab Majid, N.I.; Abd Malik, N.N.N.; Zakaria, N.A. Node Positioning Error Optimization for Collaborative Beamforming in Wireless Sensor Network. In Proceedings of the IEEE International Symposium on Antennas and Propagation (ISAP), Kuala Lumpur, Malaysia, 30 October–2 November 2023; pp. 1–2. [Google Scholar]
  20. Yang, Z.; Jiang, B. Robust Adaptive Beamforming Based on Covariance Matrix Reconstruction and SV Estimation. In Proceedings of the Second International Conference on Electronic Information Engineering and Computer Communication (EIECC 2022), Xi’an, China, 25–27 November 2022; SPIE: Bellingham, WA, USA, 2023; Volume 12594, pp. 577–583. [Google Scholar]
  21. Mohammadzadeh, S.; Nascimento, V.H.; de Lamare, R.C.; Kukrer, O. Study of Robust Adaptive Beamforming with Covariance Matrix Reconstruction Based on Power Spectral Estimation and Uncertainty Region. arXiv 2023, arXiv:2304.10502. [Google Scholar]
  22. Luo, Z.; Hu, Y.; Liu, H.; Li, Y. Robust Hybrid Beamforming Designs for Full-Duplex OFDM Millimeter Wave Systems with Imperfect Channel Estimates. Digit. Signal Process. 2023, 133, 103878. [Google Scholar] [CrossRef]
  23. Savas, Y.; Noorani, E.; Koppel, A.; Baras, J.; Topcu, U.; Sadler, B.M. Collaborative One-Shot Beamforming under Localization Errors: A Discrete Optimization Approach. Sig. Proc. 2022, 200, 108647. [Google Scholar] [CrossRef]
  24. Ben Smida, O.; Zaidi, S.; Affes, S.; Valaee, S. Low-Cost Robust Distributed Collaborative Beamforming against Implementation Impairments. In Proceedings of the IEEE GLOBECOM 2018, Abu Dhabi, United Arab Emirates, 9–13 December 2018. [Google Scholar]
  25. Iqbal, M.; Ashraf, T.; Ahmad, A.; Sohaib, S.; Pan, J.Y.; Lee, S.S. Distributed Beamforming using Trial and Error Learning Algorithm. In Proceedings of the IEEE APCC 2021, Kuala Lumpur, Malaysia, 10–13 October 2021; pp. 275–280. [Google Scholar]
  26. Ruan, H.; de Lamare, R.C. Distributed Robust Beamforming based on Low-Rank and Cross-Correlation Techniques: Design and Analysis. IEEE Trans. Signal Process. 2019, 67, 6411–6423. [Google Scholar] [CrossRef]
  27. Havary-Nassab, V.; Shahbazpanahi, S.; Grami, A.; Luo, Z.Q. Distributed Beamforming for Relay Networks based on Second-Order Statistics of the Channel State Information. IEEE Trans. Sig. Proc. 2008, 56, 4306–4316. [Google Scholar] [CrossRef]
  28. Morrison, W.J.; Humphreys, T.E.; Ton-Nu, D.A. Robust Beampattern Synthesis for UAV-Swarm-Based Distributed Beamforming. In Proceedings of the 37th International Technical Meeting of the Satellite Division of the Institute of Navigation (ION GNSS+), Baltimore, MD, USA, 16–20 September 2024; pp. 2754–2765. [Google Scholar]
  29. Yan, J. Machinery Prognostics and Prognosis Oriented Maintenance Management; John Wiley & Sons: Hoboken, NJ, USA, 2014. [Google Scholar]
  30. Yick, J.; Biswanath, M.; Dipak, G. Wireless Sensor Network Survey. Comput. Netw. 2008, 12, 2292–2330. [Google Scholar] [CrossRef]
  31. Ben Smida, O.; Affes, S. Dual-Hop Robust Distributed Collaborative Beamforming Over Nominally Rectangular WSNs in Slightly to Moderately Scattered Environments: (Invited Paper). In Proceedings of the IEEE IWCMC 2023, Marrakesh, Morocco, 19–23 June 2023. [Google Scholar]
  32. Souden, M.; Affes, S.; Benesty, J. A Two-Stage Approach to Estimate the Angles of Arrival and the Angular Spreads of Locally Scattered Sources. IEEE Trans. Signal Process. 2008, 56, 1968–1983. [Google Scholar] [CrossRef]
  33. Affes, S.; Gazor, S.; Grenier, Y. An Algorithm for Multisource Beamforming and Multitarget Tracking. IEEE Trans. Signal Process. 1996, 44, 1512–1522. [Google Scholar] [CrossRef]
Figure 1. System model.
Figure 1. System model.
Jsan 14 00032 g001
Figure 2. Illustrations of the nominal (blue circles) and true (red dots) square-grid positions for a WSAN of K = 64 nodes (i.e., K 1 = K 2 = 8) with (a) σ x = σ y = 0.1 and (b) σ x = σ y = 0.25.
Figure 2. Illustrations of the nominal (blue circles) and true (red dots) square-grid positions for a WSAN of K = 64 nodes (i.e., K 1 = K 2 = 8) with (a) σ x = σ y = 0.1 and (b) σ x = σ y = 0.25.
Jsan 14 00032 g002
Figure 3. Performance evaluation of the proposed w MM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ MM DCB in terms of the numerical ASANR vs. the normalized standard deviation of node placement errors in dual-hop monochromatic–monochromatic scenarios (i.e., σ g = 0 degrees) [9] over a square grid of K = 64 , 256 , 1024 , 4096 nodes with K 1 = K 2 = K and d / λ = 0.5.
Figure 3. Performance evaluation of the proposed w MM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ MM DCB in terms of the numerical ASANR vs. the normalized standard deviation of node placement errors in dual-hop monochromatic–monochromatic scenarios (i.e., σ g = 0 degrees) [9] over a square grid of K = 64 , 256 , 1024 , 4096 nodes with K 1 = K 2 = K and d / λ = 0.5.
Jsan 14 00032 g003
Figure 4. Performance evaluation of the proposed w MM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ MM DCB in terms of the numerical ASANR vs. the normalized standard deviation of node placement errors in dual-hop monochromatic–monochromatic scenarios (i.e., σ g = 0 degrees) [9] over a portrait-oriented rectangular grid of K = 64 , 256 , 1024 , 4096 nodes with K 1 = K / 2 < K 2 = 2 K and d / λ = 0.5.
Figure 4. Performance evaluation of the proposed w MM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ MM DCB in terms of the numerical ASANR vs. the normalized standard deviation of node placement errors in dual-hop monochromatic–monochromatic scenarios (i.e., σ g = 0 degrees) [9] over a portrait-oriented rectangular grid of K = 64 , 256 , 1024 , 4096 nodes with K 1 = K / 2 < K 2 = 2 K and d / λ = 0.5.
Jsan 14 00032 g004
Figure 5. Performance evaluation of the proposed w MM RDCB in terms of the ASANR gain against the nominal w ¯ MM DCB vs. the normalized standard deviation of node placement errors in dual-hop monochromatic–monochromatic scenarios (i.e., σ g = 0 degrees) [9] for K = 64 , 256 , 1024 , 4096 and d / λ = 0.5.
Figure 5. Performance evaluation of the proposed w MM RDCB in terms of the ASANR gain against the nominal w ¯ MM DCB vs. the normalized standard deviation of node placement errors in dual-hop monochromatic–monochromatic scenarios (i.e., σ g = 0 degrees) [9] for K = 64 , 256 , 1024 , 4096 and d / λ = 0.5.
Jsan 14 00032 g005
Figure 6. Performance evaluation of the proposed w BM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ BM DCB in terms of the numerical ASANR vs. the normalized standard deviation of node placement errors in dual-hop bichromatic–monochromatic scenarios (i.e., σ g = 6 degrees) over a square grid of K = 64 , 256 , 1024 , 4096 nodes with K 1 = K 2 = K and d / λ = 0.5.
Figure 6. Performance evaluation of the proposed w BM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ BM DCB in terms of the numerical ASANR vs. the normalized standard deviation of node placement errors in dual-hop bichromatic–monochromatic scenarios (i.e., σ g = 6 degrees) over a square grid of K = 64 , 256 , 1024 , 4096 nodes with K 1 = K 2 = K and d / λ = 0.5.
Jsan 14 00032 g006
Figure 7. Performance evaluation of the proposed w BM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ BM DCB in terms of the numerical ASANR vs. the normalized standard deviation of node placement errors in dual-hop bichromatic–monochromatic scenarios (i.e., σ g = 6 degrees) over a portrait-oriented rectangular grid of K = 64 , 256 , 1024 , 4096 nodes with K 1 = K / 2 < K 2 = 2 K and d / λ = 0.5.
Figure 7. Performance evaluation of the proposed w BM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ BM DCB in terms of the numerical ASANR vs. the normalized standard deviation of node placement errors in dual-hop bichromatic–monochromatic scenarios (i.e., σ g = 6 degrees) over a portrait-oriented rectangular grid of K = 64 , 256 , 1024 , 4096 nodes with K 1 = K / 2 < K 2 = 2 K and d / λ = 0.5.
Jsan 14 00032 g007
Figure 8. Performance evaluation of the proposed w BM RDCB in terms of the ASANR gain against the nominal w ¯ BM DCB vs. the normalized standard deviation of node placement errors in dual-hop bichromatic–monochromatic scenarios (i.e., σ g = 6 degrees) for K = 64 , 256 , 1024 , 4096 and d / λ = 0.5.
Figure 8. Performance evaluation of the proposed w BM RDCB in terms of the ASANR gain against the nominal w ¯ BM DCB vs. the normalized standard deviation of node placement errors in dual-hop bichromatic–monochromatic scenarios (i.e., σ g = 6 degrees) for K = 64 , 256 , 1024 , 4096 and d / λ = 0.5.
Jsan 14 00032 g008
Figure 9. Performance evaluation of the proposed w PM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ PM DCB in terms of the numerical ASANR vs. the normalized standard deviation of node placement errors in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) over a square grid of K = 64 , 256 , 1024 , 4096 nodes with K 1 = K 2 = K and d / λ = 0.5.
Figure 9. Performance evaluation of the proposed w PM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ PM DCB in terms of the numerical ASANR vs. the normalized standard deviation of node placement errors in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) over a square grid of K = 64 , 256 , 1024 , 4096 nodes with K 1 = K 2 = K and d / λ = 0.5.
Jsan 14 00032 g009
Figure 10. Performance evaluation of the proposed w PM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ PM DCB in terms of the numerical ASANR vs. the normalized standard deviation of node placement errors in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) over a portrait-oriented rectangular grid of K = 64 , 256 , 1024 , 4096 nodes with K 1 = K / 2 < K 2 = 2 K and d / λ = 0.5.
Figure 10. Performance evaluation of the proposed w PM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ PM DCB in terms of the numerical ASANR vs. the normalized standard deviation of node placement errors in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) over a portrait-oriented rectangular grid of K = 64 , 256 , 1024 , 4096 nodes with K 1 = K / 2 < K 2 = 2 K and d / λ = 0.5.
Jsan 14 00032 g010
Figure 11. Performance evaluation of the proposed w PM RDCB in terms of the ASANR gain against the nominal w ¯ PM DCB vs. the normalized standard deviation of node placement errors in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) for K = 64 , 256 , 1024 , 4096 and d / λ = 0.5.
Figure 11. Performance evaluation of the proposed w PM RDCB in terms of the ASANR gain against the nominal w ¯ PM DCB vs. the normalized standard deviation of node placement errors in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) for K = 64 , 256 , 1024 , 4096 and d / λ = 0.5.
Jsan 14 00032 g011
Figure 12. Performance evaluation of the proposed w PM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ PM DCB in terms of the numerical ASANR of vs. the normalized standard deviation of node placement errors in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) for K = 1024 and d / λ = 0.1, 0.5, 0.8.
Figure 12. Performance evaluation of the proposed w PM RDCB in terms of the numerical ASNR and analytical ASANR and the nominal w ¯ PM DCB in terms of the numerical ASANR of vs. the normalized standard deviation of node placement errors in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) for K = 1024 and d / λ = 0.1, 0.5, 0.8.
Jsan 14 00032 g012
Figure 13. Performance evaluation of the proposed w PM RDCB in terms of the ASANR gain against the nominal w ¯ PM DCB vs. the normalized standard deviation of node placement errors in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) for K = 1024 and d / λ = [0.1:0.1:0.8].
Figure 13. Performance evaluation of the proposed w PM RDCB in terms of the ASANR gain against the nominal w ¯ PM DCB vs. the normalized standard deviation of node placement errors in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) for K = 1024 and d / λ = [0.1:0.1:0.8].
Jsan 14 00032 g013
Figure 14. Performance evaluation of the proposed w MM RDCB in terms of the analytical ASANR vs. the normalized standard deviation of node placement errors in dual-hop monochromatic–monochromatic scenarios (i.e., σ g = 0 degrees) for K = 64 , 256 , 1024 , 4096 ; d / λ = 0.5; and σ n 2 = σ v 2 = [0, −10, −20] dB.
Figure 14. Performance evaluation of the proposed w MM RDCB in terms of the analytical ASANR vs. the normalized standard deviation of node placement errors in dual-hop monochromatic–monochromatic scenarios (i.e., σ g = 0 degrees) for K = 64 , 256 , 1024 , 4096 ; d / λ = 0.5; and σ n 2 = σ v 2 = [0, −10, −20] dB.
Jsan 14 00032 g014
Figure 15. Performance evaluation of the proposed w BM RDCB in terms of the analytical ASANR vs. the normalized standard deviation of node placement errors in dual-hop bichromatic–monochromatic scenarios (i.e., σ g = 6 degrees) for K = 64 , 256 , 1024 , 4096 ; d / λ = 0.5; and σ n 2 = σ v 2 = [0, −10, −20] dB.
Figure 15. Performance evaluation of the proposed w BM RDCB in terms of the analytical ASANR vs. the normalized standard deviation of node placement errors in dual-hop bichromatic–monochromatic scenarios (i.e., σ g = 6 degrees) for K = 64 , 256 , 1024 , 4096 ; d / λ = 0.5; and σ n 2 = σ v 2 = [0, −10, −20] dB.
Jsan 14 00032 g015
Figure 16. Performance evaluation of the proposed w PM RDCB in terms of the analytical ASANR vs. the normalized standard deviation of node placement errors in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) for K = 64 , 256 , 1024 , 4096 ; d / λ = 0.5; and σ n 2 = σ v 2 = [0, −10, −20] dB.
Figure 16. Performance evaluation of the proposed w PM RDCB in terms of the analytical ASANR vs. the normalized standard deviation of node placement errors in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) for K = 64 , 256 , 1024 , 4096 ; d / λ = 0.5; and σ n 2 = σ v 2 = [0, −10, −20] dB.
Jsan 14 00032 g016
Figure 17. Performance evaluation of the proposed w MM RDCB in terms of the analytical ASANR vs. the angular spread in dual-hop monochromatic–monochromatic scenarios for K = 64 , 256 , 1024 , 4096 ; d / λ = 0.5; and σ x = σ y = 0, 0.2.
Figure 17. Performance evaluation of the proposed w MM RDCB in terms of the analytical ASANR vs. the angular spread in dual-hop monochromatic–monochromatic scenarios for K = 64 , 256 , 1024 , 4096 ; d / λ = 0.5; and σ x = σ y = 0, 0.2.
Jsan 14 00032 g017
Figure 18. Performance evaluation of the proposed w BM RDCB in terms of the analytical ASANR vs. the angular spread in dual-hop bichromatic–monochromatic scenarios for K = 64 , 256 , 1024 , 4096 ; d / λ = 0.5; and σ x = σ y = 0, 0.2.
Figure 18. Performance evaluation of the proposed w BM RDCB in terms of the analytical ASANR vs. the angular spread in dual-hop bichromatic–monochromatic scenarios for K = 64 , 256 , 1024 , 4096 ; d / λ = 0.5; and σ x = σ y = 0, 0.2.
Jsan 14 00032 g018
Figure 19. Performance evaluation of the proposed w PM RDCB in terms of the analytical ASANR vs. the angular spread in dual-hop polychromatic–monochromatic scenarios for K = 64 , 256 , 1024 , 4096 ; d / λ = 0.5; and σ x = σ y = 0, 0.2.
Figure 19. Performance evaluation of the proposed w PM RDCB in terms of the analytical ASANR vs. the angular spread in dual-hop polychromatic–monochromatic scenarios for K = 64 , 256 , 1024 , 4096 ; d / λ = 0.5; and σ x = σ y = 0, 0.2.
Jsan 14 00032 g019
Table 1. Relevant abreviations.
Table 1. Relevant abreviations.
AoAAngle of arrival
AoDAngle of departure
ASAngular spread
ASANRAverage-signal-to-average-noise ratio
ASNRAverage signal-to-noise ratio
BMBichromatic–monochromatic
CBCollaborative beamforming
CSIChannel state information
DCBDistributed collaborative beamforming
LoSLine of sight
MMMonochromatic–monochromatic
PMPolychromatic–monochromatic
RDCBRobust distributed collaborative beamforming
SNRSignal-to-noise ratio
WSANWireless sensor and actuator network
Table 2. Simulation setup parameters.
Table 2. Simulation setup parameters.
VariableNotationValue (s)
Total number of grid nodesK64, 256, 1024,
4096
Grid nodes over x and ySquare K 1 = K 2 K
Rectangle K i = 4 K j i j
i , j { 1 , 2 }
2 K , K / 2
Inter-node distances over x and y d 1 = d 2 = d λ /2 when fixed
or [0.1:0.1:0.8]  λ
AoA at D ϕ D 17 degrees
AoD at S ϕ S 0 degrees
AS around AoD of SLow 0 degrees
Moderate σ g 6 degrees
High 60 degrees
AS around AoA of D σ f 0 degrees
Approximate number of polychromatic rays
in high scattering
L10
Rx noise power at nodes below Tx power of S σ n 2 10 dB when fixed
or [0, 10, 20] dB
Rx noise power at D below Tx power of S σ v 2 10 dB when fixed
or [0, 10, 20] dB
Normalized standard deviation of nodes
placement errors
σ x = σ y 0:0.02:0.26
or specified
Monte Carlo realizations M c 10 5
Table 3. ASANR performance of proposed w PM RDCB with different AoA ϕ D values at destination D in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) with K = 4096 ; d / λ = 0.5; and σ x = σ y = 0.1.
Table 3. ASANR performance of proposed w PM RDCB with different AoA ϕ D values at destination D in dual-hop polychromatic–monochromatic scenarios (i.e., σ g = 60 degrees) with K = 4096 ; d / λ = 0.5; and σ x = σ y = 0.1.
AoA ϕ D at destination D π / 2 π π / 2
ASANR (dB)10.016910.014910.0151
Table 4. Applicable scenarios for single-source RDCB in terms of dual-hop communication scenarios (backward/forward channels vs. rows/columns or vice versa due to reciprocity between S-WSAN-D and D-WSAN-S links).
Table 4. Applicable scenarios for single-source RDCB in terms of dual-hop communication scenarios (backward/forward channels vs. rows/columns or vice versa due to reciprocity between S-WSAN-D and D-WSAN-S links).
Dual-Hop ChannelsUnstructuredMonochromaticBichromaticPolychromatic
UnstructuredN.A.OngoingOngoingOngoing
MonochromaticOngoing✓(this work)✓(this work)✓(this work)
BichromaticOngoing✓(this work)OngoingOngoing
PolychromaticOngoing✓(this work)OngoingOngoing
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ben Smida, O.; Affes, S.; Jayakody, D.; Nizam, Y. Robust Distributed Collaborative Beamforming for WSANs in Dual-Hop Scattered Environments with Nominally Rectangular Layouts. J. Sens. Actuator Netw. 2025, 14, 32. https://doi.org/10.3390/jsan14020032

AMA Style

Ben Smida O, Affes S, Jayakody D, Nizam Y. Robust Distributed Collaborative Beamforming for WSANs in Dual-Hop Scattered Environments with Nominally Rectangular Layouts. Journal of Sensor and Actuator Networks. 2025; 14(2):32. https://doi.org/10.3390/jsan14020032

Chicago/Turabian Style

Ben Smida, Oussama, Sofiène Affes, Dushantha Jayakody, and Yoosuf Nizam. 2025. "Robust Distributed Collaborative Beamforming for WSANs in Dual-Hop Scattered Environments with Nominally Rectangular Layouts" Journal of Sensor and Actuator Networks 14, no. 2: 32. https://doi.org/10.3390/jsan14020032

APA Style

Ben Smida, O., Affes, S., Jayakody, D., & Nizam, Y. (2025). Robust Distributed Collaborative Beamforming for WSANs in Dual-Hop Scattered Environments with Nominally Rectangular Layouts. Journal of Sensor and Actuator Networks, 14(2), 32. https://doi.org/10.3390/jsan14020032

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop