View : 333 Download: 105

Full metadata record

DC Field Value Language
dc.contributor.author이형준-
dc.date.accessioned2016-08-28T11:08:58Z-
dc.date.available2016-08-28T11:08:58Z-
dc.date.issued2014-
dc.identifier.issn1537744X-
dc.identifier.otherOAK-12010-
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/228283-
dc.description.abstractWe present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.-
dc.languageEnglish-
dc.titleGreedy data transportation scheme with hard packet deadlines for wireless ad hoc networks-
dc.typeArticle-
dc.relation.volume2014-
dc.relation.indexSCOPUS-
dc.relation.startpage815123-
dc.relation.journaltitleTheScientificWorldJournal-
dc.identifier.doi10.1155/2014/815123-
dc.identifier.wosidWOS:000343577300001-
dc.identifier.scopusid2-s2.0-84931464803-
dc.author.googleLee H.-
dc.contributor.scopusid이형준(22834789100)-
dc.date.modifydate20180302081000-


qrcode

BROWSE