在無線網路資源的使用上是透過頻譜的劃分來分配給不同的無線網路通訊技術來利用，頻譜上的通道狀況與頻寬都不相同，這同時也影響了傳輸速度與品質。若該通訊技術的使用人數或是使用的頻率很低，就會形成整體頻譜使用率低落或是極度不均勻的情形。動態頻譜接取技術(Dynamic Spectrum Access, DSA)便是在這種情形下成為研究的重點。在眾多動態頻譜接取技術之中感知無線電(Cognitive Radio, CR)技術更是學者們的熱門研究目標。 在感知無線電網路中若是有一個使用者想要與其他使用者共享資料或是交換資訊，該使用者必須先要和傳送對象在同一個頻道上並且建立連線，這樣的行為稱為「相遇(Rendezvous)」。而不同的相遇演算法有不同的適用環境和限制，此種環境限制可以成為評比相遇演算法的依據，例如：分散式系統、不依靠共同控制通道(不需要額外資訊)、不需時間同步、非對稱模型和擁有相遇保證。本論文便是基於這樣的條件下，提出一個有效率的群體資料共享機制。 本論文設計出一個可以將欲共享資料的感知無線電網路使用者經由通道競爭取得使用權，之後快速結合成一個新群體的機制。並透過分享門檻值控制在群體內共享資料的時機，以提升資料傳送的使用效率避免不必要的浪費與節省大量的網路資源能提供給更多使用者。 The use of resources in a wireless network is through the division of the spectrum to be assigned to different wireless network communication technology to take advantage. Channel condition on the spectrum and bandwidth are not the same, this also affects the transmission speed and quality. If the number of users of communication technology or the frequency of use is low, it will form a whole spectrum usage is extremely low or uneven situation. In this case, dynamic spectrum access technologies (DSA) become a research focus. In many dynamic spectrum access technologies, cognitive radio (CR) technology is the most popular research objectives. In cognitive radio networks if there is a user wants to share data with other users or to exchange information, these users must first stay in the same channel, and the connection is established. This behavior is called "Rendezvous". There are many different environments and constraints for different rendezvous algorithms, environmental constraints can become the basis for appraisal rendezvous algorithms. This thesis is based on these conditions, proposed an efficient group data sharing mechanism. In this thesis, cognitive radio network users that want to join the data sharing can be merged via channel competition that we proposed. Sharing threshold value controls the timing of when the group data sharing start. Enhance the efficiency of data transfer to avoid unnecessary waste and can save a lot of network resources to more users.
