DSpace Repository

Partition Discovery and Connectivity Restoration in WSN using Mobile Relays

Show simple item record

dc.contributor.author Gudino, Lucy J.
dc.date.accessioned 2023-01-20T10:22:52Z
dc.date.available 2023-01-20T10:22:52Z
dc.date.issued 2015
dc.identifier.uri https://dl.acm.org/doi/10.1145/2684464.2684487
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8606
dc.description.abstract Connectivity 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.language.iso en en_US
dc.publisher ACM Digital Library en_US
dc.subject Computer Science en_US
dc.subject Mobile Relays en_US
dc.subject Mobile WSN en_US
dc.subject Wireless Sensor Network (WSN) en_US
dc.title Partition Discovery and Connectivity Restoration in WSN using Mobile Relays en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account