Optimizing Communication Overhead while Reducing Path Length in Beaconless Georouting with Guaranteed Delivery for Wireless Sensor Networks

Beaconless or contention-based geographic routing algorithms forward packets toward a geographical destination reactively without the knowledge of the neighborhood. Such algorithms allow greedy forwarding, where only the next hop neighbor responds after a timer-based contention using only three mess...

Full description

Bibliographic Details

Published in:	IEEE transactions on computers Vol. 62; no. 12; pp. 2440 - 2453
Main Authors:	Ruhrup, Stefan, Stojmenovic, Ivan
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.12.2013 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Algorithm/protocol design and analysis Algorithms Computer networks Computer simulation Design methodology Failure Mathematical models Network topology Networks Planarization Recovery Routing (telecommunications) Routing protocols
ISSN:	0018-9340, 1557-9956
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!