Ediver: An efficient distance vector routing algorithm for wireless sensor networks

Haitham S. Hamza; Shasha Wu; Jitender S. Deogun

Ediver: An efficient distance vector routing algorithm for wireless sensor networks

Haitham S. Hamza, Shasha Wu, Jitender S. Deogun

Computer Science and Engineering

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

1 Scopus citations

Abstract

We propose a routing algorithm for sensor networks called EDIVER-Efficient Distance Vector Routing. EDIVER combines good features of two existing routing algorithms: the Ad hoc On-demand Distance Vector (AODV) algorithm; a routing algorithm for mobile ad hoc networks, and the Rumor routing algorithm; a routing algorithm for sensor networks. Extensive simulation results show that EDIVER reduces the average energy consumption; average end-to-end delay, and normalized routing overhead compared to the AODV algorithm. However, packet delivery fraction for EDIVER is a little less than that of the AODV algorithm, although it is very close under some scenarios.

Original language	English (US)
Title of host publication	Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005
Editors	A.O. Fapojuwo
Pages	131-136
Number of pages	6
State	Published - 2005
Event	IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED International Multi-Conference on Wireless and Optical Communications, CSA 2005 - Banff, AB, Canada Duration: Jul 19 2005 → Jul 21 2005

Publication series

Name	Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005

Conference

Conference	IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED International Multi-Conference on Wireless and Optical Communications, CSA 2005
Country/Territory	Canada
City	Banff, AB
Period	7/19/05 → 7/21/05

Keywords

AODV
Routing algorithms
Rumor routing algorithm
Sensor networks

ASJC Scopus subject areas

Engineering(all)

Cite this

Hamza, H. S., Wu, S., & Deogun, J. S. (2005). Ediver: An efficient distance vector routing algorithm for wireless sensor networks. In A. O. Fapojuwo (Ed.), Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005 (pp. 131-136). (Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005).

Ediver : An efficient distance vector routing algorithm for wireless sensor networks. / Hamza, Haitham S.; Wu, Shasha; Deogun, Jitender S.

Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005. ed. / A.O. Fapojuwo. 2005. p. 131-136 (Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005).

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

Hamza, HS, Wu, S & Deogun, JS 2005, Ediver: An efficient distance vector routing algorithm for wireless sensor networks. in AO Fapojuwo (ed.), Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005. Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005, pp. 131-136, IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED International Multi-Conference on Wireless and Optical Communications, CSA 2005, Banff, AB, Canada, 7/19/05.

Hamza HS, Wu S, Deogun JS. Ediver: An efficient distance vector routing algorithm for wireless sensor networks. In Fapojuwo AO, editor, Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005. 2005. p. 131-136. (Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005).

Hamza, Haitham S. ; Wu, Shasha ; Deogun, Jitender S. / Ediver : An efficient distance vector routing algorithm for wireless sensor networks. Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005. editor / A.O. Fapojuwo. 2005. pp. 131-136 (Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005).

@inproceedings{780362ddb86b4a24bace9c99073bdda0,

title = "Ediver: An efficient distance vector routing algorithm for wireless sensor networks",

abstract = "We propose a routing algorithm for sensor networks called EDIVER-Efficient Distance Vector Routing. EDIVER combines good features of two existing routing algorithms: the Ad hoc On-demand Distance Vector (AODV) algorithm; a routing algorithm for mobile ad hoc networks, and the Rumor routing algorithm; a routing algorithm for sensor networks. Extensive simulation results show that EDIVER reduces the average energy consumption; average end-to-end delay, and normalized routing overhead compared to the AODV algorithm. However, packet delivery fraction for EDIVER is a little less than that of the AODV algorithm, although it is very close under some scenarios.",

keywords = "AODV, Routing algorithms, Rumor routing algorithm, Sensor networks",

author = "Hamza, {Haitham S.} and Shasha Wu and Deogun, {Jitender S.}",

year = "2005",

language = "English (US)",

isbn = "0889864934",

series = "Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005",

pages = "131--136",

editor = "A.O. Fapojuwo",

booktitle = "Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005",

note = "IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED International Multi-Conference on Wireless and Optical Communications, CSA 2005 ; Conference date: 19-07-2005 Through 21-07-2005",

}

TY - GEN

T1 - Ediver

T2 - IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED International Multi-Conference on Wireless and Optical Communications, CSA 2005

AU - Hamza, Haitham S.

AU - Wu, Shasha

AU - Deogun, Jitender S.

PY - 2005

Y1 - 2005

N2 - We propose a routing algorithm for sensor networks called EDIVER-Efficient Distance Vector Routing. EDIVER combines good features of two existing routing algorithms: the Ad hoc On-demand Distance Vector (AODV) algorithm; a routing algorithm for mobile ad hoc networks, and the Rumor routing algorithm; a routing algorithm for sensor networks. Extensive simulation results show that EDIVER reduces the average energy consumption; average end-to-end delay, and normalized routing overhead compared to the AODV algorithm. However, packet delivery fraction for EDIVER is a little less than that of the AODV algorithm, although it is very close under some scenarios.

AB - We propose a routing algorithm for sensor networks called EDIVER-Efficient Distance Vector Routing. EDIVER combines good features of two existing routing algorithms: the Ad hoc On-demand Distance Vector (AODV) algorithm; a routing algorithm for mobile ad hoc networks, and the Rumor routing algorithm; a routing algorithm for sensor networks. Extensive simulation results show that EDIVER reduces the average energy consumption; average end-to-end delay, and normalized routing overhead compared to the AODV algorithm. However, packet delivery fraction for EDIVER is a little less than that of the AODV algorithm, although it is very close under some scenarios.

KW - AODV

KW - Routing algorithms

KW - Rumor routing algorithm

KW - Sensor networks

UR - http://www.scopus.com/inward/record.url?scp=33644542719&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33644542719&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33644542719

SN - 0889864934

T3 - Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005

SP - 131

EP - 136

BT - Proceedings of the IASTED International Conference on Communication Systems and Applications, as part of the Fifth IASTED Int. Multi-Conference on Wireless and Optical Communications, CSA 2005

A2 - Fapojuwo, A.O.

Y2 - 19 July 2005 through 21 July 2005

ER -

Ediver: An efficient distance vector routing algorithm for wireless sensor networks

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this