The coexistence of heterogeneous sub-networks in 6G poses new security and trust concerns and thus calls for a perimeterless-security model. Blockchain radio access network (B-RAN) provides a trust-building approach via repeated interactions rather than relying on pre-established trust or central authentication. Such a trust-building process naturally supports dynamic trusted services across various service providers (SP) without the need for perimeter-based authentications; however, it remains vulnerable to environmental and system unreliability such as wireless channel uncertainty. In this study, we investigate channel unreliability in the trust-building framework based on repeated interactions for secure wireless services. We derive specific requirements for achieving cooperation between SPs and clients via a repeated game model and illustrate the implications of channel unreliability on sustaining trusted wireless services. We consider the framework design and optimization to guarantee SP-client cooperation, given the worst channel condition and/or the least cooperation willingness. Furthermore, we explore the maximum cooperation area to enhance service resilience and reveal the trade-off relationship between transmission efficiency, security integrity, and cooperative margin. Finally, we present simulations to demonstrate the system performance over fading channels and verify our results.

Blockchain-based decentralized applications (DApps) offer enhanced security and decentralization features; nevertheless, their maintenance demands substantial computational resources and poses challenges for deployment in mobile networks. To address this, a number of studies have explored offloading blockchain mining tasks from mobile users to mobile edge computing (MEC) servers. However, the existing literature overlooks the fact that MEC servers can not only mine for mobile users but also mine for themselves, potentially explaining why MEC mining offloading has not gained broad acceptance within the industry. In this work, we exploit a more practical case and rethink the question of whether MEC servers lease computing power to mobile users by taking into account that MEC servers can mine for themselves. We establish a game model and apply backward induction to analytically characterize Nash equilibria for mining strategies adopted by MEC and mobile users. Our findings suggest that, if MEC can mine for self, MEC would mine for mobile users only under specific conditions where mobile users possess superior information gathering capability (at least better than the MEC server) or the whole blockchain system exhibits significant network value. We further provide a series of simulations to verify our conclusion and illustrate the impact of network parameters on the strategies of both sides.

The advent of blockchain technology in wireless networking has spawned a novel decentralized paradigm that engenders the establishment of multi-party trust, secure and efficient resource sharing, and equitable distribution of benefits. However, blockchain often results in lengthy access latencies and can hardly guarantee the quality of off-chain services. The problems stem from the intrinsic flaws of blockchain in dealing with off-chain services such as wireless access. In this study, we propose a unified framework that guarantees service quality and low establishment latency for blockchain-based systems, and incentivizes clients and service providers (SPs) to cooperate without a trusted third party. We use wireless access service in blockchain radio access network (B-RAN) as a typical example and provide a detailed implementation design. We model the service delivery process in our framework and identify the necessary condition for achieving trusting cooperation. Interestingly, we find the necessary condition is also sufficient for cooperation if the service framework is properly designed. Furthermore, we uncover a trade-off between system robustness and transmission efficiency, which offers insightful guidance for framework design in practice. Finally, we present simulation results to illustrate the effectiveness of our proposed wireless access scheme.