Minimum power multicasting in wireless networks under probabilistic node failures

János Barta*, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki

*المؤلف المقابل لهذا العمل

نتاج البحث: المساهمة في مجلةArticleمراجعة النظراء

1 اقتباس (Scopus)


In this paper we deal with a probabilistic extension of the minimum power multicast (MPM) problem for wireless networks. The deterministic MPM problem consists in assigning transmission powers to the nodes, so that a multihop connection can be established between a source and a given set of destination nodes and the total power required is minimized. We present an extension to the basic problem, where node failure probabilities for the transmission are explicitly considered. This model reflects the necessity of taking uncertainty into account in the availability of the hosts. The novelty of the probabilistic minimum power multicast (PMPM) problem treated in this paper consists in the minimization of the assigned transmission powers, imposing at the same time a global reliability level to the solution network. An integer linear programming formulation for the PMPM problem is presented. Furthermore, an exact algorithm based on an iterative row and column generation procedure, as well as a heuristic method are proposed. Computational experiments are finally presented.

اللغة الأصليةEnglish
الصفحات (من إلى)193-212
عدد الصفحات20
دوريةComputational Optimization and Applications
مستوى الصوت49
رقم الإصدار1
المعرِّفات الرقمية للأشياء
حالة النشرPublished - مايو 2011

ASJC Scopus subject areas

  • ???subjectarea.asjc.2600.2606???
  • ???subjectarea.asjc.2600.2605???
  • ???subjectarea.asjc.2600.2604???


أدرس بدقة موضوعات البحث “Minimum power multicasting in wireless networks under probabilistic node failures'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا