Search results for "Computer network"
showing 10 items of 1634 documents
Performance analysis of selfish access strategies on WiFi infrastructure networks
2009
In this paper we propose a game-theoretic approach for characterizing WiFi network performance in presence of intelligent nodes employing cognitive functionalities. We assume that a cognitive WiFi node is aware of its application requirements and is able to dynamically estimate the network status, in order to dynamically change its access strategy by tuning the contention window settings. We prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium conditions, which are also Pareto optimal. Indeed, we show that the station strategies converge toward values which maximize a per-node uti…
A survey on data center network topologies
2018
Data centers are the infrastructures that support the cloud computing services. So, their topologies have an important role on controlling the performance of these services. Designing an efficient topology with a high scalability and a good network performance is one of the most important challenges in data centers. This paper surveys recent research advances linked to data center network topologies. We review some representative topologies and discuss their proprieties in details. We compare them in terms of average path length, network fault tolerance, scalability and connection pattern techniques. Springer Nature Switzerland AG 2018. Acknowledgment. This publication was made possible by …
Analysis of interference avoidance with load balancing in heterogeneous cellular networks
2016
In heterogeneous cellular networks (HCNets) smallcells are overlaid with macro-cells to handle heavy cellular data traffic in an efficient way. To achieve fast and reliable access to data with a better coverage it is necessary to offload users to the underutilized small-cells from the congested macro-cells. Sharing of the same licensed frequency spectrum by smallcells and macro-cells results in heavy cross-tier interference which significantly affects the downlink SINR. In this paper, we investigate and analyze a joint frequency-division duplex based cross-tier complementary spectrum sharing technique which is also regarded as reverse frequency allocation (RFA) scheme with load balancing. T…
Kalman filter estimation of the contention dynamics in error-prone IEEE 802.11 networks
2008
In the last years, several strategies for maximizing the throughput performance of IEEE 802.11 networks have been proposed in literature. Specifically, it has been shown that optimizations are possible both at the medium access control (MAC) layer, and at the physical (PHY) layer. In fact, at the MAC layer, it is possible to minimize the channel wastes due to collisions and backoff expiration times, by tuning the minimum contention window as a function of the number n of competing stations. At the PHY layer, it is possible to improve the transmission robustness, by selecting a suitable modulation/coding scheme as a function of the channel quality perceived by the stations. However, the feas…
NoC Reconfiguration for CMP Virtualization
2011
At NoC level, the traffic interferences can be drastically reduced by using virtualization mechanisms. An effective strategy to virtualize a NoC consists in dividing the network in different partitions, each one serving different applications and traffic flows. In this paper, we propose a NoC reconfiguration mechanism to support NoC virtualization under real scenarios. Dynamic reassignment of network resources to different partitions is allowed in order to NoC dynamically adapts to application needs. Evaluation results show a good behavior of CMP virtualization.
C<sup>2</sup>SMA/CA: Enabling co-channel concurrency in WLANs using positional information
2013
An attractive approach to overcome capacity limitations in a densely deployed WLAN environment is to enable transmission concurrency. In this paper, we propose a co-channel concurrent transmission scheme, referred to as C2SMA/CA, which determines whether to allow multiple concurrent transmissions based on interference estimation using positional information. A distributed multi-link concurrency scheduling algorithm is implemented, and its performance is evaluated through extensive simulations.
MSS: A Multi-Level Data Placement Scheme for Data Survival in Wireless Sensor Networks
2009
In recently popularized unattended wireless sensor networks, sensed data are stored locally or some designated nodes for a long term and retrieved sometime by collectors on demand. Such data may be delete or modified as sensor nodes are always exposed to risks such as random failure and mobile adversary. To maximize the data survival, we propose a secure and efficient scheme - MSS. MSS makes use of hopbounded computational secret sharing to achieve fault tolerance and compromise resilience, and takes advantages of multi-level secret sharing to mitigate communication overhead and improve overall security. MSS has the most advantages in terms of security and efficiency among presented schemes…
DSMAV: An improved solution for multi-attribute search based on load capacities
2016
DHT (Distributed Hash Table) such as CHORD or PARTRY facilitates information searching in scalable systems. Two popular DHT-based approaches for range or multi-attribute search are to rely on attribute-value tree and a combination of attributes and values. However, tradeoff between a load balancing mechanism and query efficiency is a challenging task for such information searching systems. In this paper, we propose improved algorithms for a system called DSMAV in which information resources are distributed fairly among nodes and found based on multi-attribute queries in a small number of hop counts. Our system creates identifiers from resource names, each of which is a combination of attrib…
A Scheme for Secure and Reliable Distributed Data Storage in Unattended WSNs
2010
Unattended Wireless Sensor Networks (UWSNs) operated in hostile environments face a risk on data security due to the absence of real-time communication between sensors and sinks, which imposes sensors to accumulate data till the next visit of a mobile sink to off-load the data. Thus, how to ensure forward secrecy, backward secrecy and reliability of the accumulated data is a great challenge. For example, if a sensor is compromised, pre-compromise data accumulated in the sensor is exposed to access. In addition, by holding key secrecy of the compromised sensor, attackers also can learn post-compromise data in the sensor. Furthermore, in practical UWSNs, once sensors stop working for accident…
UDP flows in Cognitive Radios with Channel Aggregation and Fragmentation: A Test-bed Based Evaluation
2018
Channel aggregation (CA) and channel fragmentation (CF) have been studied extensively in cognitive radios (CRs) for many years. However, a test-bed evaluation for such techniques at flow level is still open. In this study, employing National Instruments devices, a test-bed is set up to evaluate the performance of UDP flows for CRs with CA and CF, considering the aspects of blocking, preemption, and throughput in probability. The measurements clearly show that there are performance improvements in applying CA and CF in CRs for UDP flows.