Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/11051
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAgathos, S.en
dc.contributor.authorPapapetrou, E.en
dc.date.accessioned2015-11-24T17:02:25Z-
dc.date.available2015-11-24T17:02:25Z-
dc.identifier.issn1751-8628-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/11051-
dc.rightsDefault Licence-
dc.subjectwireless networksen
dc.subjectdominating setsen
dc.subjectprotocolsen
dc.titleEfficient broadcasting using packet history in mobile ad hoc networksen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.primaryDOI 10.1049/iet-com.2010.0259-
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate2011-
heal.abstractBroadcasting is a key component of several networking mechanisms in mobile ad hoc networks. However, its traditional implementation suffers from resource consumption caused by message redundancy. Several efficient algorithms have been proposed to tackle this problem. Among them, the class of algorithms that construct on-demand a connected dominating set, known as dominant pruning, yields an improved performance. Dominant pruning algorithms capitalise on neighbourhood information and the previous hop of the broadcast message in order to minimise the set of nodes that forward a message. The proposed algorithm makes the observation that all the nodes, visited by a broadcast message, may be exploited in order to minimise the cost of broadcasting. The analysis of the proposed algorithm as well as extensive simulation results confirm the rationale behind the proposed approach and prove the performance gains.en
heal.journalNameIet Communicationsen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)



This item is licensed under a Creative Commons License Creative Commons