Home // AMBIENT 2015, The Fifth International Conference on Ambient Computing, Applications, Services and Technologies // View article

Improvement on K-means and TSP Based Mobility Protocol of Wireless Sensor Network

Authors:
Afef Ghabri
Monia Bellalouna
Walid Khaznaji

Keywords: Wireless sensor network; fault-tolerance; failures; Tabu; quality; realistic.

Abstract:
Wireless sensor networks are widely used in different environments in order to execute diverse tasks and applications. In this paper, we will consider problems related to the fault tolerance issue and we will present a new version of K-means And Traveling Salesman Problem based mobility protocol which aims to provide not only better energy efficiency within the wireless network, but also better reliability compared with the conventional method based on K-means clustering and the approximate solution for Traveling Salesman Problem by using the simple local search algorithm "2-Opt". This problem is Non-deterministic Polynomial-time hard (NP-hard), so we propose the new approach that navigates the mobile sink to go through the cluster centers according to the optimized route by implementing the local search method "Tabu". Simulation results have demonstrated that the solution given by the Tabu heuristic outperforms the original solution of K-means and Traveling Salesman Problem based mobility protocol in terms of quality. Our goal is to propose a much more realistic model that provides less execution time than the conventional strategy and an effective improvement once the problem is disturbed by the breakdowns of some nodes.

Pages: 56 to 64

Copyright: Copyright (c) IARIA, 2015

Publication date: July 19, 2015

Published in: conference

ISSN: 2326-9324

ISBN: 978-1-61208-421-3

Location: Nice, France

Dates: from July 19, 2015 to July 24, 2015