A novel chain-based routing protocol, BranChain, in wireless sensor networks
by Li'e Zi; Wanli Chen; Xingcheng Liu; Xiang Chen
International Journal of Embedded Systems (IJES), Vol. 11, No. 3, 2019

Abstract: In order to solve the deficiencies with the PEGASIS in the inevitability of long link, the overhead of the ineligible cluster head (CH), and the overhead and time cost of chain rebuilding, an improved protocol, the BranChain, is proposed. The proposed algorithm can avoid long links, re-adjust network topology and adopt CH re-election mechanism. Whenever a long link is formed, the node originally connected is supposed to form a new independent branched chain with the greedy algorithm. When all nodes get connected in the chain, the system will connect all the independent branched chains together by searching for the optimal paths between each two of the branched chains. When the sensor nodes die, the two broken branched chains will be connected with the same algorithm as that of the optimal paths searching. Simulation results show that the BranChain, compared with the PEGASIS, can significantly prolong the network lifetime.

Online publication date: Thu, 02-May-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com