Search results for "Network topology"
showing 10 items of 192 documents
Long-range & Self-powered IoT Devices for Agriculture & Aquaponics Based on Multi-hop Topology
2019
This article presents the prototype design and testing of a long-range, self-powered IoT devices for use in precision agriculture and aquaponics. The devices are designed using the ultra-low power nRF52840 microcontroller with Bluetooth 5 support and ambient energy harvesting. A power of 942µW is harvested in an indoor environment. The devices are therefore suitable for both indoor and outdoor use, as natural sunlight will provide far more energy compared to artificial indoor lights. A line-of-sight range of up to 1.8km is achieved with the use of coded transmissions. However, the coverage area and range can be extended significantly by deploying the devices in multi-hop network topology. T…
Optimal Configuration for N-Dimensional Twin Torus Networks
2014
Torus topology is one of the most common topologies used in the current largest supercomputers. Although 3D torus is widely used, recently some supercomputers in the Top500 list have been built using networks with topologies of five or six dimensions. To obtain an nD torus, 2n ports per node are needed. These ports can be offered by a single or several cards per node. In the second case, there are multiple ways of assigning the dimension and direction of the card ports. In a previous work we proposed the 3D Twin (3DT) torus which uses two 4-port cards per node, and obtained the optimal port configuration. This paper extends and generalizes that work in order to obtain the optimal port confi…
Network Centralities and Node Ranking
2017
An important problem in network analysis is understanding how much nodes are important in order to “propagate” the information across the input network. To this aim, many centrality measures have been proposed in the literature and our main goal here is that of providing an overview of the most important of them. In particular, we distinguish centrality measures based on walks computation from those based on shortest-paths computation. We also provide some examples in order to clarify how these measures can be calculated, with special attention to Degree Centrality, Closeness Centrality and Betweennes Centrality.
Optimal Resource Discovery Paths of Gnutella2
2008
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal query paths for the peer-to-peer resource discovery problem. Global knowledge of the topology and the resources from the peer-to-peer network are required as an input to the algorithm. The algorithm provides an objective measure for defining how good local search algorithms are. The performance is evaluated in simulated peer-to-peer scenarios and in the measured Gnutella2 P2P network topology with four local search algorithms: breadth-first search, self-avoiding random walker, highest degree search and Dynamic Query …
A Lightweight Network Discovery Algorithm for Resource-constrained IoT Devices
2019
Although quite simple, existing protocols for the IoT suffer from the inflexibility of centralized infrastructures and require several configuration stages. The implementation of these protocols is often prohibitive on resource-constrained devices. In this work, we propose a distributed lightweight implementation of network discovery for simple IoT devices. Our approach is based on the exchange of symbolic executable code among nodes. Based on this abstraction, we propose an algorithm that makes even IoT resource-constrained nodes able to construct the network topology graph incrementally and without any a priori information about device positioning and presence. The minimal set of executab…
Notice of Violation of IEEE Publication Principles: Enhanced P2P Services Providing Multimedia Content
2006
[This paper has been withdrawn by the publisher]Traditional peer-to-peer (P2P) services provide only basic searching facilities, based on unique identifiers or small sets of keywords. Unfortunately, this approach is very inadequate and inefficient when a huge amount of multimedia resources is shared. In this paper, we present an original image and video sharing system, in which a user is able to interactively search interesting resources by means of content-based image and video retrieval techniques. In order to limit the network traffic cost, maximizing the usefulness of each peer contacted in the query process, we also propose the adoption of an adaptive overlay routing algorithm, exploit…
Video Streaming Distribution in VANETs
2011
Streaming applications will rapidly develop and contribute a significant amount of traffic in the near future. A problem, scarcely addressed so far, is how to distribute video streaming traffic from one source to all nodes in an urban vehicular network. This problem significantly differs from previous work on broadcast and multicast in ad hoc networks because of the highly dynamic topology of vehicular networks and the strict delay requirements of streaming applications. We present a solution for intervehicular communications, called Streaming Urban Video (SUV), that 1) is fully distributed and dynamically adapts to topology changes, and 2) leverages the characteristics of streaming applica…
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…
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…
PTNet: An efficient and green data center network
2017
International audience; In recent years, data centers have witnessed an exponential growth for hosting hundreds of thousands of servers as well as to accommodating a very large demand for resources. To fulfill the required level of demand, some approaches tackled network aspects so to host a huge number of servers while others focused on delivering rapid services to the clients by minimizing the path length between any two servers. In general, network devices are often designed to achieve 1:1 oversubscription. Alternatively, in a realistic data center environment, the average utilization of a network could vary between 5% and 25%, and thus the energy consumed by idle devices is wasted. This…