Computer Networks and Distributed Systems

In this paper, we study the performance of random sensing strategies in Cognitive Friendly Networks (CFN). CFN refers to the scenarios where primary networks conform with some stated conditions in order to assist secondary users in the process of channel detection and utilization. The incentive may come from a unified business model for primary and secondary networks or it may come from regulatory requirements. Random sensing strategies although have low complexity, but they lead to poor performance in the scenarios that are not CFN. However, due to properties of CFN, the situation is different in these scenarios. In this paper, we study the performance of Pure Random Sensing and Cooperative Random Sensing which can be both used in CFN and not CFN scenarios. Moreover, the investigation includes results of Reward based Random Sensing proposed for CFN. The results show that in contrast to not CFN scenarios, these strategies lead to significant performance increase in CFN.

[1]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[2]  George Varghese,et al.  Fast Content-Based Packet Handling for Intrusion Detection , 2001 .

[3]  Gary Stoneburner,et al.  Underlying technical models for information technology security :: recommendations of the National Institute of Standards and Technology , 2001 .

[4]  Fa-Long Luo.  Digital Front-End in Wireless Communication and Broadcasting: Circuits and system integration in digital front-end , 2011 .

[5]  Hrishikesh B. Acharya,et al.  Nash Equilibria in Stabilizing Systems , 2009, SSS.

[6]  Sayaka Kamei,et al.  A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set , 2010, Int. J. Found. Comput. Sci..

[7]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[8]  Sari Stern Greene.  Security Policies and Procedures: Principles and Practices , 2005 .

[9]  Wanlei Zhou,et al.  Virtual backbone routing structures in wireless ad-hoc networks , 2010 .

[10]  Michael J. Freedman,et al.  Peer-assisted content distribution with prices , 2008, CoNEXT '08.

[11]  Sébastien Tixeuil,et al.  Selfish Stabilization , 2006, SSS.

[13]  Yi Liang,et al.  Utilizing Layered Taxation to provide incentives in P2P streaming systems , 2012, J. Syst. Softw..

[14]  Sushil Jajodia,et al.  Preserving confidentiality of security policies in data outsourcing , 2008, WPES '08.

[15]  Min Sik Kim,et al.  Rule Hashing for Efficient Packet Classification in Network Intrusion Detection , 2008, 2008 Proceedings of 17th International Conference on Computer Communications and Networks.

[16]  Arobinda Gupta,et al.  A Distributed Self-Stabilizing Algorithm for Finding a Connected Dominating Set in a Graph , 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).

[17]  Aravind Srinivasan,et al.  Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..