Please use this identifier to cite or link to this item:
https://doi.org/10.1109/MASS.2011.11
Title: | Application-aware disruption tolerant network | Authors: | Choo, F.C. Seshadri, P.V. Chan, M.C. |
Keywords: | application-aware DTN routing |
Issue Date: | 2011 | Citation: | Choo, F.C.,Seshadri, P.V.,Chan, M.C. (2011). Application-aware disruption tolerant network. Proceedings - 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011 : 1-6. ScholarBank@NUS Repository. https://doi.org/10.1109/MASS.2011.11 | Abstract: | When low power mobile devices communicate over short range wireless networks using technologies such as WiFi, Bluetooth, ZigBee etc., the contacts are often opportunistic and intermittent due to range, mobility and energy constraint. While the DTN architecture provides a framework to support opportunistic and intermittent connectivities, existing DTN routing algorithms do not consider application requirements. In particular, if data block dependencies of applications are known to the network nodes, resource control mechanisms can utilize this knowledge to improve performance. The contributions of this paper are as follow. First, we propose a mechanism to quantify application data dependencies and show how this information can be exploited by resource control mechanisms. Next, we show how application data dependencies information can be incorporated into existing DTN routing algorithms to improve performance. Simulation results show that when application awareness is exploited, we can substantially improve application performance from 60% to 583% over the baseline DTN routing algorithms. © 2011 IEEE. | Source Title: | Proceedings - 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011 | URI: | http://scholarbank.nus.edu.sg/handle/10635/42082 | ISBN: | 9780769544694 | DOI: | 10.1109/MASS.2011.11 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.