Show simple item record

dc.contributor.authorHou, Xiang
dc.contributor.authorSumpter, Zane
dc.contributor.authorBurson, Lucas
dc.contributor.authorXue, Xinyu
dc.contributor.authorTang, Bin
dc.date.accessioned2013-06-26T16:33:21Z
dc.date.available2013-06-26T16:33:21Z
dc.date.issued2012-10
dc.identifier.citationXiang Hou; Sumpter, Z.; Burson, L.; Xinyu Xue; Bin Tang, "Maximizing data preservation in intermittently connected sensor networks," Mobile Adhoc and Sensor Systems (MASS), 2012 IEEE 9th International Conference on , vol., no., pp.448,452, 8-11 Oct. 2012 doi: 10.1109/MASS.2012.6502546en_US
dc.identifier.isbn9781467324335
dc.identifier.otherWOS:000318874900051
dc.identifier.urihttp://hdl.handle.net/10057/5802
dc.identifier.urihttp://dx.doi.org/10.1109/MASS.2012.6502546
dc.descriptionClick on the DOI link to access the article (may not be free)en_US
dc.description.abstractIn intermittently connected sensor networks, wherein sensor nodes do not always have connected paths to the base station, preserving generated data inside the network is a new and challenging problem. We propose to preserve the data items by distributing them from storage-depleted data generating nodes to sensor nodes with available storage space and high battery energy, under the constraints that each node has limited storage capacity and battery power. The goal is to maximize the minimum remaining energy among the nodes storing the data items, in order to preserve them for maximum amount of time until next uploading opportunity arises. We first give feasibility condition of this problem by proposing and applying a Modified Edmonds-Karp Algorithm (MEA) on an appropriately transformed flow network. We then show that when feasible solutions exist, finding the optimal solution is NP-hard. We develop a sufficient condition to solve the problem optimally. We then design a centralized greedy heuristic with less time complexity than that of the optimal, which also works when feasibility can not be satisfied and network partitions arise. Via extensive simulations, we show that the heuristic performs comparably to optimal.en_US
dc.description.sponsorshipThis work was supported in part by NSF Grants CNS-1116849 and EPS-0903806.en_US
dc.description.sponsorshipThis work was supported in part by NSF Grants CNS-1116849 and EPS-0903806.
dc.language.isoen_USen_US
dc.publisherIEEEen_US
dc.relation.ispartofseries9TH IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS 2012)
dc.subjectData Preservation
dc.subjectIntermittently Connected Sensor Networks
dc.subjectNetwork Flow-Based Algorithms
dc.titleMaximizing data preservation in intermittently connected sensor networksen_US
dc.typeConference paperen_US
dc.description.versionReviewed


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record