An online approach for wireless network repair in partially-known environments

Simple item page
dc.contributor.authorTruong, Thuy T.
dc.contributor.authorBrown, Kenneth N.
dc.contributor.authorSreenan, Cormac J.
dc.contributor.funderScience Foundation Irelanden
dc.contributor.funderHigher Education Authorityen
dc.date.accessioned2017-11-27T16:03:15Z
dc.date.available2017-11-27T16:03:15Z
dc.date.issued2016-03-10
dc.date.updated2017-11-27T15:07:42Z
dc.description.abstractWireless Sensor Networks in volatile environments may suffer damage which partitions the network, and connectivity must be restored. We investigate the online problem, in which the repairing agent must discover surviving nodes and the damage to the physical and radio environment as it moves around the sensor field to execute the repair. The objectives include minimising the cost of the repair in terms of new radios and distance travelled, and minimising the time to complete the repair. We consider a number of different agent features which we can combine in different configurations. The repairing agent may prioritise either the node cost or the travel distance. The focus of the agent may be local, with a greedy choice of next partition to re-connect, or global, maintaining a plan for all partitions. To handle the developing knowledge of the network conditions, the agent may revert to full replanning when a change is discovered, or try a minimal adjustment of the current plan in order to minimise the computation effort. For each configuration, we develop a number of heuristics for creating the plans. We evaluate the approach in simulation, varying the density of the connectivity graph and the level of damage suffered. We demonstrate that the plan repair method, while producing more expensive solutions, can require significantly less computation time, depending on the choice of heuristic. Finally, we evaluate the total time to repair the network for different speeds of agent, and we show the relative importance of the agent speeds on the two focuses. In particular, algorithms which prioritise mobility cost are preferred for slow agents, while faster moving agents should prioritise the radio node cost.en
dc.description.sponsorshipScience Foundation Ireland (CTVR, the telecommunications research centre, funded by Science Foundation Ireland (10/CE/I1853)); Higher Education Authority (HEA PRTLI4 project NEMBES)en
dc.description.statusPeer revieweden
dc.description.versionSubmitted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationTruong, T. T., Brown, K. N. and Sreenan, C. J. (2016) 'An online approach for wireless network repair in partially-known environments', Ad Hoc Networks, 45(Supplement C), pp. 47-64. doi: 10.1016/j.adhoc.2016.02.021en
dc.identifier.doi10.1016/j.adhoc.2016.02.021
dc.identifier.endpage64en
dc.identifier.issn1570-8705
dc.identifier.issuedCen
dc.identifier.journaltitleAd Hoc Networksen
dc.identifier.startpage47en
dc.identifier.urihttps://hdl.handle.net/10468/5095
dc.identifier.volume45en
dc.language.isoenen
dc.publisherElsevieren
dc.relation.urihttp://www.sciencedirect.com/science/article/pii/S1570870516300622
dc.rights© 2016 Elsevier B.V. This manuscript version is made available under the CC BY-NC-ND 4.0 license.en
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/en
dc.subjectWireless Sensor Networken
dc.subjectWSNen
dc.subjectNode deploymenten
dc.subjectConnectivity repairen
dc.titleAn online approach for wireless network repair in partially-known environmentsen
dc.typeArticle (preprint)en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2016-Thuy-journal-AdhocNet2016.pdf
Size:
1.18 MB
Format:
Adobe Portable Document Format
Description:
Submitted version
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science - Journal Articles
Insight Centre for Data Analytics - Journal Articles