Controlled epidemic-style dissemination middleware for mobile ad hoc networks

被引:0
|
作者
Musolesi, Mirco [1 ]
Mascolo, Cecilia [1 ]
机构
[1] UCL, Dept Comp Sci, Gower St, London WC1E 6BT, England
来源
2006 3RD ANNUAL INTERNATIONAL CONFERENCE ON MOBILE AND UBIQUITOUS SYSTEMS - WORKSHOPS | 2006年
基金
英国工程与自然科学研究理事会;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Traditional middleware primitives offer very elementary information dissemination mechanisms, which, in the case of a decentralized and dynamic network such as a mobile ad hoc network, do not offer the ability to control the information spreading. Control over information dissemination could instead be very critical especially in terms of lifetime of the network. Gossip-based communication and epidemic-style algorithms, which are based on a store and forward approach, have been proposed to obtain message dissemination with probabilistic guarantees and lower overheads. However epidemic algorithms have never been used to allow, designers to control the spreading of the information depending on the desired reliability and the network, structure. In this paper we present a middle,are,for ad hoc networking, which uses epidemic-style infornation dissemination techniques to tune the reliability of the communication in mobile ad hoc networks. The approach is based on recent results of complex networks theory; the novelty of our idea resides in the evaluation and the exploitation of the structure of the underlying network for the automatic tuning of the dissemination process and its use in the design of the API offered by the middleware. We present a detailed analytical model supported by several simulation results.
引用
收藏
页码:179 / +
页数:2
相关论文
共 50 条
  • [21] An adaptive epidemic broadcast mechanism for mobile ad hoc networks
    Liu, Zhen-Yu
    Kwiatkowska, Marta
    Lei, Kai
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 3651 - +
  • [22] A protocol for data dissemination in frequently partitioned mobile ad hoc networks
    Hähner, J
    Becker, C
    Rothermel, K
    EIGHTH IEEE INTERNATIONAL SYMPOSIUM ON COMPUTERS AND COMMUNICATION, VOLS I AND II, PROCEEDINGS, 2003, : 633 - 640
  • [23] Dissemination in Opportunistic Mobile Ad-hoc Networks: the Power of the Crowd
    Zyba, Gjergji
    Voelker, Geoffrey M.
    Ioannidis, Stratis
    Diot, Christophe
    2011 PROCEEDINGS IEEE INFOCOM, 2011, : 1179 - 1187
  • [24] Efficient and Reliable Dissemination in Mobile Ad Hoc Networks by Location Extrapolation
    Agbaria, Adnan
    Hugerat, Muhamad
    Friedman, Roy
    JOURNAL OF COMPUTER NETWORKS AND COMMUNICATIONS, 2011, 2011
  • [25] Epidemic algorithms for reliable and efficient information dissemination in vehicular ad hoc networks
    Nekovee, M.
    IET INTELLIGENT TRANSPORT SYSTEMS, 2009, 3 (02) : 104 - 110
  • [26] An agile approach to distributed information dissemination in mobile ad hoc networks
    Bauer, N
    Colagrosso, M
    Camp, T
    SIXTH IEEE INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS MOBILE AND MULTIMEDIA NETWORKS, PROCEEDINGS, 2005, : 131 - 141
  • [27] Middleware support for service discovery in special operations mobile ad hoc networks
    Gadallah, Yasser
    Serhani, Mohamed Adel
    Mohamed, Nader
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2010, 33 (05) : 611 - 619
  • [28] Enhanced cross-layer based middleware for mobile ad hoc networks
    Denko, Mieso K.
    Shakshuki, Elhadi
    Malik, Haroon
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2009, 32 (02) : 490 - 499
  • [29] A middleware for mobile spontaneous short-range ad-hoc networks
    Fernandes Palmeira Filho, Antonio Sa
    da Silva e Silva, Francisco Jos
    WET ICE 2007: 16TH IEEE INTERNATIONAL WORKSHOPS ON ENABLING TECHNOLOGIES: INFRASTRUCTURE FOR COLLABORATIVE ENTERPRISES, PROCEEDINGS, 2007, : 192 - 197
  • [30] Epidemic Spread in Mobile Ad Hoc Networks: Determining the Tipping Point
    Valler, Nicholas C.
    Prakash, B. Aditya
    Tong, Hanghang
    Faloutsos, Michalis
    Faloutsos, Christos
    NETWORKING 2011, PT I, 2011, 6640 : 266 - 280