╨╧рб▒с>■  &(■   %                                                                                                                                                                                                                                                                                                                                                                                                                                                ье┴)`Ё┐ybjbjWwWw455y      д(ММММ Ш (Юю░░░░░ЛЛЛ$МhЇ ьCЛЛЛЛЛC░░█X┼┼┼Л░░┼Л┼┼┼░д ЁБ№┴╬Мз ┼ n0Ю┼р ▒ р ┼┼р ┘8ЛЛ┼ЛЛЛЛЛCC╗ ЛЛЛЮЛЛЛЛ(((dМ(((М(((     Multihop wireless networks are employed in a wide range of scenarios and environments. They are used for mobile networks, ad hoc wireless access networks, and sensor networks. Routing is a core function in this kind of network due to the possible existence of multiple paths between any pair of nodes. Differently from wired networks, though, the quality of a path is not determined only by the individual links' qualities and the state of intermediate nodes' buffers. Given the shared nature of the wireless medium, the performance of a path may be affected by the usage of other links, further complicating the problem of finding the optimal routes. This phenomenon, in which the performance of a link or path is affected by the simultaneous usage of other links, is known as self interference. A technique that has already been studied in the literature and has the potential to mitigate self interference is network coding. Through the employment of this technique, network nodes can combine distinct packets into a single message of similar size, reducing the number of transmissions required to establish a certain communication. The goal of this thesis is to study the self interference problem from the standpoint of route selection in multihop wireless networks. Specifically, this thesis introduces a novel method for selecting routes that takes into account the self interference between network flows, as well as the possibility of employing network coding to mitigate this issue. Differently from other proposals found in the literature, this method employs an approach that uses a global view of the network flows, in contrast with the traditional route selection algorithms that analyze each flow separately. The proposed method was implemented in both simulated and real environments. Experiments on simulated environments demonstrate the ability of our mechanism to finding alternative path sets that result in gains up to 90% in terms of aggregated throughput. On the other hand, tests on the real environment show that the method is viable in practice, even when implemented on off-the-shelf equipment with severe processing and memory constraints. IJ[\ЪЫ┌█  g h ╖ ╕   S T Я а э ю   d e л м √ № L M o p ║ ╗ X Y г д ы ь :;НО╗╜  NOЫЬьэ12xyч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╤ч╞hд"┌h∙┼mH sH *hд"┌CJOJPJQJaJmH nHsH tH0hд"┌hд"┌CJOJPJQJaJmH nHsH tH> ╜yЄЄЄ $dЁдa$gdд"┌y¤21Рh:p$rя░В. ░╞A!░е"░е#РЙ$РЙ%░░─░─ Р─ЖЬШЮЮЮЮЮЮЮЮ666666666vvvvvvvvv666666>666666666666666666666666666и6666666666╕666666666666hH66666666666666666666666666666666666666666666666666666666666666666░6J@ё J $rяNormal dд╚CJ_HaJmHsHtH >AЄ б> Fonte parсg. padrуoTiє │T 0 Tabela normalЎ4╓ l4╓aЎ ,kЇ ┴, 0 Sem lista d^Єd д"┌0 Normal (Web)dЁдdдd[$\$CJOJPJQJ^JaJtHy    ╜{╚С08А╚С0А╚С0Аy y y Ё8Ё@ё   АААўЁТЁЁ0Ё( Ё ЁЁB ЁS Ё┐╦  ?Ё▄ф{{{{6/э0х═-b[vzNDА$╗∙┼д"┌$rя{ @АP[1yP@  Unknown            GРЗz А Times New Roman5РАSymbol3&Р Зz А Arial7&Ряа{ @ЯCalibri"qИЁ─й#з#зR'РR'сЁеЙ┤┤ББr4uu2ГЁ№¤HX)Ё $Pф                     д"┌2  UMultihop wireless networks are employed in a wide range of scenarios and environmentsdiegoviviane■ рЕЯЄ∙OhлС+'│┘0мИРЁ№ , <H h t АМФЬдфXMultihop wireless networks are employed in a wide range of scenarios and environmentsdiego Normal.dotviviane2Microsoft Office Word@@lщ┴╬@lщ┴╬R'■ ╒═╒Ь.УЧ+,∙о0@ hp|ДМФ Ьдм┤ ╝ фu' VMultihop wireless networks are employed in a wide range of scenarios and environments Tэtulo ■   ■   ■    !"#$■   ¤   '■   ■   ■                                                                                                                                                                                                                                                                                                                                                           Root Entry         └FЁОГ№┴╬)А1Table         WordDocument        4SummaryInformation(    DocumentSummaryInformation8            CompObj            u                        ■                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           ■       └F#Documento do Microsoft Office Word MSWordDocWord.Document.8Ї9▓q