Search results for "Distributed"
showing 10 items of 1260 documents
A New Neighbour Selection Strategy for Group-Based Wireless Sensor Networks
2008
In any type of networks a neighbour selection method is needed to form the topology of the network and to know which node the information has to be sent to reach a destination. Nowadays, several selection strategies exist that are based on different aspects and mainly designed to work in common networks. In this paper we will show our study about those different methods and, then we show the development of a suitable neighbour selection strategy for group-based wireless sensor networks (WSN) that is based on a capacity parameter defined by us and the new neighbour distance. We also present the proposal architecture for WSNs and the protocol when a new node joins a group and has to select it…
A survey of wireless data center networks
2015
Data centers are becoming more and more popular for a wide variety of applications. However, the efficiency of data centers are restricted by many issues like cabling and maintenance problems in addition to performance problems like oversubscription. Wireless technology was proposed as it has the capability and the flexibility to offer feasible approaches to solve some of these problems. In this paper, we conduct a deep investigation about wireless data center networks, describe some works that enhance the performance of the network, then give some remarks and critiques. 2015 IEEE. Scopus
Link scheduling in sensor networks for asymmetric average consensus
2012
Wireless Sensor Networks constitute a recent technology where the nodes cooperate to obtain, in a totally distributed way, certain function of the sensed data. One example is the average consensus algorithm, which allows every node to converge to the global average. However, this algorithm presents two major drawbacks in practice. The first one is that instantaneous symmetric links are required, which are hard to ensure in practice because of the presence of wireless interferences. The second one is that all the nodes are required to communicate with all of their local neighbors in every iteration, which can lead to an unbounded delay. In order to solve these issues, we propose a novel link…
Achieving Fair Bandwidth Distribution in WiFi Networks: A Game Theoretical Approach
2011
International audience; Achieving fair bandwidth distribution among uplink and downlink ows in IEEE 802.11 infrastructure networks is a complex issue, due to the well-known features of the Distributed Coordination Function (DCF) which regulates the access to the shared medium. Indeed, the dynamic adaptation of the contention windows causes phenomena of short-term unfairness, while the use of homogeneous contention parameters among the contending nodes makes the aggregated downlink bandwidth equal to the uplink bandwidth of a single node. We propose a dynamic tuning of the contention parameters used by the nodes, based on simple network monitoring functionalities and rational strategies. Spe…
A methodology for evaluation of operational zones for distributed generation based on DFIG
2017
This study developed a methodology to determine zones of acceptable voltage profiles for wind power generation connected to distribution systems. Three load profiles (residential, commercial and industrial) connected to the distribution network were analyzed considering the impact on voltage levels and steady-state stability for different wind speeds and wind generator control strategies. The wind generator model is based on doubly fed induction generator (DFIG) and were developed using Matlab/Simulink. The presented methodology can be used to map the impact on operation of different types of control, the time of day and the available wind speed and it is not limited only for DFIG. The resu…
Network Reconfiguration Suitability for Scientific Applications
2008
This paper analyzes the communication pattern of several scientific applications and how they can make profit of network reconfiguration in order to adapt network topology to the communication needs so that total execution time is reduced. By using an analysis methodology based on real application executions, we study the variation of the required communication bandwidth with time and also the global interprocedural communication patterns. Results show that required bandwidth between each pair of processes does not significantly fluctuates, leading to a constant use of the links and therefore discouraging dynamic reconfigurations of the network during execution time. Nevertheless, the group…
Measurement and Modeling of the Origins of Starvation of Congestion-Controlled Flows in Wireless Mesh Networks
2009
Significant progress has been made in understanding the behavior of TCP and congestion-controlled traffic over CSMA-based multihop wireless networks. Despite these advances, however, no prior work identified severe throughput imbalances in the basic scenario of mesh networks, in which a one-hop flow contends with a two-hop flow for gateway access. In this paper, we demonstrate via real network measurements, testbed experiments, and an analytical model that starvation exists in such a scenario; i.e., the one-hop flow receives most of the bandwidth, while the two-hop flow starves. Our analytical model yields a solution consisting of a simple contention window policy that can be implemented vi…
Supporting a Pseudo-TDMA Access Scheme in Mesh Wireless Networks
2013
Wireless mesh networks appear a promising solution for pro- viding ubiquitous low-cost wireless access, but cannot rely on simple CSMA access protocols because of the critical inefficiencies that arise in topologies with hidden nodes. To overcome these limitations, some important protocol extensions based on synchronization and reservation mechanisms have been ratified. In this paper we show that an alternative approach to the standardiza- tion of new features and signaling messages for mesh networks can be the utilization of programmable nodes able to execute different MAC protocols programmed on the fly. Signaling messages are used only for disseminating the new protocol among the nodes. …
An automatic cooperative retransmission MAC protocol in Wireless Local Area Networks
2009
Existing solutions for cooperation in wireless networks either require simultaneous transmission of source and relay nodes or impose major modifications to original MAC protocols. In this paper, a new efficient retransmission MAC protocol is proposed for IEEE 802.11 based cooperation communications, with minimum modifications to the DCF scheme. Throughput and access delay performance of the proposed protocols is analyzed in error-prone and highly temporally correlated channels. Numerical results show that significant benefits can be achieved with our cooperative protocol, compared with the legacy schemes.
Making WiFi work in multi-hop topologies: Automatic negotiation and allocation of airtime
2015
We propose a solution for mitigating the performance impairments of CSMA/CA protocols in multi-hop topologies based on the dynamic adaptation of the contention process experienced by nodes in a wireless network. A distributed protocol is used to negotiate the channel airtime for a node as a function of the traffic requirements of its neighbourhood, taking into account bandwidth reserved for the control operations. A mechanism is provided for a node to tune its contention window depending on its allocated airtime. Different from previous schemes, a node's contention window is fixed in size unless the traffic requirements of its neighbourhood change. The scheme is implemented on legacy commer…