Evaluating routing metric composition approaches for QoS differentiation in low power and lossy networks

  • Authors:

  • Panagiotis Karkazis;Panagiotis Trakadas;Helen C. Leligou;Lambros Sarakis;Ioannis Papaefstathiou;Theodore Zahariadis

  • Affiliations:

  • Department of Electronic and Computer Engineering, Technical University of Crete, Chania, Greece;ADAE, Hellenic Authority of Communication Security and Privacy, Athens, Greece;Department of Electrical Engineering, TEI of Chalkis, Psahna, Greece;Department of Electrical Engineering, TEI of Chalkis, Psahna, Greece;Department of Electronic and Computer Engineering, Technical University of Crete, Chania, Greece;Department of Electrical Engineering, TEI of Chalkis, Psahna, Greece

  • Venue:
  • Wireless Networks
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

The use of Wireless Sensor Networks (WSN) in a wide variety of application domains has been intensively pursued lately while Future Internet designers consider WSN as a network architecture paradigm that provides abundant real-life real-time information which can be exploited to enhance the user experience. The wealth of applications running on WSNs imposes different Quality of Service requirements on the underlying network with respect to delay, reliability and loss. At the same time, WSNs present intricacies such as limited energy, node and network resources. To meet the application's requirements while respecting the characteristics and limitations of the WSN, appropriate routing metrics have to be adopted by the routing protocol. These metrics can be primary (e.g. expected transmission count) to capture a specific effect (e.g. link reliability) and achieve a specific goal (e.g. low number of retransmissions to economize resources) or composite (e.g. combining latency with remaining energy) to satisfy different applications needs and WSNs requirements (e.g. low latency and energy consumption at the same time). In this paper, (a) we specify primary routing metrics and ways to combine them into composite routing metrics, (b) we prove (based on the routing algebra formalism) that these metrics can be utilized in such a way that the routing protocol converges to optimal paths in a loop-free manner and (c) we apply the proposed approach to the RPL protocol specified by the ROLL group of IETF for such low power and lossy link networks to quantify the achieved performance through extensive computer simulations.