Partition Discovery and Connectivity Restoration in WSN using Mobile Relays

dc.contributor.authorGudino, Lucy J.
dc.date.accessioned2023-01-20T10:22:52Z
dc.date.available2023-01-20T10:22:52Z
dc.date.issued2015
dc.description.abstractConnectivity restoration in Wireless Sensor Network (WSN) is a common problem and several solutions has been proposed in the literature. Reasons for partition include initial random deployment, node failure due to low battery life, hardware malfunction etc. This paper focuses on partition discovery and hence restoring connectivity in a segmented network using Mobile Relay (MR) nodes. We propose a hybrid of frontier-based and random-direction exploration approaches for detecting partitions in a given area. An approximation algorithm for Steiner point based minimum spanning tree is adopted to determine the topology for connecting the discovered partition. Optimal assignment of mobile relays in this topology is visualized as a Bottleneck Assignment Problem (BAP). Our approach guarantees use of minimum number of MR nodes to be placed in minimum time. Experimental results indicate that the proposed approach can be effectively used for connectivity restoration in a partitioned network.en_US
dc.identifier.urihttps://dl.acm.org/doi/10.1145/2684464.2684487
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8606
dc.language.isoenen_US
dc.publisherACM Digital Libraryen_US
dc.subjectComputer Scienceen_US
dc.subjectMobile Relaysen_US
dc.subjectMobile WSNen_US
dc.subjectWireless Sensor Network (WSN)en_US
dc.titlePartition Discovery and Connectivity Restoration in WSN using Mobile Relaysen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: