7 research outputs found

    Improving availability of mobile networks using a cluster routing protocol with redundant cluster head

    Get PDF
    We show a cluster based routing protocol in order to improve the convergence of the clusters and of the network it is proposed to use a backup cluster head. The use of a event discrete simulator is used for the implementation and the simulation of a hierarchical routing protocol called the Backup Cluster Head Protocol (BCHP). Finally it is shown that the BCHP protocol improves the convergence and availability of the network through a comparative analysis with the Ad Hoc On Demand Distance Vector (AODV)[1] routing protocol and Cluster Based Routing Protocol (CBRP)[2

    Behavior of Ad Hoc routing protocols, analyzed for emergency and rescue scenarios, on a real urban area

    Get PDF
    A mobile Ad Hoc network (MANET) is a collection of wireless mobile nodes that can dynamically configure a network without a fixed infrastructure or central administration. This makes it ideal for emergency and rescue scenarios, where sharing information is essential and should occur as soon as possible. This article discusses which of the routing strategies for mobile MANETs: proactive, reactive or hierarchical, has a better performance in such scenarios. By selecting a real urban area for the emergency and rescue scenario, we calculated the density of nodes and the mobility model needed for the validation study of AODV, DSDV and CBRP in the routing model. The NS2 simulator has been used for our study. We also show that the hierarchical routing strategies are better suited for this type of scenarios

    Encaminhamento confiável e energeticamente eficiente para redes ad hoc

    Get PDF
    Doutoramento em InformáticaIn Mobile Ad hoc NETworks (MANETs), where cooperative behaviour is mandatory, there is a high probability for some nodes to become overloaded with packet forwarding operations in order to support neighbor data exchange. This altruistic behaviour leads to an unbalanced load in the network in terms of traffic and energy consumption. In such scenarios, mobile nodes can benefit from the use of energy efficient and traffic fitting routing protocol that better suits the limited battery capacity and throughput limitation of the network. This PhD work focuses on proposing energy efficient and load balanced routing protocols for ad hoc networks. Where most of the existing routing protocols simply consider the path length metric when choosing the best route between a source and a destination node, in our proposed mechanism, nodes are able to find several routes for each pair of source and destination nodes and select the best route according to energy and traffic parameters, effectively extending the lifespan of the network. Our results show that by applying this novel mechanism, current flat ad hoc routing protocols can achieve higher energy efficiency and load balancing. Also, due to the broadcast nature of the wireless channels in ad hoc networks, other technique such as Network Coding (NC) looks promising for energy efficiency. NC can reduce the number of transmissions, number of re-transmissions, and increase the data transfer rate that directly translates to energy efficiency. However, due to the need to access foreign nodes for coding and forwarding packets, NC needs a mitigation technique against unauthorized accesses and packet corruption. Therefore, we proposed different mechanisms for handling these security attacks by, in particular by serially concatenating codes to support reliability in ad hoc network. As a solution to this problem, we explored a new security framework that proposes an additional degree of protection against eavesdropping attackers based on using concatenated encoding. Therefore, malicious intermediate nodes will find it computationally intractable to decode the transitive packets. We also adopted another code that uses Luby Transform (LT) as a pre-coding code for NC. Primarily being designed for security applications, this code enables the sink nodes to recover corrupted packets even in the presence of byzantine attacks.Nas redes móveis ad hoc (MANETs), onde o comportamento cooperativo é obrigatório, existe uma elevada probabilidade de alguns nós ficarem sobrecarregados nas operações de encaminhamento de pacotes no apoio à troca de dados com nós vizinhos. Este comportamento altruísta leva a uma sobrecarga desequilibrada em termos de tráfego e de consumo de energia. Nestes cenários, os nós móveis poderão beneficiar do uso da eficiência energética e de protocolo de encaminhamento de tráfego que melhor se adapte à sua capacidade limitada da bateria e velocidade de processamento. Este trabalho de doutoramento centra-se em propor um uso eficiente da energia e protocolos de encaminhamento para balanceamento de carga nas redes ad hoc. Actualmente a maioria dos protocolos de encaminhamento existentes considera simplesmente a métrica da extensão do caminho, ou seja o número de nós, para a escolha da melhor rota entre fonte (S) e um nó de destino (D); no mecanismo aqui proposto os nós são capazes de encontrar várias rotas por cada par de nós de origem e destino e seleccionar o melhor caminho segundo a energia e parâmetros de tráfego, aumentando o tempo de vida útil da rede. Os nossos resultados mostram que pela aplicação deste novo mecanismo, os protocolos de encaminhamento ad hoc actuais podem alcançar uma maior eficiência energética e balanceamento de carga. Para além disso, devido à natureza de difusão dos canais sem fio em redes ad-hoc, outras técnicas, tais como a Codificação de Rede (NC), parecem ser também promissoras para a eficiência energética. NC pode reduzir o número de transmissões, e número de retransmissões e aumentar a taxa de transferência de dados traduzindo-se directamente na melhoria da eficiência energética. No entanto, devido ao acesso dos nós intermediários aos pacotes em trânsito e sua codificação, NC necessita de uma técnica que limite as acessos não autorizados e a corrupção dos pacotes. Explorou-se o mecanismo de forma a oferecer um novo método de segurança que propõe um grau adicional de protecção contra ataques e invasões. Por conseguinte, os nós intermediários mal-intencionados irão encontrar pacotes em trânsito computacionalmente intratáveis em termos de descodificação. Adoptou-se também outro código que usa Luby Transform (LT) como um código de précodificação no NC. Projectado inicialmente para aplicações de segurança, este código permite que os nós de destino recuperem pacotes corrompidos mesmo em presença de ataques bizantinos

    Energy-efficient cooperative resource allocation for OFDMA

    Get PDF
    Energy is increasingly becoming an exclusive commodity in next generation wireless communication systems, where even in legacy systems, the mobile operators operational expenditure is largely attributed to the energy bill. However, as the amount of mobile traffic is expected to double over the next decade as we enter the Next Generation communications era, the need to address energy efficient protocols will be a priority. Therefore, we will need to revisit the design of the mobile network in order to adopt a proactive stance towards reducing the energy consumption of the network. Future emerging communication paradigms will evolve towards Next Generation mobile networks, that will not only consider a new air interface for high broadband connectivity, but will also integrate legacy communications (LTE/LTE-A, IEEE 802.11x, among others) networks to provide a ubiquitous communication platform, and one that can host a multitude of rich services and applications. In this context, one can say that the radio access network will predominantly be OFDMA based, providing the impetus for further research studies on how this technology can be further optimized towards energy efficiency. In fact, advanced approaches towards both energy and spectral efficient design will still dominate the research agenda. Taking a step towards this direction, LTE/LTE-A (Long Term Evolution-Advanced) have already investigated cooperative paradigms such as SON (self-Organizing Networks), Network Sharing, and CoMP (Coordinated Multipoint) transmission. Although these technologies have provided promising results, some are still in their infancy and lack an interdisciplinary design approach limiting their potential gain. In this thesis, we aim to advance these future emerging paradigms from a resource allocation perspective on two accounts. In the first scenario, we address the challenge of load balancing (LB) in OFDMA networks, that is employed to redistribute the traffic load in the network to effectively use spectral resources throughout the day. We aim to reengineer the load-balancing (LB) approach through interdisciplinary design to develop an integrated energy efficient solution based on SON and network sharing, what we refer to as SO-LB (Self-Organizing Load balancing). Obtained simulation results show that by employing SO-LB algorithm in a shared network, it is possible to achieve up to 15-20% savings in energy consumption when compared to LTE-A non-shared networks. The second approach considers CoMP transmission, that is currently used to enhance cell coverage and capacity at cell edge. Legacy approaches mainly consider fundamental scheduling policies towards assigning users for CoMP transmission. We build on these scheduling approaches towards a cross-layer design that provide enhanced resource utilization, fairness, and energy saving whilst maintaining low complexity, in particular for broadband applications
    corecore