View : 55 Download: 16

Greedy data transportation scheme with hard packet deadlines for wireless ad hoc networks

Title
Greedy data transportation scheme with hard packet deadlines for wireless ad hoc networks
Authors
Lee H.
Ewha Authors
이형준
SCOPUS Author ID
이형준scopus
Issue Date
2014
Journal Title
TheScientificWorldJournal
ISSN
1537744XJCR Link
Citation
vol. 2014, pp. 815123
Indexed
SCOPUS WOS scopus
Abstract
We 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.
DOI
10.1155/2014/815123
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
001.pdf(2.51 MB)Download
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

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

BROWSE