Spelling suggestions: "subject:"mest networks""
121 |
Uma nova métrica para protocolos de roteamento em redes em malha sem fio. / A New Metric for Routing Protocols in Wireless Mesh Networks.Dalbert Matos Mascarenhas 30 October 2008 (has links)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Este trabalho propõe uma nova métrica denominada AP (Alternative Path), a ser utilizada para o cálculo de rotas em protocolos de roteamento em redes em malha sem fio. Esta métrica leva em consideração a interferência causada por nós vizinhos na escolha de uma rota para um destino. O desempenho da métrica AP é avaliado e comparado com o da métrica ETX (Expected Transmission Count) e com o da métrica número de saltos (Hop Count). As simulações realizadas mostram que a métrica AP pode propiciar desempenho superior à rede quando comparada com as outras duas métricas. A métrica AP apresenta melhor desempenho em cenários com maior diversidade de caminhos alternativos. / This work proposes a new metric, AP (Alternative Path), to be used in the calculation of routes in wireless mesh network routing protocols. This new metric takes into account the interference caused by neighbor nodes when choosing a route for a destination. The performance of the AP metric is evaluated and compared to the ETX (Expected Transmission Count) and Hop count metrics. Simulations show that AP can provide superior performance to the network when compared with the other two metrics. The AP metric shows a better performance in networks with a wider variety of alternative paths.
|
122 |
AIGA: um ambiente integrado de ger?ncia para redes em malha sem fio IEEE 802.11s / AIGA: A Management Integrated Environmental for Wireless Mesh Networks IEEE 802.11sCarvalho, Dhiego Fernandes 31 March 2014 (has links)
Made available in DSpace on 2014-12-17T15:48:09Z (GMT). No. of bitstreams: 1
DhiegoFC_DISSERT.pdf: 2315369 bytes, checksum: 0b56b1d402d2c768528a0bcc9847d87f (MD5)
Previous issue date: 2014-03-31 / Conselho Nacional de Desenvolvimento Cient?fico e Tecnol?gico / A Wireless Mesh Network (WMN - Wireless Mesh Network) IEEE 802.11s standard to become
operational it is necessary to configure the parameters that meet the demands of its users, as
regards, for example, the frequency channels, the power antennas, IPs addresses, meshID,
topology, among others. This configuration can be done via a CLI (Command - Line Interface) or a
remote interface provided by the equipment manufacturer, both are not standardized and
homogeneous, like black boxes for the developers, a factor that hinders its operation and
standardization. The WMN, as a new standard, is still in the testing phase, and tests are necessary
to evaluate the performance of Path Discovery Protocol, as in this case of HWMP (Hybrid Wireless
Mesh Protocol), which still has many shortcomings. The configuration and test creation in a WMN
are not trivial and require a large workload. For these reasons this work presents the AIGA, a
Management Integrated Environment for WMN IEEE 802.11s, which aims to manage and perform
testbeds for analyzes of new Path Discovery Protocols in a WMN / Por serem redes com diversas caracter?sticas interessantes como auto-organiza??o e
toler?ncia a falhas, as Wireless Mesh Networks (WMN) vem sendo estudadas a bastante tempo pela
comunidade cient?fica. Muitos desses estudos tipicamente s?o conduzidos utilizando redes em
ambientes controlados conhecidos como testbeds. Al?m disso, ap?s a conclus?o do processo de
padroniza??o do IEEE 802.11s as WMN baseadas nessa tecnologia vem sendo cada vez mais
utilizadas como redes de produ??o nas organiza??es. Como s?o redes bastante flex?veis no que diz
respeito ao seu modo de opera??o, pois suportam um elevado n?mero de par?metros de
configura??o, a tarefa de gerenciamento dessas redes tende a ser muito complexa. N?o existe uma
configura??o ideal que atenda a qualquer cen?rio, sendo preciso identificar o conjunto de valores
que oferecem o melhor desempenho para cada caso. Desse modo, ap?s a configura??o da rede ?
importante verificar se ela se comporta conforme esperado. Para isso, ? necess?rio injetar tr?fego na
rede e monitorar seu comportamento. Este trabalho prop?e o AIGA, um Ambiente Integrado de
Ger?ncia para Redes em Malha Sem Fio IEEE 802.11s, que facilita o gerenciamento de WMNs de
produ??o bem como da utiliza??o de testbeds para realiza??o de experimentos
|
123 |
Uma nova métrica para protocolos de roteamento em redes em malha sem fio. / A New Metric for Routing Protocols in Wireless Mesh Networks.Dalbert Matos Mascarenhas 30 October 2008 (has links)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Este trabalho propõe uma nova métrica denominada AP (Alternative Path), a ser utilizada para o cálculo de rotas em protocolos de roteamento em redes em malha sem fio. Esta métrica leva em consideração a interferência causada por nós vizinhos na escolha de uma rota para um destino. O desempenho da métrica AP é avaliado e comparado com o da métrica ETX (Expected Transmission Count) e com o da métrica número de saltos (Hop Count). As simulações realizadas mostram que a métrica AP pode propiciar desempenho superior à rede quando comparada com as outras duas métricas. A métrica AP apresenta melhor desempenho em cenários com maior diversidade de caminhos alternativos. / This work proposes a new metric, AP (Alternative Path), to be used in the calculation of routes in wireless mesh network routing protocols. This new metric takes into account the interference caused by neighbor nodes when choosing a route for a destination. The performance of the AP metric is evaluated and compared to the ETX (Expected Transmission Count) and Hop count metrics. Simulations show that AP can provide superior performance to the network when compared with the other two metrics. The AP metric shows a better performance in networks with a wider variety of alternative paths.
|
124 |
MLSD: um protocolo de divulgação de estados dos enlaces para redes em malha sem fio infraestruturadasPorto, Daniel Charles Ferreira 26 March 2010 (has links)
Made available in DSpace on 2015-05-14T12:36:57Z (GMT). No. of bitstreams: 1
arquivototal.pdf: 2319492 bytes, checksum: 7322dcd074c1c36c3d7750aad585ca51 (MD5)
Previous issue date: 2010-03-26 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / The increasing popularity and demand of wireless networks, over the past few years, has led to new challenges that stimulate the development of technology to build better standards and protocols. In such a context arises the Wireless Mesh Networks (WMN) which are low cost, self-organized and self-configurable networks that are easy to deploy and are fault tolerant. The WMN are aiming to achieve better performance, greater reliability and flexibility when compared to other wireless networks. These networks can provide an infrastructure consisting of dedicated devices for routing, strategically placed to achieve adequate coverage, providing connectivity within the coverage area for mobile clients. Therefore, these networks need to adapt to topology changes that can occur at any time. To allow this adjustment a routing protocol is required. An important component of a proactive routing protocol is a network topology discovery protocol, which disseminates link-state updates messages over the network. The proactive protocols usually have a high message overhead. However, a high message overhead has a major impact on the performance of a routing protocol and can lead to scalability problems. In such a context, the main contribution of this work is to build a reliable link-state dissemination protocol, called MLSD specially designed for RMSF whose goals are to reduce the messages overhead and reduce the total messages sent to advertise topology changes. / O aumento da popularidade e da demanda das redes sem fio ao longo dos últimos anos tem levado a novos desafios que estimulam o desenvolvimento da tecnologia na busca de melhores padrões e protocolos. Neste contexto, surgem as Redes em Malha Sem Fio - RMSF (Wireless Mesh Networks WMN), que são redes de baixo custo, que tem a capacidade de se organizar e se configurar automaticamente, de fácil implantação e com capacidade de tolerância a falhas. As RMSFs buscam alcançar melhor desempenho, maior confiabilidade e flexibilidade quando comparadas a outras redes sem fio. Estas redes podem fornecer uma infraestrutura formada por dispositivos dedicados à tarefa de roteamento, com seu posicionamento planejado para obter cobertura satisfatória, proporcionando conectividade dentro da área de cobertura para os clientes móveis. Por isto, estas redes precisam se adaptar a alterações de topologia, que podem ocorrer a todo o momento. Para permitir esta adaptação é necessário um protocolo de roteamento. Um componente importante de um protocolo de roteamento proativo é um protocolo de descoberta de topologia da rede, no qual as modificações na topologia da rede são divulgadas através de mensagens de atualização. Entretanto, protocolos proativos possuem uma alta carga de mensagens. Uma carga elevada de mensagens tem grande impacto no desempenho do protocolo de roteamento e podem levar a problemas de escalabilidade. Neste contexto, a principal contribuição deste trabalho é a construção de um protocolo de divulgação dos estados dos enlaces com garantia de entrega, chamado Mesh Network Link State Dissemination Protocol - MLSD, projetado para RMSFs, cujos objetivos são reduzir a carga de mensagens de atualização na rede e reduzir o total de mensagens enviadas para divulgar as atualizações.
|
125 |
Otimização do posicionamento de concentradores GPRS em redes elétricas inteligentes utilizando programação linear e teoria de filas / Positioning optmization of GPRS concentrators in smart grids using linear programming and queuing theorySouza, Gustavo Batista de Castro 17 July 2014 (has links)
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2015-01-13T10:55:38Z
No. of bitstreams: 2
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Dissertação - Gustavo Batista de Castro Souza - 2014.pdf: 11760996 bytes, checksum: 8245af285d79ff9e8079bafddb72e690 (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2015-01-13T10:56:54Z (GMT) No. of bitstreams: 2
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Dissertação - Gustavo Batista de Castro Souza - 2014.pdf: 11760996 bytes, checksum: 8245af285d79ff9e8079bafddb72e690 (MD5) / Made available in DSpace on 2015-01-13T10:56:54Z (GMT). No. of bitstreams: 2
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Dissertação - Gustavo Batista de Castro Souza - 2014.pdf: 11760996 bytes, checksum: 8245af285d79ff9e8079bafddb72e690 (MD5)
Previous issue date: 2014-07-17 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / Smart Grids systems have become widespread around the world. The RF mesh communication
systems have contributed to make power systems smarter and reliable with
implementation of Distributed Automation and Demand Response technologies. This work
presents a methodology for positioning of GPRS concentrators in a energy meter ZigBee
mesh network in order to attain the average network delay, thus aiming to improve the
performance of the communication service. The proposed algorithm determines the amount
and placement of concentrators using Integer Linear Programming and a Queuing Model
for the Mesh Network. The solutions given by the proposed algorithm are validated by
verifying the network performance through computer simulations based on real network
scenarios. / Smart Grids tem se difundido em todo o mundo. Sistemas de comunicação RF Mesh (em
malha) tem contribuído para deixar sistemas de potência mais inteligentes e confiáveis com
a implantação de tecnolgias de Automação da Distribuição e Resposta à Demanda. Este
trabalho apresenta um metodologia de posicionamento de concentradores GPRS em uma
rede ZigBee mesh de medidores de energia elétrica com o objetivo de limitar o delay médio
da rede e assim otimizar o desempenho do serviço de comunicação. O algoritmo proposto
determina a quantidade e a localização de concentradores utilizando Programação Linear
Inteira e um Modelo de Filas para Redes Mesh. As soluções obtidas pelo algoritmo proposto
são validadas verificando o desempenho da rede através de simulações computacionais
baseadas em cenários reais de redes.
|
126 |
Comparative Analysis of Performance Routing Metrics for Multi-radio Wireless Mesh NetworksIvo, Akum Nji January 2008 (has links)
Traditional Ad Hoc network wireless communication in the past years have contributed tremendously to the dawn of wireless mesh networks (WMNs) which have so far been able to provide a significant improvement in capacity and scalability. Routing metrics which form the basic element for the routing protocol in this innovative communication technology is a call for concern as they must take into consideration the wireless medium network characteristics in order to provide a optimum appreciable QoS performance. In the past many single-radio routing metrics have been proposed for Ad Hoc networks which are not compatible with the multi-radio routing scenario demanded by WMNs. In our work, we provide a comparative analysis of most recently proposed multi-radio routing metrics for WMNs. We begin by providing an overview of the features of a wireless mesh network thereby presenting a better understanding of some of the research challenges of WMNs. Also, since single-radio routing forms the basis of multi-radio routing, we in this regard provide a review of some single-radio routing metrics. In our comparative analysis, an overview of routing protocols for WMNs is provided enabling an understanding of the demands to be included in a routing metric to ensure efficient routing in WMNs since different routing protocols may impose different demands; we then identify the requirements of multi-radio routing metrics from which we base our comparative analysis.
|
127 |
Enabling Multimedia Services over Wireless Multi-Hop NetworksCavalcanti de Castro, Marcel January 2009 (has links)
With the constant development of wireless technologies, the usageof wireless devices tends to increase even more in the future.Wireless multi-hop networks (WMNs) have emerged as a keytechnology to numerous potential scenarios, ranging from disasterrecovery to wireless broadband internet access. The distributedarchitecture of WMNs enables nodes to cooperatively relay othernode's packets. Because of their advantages over other wirelessnetworks, WMNs are undergoing rapid progress and inspiringnumerous applications. However, many technical issues still existin this field. In this thesis we investigate how Voice over IP(VoIP) and peer-to-peer (P2P) application are influenced bywireless multi-hop network characteristics and how to optimizethem in order to provide scalable communication.We first consider the deployment of VoIP service in wirelessmulti-hop networks, by using the Session Initiation Protocol (SIP)architecture. Our investigation shows that the centralized SIParchitecture imposes several challenges when deployed in thedecentralized wireless multi-hop environment. We find that VoIPquality metrics are severely degraded as the traffic and number ofmultiple hops to the gateway increase. In the context ofscalability, we further propose four alternative approaches whichavoid current limitations.In the second part of this thesis we tackle the network capacityproblem while providing scalable VoIP service over wirelessmulti-hop networks. The performance evaluation shows the influenceof intra and inter-flow interference in channel utilization, whichdirect impacts the VoIP capacity. In order to avoid the small VoIPpacket overhead, we propose a new adaptive hop-by-hop packetaggregation scheme based on wireless link characteristics. Ourperformance evaluation shows that the proposed scheme can increasethe VoIP capacity by a two-fold gain.The study of peer-to-peer applicability over wireless multi-hopnetworks is another important contribution. A resource lookupapplication is realized through structured P2P overlay. We showthat due to several reasons, such as characteristics of wirelesslinks, multi-hop forwarding operation, and structured P2Pmanagement traffic aggressiveness the performance of traditionalP2P applications is rather low in wireless multi-hop environments.Therefore, we suggested that a trade-off between the P2P lookupefficiency and the P2P management traffic overhead can be achievedwhile maintaining the overlay network consistency in wirelessmulti-hop networks.
|
128 |
Performance evaluation of routing protocols for Wireless Mesh NetworksMarinis Artelaris, Spyridon January 2016 (has links)
Wireless Mesh Networks provide an organisation or a community with the means to extend or create a network independent of infrastructure. However, the network’s dynamic topology along with the fact that devices in the network might be mobile and move randomly, brings tolight various kind of problems on the network, with the most common being the routing. In this report, the problem of routing is examined in terms of throughput, routing overhead, end-to-end delay and packet delivery ratio on two chosen algorithms, namely the Dynamic MANET On-demand (DYMO) and the Better Approach To Mobile Adhoc Networking (B.A.T.M.A.N.). Furthermore, this thesis examines also a Transmission Control Protocol (TCP) connection and compares it against several TCP congestion control mechanisms, two of which, were implemented, namely TCP-Illinois and TCP-FIT, to address the effects that different TCP congestion mechanisms have on an ad-hoc network, when reliable connections are needed. The results show that DYMO is more stable, performs good overall and has the lowest routing overhead, however in a situation with limited mobility or no mobility (as in high mobility they perform poorly) proactive protocols like B.A.T.M.A.N. are worthy protocols, should the extra penalty of routing overhead in the network traffic is not causing any problems. Furthermore, regarding the TCP results, it was observed that TCP congestion algorithms designed specifically for Wireless networks, do offer better performance and should be considered, when designing an ad-hoc network.
|
129 |
Hybrid evolutionary routing optimisation for wireless sensor mesh networksRahat, Alma As-Aad Mohammad January 2015 (has links)
Battery powered wireless sensors are widely used in industrial and regulatory monitoring applications. This is primarily due to the ease of installation and the ability to monitor areas that are difficult to access. Additionally, they can be left unattended for long periods of time. However, there are many challenges to successful deployments of wireless sensor networks (WSNs). In this thesis we draw attention to two major challenges. Firstly, with a view to extending network range, modern WSNs use mesh network topologies, where data is sent either directly or by relaying data from node-to-node en route to the central base station. The additional load of relaying other nodes’ data is expensive in terms of energy consumption, and depending on the routes taken some nodes may be heavily loaded. Hence, it is crucial to locate routes that achieve energy efficiency in the network and extend the time before the first node exhausts its battery, thus improving the network lifetime. Secondly, WSNs operate in a dynamic radio environment. With changing conditions, such as modified buildings or the passage of people, links may fail and data will be lost as a consequence. Therefore in addition to finding energy efficient routes, it is important to locate combinations of routes that are robust to the failure of radio links. Dealing with these challenges presents a routing optimisation problem with multiple objectives: find good routes to ensure energy efficiency, extend network lifetime and improve robustness. This is however an NP-hard problem, and thus polynomial time algorithms to solve this problem are unavailable. Therefore we propose hybrid evolutionary approaches to approximate the optimal trade-offs between these objectives. In our approach, we use novel search space pruning methods for network graphs, based on k-shortest paths, partially and edge disjoint paths, and graph reduction to combat the combinatorial explosion in search space size and consequently conduct rapid optimisation. The proposed methods can successfully approximate optimal Pareto fronts. The estimated fronts contain a wide range of robust and energy efficient routes. The fronts typically also include solutions with a network lifetime close to the optimal lifetime if the number of routes per nodes were unconstrained. These methods are demonstrated in a real network deployed at the Victoria & Albert Museum, London, UK.
|
130 |
Estimação da capacidade de redes sem fio do tipo Mesh / Capacity estimation of wireless mesh networksMuñoz Gallego, David Alfonso 30 November 2005 (has links)
Orientador: Paulo Cardieri / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-07T23:43:16Z (GMT). No. of bitstreams: 1
MunozGallego_DavidAlfonso_M.pdf: 701198 bytes, checksum: b2030ec2292717eca9c4a897402834ab (MD5)
Previous issue date: 2005 / Resumo: Este trabalho apresenta uma estimação da capacidade das redes sem fio tipo Mesh. As redes deste tipo têm topologias e padrões de tráfego únicos que as diferenciam das redes sem fio convencionais. Nas redes sem fio tipo mesh os nós atuam como clientes e como servidores e o tráfego e encaminhado para uma ou várias gateways em um modo multi-salto. A estimação da capacidade é baseada em estudos da Camada Física e MAC. Efeitos da propagação do canal são avaliados / Abstract: This work addresses the capacity of wireless mesh networks (WMN). This kind of networks has unique topologies and traffic patterns that differentiate them from conventional wireless networks. In WMN, the nodes act as clients and hosts and the traffic is forwarded to one or more gateways in a multihop fashion. The capacity estimation presented in this work is based on the physical and link layer investigation, using computer simulation / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica
|
Page generated in 0.0657 seconds