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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on computers Ročník 62; číslo 12; s. 2440 - 2453
Hlavní autori:	Ruhrup, Stefan, Stojmenovic, Ivan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.12.2013 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!