Some valid inequalities for the probabilistic minimum power multicasting problem

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

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

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

3 اقتباسات (Scopus)

ملخص

In this paper we describe some results on the linear integer programming formulation of the Probabilistic Minimum Power Multicast (PMPM) problem for wireless networks. The PMPM problem consists in optimally assigning transmission powers to the nodes of a given network in order to establish a multihop connection between a source node and a set of destination nodes. The nodes are subject to failure with some probability, however the assignment should be made so that the reliability of the connection is above a given threshold level. This model reflects the necessity of taking into account the uncertainty of hosts' availability in a telecommunication network.

اللغة الأصليةEnglish
الصفحات (من إلى)463-470
عدد الصفحات8
دوريةElectronic Notes in Discrete Mathematics
مستوى الصوت36
رقم الإصدارC
المعرِّفات الرقمية للأشياء
حالة النشرPublished - أغسطس 2010
منشور خارجيًانعم

ASJC Scopus subject areas

  • ???subjectarea.asjc.2600.2607???
  • ???subjectarea.asjc.2600.2604???

بصمة

أدرس بدقة موضوعات البحث “Some valid inequalities for the probabilistic minimum power multicasting problem'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا