Home // ICN 2013, The Twelfth International Conference on Networks // View article
Authors:
Paritosh Ramanan
Prathamesh Gaikwad
Sreejith Vidyadharan
Keywords: WSN, Mobility, Assignment Problem
Abstract:
Wireless Sensor Networks (WSNs) have been proposed as a solution to problems in a variety of monitoring applications. Most of the random deployments in sensor networks lack proper connectivity. In this paper, an approach is presented to achieve connectivity in a disconnected random deployment of sensor networks. This can be accomplished by using mobile nodes for establishing connectivity in the network as well as for information gathering. The concept of Steiner point has been used to find the co- ordinates for placing the mobile nodes. The paper proposes a variant of Hungarian algorithm for placing mobile nodes in the field in minimum time. The simulation results indicate that the proposed approach can be effectively used in an unstructured deployment of WSN.
Pages: 7 to 14
Copyright: Copyright (c) IARIA, 2013
Publication date: January 27, 2013
Published in: conference
ISSN: 2308-4413
ISBN: 978-1-61208-245-5
Location: Seville, Spain
Dates: from January 27, 2013 to February 1, 2013