Mobility adaptive unequal cluster-based routing protocol in wireless sensor networks
by Arunanshu Mahapatro; Pabitra Mohan Khilar
International Journal of Sensor Networks (IJSNET), Vol. 14, No. 2, 2013

Abstract: In wireless sensor networks, the impact of mobility and node failure on data delivery and network lifetime are crucial. This paper presents a mobility aware clustering algorithm which works in conjunction with the fault detection algorithm. Nodes detected as faulty do not participate in cluster election which in turn improves data delivery. An energy and mobility aware greedy geographic routing protocol is designed which constructs a cluster head backbone for the inter-cluster communication. Since the stability of the hierarchical architecture is crucial in determining the network performance, a sensor node elects itself as a cluster head basing on its residual energy and mobility. A non-cluster head node chooses a cluster head with highest link stability. To address the hot spot problem, this work groups the nodes into clusters of unequal sizes.

Online publication date: Sun, 29-Sep-2013

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 Sensor Networks (IJSNET):
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