By Topic

Constructing a 6LoWPAN Wireless Sensor Network Based on a Cluster Tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiaonan Wang ; Changshu Inst. of Technol., Changshu, China ; Huanyan Qian

This paper proposes a scheme for constructing an Internet Protocol (IP) version 6 over low-power wireless personal area networks (6LoWPAN) wireless sensor network based on a cluster tree. In the cluster generation algorithm, a cluster tree is always an isolated node with the maximum number of neighbor isolated nodes that launches the cluster generation process; therefore, the total number of cluster heads is minimized. In the cluster-tree construction algorithm, the cluster-tree architecture is proposed, and the cluster-tree construction algorithm minimizes the total number of nodes included in a cluster tree; therefore, the routing cost is reduced. In the cluster-tree repair algorithm, when a cluster head or a cluster associate node fails or moves, a new cluster head or cluster associate node is elected to maintain the cluster-tree topology. This paper compares the performance parameters of Least Cluster Change algorithm with Lowest-ID, Root-based Lowest-ID cluster constructing mechanism, and the proposed scheme, including the cluster-tree topology stability, the routing memory cost, and the routing update cost. The analytical data show that the performance of the proposed scheme is better.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:61 ,  Issue: 3 )