Search results for "Network topology"
showing 10 items of 192 documents
A Group-Based Protocol for Large Wireless AD-HOC and Sensor Networks
2008
Many routing protocols for ad-hoc networks and sensor networks have been designed, but none of them is based on groups. It is known that grouping nodes gives better performance to the group and to the whole system, thereby avoiding unnecessary message forwarding and additional overheads. We propose an approach where the network is split into several groups of sensors where connections between groups are established as a function of the proximity and the neighbor's available capacity (based on the sensor's energy). In this paper the network architecture is described with its mathematical description and the messages that are needed to proper operation. It is also simulated how much time is n…
Notice of Violation of IEEE Publication Principles: Reinforcement learning for P2P searching
2005
For a peer-to-peer (P2P) system holding a massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured P2P networks avoid the limitations of centralized systems and the drawbacks of a highly structured approach, because they impose few constraints on topology and data placement, and they support highly versatile search mechanisms. However their search algorithms are usually based on simple flooding schemes, showing severe inefficiencies. In this paper, to address this major limitation, we propose and evaluate the adoption of a local adaptive routing protocol. The routing algorithm adopts a simple reinforcement learni…
Performance Analysis in Spatially Correlated IEEE 802.11 Networks
2012
Wireless mesh networks are difficult to be characterized, especially under multi-hop traffic streams. The problem is that the local view of the channel and the correlation between the buffers of consecutive nodes in a stream path make complicated the identification of the contention level perceived by each station along the time. Such a figure is used in the models based on the so called decoupling assumption for evaluating the final scheduling of simultaneous channel access grants. In this paper we propose a simplified mesh network model focused on capturing the correlation due to the network topology and traffic routes rather than the access protocol state at each node. To this purpose, w…
An adaptive timer for RPL to handle mobility in wireless sensor networks
2016
This paper focuses on the performance of wireless sensor networks characterized by a hybrid topology composed of mobile and static sensor nodes. The Routing Protocol for Low power and lossy networks (RPL), which is standardized as an IPv6 routing protocol for low power and lossy networks, uses the trickle timer algorithm to handle changes in the network topology. However, this algorithm is not well adapted to dynamic environments. This paper enhances the trickle timer in order to fit with mobility requirements. Most of previous works have improved this algorithm without considering the random movement of nodes. In this work, the proposed timer algorithm takes into consideration the random t…
Modeling and Performance Assessment of the Split-Pi Used as a Storage Converter in All the Possible DC Microgrid Scenarios. Part I: Theoretical Analy…
2021
The integration of an electrical storage system (ESS) into a DC microgrid using a bidirectional DC/DC converter provides substantial benefits but requires careful design. Among such converter topologies, the Split-pi converter presents several merits at the cost of non-isolated operation. However, the few works in the literature on the Split-pi presented only closed-loop control with a single control loop; furthermore, they neglected the reactive components’ parasitic resistances and did not perform any experimental validation. This work aimed at investigating the use of the Split-pi converter as a power interface between an ESS and a DC microgrid. Five typical microgrid scenarios are prese…
On the Optimization of Self-Organizing Maps by Genetic Algorithms
1999
Publisher Summary This chapter reviews the research on the genetic optimization of self-organizing maps (SOMs). The optimization of learning rule parameters and of initial weights is able to improve network performance. The latter, however, requires chromosome sizes proportional to the size of the SOM and becomes unwieldy for large networks. The optimization of learning rule structures leads to self-organization processes of character similar to the standard learning rule. A particularly strong potential lies in the optimization of SOM topologies, which allows the study of global dynamical properties of SOMs and related models, as well as to develop tools for their analysis. Hierarchies of …
Integrating Variability Management in Data Center Networks
2017
International audience; Data centers have an important role in supporting cloud computing services (i.e. checking social media, sending emails, video conferencing,..). Hence, data centers topologies design became more important and must be able to respond to ever changing service requirements and application demands. An ultimate challenge in this research is the design of data center network that interconnects the massive number of servers, and provides efficient and fault-tolerant routing algorithm. Several topologies such as DCell, FlatNet and ScalNet have been proposed. However, these topologies generally seek to improve the scalability without taking into consideration the energy usage …
Graph Comparison and Artificial Models for Simulating Real Criminal Networks
2021
Network Science is an active research field, with numerous applications in areas like computer science, economics, or sociology. Criminal networks, in particular, possess specific topologies which allow them to exhibit strong resilience to disruption. Starting from a dataset related to meetings between members of a Mafia organization which operated in Sicily during 2000s, we here aim to create artificial models with similar properties. To this end, we use specific tools of Social Network Analysis, including network models (Barabási-Albert identified to be the most promising) and metrics which allow us to quantify the similarity between two networks. To the best of our knowledge, the DeltaCo…
Coloring-based resource allocations in ad-hoc wireless networks
2011
It is well known that CSMA/CA protocols exhibit very poor performance in case of multi-hop transmissions, because of inter-link interference due to imperfect carrier sensing. We propose to control such an interference by preallocating temporal slots in which different sets of network nodes are allowed to contend for the channel access. The approach is based on distributed coloring algorithms with limited signaling overhead that can be customized as a function of the network topology and traffic load.
Efficient tree construction for the multicast problem
2002
A new heuristic for the Steiner minimal tree problem is presented. The method described is based on the detection of particular sets of nodes in networks, the "hot spot" sets, which are used to obtain better approximations of the optimal solutions. An algorithm is also proposed which is capable of improving the solutions obtained by classical heuristics, by means of a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used as comparison terms in the experimental analysis which demonstrates the capability of the heuristic discussed.