Search results for "Nod"
showing 10 items of 4007 documents
Does higher datarate perform better in IEEE 802.11-based multihop ad hoc networks?
2007
Due to the nature that high datarate leads to shorter transmission range, the performance enhancement by high datarate 802.11 WLANs may be degraded when applying high datarate to an 802.11 based multihop ad hoc network. In this paper, we evaluate, through extensive simulations, the performance of multihop ad hoc networks at multiple transmission datarates, in terms of the number of hops between source and destination, throughput, end-to-end delay and packet loss. The study is conducted based on both stationary chain topology and mesh topologies with or without node mobility. From numerical results on network performance based on chain topology, we conclude that there is almost no benefit by…
An efficient distributed algorithm for generating and updating multicast trees
2006
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…
A Communication-Aware Topological Mapping Technique for NoCs
2008
Networks---on---Chip (NoCs) have been proposed as a promising solution to the complex on-chip communication problems derived from the increasing number of processor cores. The design of NoCs involves several key issues, being the topological mapping (the mapping of the Intellectual Properties (IPs) to network nodes) one of them. Several proposals have been focused on topological mapping last years, but they require the experimental validation of each mapping considered. In this paper, we propose a communication-aware topological mapping technique for NoCs. This technique is based on the experimental correlation of the network model with the actual network performance, thus avoiding the need…
Complex networks : application for texture characterization and classification
2008
This article describes a new method and approch of texture characterization. Using complex network representation of an image, classical and derived (hierarchical) measurements, we presente how to have good performance in texture classification. Image is represented by a complex networks : one pixel as a node. Node degree and clustering coefficient, using with traditionnal and extended hierarchical measurements, are used to characterize ”organisation” of textures.
Fuzzy Logic Based Security Trust Evaluation for IoT Environments
2019
In the new technological era called the Internet of Things (IoT), people, machines and objects communicate with each other via the Internet by exchanging information. In this context, trust plays an important role and is considered as a key factor in the success of the IoT services expansion. IoT services and applications use in some cases data concerning the privacy of their users. Consequently, users should trust the entities exchanging their personal information. In this paper, we present a framework that evaluates the security trust level of IoT nodes based on a Fuzzy Logic model using different input parameters such as Device Physical Security, Device Security Level and Device Ownershi…
Energy Efficient Consensus Over Directed Graphs
2018
Consensus algorithms are iterative methods that represent a basic building block to achieve superior functionalities in increasingly complex sensor networks by facilitating the implementation of many signal-processing tasks in a distributed manner. Due to the heterogeneity of the devices, which may present very different capabilities (e.g. energy supply, transmission range), the energy often becomes a scarce resource and the communications turn into directed. To maximize the network lifetime, a magnitude that in this work measures the number of consensus processes that can be executed before the first node in the network runs out of battery, we propose a topology optimization methodology fo…
Decentralized Subspace Projection for Asymmetric Sensor Networks
2020
A large number of applications in Wireless Sensor Networks include projecting a vector of noisy observations onto a subspace dictated by prior information about the field being monitored. In general, accomplishing such a task in a centralized fashion, entails a large power consumption, congestion at certain nodes and suffers from robustness issues against possible node failures. Computing such projections in a decentralized fashion is an alternative solution that solves these issues. Recent works have shown that this task can be done via the so-called graph filters where only local inter-node communication is performed in a distributed manner using a graph shift operator. Most of the existi…
Reducing False Node Failure Predictions in HPC
2019
Future HPC applications must be able to scale to thousands of compute nodes, while running for several days. The increased runtime and node count inconveniently raises the probability of hardware failures that may interrupt computations. Scientists must therefore protect their simulations against hardware failures. This is typically done using frequent checkpoint& restart, which may have significant overheads. Consequently, the frequency in which checkpoints are taken should be minimized. Predicting hardware failures ahead of time is a promising approach to address this problem, but has remaining issues like false alarms at large scales. In this paper, we introduce the probability of unnece…
Joint Usage of Dynamic Sensitivity Control and Time Division Multiple Access in Dense 802.11ax Networks
2016
It is well known that in case of high density deployments, Wi-Fi networks suffer from serious performance impairments due to hid- den and exposed nodes. The problem is explicitly considered by the IEEE 802.11ax developers in order to improve spectrum efficiency. In this pa- per, we propose and evaluate the joint usage of dynamic sensitivity con- trol (DSC) and time division multiple access (TDMA) for improving the spectrum allocation among overlapping 802.11ax BSSs. To validate the solution, apart from simulation, we used a testbed based on the Wireless MAC Processor (WMP), a prototype of a programmable wireless card.
Constraint Hubs Deployment for efficient Machine-Type-Communications
2018
Massive Internet of Things (mIoT) is an important use case of 5G. The main challenge for mIoT is the huge amount of uplink traffic as it dramatically overloads the radio access network (RAN). To mitigate this shortcoming, a new RAN technology has been suggested, where small cells are used for interconnecting different devices to the network. The use of small cells will alleviate congestion at the RAN, reduce the end-to-end (E2E) delay, and increase the link capacity for communications. In this paper, we devise three solutions for deploying and interconnecting small cells that would handle mIoT traffic. A realistic physical model is considered in these solutions. The physical model is based …