An efficient source initiated on-demand data forwarding scheme for wireless sensor networks

Authors:
M. Brandl;K. H. Kellner;T. Posnicek;A. Kos;C. Mayerhofer;C. Fabian
Affiliations:
Center for Biomedical Technology, Danube University Krems, Krems, Austria;Center for Biomedical Technology, Danube University Krems, Krems, Austria;Center for Biomedical Technology, Danube University Krems, Krems, Austria;University of Applied Science, St. Poelten, Austria;University of Applied Science, St. Poelten, Austria;University of Applied Science, St. Poelten, Austria
Venue:
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Year:
2009

Citing 11
Cited 1

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks

Mobile Networks and Applications - Special issue: routing in mobile communications networks
The ant colony optimization meta-heuristic

New ideas in optimization
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
Routing in ad hoc networks: a case for long hops

IEEE Communications Magazine

Identifier based graph neuron: a light weight event classification scheme for WSN

ICONIP'10 Proceedings of the 17th international conference on Neural information processing: models and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel approach for an on demand routing protocol using sensor attractiveness-metric (Pa) gradients for the data forwarding decisions is proposed. Attractiveness based routing provides an efficient concept for a 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. During development of the algorithm, the attractiveness-metric was turned into a special factor for link costs and is the sole determinant for data load propagation where the attractiveness level of the sensor node defines its data forwarding attitude. The link costs called "attractiveness" are calculated from the sensor nodes' energy status, the current buffer (sensor on board memory) fill level. The received signal strength can also take into account for the attractiveness metric calculation. The algorithm only supports node-to-sink data traffic and therefore is 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.