Konferans bildirisi Açık Erişim
Gul, Omer Melih; Uysal-Biyikoglu, Elif
<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
<identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/64079</identifier>
<creators>
<creator>
<creatorName>Gul, Omer Melih</creatorName>
<givenName>Omer Melih</givenName>
<familyName>Gul</familyName>
<affiliation>Middle East Tech Univ, Elect & Elect Engn, Ankara, Turkey</affiliation>
</creator>
<creator>
<creatorName>Uysal-Biyikoglu, Elif</creatorName>
<givenName>Elif</givenName>
<familyName>Uysal-Biyikoglu</familyName>
<affiliation>Middle East Tech Univ, Elect & Elect Engn, Ankara, Turkey</affiliation>
</creator>
</creators>
<titles>
<title>A Randomized Scheduling Algorithm For Energy Harvesting Wireless Sensor Networks Achieving Nearly 100% Throughput</title>
</titles>
<publisher>Aperta</publisher>
<publicationYear>2014</publicationYear>
<dates>
<date dateType="Issued">2014-01-01</date>
</dates>
<resourceType resourceTypeGeneral="Text">Conference paper</resourceType>
<alternateIdentifiers>
<alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/64079</alternateIdentifier>
</alternateIdentifiers>
<relatedIdentifiers>
<relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.81043/aperta.64078</relatedIdentifier>
<relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.81043/aperta.64079</relatedIdentifier>
</relatedIdentifiers>
<rightsList>
<rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
<rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
</rightsList>
<descriptions>
<description descriptionType="Abstract">This paper considers a single-hop wireless network where a fusion center (FC) collects data from a set of m energy harvesting (EH) sensors. In each time slot, k of m nodes can be scheduled by the FC for transmission over k communication channels. FC has no knowledge about the EH processes and current battery states of sensors; however, it knows the outcomes of previous transmission attempts. Also, battery leakage is ignored since it is very small. The objective is to find a low complexity scheduling policy that maximizes the total throughput of the data backlogged system for general case of EH process in finite or infinite horizon. A low-complexity and near optimal policy UROP (Uniformizing Random Ordered Policy) is proposed for a general case of EH process under infinite battery assumption. Simulations indicate that under a reasonable-sized finite battery assumption, there is almost no loss in throughput.</description>
</descriptions>
</resource>
| Görüntülenme | 47 |
| İndirme | 8 |
| Veri hacmi | 1.8 kB |
| Tekil görüntülenme | 44 |
| Tekil indirme | 8 |