Dynamic Architecture for Collaborative Distributed Storage of Collected Data in Fog Environments

Wireless Personal Communications - Fog computing needs, particularly in terms of performance, availability and reliability, are increasing every day due to the rapid growth in the number of...     

Improving the Quality of Mobile Learning Services

Wireless Personal Communications - The quality of services (QoS) has a key role to improve the performances of the collaborative mobile learning. However, many factors can limit it such as the...     

Analytical analysis of applying packet fragmentation mechanism on IEEE 802.11b DCF network in non ideal channel with infinite load conditions

The analytical modeling and performance analysis of the 802.11 network in all its various extensions (802.11b, 802.11a, 802.11g, 802.11e, 802.11n, etc.) have already been widely explored over the past years. However, the packet fragmentation mechanism (PFM), which is proposed by the IEEE work group to reduce the impact of bit error rate (BER) on the packet error rate (PER), has not been considered in the analytical models proposed in the literature. Yet, the PFM constitutes a key parameter to achieve the best performances of 802.11 networks. In this paper, we extend the Bianchi’s Markov chain model with the PFM and the PER. Then, we analyze the performance improvement level achieved with the PFM in an IEEE 802.11 network under the impact of BER and packet length. The proposed analysis has been applied on the basic access method of 802.11b network in saturated traffic conditions. So, we have analyzed the throughput and the mean response time of the 802.11 network. The obtained theoretical results are validated by simulation.     

Modeling and performance evaluation of the IEEE 802.15.4e LLDN mechanism designed for industrial applications in WSNs

The IEEE 802.15.4 standard has been introduced for low latency and low energy consumption in wireless sensor networks. To better support the requirements of industrial applications, where the use of this standard is limited, the low latency deterministic network (LLDN) mechanism of the IEEE 802.15.4e amendment has been proposed. In this paper, we develop a three dimensional Markov chain model for the IEEE 802.15.4e LLDN mechanism. Then, we estimate the stationary probability distribution of this chain in order to derive theoretical expressions of some performance metrics, as the reliability, energy consumption, throughput, delay and jitter. After that, we conduct a comparative study between the IEEE 802.15.4e LLDN and the IEEE 802.15.4 slotted carrier sense multiple access with collision avoidance (CSMA/CA). Numerical results show that the deterministic behavior of the LLDN mechanism significantly reduces the collision probability providing best performances in terms of reliability, energy consumption, throughput and delay compared to the IEEE 802.15.4 slotted CSMA/CA. Finally, the accuracy of our theoretical analysis is validated by Monte Carlo simulations.     

Eliminating Selective Dropping Attack in Mobile Ad Hoc Network

Wireless Personal Communications - In this paper, we propose a new reputation approach, called I-WD (improved WatchDog). We attempt to eliminate selective dropping attack that ensue when malicious...     

A new QoS aware and energy efficient opportunistic routing protocol for wireless sensor networks

Energy efficiency and Quality of Service (QoS) providing are known to be critical design concerns in routing protocols for Wireless Sensor Networks (WSNs). Recent studies, demonstrate that Opportunistic Routing (OR) can greatly improve the performance of WSNs by exploiting the broadcast nature of the wireless medium. In this paper, we propose a new QoS aware and Energy efficient Opportunistic Routing protocol (QEOR) to efficiently routing data under QoS and energy constraints for WSNs. QEOR uses a new multi-metric QoS based candidate selection method in order to accurately select and prioritise the candidate forwarders. The selection is focused on a QoS function that takes into consideration the reliabilty of buffers and links, while the prioritisation is established according to transmission delays. To achieve an obvious improvement on the energy consumption, QEOR uses an energy efficient coordination method and an implicit ACKnowledgement scheme for collision and redundancy avoidance. Simulation results show that QEOR provides best performances as compared to other OR protocols.     

Minimum Perimeter Coverage Set Based on Points of Tangency and Strong Barrier for an Extended WSN Lifetime

Wireless Personal Communications - The random deployment of sensors in the area of interest triggers several research issues. Among them, we can cite connectivity, localization and coverage. In...     

Improving the performance for task assignment in distributed server systems by partitioning the large tasks

Task Assignment in distributed server systems focuses on the policy that assigns the tasks reached these systems in order to improve the response time. These tasks, generally, have the property that there is a tiny fraction (about 3%) of the large tasks that makes half (50%) of the total load. However, this property creates additional problems: the large tasks make the load difficult to balance among the servers, and the small tasks will be delayed by the large ones when they are in the same queue. In this paper, we propose a new policy for the Web clusters that we call Partitioning Large Tasks (PLT) and which deals with these problems mostly under a high traffic demand and a high variability of task sizes. PLT partitions each large task into fragments and assigns them to be processed in a parallel way and completing at the same time to improve the mean response time, and separates the small tasks from the large tasks to avoid being delayed. Performance tests show a significantly improvement in performance of PLT over the existing task assignment policies.