JAG: Reliable and Predictable Wireless Agreement under External Radio Interference

Wireless low-power transceivers used in sensor networks typically operate in unlicensed frequency bands that are subject to external radio interference caused by devices transmitting at much higher power.communication protocols should therefore be designed to be robust against such interference. A critical building block of many protocols at all layers is agreement on a piece of information among a set of nodes. At the MAC layer, nodes may need to agree on a new time slot or frequency channel, at the application layer nodes may need to agree on handing over a leader role from one node to another. Message loss caused by interference may break agreement in two different ways: none of the nodes uses the new information (time slot, channel, leader) and sticks with the previous assignment, or-even worse-some nodes use the new information and some do not. This may lead to reduced performance or failures. In this paper, we investigate the problem of agreement under external radio interference and point out the limitations of traditional message-based approaches. We propose JAG, a novel protocol that uses jamming instead of message transmissions to make sure that two neighbouring nodes agree, and show that it outperforms message-based approaches in terms of agreement probability, energy consumption, and time-to-completion. We further show that JAG can be used to obtain performance guarantees and meet the requirements of applications with real-time constraints.CONETReSens

A novel nomadic people optimizer-based energy-efficient routing for WBAN

In response to user demand for wearable devices, several WBAN deployments now call for effective communication processes for remote data monitoring in real time. Using sensor networks, intelligent wearable devices have exchanged data that has benefited in the evaluation of possible security hazards. If smart wearables in sensor networks use an excessive amount of power during data transmission, both network lifetime and data transmission performance may suffer. Despite the network's effective data transmission, smart wearable patches include data that has been combined from several sources utilizing common aggregators. Data analysis requires careful network lifespan control throughout the aggregation phase. By using the Nomadic People Optimizer-based Energy-Efficient Routing (NPO-EER) approach, which effectively allows smart wearable patches by minimizing data aggregation time and eliminating routing loops, the network lifetime has been preserved in this research. The obtained findings showed that the NPO method had a great solution. Estimated Aggregation time, Energy consumption, Delay, and throughput have all been shown to be accurate indicators of the system's performance

An Energy Efficient Self-healing Mechanism for Long Life Wireless Sensor Networks

In this paper, we provide an energy efficient self- healing mechanism for Wireless Sensor Networks. The proposed solution is based on our probabilistic sentinel scheme. To reduce energy consumption while maintaining good connectivity between sentinel nodes, we compose our solution on two main concepts, node adaptation and link adaptation. The first algorithm uses node adaptation technique and permits to distributively schedule nodes activities and select a minimum subset of active nodes (sentry) to monitor the interest region. And secondly, we in- troduce a link control algorithm to ensure better connectiv- ity between sentinel nodes while avoiding outliers appearance. Without increasing control messages overhead, performances evaluations show that our solution is scalable with a steady energy consumption. Simulations carried out also show that the proposed mechanism ensures good connectivity between sentry nodes while considerably reducing the total energy spent.Comment: 6 pages, 8 figures. arXiv admin note: text overlap with arXiv:1309.600

Energy-Efficient Self-Organization Protocols for Sensor Networks

A Wireless Sensor Network (WSN, for short) consists of a large number of very small sensor devices deployed in an area of interest for gathering and delivery information. The fundamental goal of a WSN is to produce, over an extended period of time, global information from local data obtained by individual sensors. The WSN technology will have a significant impact on a wide array of applications on the efficiency of many civilian and military applications including combat field surveillance, intrusion detection, disaster management among many others. The basic management problem in the WSN is to balance the utility of the activity in the network against the cost incurred by the network resources to perform this activity. Since the sensors are battery powered and it is impossible to change or recharge batteries after the sensors are deployed, promoting system longevity becomes one of the most important design goals instead of QoS provisioning and bandwidth efficiency. On the other hand the self-organization ability is essential for the WSN due to the fact that the sensors are randomly deployed and they work unattended. We developed a self-organization protocol, which creates a multi-hop communication infrastructure capable of utilizing the limited resources of sensors in an adaptive and efficient way. The resulting general-purpose infrastructure is robust, easy to maintain and adapts well to various application needs. Important by-products of our infrastructure include: (1) Energy efficiency: in order to save energy and to extend the longevity of the WSN sensors, which are in sleep mode most of the time. (2) Adaptivity: the infrastructure is adaptive to network size, network topology, network density and application requirement. (3) Robustness: the degree to which the infrastructure is robust and resilient. Analytical results and simulation confirmed that our self-organization protocol has a number of desirable properties and compared favorably with the leading protocols in the literature

The eventual leadership in dynamic mobile networking environments

2007-2008 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

A Prey-Predator Defence Mechanism For Ad Hoc On-Demand Distance Vector Routing Protocol

This study proposes a nature-based system survivability model. The model was simulated, and its performance was evaluated for the mobile ad hoc wireless networks. The survivability model was used to enable mobile wireless distributed systems to keep on delivering packets during their stated missions in a timely manner in the presence of attacks. A prey-predator communal defence algorithm was developed and fused with the Ad hoc On-demand Distance Vector (AODV) protocol. The mathematical equations for the proposed model were formulated using the Lotka-Volterra theory of ecology. The model deployed a security mechanism for intrusion detection in three vulnerable sections of the AODV protocol. The model simulation was performed using MATLAB for the mathematical model evaluation and using OMNET++ for protocol performance testing. The MATLAB simulation results, which used empirical and field data, have established that the adapted Lotka-Volterra-based equations adequately represent network defense using the communal algorithm. Using the number of active nodes as a measure of throughput after attack (with a maximum throughput of 250 units), the proposed model had a throughput of 230 units while under attack and the intrusion was nullified within 2 seconds. The OMNET++ results for protocol simulation that use throughput, delivery ratio, network delay, and load as performance metrics with the OMNET++ embedded datasets showed good performance of the model, which was better than the existing conventional survivability systems. The comparison of the proposed model with the existing model is also presented. The study concludes that the proposed communal defence model was effective in protecting the entire routing layer (layer 2) of the AODV protocol when exposed to diverse forms of intrusion attacks

A two-stage game theoretical approach for interference mitigation in Body-to-Body Networks

International audienceIn this paper, we identify and exploit opportunities for cooperation between a group of mobile Wireless Body Area Networks (WBANs), forming a Body-to-Body Network (BBN), through inter-body interference detection and subsequent mitigation. Thus, we consider a dynamic system composed of several BBNs and we analyze the joint mutual and cross-technology interference problem due to the utilization of a limited number of channels by different transmission technologies (i.e., ZigBee and WiFi) sharing the same radio spectrum. To this end, we propose a game theoretical approach to address the problem of Socially-aware Interference Mitigation (SIM) in BBNs, where WBANs are " social " and interact with each other. Our approach considers a two-stage channel allocation scheme: a BBN-stage for inter-WBANs' communications and a WBAN-stage for intra-WBAN communications. We demonstrate that the proposed BBN-stage and WBAN-stage games admit exact potential functions, and we develop a Best-Response (BR-SIM) algorithm that converges to Nash equilibrium points. A second algorithm, named Sub-Optimal Randomized Trials (SORT-SIM), is then proposed and compared to BR-SIM in terms of efficiency and computation time. We further compare the BR-SIM and SORT-SIM algorithms to two power control algorithms in terms of signal-to-interference ratio and aggregate interference, and show that they outperform the power control schemes in several cases. Numerical results, obtained in several realistic mobile scenarios, show that the proposed schemes are indeed efficient in optimizing the channel allocation in medium-to-large-scale BBNs

Byzantine fault-tolerant agreement protocols for wireless Ad hoc networks

Tese de doutoramento, Informática (Ciências da Computação), Universidade de Lisboa, Faculdade de Ciências, 2010.The thesis investigates the problem of fault- and intrusion-tolerant consensus in resource-constrained wireless ad hoc networks. This is a fundamental problem in distributed computing because it abstracts the need to coordinate activities among various nodes. It has been shown to be a building block for several other important distributed computing problems like state-machine replication and atomic broadcast. The thesis begins by making a thorough performance assessment of existing intrusion-tolerant consensus protocols, which shows that the performance bottlenecks of current solutions are in part related to their system modeling assumptions. Based on these results, the communication failure model is identified as a model that simultaneously captures the reality of wireless ad hoc networks and allows the design of efficient protocols. Unfortunately, the model is subject to an impossibility result stating that there is no deterministic algorithm that allows n nodes to reach agreement if more than n2 omission transmission failures can occur in a communication step. This result is valid even under strict timing assumptions (i.e., a synchronous system). The thesis applies randomization techniques in increasingly weaker variants of this model, until an efficient intrusion-tolerant consensus protocol is achieved. The first variant simplifies the problem by restricting the number of nodes that may be at the source of a transmission failure at each communication step. An algorithm is designed that tolerates f dynamic nodes at the source of faulty transmissions in a system with a total of n 3f + 1 nodes. The second variant imposes no restrictions on the pattern of transmission failures. The proposed algorithm effectively circumvents the Santoro- Widmayer impossibility result for the first time. It allows k out of n nodes to decide despite dn 2 e(nk)+k2 omission failures per communication step. This algorithm also has the interesting property of guaranteeing safety during arbitrary periods of unrestricted message loss. The final variant shares the same properties of the previous one, but relaxes the model in the sense that the system is asynchronous and that a static subset of nodes may be malicious. The obtained algorithm, called Turquois, admits f < n 3 malicious nodes, and ensures progress in communication steps where dnf 2 e(n k f) + k 2. The algorithm is subject to a comparative performance evaluation against other intrusiontolerant protocols. The results show that, as the system scales, Turquois outperforms the other protocols by more than an order of magnitude.Esta tese investiga o problema do consenso tolerante a faltas acidentais e maliciosas em redes ad hoc sem fios. Trata-se de um problema fundamental que captura a essência da coordenação em actividades envolvendo vários nós de um sistema, sendo um bloco construtor de outros importantes problemas dos sistemas distribuídos como a replicação de máquina de estados ou a difusão atómica. A tese começa por efectuar uma avaliação de desempenho a protocolos tolerantes a intrusões já existentes na literatura. Os resultados mostram que as limitações de desempenho das soluções existentes estão em parte relacionadas com o seu modelo de sistema. Baseado nestes resultados, é identificado o modelo de falhas de comunicação como um modelo que simultaneamente permite capturar o ambiente das redes ad hoc sem fios e projectar protocolos eficientes. Todavia, o modelo é restrito por um resultado de impossibilidade que afirma não existir algoritmo algum que permita a n nós chegaram a acordo num sistema que admita mais do que n2 transmissões omissas num dado passo de comunicação. Este resultado é válido mesmo sob fortes hipóteses temporais (i.e., em sistemas síncronos) A tese aplica técnicas de aleatoriedade em variantes progressivamente mais fracas do modelo até ser alcançado um protocolo eficiente e tolerante a intrusões. A primeira variante do modelo, de forma a simplificar o problema, restringe o número de nós que estão na origem de transmissões faltosas. É apresentado um algoritmo que tolera f nós dinâmicos na origem de transmissões faltosas em sistemas com um total de n 3f + 1 nós. A segunda variante do modelo não impõe quaisquer restrições no padrão de transmissões faltosas. É apresentado um algoritmo que contorna efectivamente o resultado de impossibilidade Santoro-Widmayer pela primeira vez e que permite a k de n nós efectuarem progresso nos passos de comunicação em que o número de transmissões omissas seja dn 2 e(n k) + k 2. O algoritmo possui ainda a interessante propriedade de tolerar períodos arbitrários em que o número de transmissões omissas seja superior a . A última variante do modelo partilha das mesmas características da variante anterior, mas com pressupostos mais fracos sobre o sistema. Em particular, assume-se que o sistema é assíncrono e que um subconjunto estático dos nós pode ser malicioso. O algoritmo apresentado, denominado Turquois, admite f < n 3 nós maliciosos e assegura progresso nos passos de comunicação em que dnf 2 e(n k f) + k 2. O algoritmo é sujeito a uma análise de desempenho comparativa com outros protocolos na literatura. Os resultados demonstram que, à medida que o número de nós no sistema aumenta, o desempenho do protocolo Turquois ultrapassa os restantes em mais do que uma ordem de magnitude.FC