Search results for "Distributed computing"
showing 10 items of 622 documents
Continuous energy-efficient monitoring model for mobile ad hoc networks
2021
The monitoring of mobile ad hoc networks is an observation task that consists of analysing the operational status of these networks while evaluating their functionalities. In order to allow the whole network and applications to work properly, the monitoring task has become of considerable importance. It must be carried out in real-time by performing measurements, logs, configurations, etc. However, achieving continuous energy-efficient monitoring in mobile wireless networks is very challenging considering the environment features as well as the unpredictable behavior of the participating nodes. This paper outlines the challenges of continuous energy-efficient monitoring over mobile ad hoc n…
A Cluster based Sensor-Selection Scheme for Energy-Efficient Agriculture Sensor Networks
2021
Improving the energy-efficiency of remotely deployed sensor nodes in agriculture wireless networks is very challenging due to a lack of access to energy grid. Network clustering and limiting the amount of sensor data are among the various methods to improve the lifetime of these sensor nodes. In this work, an optimal sensor-selection scheme is proposed to improve the Quality of Service in clustered agriculture networks. the proposed method selects a limited number of sensor nodes to be active in each cluster. It considers the estimator performance while selecting limited sensor nodes for environmental monitoring. the optimal sensor-selection process considers the information of remaining en…
A contention-based multiple access protocol in cooperative wireless networks
2010
Cooperative communication has emerged as a promising technique to enhance system performance in wireless networks. This paper proposes a contention-based cooperative multiple medium access control protocol by means of multiple retransmissions of the same packet from different relay nodes. The proposed scheme exploits cooperative communication capability not only from time diversity derived from multiple temporal transmissions but also spatial diversity derived from distributed multiple relays. A Markov chain is introduced to analyze the throughput performance of the proposed cooperative scheme. The performance evaluation of the protocol is validated and compared with non-cooperative ARQ pro…
Resource sharing optimality in WiFi infrastructure networks
2009
In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same probability to transmit on the channel, it has been shown that unfair behaviors may emerge in actual networking scenarios. Assuming that a contending node can dynamically change its strategy, by tuning its contention parameters to non-standard values on the basis of channel observations, we prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium condi…
Performance analysis of selfish access strategies on WiFi infrastructure networks
2009
In this paper we propose a game-theoretic approach for characterizing WiFi network performance in presence of intelligent nodes employing cognitive functionalities. We assume that a cognitive WiFi node is aware of its application requirements and is able to dynamically estimate the network status, in order to dynamically change its access strategy by tuning the contention window settings. We prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium conditions, which are also Pareto optimal. Indeed, we show that the station strategies converge toward values which maximize a per-node uti…
C<sup>2</sup>SMA/CA: Enabling co-channel concurrency in WLANs using positional information
2013
An attractive approach to overcome capacity limitations in a densely deployed WLAN environment is to enable transmission concurrency. In this paper, we propose a co-channel concurrent transmission scheme, referred to as C2SMA/CA, which determines whether to allow multiple concurrent transmissions based on interference estimation using positional information. A distributed multi-link concurrency scheduling algorithm is implemented, and its performance is evaluated through extensive simulations.
MSS: A Multi-Level Data Placement Scheme for Data Survival in Wireless Sensor Networks
2009
In recently popularized unattended wireless sensor networks, sensed data are stored locally or some designated nodes for a long term and retrieved sometime by collectors on demand. Such data may be delete or modified as sensor nodes are always exposed to risks such as random failure and mobile adversary. To maximize the data survival, we propose a secure and efficient scheme - MSS. MSS makes use of hopbounded computational secret sharing to achieve fault tolerance and compromise resilience, and takes advantages of multi-level secret sharing to mitigate communication overhead and improve overall security. MSS has the most advantages in terms of security and efficiency among presented schemes…
Comparative Analysis of Different Types of Micro-grid Architectures and Controls
2018
An innovative and smart micro-grid model is an essentialfor the integration of distributed energy resources into the electrical power distribution network. There are various types of micro-grid architectures that have been designed and implemented in the last few years. These micro-grid architectures have their key advantages and limitations. This paper has been prepared with the objective to identify and address, key challenges and solutions for integration of micro-grid into the distribution network. It reviewsdifferent micro-grid architectures and control strategies which can help to address various challenges i.e. voltage imbalance, power quality, demand side management, smooth islandin…
M-GRASP: A GRASP With Memory for Latency-Aware Partitioning Methods in DVE Systems
2009
A necessary condition for providing quality of service to distributed virtual environments (DVEs) is to provide a system response below a maximum threshold to the client computers. In this sense, latency-aware partitioning methods try to provide response times below the threshold to the maximum number of client computers as possible. These partitioning methods should find an assignment of clients to servers that optimizes system throughput, system latency, and partitioning efficiency. In this paper, we present a new algorithm based on greedy randomized adaptive search procedure with memory for finding the best solutions as possible to this problem. We take into account several different alt…
Energy-Efficient M2M Communications in for Industrial Automation
2020
M2M communication with autonomous data acquisition and exchange plays a key role in realizing the “control”-oriented tactile Internet (TI) applications such as industrial automation. In this chapter, we develop a two-stage access control and resource allocation algorithm. In the first stage, we introduce a contract-based incentive mechanism to motivate some delay-tolerant machine-type communication (MTC) devices to postpone their access demands in exchange for higher access opportunities. In the second stage, a long-term cross-layer online resource allocation approach is based on Lyapunov optimization, which jointly optimizes rate control, power allocation, and channel selection without pri…