Intercluster Link Management for Quality of Service Development by Mitigating the Hidden Node Problem in Wireless Sensor Networks

Abstract

A hidden node problem occurs when two different cluster heads communicate with each other. The cluster head may always establish bidirectional connections to achieve another node in a different cluster from the first nongroup node. In the correspondence between two unique clusters, the occurrence of a hidden node cannot be recognized. The intercluster link management problem occurs in the system because of the hidden node. The intercluster grouping method is proposed to eliminate the hidden node problem when there is correspondence between two unique clusters. The cluster head initiates the proposed method by the grouping method. The Group Join Request (GJREQ) is sent by each cluster head to the other cluster, which is the nongroup member. The GJREQ is received by the nongroup member in the cluster, which promotes the request to other bidirectional nodes. This request is sent until it comes to the cluster head. The cluster head assigns a response in the affirmative and sends the information to the source node. The neighbor groups are points of interest that are used for sending and receiving the information between the clusters.

A Grouping Algorithm for Random Access Networks and Supermartingale Evaluation

“…In the grouping algorithms of [4][5][6][7][8][9], only the hidden node problem is considered. In our work, the load balance is synchronously considered.…”

“…Utilizing the integer programming optimization method, the authors of [7] propose a grouping scheme of hidden terminal avoidance. In [8], the intercluster grouping method is proposed to eliminate the hidden node problem. In [9], the authors propose a hidden terminal aware clustering mechanism, and the clusters are formed based on the detected information of the neighbor learning phase.…”