Delay-tolerant delivery of quality information in ad hoc networks

被引:16
作者
Anagnostopoulos, Christos [1 ]
Hadjiefthymiades, Stathes [1 ]
机构
[1] Univ Athens, Dept Informat & Telecommun, GR-10679 Athens, Greece
关键词
Optimal stopping theory; Delay-tolerant information delivery; Discounted secretary problem; Optimal online search algorithm; OPTIMAL STOPPING PROBLEM; ALGORITHMS; MAXIMUM; SEARCH;
D O I
10.1016/j.jpdc.2010.11.007
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We investigate the delivery of information in ad hoc networks. We consider information sources and information consumers, and the network in between. Information has a certain quality indicator that fades over time. Consumers (applications that process incoming data) can receive and process disseminated information from its generation time until the associated quality reaches the lowest possible level. We adopt optimal stopping theory and an optimal online search algorithm in order to study the problem of optimally scheduling information consumption. The assumptions of our study include an efficient epidemic information dissemination scheme, which is a popular scheme for wireless sensor networks nowadays. We adopt the latter scheme for a combined setting where receiving nodes delay the reporting of information to applications in search for better quality while the overall network optimizes transmissions through the epidemic abstraction. Our findings are quite promising for the engineering of delay-tolerant applications (and the relevant middleware) in ad hoc networks. (C) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码:974 / 987
页数:14
相关论文
共 33 条
[1]  
Ajtai M., 1995, SIAM J DISCRETE MATH, V14, P1
[2]   A comparison of epidemic algorithms in wireless sensor networks [J].
Akdere, Mert ;
Bilgin, Cemal Cagatay ;
Gerdaneri, Ozan ;
Korpeoglu, Ibrahim ;
Ulusoy, Osgur ;
Cetintemel, Ugur .
COMPUTER COMMUNICATIONS, 2006, 29 (13-14) :2450-2457
[3]  
Anagnostopoulos C., 2007, IEEE INT WORKSH INF, P1
[4]  
Anagnostopoulos C., 2009, ACM SIGMOBILE MOBILE, V12
[5]  
[Anonymous], P 10 INT C ARCH SUPP
[6]  
[Anonymous], 2000, EPIDEMIC ROUTING PAR
[7]  
Babaioff M., P 20 ANN ACM SIAM S, P1245
[8]   Opportunistic Routing for Disruption Tolerant Networks [J].
Caleffi, Marcello ;
Paura, Luigi .
2009 INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS WORKSHOPS: WAINA, VOLS 1 AND 2, 2009, :826-831
[9]   Epidemic thresholds in real networks [J].
Chakrabarti, Deepayan ;
Wang, Yang ;
Wang, Chenxi ;
Leskovec, Jurij ;
Faloutsos, Christos .
ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2008, 10 (04)
[10]   TCP with delayed ack for wireless networks [J].
Chen, Jiwei ;
Gerla, Mario ;
Lee, Yeng Zhong ;
Sanadidi, M. Y. .
AD HOC NETWORKS, 2008, 6 (07) :1098-1116