Article

Performance analysis of fault-tolerant beacon vector routing for wireless sensor networks

Authors:

MSWiM '05: Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems

Pages 40 - 44

https://doi.org/10.1145/1089444.1089453

Published: 10 October 2005 Publication History

Get Access

Abstract

This paper presents a performance analysis for an improved Beacon Vector Routing (BVR) protocol. BVR algorithms are useful for point-to-point routing in wireless sensor networks. The original BVR algorithm is compared through performance analysis to improved three-phase fault-tolerant BVR, known as FBVR-Opt. Finally, FBVR-Opt is compared against an existing fault-tolerant routing technique, known as LRR.The simulator assumptions and performance analysis are discussed. Performance metrics include throughput, latency, overhead, and routing success rate in the presence of multiple node failures. FBVR-Opt is found to significantly improve routing success and throughput in the presence of multiple simultaneous node failures.

References

[1]

D. R. Avresky, J. R. Acosta, V. Shurbanov, and Z. Mcaffrey. Dependable Network Computing, edited by D. R. Avresky: Adaptive Minimal-Path Routing in 2-Dimensional Torus Servernet. Kluwer Academic Publisher, 2000.

Google Scholar

[2]

R. Caceres and L. Iftode. Improving the performance of reliable transport protocols in mobile computing environments. IEEE Journal on Selected Areas in Communications, 13(5), June 1995.

Digital Library

Google Scholar

[3]

L. Demoracski. Fault-tolerant beacon vector routing for mobile ad hoc networks. Proceedings of 10th IEEE Workshop on Dependable Parallel, Distributed and Network-Centric Systems, held in conjunction with the International Parallel and Distributed Processing Symposium, Apr. 2005, Denver, CO, USA.

Digital Library

Google Scholar

[4]

L. Demoracski and D. R. Avresky. Correctness of fault-tolerant cluster-based beacon vector routing for ad hoc networks. To Appear in IEEE International Conference on Wireless and Mobile Computing, Networking, and Communications, Aug. 2005, Montreal, Canada.

Crossref

Google Scholar

[5]

R. Duggirala, R. Gupta, Q.-A. Zeng, and D. P. Agrawal. Performance enhancements of ad hoc networks with localized route repair. IEEE Transactions on Computers, 52(7), Jul. 2003.

Digital Library

Google Scholar

[6]

R. Fonseca, S. Ratnasamy, D. Culler, S. Shenker, and I. Stoica. Beacon vector routing: Scalable point-to-point in wireless sensornets. Intel Research, IRB-TR-04-012, May 2004.

Google Scholar

[7]

R. Jain. The art of computer systems performance analysis. John Wiley and Sons, Inc, 1991.

Google Scholar

[8]

F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric ad-hoc routing: Of theory and practice. In 22nd ACM Symposium on the Principles of Distributed Computing, 2003, Boston, MA, USA.

Digital Library

Google Scholar

[9]

J. Newsome and D. Song. Gem: Graph embedding for routing and data-centric storage in sensor networks without geographic information. In Proceedings of the First International Conference on Embedded Network Sensor Systems, pages 76--88, Nov. 2003, Los Angeles, CA, USA.

Digital Library

Google Scholar

[10]

A. Rao, C. Papadimitriou, S. Shenker, and I. Stoica. Geographic routing without location information. In Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, pages 96--108, Sep. 2003, San Diego, CA, USA.

Digital Library

Google Scholar

Cited By

View all

Ma CLiu HZhou HWu ZYang XXiao X(2011)A Fault-Tolerant Algorithm of Wireless Sensor Network Based on Recoverable NodesIntelligent Automation & Soft Computing10.1080/10798587.2011.1064318317:6(737-747)Online publication date: Jan-2011
https://doi.org/10.1080/10798587.2011.10643183
Fayed MMouftah H(2008)Position‐Based Routing for Sensor Networks: Approaches and ObstaclesAlgorithms and Protocols for Wireless Sensor Networks10.1002/9780470396360.ch8(195-223)Online publication date: 26-Mar-2008
https://doi.org/10.1002/9780470396360.ch8
Fayed MMouftah H(2007)A Method to Identify Boundary Nodes for Virtual Coordinate Constructions in Large Wireless Networks2007 Canadian Conference on Electrical and Computer Engineering10.1109/CCECE.2007.273(1070-1073)Online publication date: Apr-2007
https://doi.org/10.1109/CCECE.2007.273
Show More Cited By

Index Terms

Performance analysis of fault-tolerant beacon vector routing for wireless sensor networks

Recommendations

Fault tolerant greedy perimeter stateless routing in wireless network
ICCCS '11: Proceedings of the 2011 International Conference on Communication, Computing & Security

Routing in wireless network is a key research area. This paper proposes a fault tolerant greedy perimeter stateless routing protocol (FGPSR) suitable for wireless network with minimal routing overhead. FGPSR has four main phases-Fault testing, ...
Localized routing with guaranteed delivery and a realistic physical layer in wireless sensor networks

Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where messages between nodes are received correctly if and only if the distance ...
A fault-tolerant routing protocol in wireless sensor networks

In this paper, we propose a fault-tolerant routing protocol, called Sensor On-demand Multi-path Distance Vector Reliable (SOMDV-R) routing protocol, for wireless sensor networks to support reliable data delivery. Instead of selecting a shortest path, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

MSWiM '05: Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems

October 2005

372 pages

ISBN:1595931880

DOI:10.1145/1089444

General Chairs:
Azzedine Boukerche
University of Ottawa, Canada
,
Victor Leung
University of British Columbia, Canada
,
Program Chairs:
Carla-Fabiana Chiasserini
Politecnico di Torino, Italy
,
Vikram Srinivasan
National University of Singapore, Singapore

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 October 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

MSWiM05

Sponsor:

MSWiM05: 8th International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems 2005

October 10 - 13, 2005

Quebec, Montréal, Canada

Acceptance Rates

MSWiM '05 Paper Acceptance Rate 48 of 165 submissions, 29%;

Overall Acceptance Rate 398 of 1,577 submissions, 25%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
367
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ma CLiu HZhou HWu ZYang XXiao X(2011)A Fault-Tolerant Algorithm of Wireless Sensor Network Based on Recoverable NodesIntelligent Automation & Soft Computing10.1080/10798587.2011.1064318317:6(737-747)Online publication date: Jan-2011
https://doi.org/10.1080/10798587.2011.10643183
Fayed MMouftah H(2008)Position‐Based Routing for Sensor Networks: Approaches and ObstaclesAlgorithms and Protocols for Wireless Sensor Networks10.1002/9780470396360.ch8(195-223)Online publication date: 26-Mar-2008
https://doi.org/10.1002/9780470396360.ch8
Fayed MMouftah H(2007)A Method to Identify Boundary Nodes for Virtual Coordinate Constructions in Large Wireless Networks2007 Canadian Conference on Electrical and Computer Engineering10.1109/CCECE.2007.273(1070-1073)Online publication date: Apr-2007
https://doi.org/10.1109/CCECE.2007.273
Demoracski LAvresky D(2005)Topology Selection for Fault-Tolerant Beacon Vector Routing in Wireless Sensor NetworksJoint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-isns'05)10.1109/ICAS-ICNS.2005.91(46-46)Online publication date: 2005
https://doi.org/10.1109/ICAS-ICNS.2005.91

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Fault tolerant greedy perimeter stateless routing in wireless network

Localized routing with guaranteed delivery and a realistic physical layer in wireless sensor networks

A fault-tolerant routing protocol in wireless sensor networks