Enhanced routing in heterogeneous sensor networks

Kanwalinder Jit Kaur; Xiaojiang Du; Kendall Nygard

doi:10.1109/ComputationWorld.2009.4

Enhanced routing in heterogeneous sensor networks

Kanwalinder Jit Kaur
, Xiaojiang Du
, Kendall Nygard

Department of Electrical and Computer Engineering

North Dakota State University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

19 Scopus citations

Abstract

The research is centered on sensor networks with two types of nodes. The low end nodes are simple and low cost, while the high end nodes are costly but provide significantly more processing power. In this type of sensor networks, the low end nodes are clustered and report to a high end node, which is turn uses a network backbone to send data to a base station. In this research we have configured a new data routing procedure potentially improves the energy efficiency of the network by reducing the number of hops utilized to reach to the Base Station. We gain robustness and energy efficiency by reducing the vulnerability points in the network by employing alternatives to Shortest Path Tree routing. The new data routing procedure is compared with the Directed Diffusion algorithm.

Original language	English
Title of host publication	Computation World
Subtitle of host publication	Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009
Pages	569-574
Number of pages	6
DOIs	https://doi.org/10.1109/ComputationWorld.2009.4
State	Published - 2009
Event	Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009 - Athens, Greece Duration: 15 Nov 2009 → 20 Nov 2009

Publication series

Name	Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009

Conference

Conference	Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009
Country/Territory	Greece
City	Athens
Period	15/11/09 → 20/11/09

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Keywords

Base station
Heterogeneous sensor networks
Hierarchical routing
Security

Access to Document

10.1109/ComputationWorld.2009.4

Cite this

Kaur, K. J., Du, X., & Nygard, K. (2009). Enhanced routing in heterogeneous sensor networks. In Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009 (pp. 569-574). Article 5359654 (Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009). https://doi.org/10.1109/ComputationWorld.2009.4

Kaur, Kanwalinder Jit ; Du, Xiaojiang ; Nygard, Kendall. / Enhanced routing in heterogeneous sensor networks. Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009. 2009. pp. 569-574 (Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009).

@inproceedings{b6fd7399c5534212830097683316975d,

title = "Enhanced routing in heterogeneous sensor networks",

abstract = "The research is centered on sensor networks with two types of nodes. The low end nodes are simple and low cost, while the high end nodes are costly but provide significantly more processing power. In this type of sensor networks, the low end nodes are clustered and report to a high end node, which is turn uses a network backbone to send data to a base station. In this research we have configured a new data routing procedure potentially improves the energy efficiency of the network by reducing the number of hops utilized to reach to the Base Station. We gain robustness and energy efficiency by reducing the vulnerability points in the network by employing alternatives to Shortest Path Tree routing. The new data routing procedure is compared with the Directed Diffusion algorithm.",

keywords = "Base station, Heterogeneous sensor networks, Hierarchical routing, Security",

author = "Kaur, \{Kanwalinder Jit\} and Xiaojiang Du and Kendall Nygard",

year = "2009",

doi = "10.1109/ComputationWorld.2009.4",

language = "English",

isbn = "9780769538624",

series = "Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009",

pages = "569--574",

booktitle = "Computation World",

note = "Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009 ; Conference date: 15-11-2009 Through 20-11-2009",

}

Kaur, KJ, Du, X & Nygard, K 2009, Enhanced routing in heterogeneous sensor networks. in Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009., 5359654, Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009, pp. 569-574, Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009, Athens, Greece, 15/11/09. https://doi.org/10.1109/ComputationWorld.2009.4

Enhanced routing in heterogeneous sensor networks. / Kaur, Kanwalinder Jit; Du, Xiaojiang; Nygard, Kendall.
Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009. 2009. p. 569-574 5359654 (Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Enhanced routing in heterogeneous sensor networks

AU - Kaur, Kanwalinder Jit

AU - Du, Xiaojiang

AU - Nygard, Kendall

PY - 2009

Y1 - 2009

N2 - The research is centered on sensor networks with two types of nodes. The low end nodes are simple and low cost, while the high end nodes are costly but provide significantly more processing power. In this type of sensor networks, the low end nodes are clustered and report to a high end node, which is turn uses a network backbone to send data to a base station. In this research we have configured a new data routing procedure potentially improves the energy efficiency of the network by reducing the number of hops utilized to reach to the Base Station. We gain robustness and energy efficiency by reducing the vulnerability points in the network by employing alternatives to Shortest Path Tree routing. The new data routing procedure is compared with the Directed Diffusion algorithm.

AB - The research is centered on sensor networks with two types of nodes. The low end nodes are simple and low cost, while the high end nodes are costly but provide significantly more processing power. In this type of sensor networks, the low end nodes are clustered and report to a high end node, which is turn uses a network backbone to send data to a base station. In this research we have configured a new data routing procedure potentially improves the energy efficiency of the network by reducing the number of hops utilized to reach to the Base Station. We gain robustness and energy efficiency by reducing the vulnerability points in the network by employing alternatives to Shortest Path Tree routing. The new data routing procedure is compared with the Directed Diffusion algorithm.

KW - Base station

KW - Heterogeneous sensor networks

KW - Hierarchical routing

KW - Security

UR - https://www.scopus.com/pages/publications/77950968911

UR - https://www.scopus.com/pages/publications/77950968911#tab=citedBy

U2 - 10.1109/ComputationWorld.2009.4

DO - 10.1109/ComputationWorld.2009.4

M3 - Conference contribution

AN - SCOPUS:77950968911

SN - 9780769538624

T3 - Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009

SP - 569

EP - 574

BT - Computation World

T2 - Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009

Y2 - 15 November 2009 through 20 November 2009

ER -

Kaur KJ, Du X, Nygard K. Enhanced routing in heterogeneous sensor networks. In Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009. 2009. p. 569-574. 5359654. (Computation World: Future Computing, Service Computation, Adaptive, Content, Cognitive, Patterns, ComputationWorld 2009). doi: 10.1109/ComputationWorld.2009.4

Enhanced routing in heterogeneous sensor networks

Abstract

Publication series

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this