Efficient routing in PAN and sensor networks

Authors:
P. Trakadas;Th. Zahariadis;S. Voliotis;Ch. Manasis
Affiliations:
National Technical University of Athens, Athens, Greece;Ellemedia Technologies/Bell Labs, Athens, Greece;Technical Educational Institute of Chalkida, Greece;Technical Educational Institute of Chalkida, Greece
Venue:
ACM SIGMOBILE Mobile Computing and Communications Review - Special issue on wireless pan & sensor networks
Year:
2004

Citing 10
Cited 1

The landmark hierarchy: a new hierarchy for routing in very large networks

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Computer networks (3rd ed.)

Computer networks (3rd ed.)
An efficient routing protocol for wireless networks

Mobile Networks and Applications - Special issue: routing in mobile communications networks
LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Increasing Reliability in Cable-Free Radio LANs Low Level Forwarding in HIPERLAN

Wireless Personal Communications: An International Journal
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
A survey on sensor networks

IEEE Communications Magazine
Scalable routing strategies for ad hoc wireless networks

IEEE Journal on Selected Areas in Communications
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks

IEEE Journal on Selected Areas in Communications

Dynamic path control scheme in mobile ad hoc networks using on-demand routing protocol

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Routing in both PANs and sensor networks can be significantly improved, if each node knows the network topology. However, this leads to high signalling overhead and power loss, given the frequent network topology changes. In order to compromise between efficient routing and communications /power limitations, various algorithms have been proposed. In this paper, a selection of algorithms proposed for ad-hoc networks are classified according to their relevancy and efficiency, when applied to PANs and sensor networks.