Abstract
In recent years, a large number of smart devices will be connected in Internet of Things (IoT) using an ad hoc network, which needs more frequency spectra. The cognitive radio (CR) technology can improve spectrum utilization in an opportunistic communication manner for IoT, forming a promising paradigm known as cognitive radio ad hoc networks, CRAHNs. However, dynamic spectrum availability and mobile devices/persons make it difficult to develop an efficient data transmission scheme for CRAHNs under an obstacle environment. Opportunistic routing can leverage the broadcast nature of wireless channels to enhance network performance. Inspired by this, in this paper, we propose an Obstacle aware Opportunistic Data Transmission scheme (OODT) in CRAHNs from a computational geometry perspective, considering energy efficiency and social features. In the proposed scheme, we exploit a new routing metric, which is based on an obstacle avoiding algorithm using a polygon boundary 1-searcher technology, and an auction model for selecting forwarding candidates. In addition, we prove that the candidate selection problem is NP-hard and propose a heuristic algorithm for candidate selection. The simulation results show that the proposed scheme can achieve better performance than existing schemes.
1. Introduction
The rapid expansion of the Internet of Things (IoT) has led to a significant demand for radio spectrum. Cognitive Radio (CR) technology addresses this by allowing Secondary Users (SUs) to opportunistically access unused spectrum licensed to Primary Users (PUs). In Cognitive Radio Ad Hoc Networks (CRAHNs), nodes communicate without centralized infrastructure, making them highly flexible but also susceptible to environmental challenges.
A major hurdle in real-world CRAHN deployment is the presence of physical obstacles such as buildings or terrain, which create "blind spots" and disrupt signal propagation. Traditional opportunistic routing (OR) protocols often rely on simplistic models like the "unit disk" range, failing to account for these barriers. This leads to inefficient path selection and high packet loss when nodes attempt to communicate through obstacles.
2. The OODT Scheme
To address these challenges, we propose the Obstacle aware Opportunistic Data Transmission (OODT) scheme. OODT integrates computational geometry with game-theoretic models to optimize routing in complex environments.
2.1 Boundary Searcher Algorithm (BSA)
The core of OODT's obstacle awareness is the Boundary Searcher Algorithm. By modeling the network environment as a polygon, we employ a "boundary 1-searcher" technique to determine visibility between nodes. This geometric approach allows the system to identify which neighbors are physically reachable and which are obscured by obstacles, effectively pruning "trap nodes" that might appear close geographically but are signal-isolated.
2.2 Routing Metric and Candidate Selection
OODT utilizes a holistic routing metric that balances three critical factors:
- Expected Transmission Count (ETX): Predicts the reliability of the link.
- Energy Efficiency: Prioritizes nodes with higher residual energy to prolong network life.
- Social Ties: Leverages social similarity scores derived from node encounter frequencies, recognizing that IoT devices are often tied to human mobility patterns.
Since selecting the optimal set of forwarding candidates is an NP-hard problem, OODT implements a two-layer auction model. Potential forwarders act as bidders, offering their services based on their local utility (social ties and energy). This decentralized mechanism ensures that the network reaches a Bayesian Nash Equilibrium, selecting the most efficient forwarders without global coordination.
3. Performance Evaluation
The OODT scheme was evaluated using the NS-2.35 simulator with the CRCN model, incorporating the MIT Reality Dataset for realistic mobility and social interaction patterns. Synthetic maps with varying numbers of polygonal obstacles were used to test robustness.
Results indicate that OODT significantly outperforms existing protocols like SoRoute (social-aware) and VTBR (geometry-aware). Specifically, OODT maintains a higher Packet Delivery Ratio (PDR) in high-obstacle environments by avoiding dead-end paths. Furthermore, the energy-aware auction model effectively balances the load, extending the overall network lifetime compared to non-energy-aware schemes.
4. Conclusion
OODT provides a robust framework for data transmission in CRAHNs by combining obstacle-aware geometry with social and energy metrics. By treating signal blockage as a visibility problem and using an auction-based selection process, it achieves superior reliability and efficiency in urban-like environments. Future work will focus on enhancing security against malicious nodes and adapting the model for highly dynamic obstacles.
Summary updated