The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimum weight routing based on a common link control radio for cognitive wireless ad hoc networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
A path-centric channel assignment framework for cognitive radio wireless networks
Mobile Networks and Applications
CRAHNs: Cognitive radio ad hoc networks
Ad Hoc Networks
CREAM-MAC: An efficient Cognitive Radio-enAbled Multi-Channel MAC protocol for wireless networks
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Minimal time broadcasting in cognitive radio networks
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network
IEEE Transactions on Computers
Full length article: Proactive channel access in dynamic spectrum networks
Physical Communication
| Hi-index | 0.00 |
Cognitive radio (CR) enables efficient sharing of radio spectrums, where those spectrums are owned by licensed users which are named as primary users (PUs). As in conventional ad hoc networks, broadcasting is also a necessary and an elementary operation in cognitive radio ad hoc networks (CRAHNs). In CRAHNs, sharing licensed channels with PUs and rendezvousing in the same channel create extra difficulties for broadcasting. In this paper, we propose a broadcasting strategy for CRAHNs named as "Primary User Aware, Request for Message" (PA_RfM). In the PA_RfM scheme, to prevent the interference with PUs, each broadcasting node calls its neighbors to the licensed data channel with the lowest PU activity. To increase the reachability, when a node cannot get an expected broadcast message due to collisions, it requests this message from a proper neighbor. The algorithm also uses a counter based mechanism to avoid transmissions of unnecessary broadcasting messages. Experimental results show that the PA_RfM strategy can reach 100% of nodes and outperforms possible broadcasting techniques in reduction of the overhead in the network and decreasing propagation delay of broadcasting messages.