Home // ICSNC 2014, The Ninth International Conference on Systems and Networks Communications // View article

The K-means and TSP Based Mobility Protocol Modeling as a Probabilistic Combinatorial Optimization Problem

Authors:
Monia Bellalouna
Afef Ghabri
Walid Khaznaji

Keywords: Wireless sensor networks; failure; fault-tolerance; modeling; probabilistic.

Abstract:
Fault tolerance is considered as a critical issue and a very interesting subject of research in Wireless Sensor Networks (WSN). Some sensors may be blocked or may fail due to a lack of energy or because of their manufacture. The external interactions (interferences, malicious attacks) can also be the source of malfunctions. The failure of sensors should not affect the network performance. This is a problem of reliability or fault tolerance which is the ability to maintain network functionality without interruptions due to a failure of a sensor node. It therefore aims to reduce the influence of these failures on the overall task of a wireless sensor network. Protocols and fault- tolerant approaches must be used to ensure reliable delivery of data packets to the base station and to guarantee reliable functioning even after the vulnerability of some network components. In this paper, we describe the K-means And Traveling Salesman Problem-based mobility protocol used to assure the proper functioning of the networks; we also propose a theoretical modeling of a probabilistic combinatorial optimization problem, which is explored through this method in order to minimize the energy consumption and improve fault tolerance for WSN.

Pages: 48 to 53

Copyright: Copyright (c) IARIA, 2014

Publication date: October 12, 2014

Published in: conference

ISSN: 2163-9027

ISBN: 978-1-61208-368-1

Location: Nice, France

Dates: from October 12, 2014 to October 16, 2014