File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

이재용

Lee, Jaiyong
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 577 -
dc.citation.number 4 -
dc.citation.startPage 567 -
dc.citation.title INTELLIGENT AUTOMATION AND SOFT COMPUTING -
dc.citation.volume 16 -
dc.contributor.author Sim, Inbo -
dc.contributor.author Lee, Jaiyong -
dc.date.accessioned 2023-12-22T07:06:42Z -
dc.date.available 2023-12-22T07:06:42Z -
dc.date.created 2020-05-12 -
dc.date.issued 2010-07 -
dc.description.abstract The world around us will soon be interconnected as a pervasive network of intelligent devices. Through this, people will be able to get online and have almost continuous access to their preferred services. WSN (Wireless Sensor Networks) is the emerging technology expected to prevail in the pervasive computing environment of the future. Geographic routing protocol is an attractive localized routing scheme for wireless sensor networks because of its directional routing properties and scalability. Sensor nodes are highly energy-constrained. Also, sensor nodes can be deployed in a hostile condition. This is the reason why we have to consider not only the energy but also the wireless link condition. In this paper, we propose a geographic routing scheme considering the wireless link condition. If wireless link condition is not considered, the node which is at the end distance of the transitional region where packets can be received with errors can be selected as the next hop. This draws out retransmissions because of received packet errors. In addition, because of these retransmissions, additional energy is consumed. This proposed scheme guarantees that reliable data transmission is made and consumed energy is minimized. For this, we first determined the distance clop. That is, in this scheme, sensor nodes send packets to the neighbor closest at the place which is do, distance from the source to the sink. Also, method handling communication voids and loop avoidance is proposed. Through simulation, we validate that this proposed scheme is more efficient in terms of performance than general geographic routing, which selects the neighbor closest to the sink in the connected region or in the transmission range as the next hop. -
dc.identifier.bibliographicCitation INTELLIGENT AUTOMATION AND SOFT COMPUTING, v.16, no.4, pp.567 - 577 -
dc.identifier.doi 10.1080/10798587.2010.10643101 -
dc.identifier.issn 1079-8587 -
dc.identifier.scopusid 2-s2.0-77958608412 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/32108 -
dc.identifier.url https://www.tandfonline.com/doi/abs/10.1080/10798587.2010.10643101 -
dc.identifier.wosid 000281750000007 -
dc.language 영어 -
dc.publisher TSI PRESS -
dc.title ROUTING PROTOCOL WITH SCALABILITY, ENERGY EFFICIENCY AND RELIABILITY IN WSN -
dc.type Article -
dc.description.isOpenAccess FALSE -
dc.relation.journalWebOfScienceCategory Automation & Control Systems; Computer Science, Artificial Intelligence -
dc.relation.journalResearchArea Automation & Control Systems; Computer Science -
dc.type.docType Article -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor geographic routing protocol -
dc.subject.keywordAuthor scalability -
dc.subject.keywordAuthor energy efficiency -
dc.subject.keywordAuthor reliability -
dc.subject.keywordAuthor wireless sensor networks -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.