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

Show simple item record

dc.contributor.author Truong, Thuy T.
dc.contributor.author Brown, Kenneth N.
dc.contributor.author Sreenan, Cormac J.
dc.date.accessioned 2017-11-27T16:03:15Z
dc.date.available 2017-11-27T16:03:15Z
dc.date.issued 2016-03-10
dc.identifier.citation Truong, 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.021 en
dc.identifier.volume 45 en
dc.identifier.issued C en
dc.identifier.startpage 47 en
dc.identifier.endpage 64 en
dc.identifier.issn 1570-8705
dc.identifier.uri http://hdl.handle.net/10468/5095
dc.identifier.doi 10.1016/j.adhoc.2016.02.021
dc.description.abstract Wireless 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.sponsorship Science Foundation Ireland (CTVR, the telecommunications research centre, funded by Science Foundation Ireland (10/CE/I1853)); Higher Education Authority (HEA PRTLI4 project NEMBES) en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Elsevier en
dc.relation.uri http://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.uri http://creativecommons.org/licenses/by-nc-nd/4.0/ en
dc.subject Wireless Sensor Network en
dc.subject WSN en
dc.subject Node deployment en
dc.subject Connectivity repair en
dc.title An online approach for wireless network repair in partially-known environments en
dc.type Article (preprint) en
dc.internal.authorcontactother Cormac Sreenan, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: c.sreenan@cs.ucc.ie en
dc.internal.availability Full text available en
dc.date.updated 2017-11-27T15:07:42Z
dc.description.version Submitted Version en
dc.internal.rssid 411920608
dc.contributor.funder Science Foundation Ireland en
dc.contributor.funder Higher Education Authority en
dc.description.status Peer reviewed en
dc.identifier.journaltitle Ad Hoc Networks en
dc.internal.copyrightchecked No !!CORA!! en
dc.internal.licenseacceptance Yes en
dc.internal.IRISemailaddress c.sreenan@cs.ucc.ie en


Files in this item

This item appears in the following Collection(s)

Show simple item record

© 2016 Elsevier B.V. This manuscript version is made available under the CC BY-NC-ND 4.0 license. Except where otherwise noted, this item's license is described as © 2016 Elsevier B.V. This manuscript version is made available under the CC BY-NC-ND 4.0 license.
This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement