Welcome to the InfoSci Platform
Reference Hub2
A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks

A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks

Martin Brandl, Andreas Kos, Karlheinz Kellner, Christian Mayerhofer, Thomas Posnicek, Christian Fabian
Copyright: © 2011 |Volume: 1 |Issue: 3 |Pages: 22
ISSN: 2155-6261|EISSN: 2155-627X|EISBN13: 9781613509814|DOI: 10.4018/ijwnbt.2011070104
Cite Article Cite Article

MLA

Brandl, Martin, et al. "A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks." IJWNBT vol.1, no.3 2011: pp.49-70. http://doi.org/10.4018/ijwnbt.2011070104

APA

Brandl, M., Kos, A., Kellner, K., Mayerhofer, C., Posnicek, T., & Fabian, C. (2011). A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks. International Journal of Wireless Networks and Broadband Technologies (IJWNBT), 1(3), 49-70. http://doi.org/10.4018/ijwnbt.2011070104

Chicago

Brandl, Martin, et al. "A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks," International Journal of Wireless Networks and Broadband Technologies (IJWNBT) 1, no.3: 49-70. http://doi.org/10.4018/ijwnbt.2011070104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Wireless Sensor Networks (WSNs) are becoming more important in the medical and environmental field. The authors propose an on-demand routing protocol using sensor attractiveness-metric (Pa) gradients for data forwarding decisions within the network. Attractiveness-based routing provides an efficient concept for data-centric routing in wireless sensor networks. The protocol works on-demand, is source-initiated, has a flat hierarchy and has its origin in the idea of pheromone-based routing. The algorithm supports node-to-sink data traffic and is therefore a lightweight approach to generalized multihop routing algorithms in WSNs. The performance evaluation of the proposed protocol is done by extensive simulation using a multi-agent based simulation environment called NetLogo. The efficiency of the attractiveness-based routing algorithm is compared in simulations with the well known Dynamic Source Routing algorithm (DSR). The authors conclude that the Pabased routing algorithm is well suited for easy to set up WSNs because of its simplicity of implementation and its adaptability to different scenarios by adjustable weighting factors for the node’s attractiveness metric.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.