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

Authors:
Martin Brandl;Andreas Kos;Karlheinz Kellner;Christian Mayerhofer;Thomas Posnicek;Christian Fabian
Affiliations:
Danube University Krems, Austria;St. Pölten University of Applied Sciences, Austria;Danube University Krems, Austria;St. Pölten University of Applied Sciences, Austria;Danube University Krems, Austria;St. Pölten University of Applied Sciences, Austria
Venue:
International Journal of Wireless Networks and Broadband Technologies
Year:
2011

Citing 8
Cited 0

Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Taming the underlying challenges of reliable multihop routing in sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Learning through participatory simulations: network-based design for systems learning in classrooms

CSCL '99 Proceedings of the 1999 conference on Computer support for collaborative learning
AntNet: distributed stigmergetic control for communications networks

Journal of Artificial Intelligence Research
Agent-based tools for modeling and simulation of self- organization in peer-to-peer, ad hoc, and other complex networks

IEEE Communications Magazine
An Adaptive Energy Saving and Reliable Routing Protocol for Limited Power Sensor Networks

ACE '10 Proceedings of the 2010 International Conference on Advances in Computer Engineering

Quantified Score

Hi-index	0.00

Visualization

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.