Search results for "Telecommunications network"
showing 10 items of 38 documents
Energy Harvesting-Aware Backoff Algorithms for Distributed Device-to-Device Communication
2016
Due to limited energy capacity in mobile devices, energy harvesting is regarded as a promising technology for lifetime extension in device-to-device (D2D) communication. However, medium access control (MAC) protocols designed for D2D communication intrinsically do not consider the existence of harvested energy. In this paper we study four backoff (BO) algorithms, among which one algorithm is proposed to enhance the BO selection based on energy harvesting rate and residual energy of devices. Simulations are performed in order to assess how the proposed algorithm can extend the lifetime of a D2D communication network as well as to provide fair channel access opportunities among devices.
A distributed control system for citric fruits conservation and maturation based on CAN and Internet networks
2007
In citric fruits conservation and maturation systems it is very important to have precise information about parameters that indicate the citric fruit state. This information allows computing the appropriate control actions in order to achieve an optimum controlled citric fruit conservation and maturation. Last technological advances must be also used in this agriculture field to forget the rudimentary control systems that are being used at the present time. This paper describes a new distributed control system devoted to control citric fruits cold chambers that applies the last computer and electronics techniques. It is structured over different communication networks, making possible a rem…
SmartARP: merging IP and MAC addressing for low-cost gigabit Ethernet networks
1999
Abstract Address Resolution Protocol (ARP) is one of the key TCP/IP stack protocols, used on LANs to map 32 bit IP addresses into 48 bit hardware addresses. Regular ARP uses MAC layer broadcasts to perform the mapping. In this paper a new server-based ARP extension (smartARP) is proposed, which allows the extension of ARP functionality beyond a single MAC layer broadcast domain. Compared to regular IP router, smartARP together with simple broadcast-filtering switches presents a low-cost alternative for forwarding packets between MAC layer broadcast domains. SmartARP is transparent to existing IP hosts, operates independent of LAN speed, and scales for big networks.
QoS Mechanisms for IEEE 802.11 Wireless LANs
2004
Currently the Internet provides users with access to information across the world using IP technology. Until now most access points to the Internet have been fixed stations at given locations, but with increasing sales of mobile devices, mobility has become a major trend. Therefore, the Internet is becoming more and more heterogeneous due to the recent explosion of wireless networks. The IEEE 802.11 wireless LAN (WLAN) is the most widely used WLAN standard nowadays. Currently the IEEE 802.11 standard specifies an over-the-air interface between wireless devices. However, QoS services over this technology are still being defined aiming to provide support to multiple applications. Thus, a larg…
Best compromise solution for a new multiobjective scheduling problem
2006
In future wireless networks, a mobile terminal will be able to communicate with a service provider using several network connections. These connections to networks will have different properties and they will be priced separately. In order to minimize the total communication time and the total transmission costs, an automatic method for selecting the network connections is needed. Here, we describe the network connection selection problem and formulate it mathematically. We discuss solving the problem and analyse different multiobjective optimization approaches for it.
Optimal Local Routing Strategies for Community Structured Time Varying Communication Networks
2017
International audience; In time varying data communication networks (TVCN), traffic congestion, system utility maximization and network performance enhancement are the prominent issues. All these issues can be resolved either by optimizing the network structure or by selecting efficient routing approaches. In this paper, we focus on the design of a time varying network model and propose an algorithm to find efficient user route in this network. Centrality plays a very important role in finding congestion free routes. Indeed, the more a node is central, the more it can be congested by the flow coming from or going to its neighborhood. For that reason, classically, routes are chosen such that…
User bandwidth usage-driven HNN neuron excitation method for maximum resource utilization within packet-switched communication networks
2006
Mobile and wireless systems beyond 3G are being designed under the user-centric paradigm. Dynamic resource allocation (DRA) is a topic on intensive research to address efficiently such paradigm. Hopfield neural networks (HNN) have proved useful in the past to solve this kind of complex optimization problems. Recently, various approaches have been proposed to realize HNN-based user-centric DRA. However, the initial algorithms suffer from severe instability problems impacting the overall performance. This letter analyses the source of the existing limitations and proposes an enhanced formulation, ensuring maximum resource utilization while optimizing the convergence of the neural network. The…
The influence of friendship and communication network density on individual innovative behaviours: a multilevel study
2016
The present study examines whether teams’ friendship and communication network density are related to individual innovative behaviours (IIBs: idea generation, suggestion making, idea promotion and idea implementation). The study sample was composed of 28 teams comprising 101 members. The results obtained by means of multilevel structural equations modelling showed that friendship network density had an indirect positive relationship with the four IIBs through the density of team communication networks.
Letter Throughput and Delay Analysis of the Ideal Window
1999
We consider the problem of random access communications over a time slotted channel with feedback of infinitely multiplicity at the beginning of each collision resolution interval (CRI), i.e., users know via instantaneous feedback the number of users involved in that collision. Once this is known, the resolution algorithm (CRA) operates with binary (successful / non successful, s/ns) feedback. The analysis of this simple full feedback sensing window random access algorithm, named ideal window stabilized ALOHA, (IWSA), algorithm, provides a throughput of 0.5052 packets/slot, Its delay is also analyzed and compared with similar algorithms.
Analysis of Pollutant Emissions on City Arteries—Aspects of Transport Management
2021
The aim of the study is to present a methodology for analyzing pollution emissions in a medium-sized city using modern traffic simulations in the aspect of minimizing exhaust emissions. The scope of the research and the methods of analysis used differ from those applied in big cities projects that can be found in the literature, Therefore the progressive elaboration model has been applied methodically to formulate and carry out the feasibility study. To perform microscopic traffic simulations, the software Simulation of Urban Mobility (SUMO—German Aerospace Center (DLR), Berlin, Germany) was applied. Thanks to the simulations, changes in traffic organization were accurately identified in th…