scholarly journals Massive MIMO-Based Distributed Signal Detection in Multi-Antenna Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 2005
Author(s):  
Guofeng Wei ◽  
Bangning Zhang ◽  
Guoru Ding ◽  
Bing Zhao ◽  
Yimin Wei ◽  
...  

For massive multiple-input multiple-output (MIMO) distributed wireless sensor networks, this paper investigates the role of multi-antenna sensors in improving network perception performance. First, we construct a distributed multi-antenna sensor network based on massive MIMO. By using the anti-fading characteristics of multi-antennas, it is better to achieve accurate detection than the single-antenna sensor network. Based on this, we derive a closed-loop expression for the detection probability of the best detector. Then, we consider the case that the sensor power resources are limited, and thus we want to use finite power to achieve higher detection probability. For this reason, the power was optimized by the alternating direction method of multipliers (ADMM). Moreover, we also prove that only statistical channel state is needed in large-scale antenna scenarios, which avoid the huge overhead of channel state information. Finally, according to the simulation results, the multi-antenna sensor network has better detection performance than the single-antenna sensor network which demonstrates the improved performance of the proposed schemes and also validates the theoretical findings.

2014 ◽  
Vol 1037 ◽  
pp. 201-204
Author(s):  
Zhan Gao ◽  
Qing Bo Zhu ◽  
Chun Mei Wei

For wireless sensor networks for energy requirements are very high and limited node energy characteristics of wireless sensor networks to improve information transfer for the purpose of quick study proposes a wireless sensor network nodes spread weighted routing strategy. The simulation result were weighted node degree technical analysis, analysis of the advantages from the principle of routing policy change, thereby effectively increasing the network lifetime and improve the data transfer rate and reduce the transmission delay, is more suitable for large-scale wireless sensor network.


Author(s):  
Tao Yang ◽  
Gjergji Mino ◽  
Leonard Barolli ◽  
Makoto Ikeda ◽  
Fatos Xhafa ◽  
...  

In this paper, the authors investigate how the sensor network performs when the event moves with special movement path. Simulation results are compared with four scenarios: when the event is stationary, moving randomly, moving with simple 4 path, and boids path. The simulation results show that for the case when the event is moving randomly, the performance is the worst in the four scenarios. The characteristic of goodput decreases with the increase of number of sensor nodes. In the case of the boids model, the goodput is unstable when the is lower than 10 pps. The consumed energy characteristic increases with the increase of Simulation results show that the consumed energy of random movement is the worst among the four scenarios. The consumed energy of boids model is the lowest in four cases. This shows that the event movement with boids model can decrease the consumed energy in large scale WSNs.


2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Xi Jin ◽  
Nan Guan ◽  
Jintao Wang ◽  
Peng Zeng

The network calculus is a powerful tool to analyze the performance of wireless sensor networks. But the original network calculus can only model the single-mode wireless sensor network. In this paper, we combine the original network calculus with the multimode model to analyze the maximum delay bound of the flow of interest in the multimode wireless sensor network. There are two combined methods A-MM and N-MM. The method A-MM models the whole network as a multimode component, and the method N-MM models each node as a multimode component. We prove that the maximum delay bound computed by the method A-MM is tighter than or equal to that computed by the method N-MM. Experiments show that our proposed methods can significantly decrease the analytical delay bound comparing with the separate flow analysis method. For the large-scale wireless sensor network with 32 thousands of sensor nodes, our proposed methods can decrease about 70% of the analytical delay bound.


2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Kyungdoh Kim ◽  
Chunghun Ha ◽  
Changsoo Ok

Routing algorithms for large-scale sensor networks should be capable of finding energy efficient paths to prolong the lifetime of the networks in a decentralized manner. With this respect, Ant System has several proper characteristics for routing algorithm in large-scale wireless sensor networks. First, its distributed mechanism enables routing algorithm to find a solution with only local information and be robust for uncertainties in wireless sensor networks. Second, the framework of the Ant System is proper to solve dynamic problems such as routing problem. Transition probability in Ant System can be used to estimate how good a given routing path is. Capturing these features, this work proposes two Ant Systems based routing algorithms, which are AS-RWSNs (Ant System for Routing in Wireless Sensor Networks) and SAAS-RWSN (Structure-Aware AS-RWSN). The AS-RWSN applies the original Ant System to routing algorithm for wireless sensor network and SAAS-RSN upgrades AS-RWSN with considering properties of network structure such as degree of node. In SAAS-RSN, sensors with high node degree have high data traffic since they have more routing paths. Consequently, SAAS-RSN achieves an energy balance over sensor network through this routing scheme. We demonstrate the effectiveness of the proposed algorithms by comparing three existing routing algorithms.


2011 ◽  
Vol 2 (3) ◽  
pp. 49-63 ◽  
Author(s):  
Tao Yang ◽  
Gjergji Mino ◽  
Leonard Barolli ◽  
Makoto Ikeda ◽  
Fatos Xhafa ◽  
...  

In this paper, the authors investigate how the sensor network performs when the event moves with special movement path. Simulation results are compared with four scenarios: when the event is stationary, moving randomly, moving with simple 4 path, and boids path. The simulation results show that for the case when the event is moving randomly, the performance is the worst in the four scenarios. The characteristic of goodput decreases with the increase of number of sensor nodes. In the case of the boids model, the goodput is unstable when the is lower than 10 pps. The consumed energy characteristic increases with the increase of . Simulation results show that the consumed energy of random movement is the worst among the four scenarios. The consumed energy of boids model is the lowest in four cases. This shows that the event movement with boids model can decrease the consumed energy in large scale WSNs.


2013 ◽  
Vol 24 (05) ◽  
pp. 625-653 ◽  
Author(s):  
ASHOK KUMAR DAS ◽  
SANTANU CHATTERJEE ◽  
JAMUNA KANTA SING

In a wireless sensor network, we often require the deployment of new nodes to extend the lifetime of the network because some sensor nodes may be lost due to power exhaustion problem or they may be also malicious nodes. In order to protect malicious nodes from joining the sensor network, access control mechanism becomes a major challenging problem in the design of sensor network protocols. Existing access control protocols designed for wireless sensor networks require either high communication overheads or they are not scalable due to involvement of the base station during authentication and key establishment processes. In this paper, we propose a new access control scheme for large-scale distributed wireless sensor networks, which not only identifies the identity of each node but it has also ability to differentiate between old nodes and new nodes. The proposed scheme does not require involvement of the base station during authentication and key establishment processes, and it can be easily implemented as a dynamic access control protocol. In addition, our scheme significantly reduces communication costs in order to authenticate neighbor nodes among each other and establish symmetric keys between neighbor nodes as compared with existing approaches. Further, our scheme is secure against different attacks and unconditionally secure against node capture attacks. The simulation results of our scheme using the AVISPA (Automated Validation of Internet Security Protocols and Applications) tool ensure that our scheme is safe.


Author(s):  
Abdelhady M. Naguib ◽  
Shahzad Ali

Background: Many applications of Wireless Sensor Networks (WSNs) require awareness of sensor node’s location but not every sensor node can be equipped with a GPS receiver for localization, due to cost and energy constraints especially for large-scale networks. For localization, many algorithms have been proposed to enable a sensor node to be able to determine its location by utilizing a small number of special nodes called anchors that are equipped with GPS receivers. In recent years a promising method that significantly reduces the cost is to replace the set of statically deployed GPS anchors with one mobile anchor node equipped with a GPS unit that moves to cover the entire network. Objectives: This paper proposes a novel static path planning mechanism that enables a single anchor node to follow a predefined static path while periodically broadcasting its current location coordinates to the nearby sensors. This new path type is called SQUARE_SPIRAL and it is specifically designed to reduce the collinearity during localization. Results: Simulation results show that the performance of SQUARE_SPIRAL mechanism is better than other static path planning methods with respect to multiple performance metrics. Conclusion: This work includes an extensive comparative study of the existing static path planning methods then presents a comparison of the proposed mechanism with existing solutions by doing extensive simulations in NS-2.


Electronics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 218
Author(s):  
Ala’ Khalifeh ◽  
Khalid A. Darabkh ◽  
Ahmad M. Khasawneh ◽  
Issa Alqaisieh ◽  
Mohammad Salameh ◽  
...  

The advent of various wireless technologies has paved the way for the realization of new infrastructures and applications for smart cities. Wireless Sensor Networks (WSNs) are one of the most important among these technologies. WSNs are widely used in various applications in our daily lives. Due to their cost effectiveness and rapid deployment, WSNs can be used for securing smart cities by providing remote monitoring and sensing for many critical scenarios including hostile environments, battlefields, or areas subject to natural disasters such as earthquakes, volcano eruptions, and floods or to large-scale accidents such as nuclear plants explosions or chemical plumes. The purpose of this paper is to propose a new framework where WSNs are adopted for remote sensing and monitoring in smart city applications. We propose using Unmanned Aerial Vehicles to act as a data mule to offload the sensor nodes and transfer the monitoring data securely to the remote control center for further analysis and decision making. Furthermore, the paper provides insight about implementation challenges in the realization of the proposed framework. In addition, the paper provides an experimental evaluation of the proposed design in outdoor environments, in the presence of different types of obstacles, common to typical outdoor fields. The experimental evaluation revealed several inconsistencies between the performance metrics advertised in the hardware-specific data-sheets. In particular, we found mismatches between the advertised coverage distance and signal strength with our experimental measurements. Therefore, it is crucial that network designers and developers conduct field tests and device performance assessment before designing and implementing the WSN for application in a real field setting.


Sign in / Sign up

Export Citation Format

Share Document