Efficient broadcasting using packet history in mobile ad hoc networks

dc.contributor.authorAgathos, S.en
dc.contributor.authorPapapetrou, E.en
dc.date.accessioned2015-11-24T16:57:30Z
dc.date.available2015-11-24T16:57:30Z
dc.identifier.issn1751-8628-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10585
dc.rightsDefault Licence-
dc.subjectwireless networksen
dc.subjectdominating setsen
dc.subjectprotocolsen
dc.titleEfficient broadcasting using packet history in mobile ad hoc networksen
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.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.identifier.primaryDOI 10.1049/iet-com.2010.0259-
heal.identifier.secondary<Go to ISI>://000296729100012-
heal.journalNameIet Communicationsen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate2011-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Χημείαςel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Αρχεία

Φάκελος/Πακέτο αδειών

Προβολή: 1 - 1 of 1
Φόρτωση...
Μικρογραφία εικόνας
Ονομα:
license.txt
Μέγεθος:
1.74 KB
Μορφότυπο:
Item-specific license agreed upon to submission
Περιγραφή: