Scalable Routing Algorithms for Large Scale Wireless Sensor Networks

Beschreibung

Jun.-Prof. Dr. Hannes Frey, University of Paderborn - Large scale wireless networks like ad hoc, sensor, sensor actuator or robot networks consist of devices which are communicating wireless without using a fixed network infrastructure. Due to limited transmission range, communication between two nodes often requires collaborating intermediate nodes in order to route messages along a path connecting source and destination node. Data communication by message routing gets a challenging task in large scale ad-hoc networks like sensor networks consisting of thousands of nodes. Networks with battery operated nodes have only a limited amount of total energy available. It is thus of great importance that such routing protocols are operating in an energy efficient manner. Moreover, opposed to traditional networks, changes in the network topology - resulting form device mobility or from wireless channel fluctuations - are the rule and not an exceptional case. This talk will discuss the class of localized routing algorithms which are a significant paradigm shift form traditional routing mechanisms, those based on global message exchange. In such algorithms the decision about the next hop forwarding node is based on information about the current and the nodes in its vicinity only. Maintenance of the routing infrastructure is just limited on local exchange of information with the immediate neighborhood. The local exchange of control messages is thus not depending on the total network size. Moreover, changes in the network topology just require control message exchange with neighbor nodes in the immediate surrounding of that change. From that perspective, such network protocols are arbitrary scalable with respect to the network size.

Zeitraum	05 Mai 2011 → 06 Mai 2011
Veranstaltungstyp	Gastvortrag
Ort	ÖsterreichAuf Karte anzeigen