Title
Optimized interconnection of disjoint wireless sensor network segments using K mobile data collectors
Abstract
Due to harsh environmental conditions a Wireless Sensor Network (WSN) may suffer from large scale damage where many nodes fail simultaneously and thus the network gets partitioned into several disjoint network segments. Restoring intersegment connectivity is essential to avoid negative effects on the application. Employing mobile data collectors (MDCs), which by repositioning-facilitate the establishment of communication links between segments, may provide flexible solution to this problem. However the problem of finding shortest tours for MDCs is NP-Hard. In this paper we study the problem under constrained number of MDCs which makes the problem more challenging. We present a polynomial time heuristic for Interconnecting Disjoint Segments with k MDCs (IDM-kMDC). IDM-kMDC opts to minimize the tour lengths and balance the load on the k available MDCs. We model each segment by a representative. The IDM-kMDC heuristic finds k-subsets of representatives, computes an optimized tour for each subset and assigns one MDC for each tour. The performance of the algorithm is validated through simulation.
Year
DOI
Venue
2012
10.1109/ICC.2012.6364467
Communications
Keywords
Field
DocType
interconnections,optimisation,wireless sensor networks,K mobile data collectors,NP-hard problems,communication links,disjoint wireless sensor network segment,intersegment connectivity,optimized interconnection,polynomial time heuristic for interconnecting disjoint segments,Interconnecting disjoint network Segments,Mobile data collectors,Recovery from multiple nodes failure
Heuristic,Disjoint sets,Computer science,Computer network,Time complexity,Interconnection,Wireless sensor network,Mobile broadband,Distributed computing
Conference
ISSN
ISBN
Citations 
1550-3607 E-ISBN : 978-1-4577-2051-2
978-1-4577-2051-2
17
PageRank 
References 
Authors
0.81
6
2
Name
Order
Citations
PageRank
Fatih Senel1170.81
Mohamed Younis21317.11