Handling large-scale node failures in mobile sensor/robot networks

2013 ◽  
Vol 36 (1) ◽  
pp. 195-210 ◽  
Author(s):  
Kemal Akkaya ◽  
Izzet F. Senturk ◽  
Shanthi Vemulapalli
2020 ◽  
Vol 29 (2) ◽  
pp. 1-24
Author(s):  
Yangguang Li ◽  
Zhen Ming (Jack) Jiang ◽  
Heng Li ◽  
Ahmed E. Hassan ◽  
Cheng He ◽  
...  

2020 ◽  
Vol 16 (4) ◽  
pp. 155014772091451 ◽  
Author(s):  
Shuguang Deng ◽  
Buwen Cao ◽  
Xiang Xiao ◽  
Hua Qin ◽  
Bing Yang

With the development of modern communication, available spectrum resources are becoming increasingly scarce, which reduce network throughput. Moreover, the mobility of nodes results in the changes of network topological structure. Hence, a considerable amount of control information is consumed, which causes a corresponding increase in network power consumption and exerts a substantial impact on network lifetime. To solve the real-time transmission problem in large-scale wireless mobile sensor networks, opportunistic spectrum access is applied to adjust the transmission power of sensor nodes and the transmission velocity of data. A cognitive routing and optimization protocol based on multiple channels with a cross-layer design is proposed to study joint optimal cognitive routing with maximizing network throughput and network lifetime. Experimental results show that the cognitive routing and optimization protocol based on multiple channels achieves low computational complexity, which maximizes network throughput and network lifetime. This protocol can be also effectively applied to large-scale wireless mobile sensor networks.


2011 ◽  
Vol 59 (8) ◽  
pp. 2306-2315 ◽  
Author(s):  
Chuan Huang ◽  
Jinhua Jiang ◽  
Shuguang Cui

To understand the network response to large-scale physical attacks, we investigate the asymptotic capacity of a half-duplex fading relay network with random node failures when the number of relays N gets infinitely large. In this paper, a simplified independent attack model is assumed where each relay node fails with a certain probability. The noncoherent relaying scheme is considered, which corresponds to the case of zero forward-link channel state information (CSI) at the relays. Accordingly, the whole relay network can be shown equivalent to a Rayleigh fading channel, where we derive the ε-outage capacity upper bound according to the multiple access (MAC) cut-set, and the ε-outage achievable rates for both the amplify-and-forward (AF) and decode-and-forward (DF) strategies. Furthermore, we show that the DF strategy is asymptotically optimal as the outage probability ε goes to zero, with the AF strategy strictly suboptimal over all signal to noise ratio (SNR) regimes. Regarding the rate loss due to random attacks, the AF strategy suffers a less portion of rate loss than the DF strategy in the high SNR regime, while the DF strategy demonstrates more robust performance in the low SNR regime.


2016 ◽  
Vol 92 (3) ◽  
pp. 1303-1332 ◽  
Author(s):  
Yanping Zhang ◽  
Yang Xiao ◽  
Yun Wang ◽  
Patrick Mosca

Sign in / Sign up

Export Citation Format

Share Document