FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Collaborative beamforming for wireless sensor networks with Gaussian distributed sensor nodes
IEEE Transactions on Wireless Communications
Network beamforming using relays with perfect channel information
IEEE Transactions on Information Theory
Distributed transmit beamforming: challenges and recent progress
IEEE Communications Magazine
Time-Slotted Round-Trip Carrier Synchronization for Distributed Beamforming
IEEE Transactions on Signal Processing
A Cross-Layer Approach to Collaborative Beamforming for Wireless Ad Hoc Networks
IEEE Transactions on Signal Processing - Part I
Collaborative beamforming for distributed wireless ad hoc sensor networks
IEEE Transactions on Signal Processing
Distributed Average Consensus With Dithered Quantization
IEEE Transactions on Signal Processing - Part I
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
On the Feasibility of Distributed Beamforming in Wireless Networks
IEEE Transactions on Wireless Communications
On distances in uniformly random networks
IEEE Transactions on Information Theory
Wireless Communications & Mobile Computing
Energy-efficient data dissemination using beamforming in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 35.68 |
As the nodes in wireless sensor networks (WSNs) are independent units, an intensive communication among them is required to generate a common signal and synchronize before entering a distributed beamforming (DBF) phase. Therefore, it is crucial to select the participating nodes in DBF such that not only the resulting beampattern meets the beamforming design requirements but also the internode connectivity is retained. We consider a DBF technique for WSNs with uniformly distributed nodes and derive an average beampattern expression for a general scenario wherein the participating nodes in DBF are located on a ring with arbitrary inner and outer radii. It is proved that increasing the ring inner radius from zero to a value close to the ring outer radius, the width of the average beampattern mainlobe continuously decreases. Further, it is shown that selecting the nodes from a neighborhood close to a disc perimeter, that is, choosing the nodes from the narrow ring adjacent to the inner side of the disc boundary, facilitates a substantial decrease in the network energy waste and the node isolation probability compared to the case that the nodes are randomly selected from the whole disc. A simple approximate expression for the average beampattern is obtained in the case where the nodes are selected from a narrow ring and is used to derive the sidelobes' null and peak positions as well as a tight lower bound on the average beampattern directivity. The proposed technique is then extended to the case where the nodes are located on multiple concentric rings and the set of rings' radii are derived that guarantee an average beampattern null at a required position while substantially decreasing the sidelobe peak levels compared to the single-ring case. Finally, an average beampattern expression is obtained in the case that the nodes' signals are contaminated by noise to show that most properties of the average beampattern in the noise-free signal case carry over to the noisy signal scenario.