Limits...
A survey on clustering routing protocols in wireless sensor networks.

Liu X - Sensors (Basel) (2012)

Bottom Line: Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs.In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics.Finally, we summarize and conclude the paper with some future directions.

View Article: PubMed Central - PubMed

Affiliation: School of Electronic and Information Engineering, South China University of Technology, Guangzhou 510641, China. liuxuxun@scut.edu.cn

ABSTRACT
The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions.

Show MeSH
Illumination of data delivery in HGMR.
© Copyright Policy
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC3472877&req=5

f12-sensors-12-11113: Illumination of data delivery in HGMR.

Mentions: In order to join a hierarchically decomposed multicast group, a node generates the hashed location for the RP and sends a join message to that location. After receiving the value of decomposition index d from the RP, the node invokes the hash function with d and its location, to achieve the hashed location of the AP of the cell it belongs to. Consequently, the source builds an overlay tree, the Source-to-AP tree, whose vertices are active APs in a topology graph, and another overlay tree, the AP-to-Member tree is also built from the AP, considering each member as the vertex. When a source needs to transmit data packets, it utilizes the unicast-based forwarding strategy of HRPM to propagate data packets to each AP along the Source-to-AP overlay tree. In each cell, instead of constructing an AP-to-Member overlay tree, HGMR uses the cost over progress optimizing broadcast algorithm of GMR to select the next relay nodes at each hop. By adjusting the value for the decomposition index d, the number of members an AP is responsible for does not increase too much. Hence, the use of GMR within each cell instead of the unicast-based forwarding strategy of HRPM contributes to reduce the number of transmissions. When routing to a hashed location (RP or AP), HGMR uses the face routing of HRPM, while when routing from an AP to a set of group members within a cell, it uses the multicast face routing of HRPM. The data delivery in HGMR is shown in Figure 12.


A survey on clustering routing protocols in wireless sensor networks.

Liu X - Sensors (Basel) (2012)

Illumination of data delivery in HGMR.
© Copyright Policy
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC3472877&req=5

f12-sensors-12-11113: Illumination of data delivery in HGMR.
Mentions: In order to join a hierarchically decomposed multicast group, a node generates the hashed location for the RP and sends a join message to that location. After receiving the value of decomposition index d from the RP, the node invokes the hash function with d and its location, to achieve the hashed location of the AP of the cell it belongs to. Consequently, the source builds an overlay tree, the Source-to-AP tree, whose vertices are active APs in a topology graph, and another overlay tree, the AP-to-Member tree is also built from the AP, considering each member as the vertex. When a source needs to transmit data packets, it utilizes the unicast-based forwarding strategy of HRPM to propagate data packets to each AP along the Source-to-AP overlay tree. In each cell, instead of constructing an AP-to-Member overlay tree, HGMR uses the cost over progress optimizing broadcast algorithm of GMR to select the next relay nodes at each hop. By adjusting the value for the decomposition index d, the number of members an AP is responsible for does not increase too much. Hence, the use of GMR within each cell instead of the unicast-based forwarding strategy of HRPM contributes to reduce the number of transmissions. When routing to a hashed location (RP or AP), HGMR uses the face routing of HRPM, while when routing from an AP to a set of group members within a cell, it uses the multicast face routing of HRPM. The data delivery in HGMR is shown in Figure 12.

Bottom Line: Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs.In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics.Finally, we summarize and conclude the paper with some future directions.

View Article: PubMed Central - PubMed

Affiliation: School of Electronic and Information Engineering, South China University of Technology, Guangzhou 510641, China. liuxuxun@scut.edu.cn

ABSTRACT
The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions.

Show MeSH