Coordinated Robust Routing By Dual Cluster Heads in Layered Wireless Sensor networks

Document Type

Conference Proceeding

Publication Date

12-7-2005

Publication Title

8th International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2005

Publisher

Institute of Electrical and Electronics Engineers

First page number:

454

Last page number:

459

Abstract

In this paper, we propose the coordinated robust routing (CRR) scheme to address the fault tolerance requirements in the layered wireless sensor networks. In the proposed scheme, the robust routing trees are constructed coordinately from the most outward layer all the way to the sink node. The coordination is achieved by selecting two dedicated cluster heads for every two clusters in one layer. The problem of selecting dual cluster heads is formulated as a transportation problem, which can be solved using network flow algorithms. By having two cluster heads for every cluster pair, the CRR scheme helps to achieve fault tolerance and energy efficiency with low degree of network redundancy as well as low inter-packet delay. The performance of the CRR scheme in terms of delay, energy consumption, and network lifetime has been confirmed through simulations and compared with the single cluster head scheme.

Keywords

Clustering algorithms; Disruption tolerant networking; Energy consumption; Energy efficiency; Fault tolerance; Redundancy; Robustness; Routing; Transportation; Wireless sensor networks

Disciplines

Controls and Control Theory | Electrical and Computer Engineering | Electrical and Electronics | Electronic Devices and Semiconductor Manufacturing | Power and Energy | Signal Processing | Systems and Communications

Language

English

Permissions

Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.

UNLV article access

Search your library

Share

COinS