Search results for "ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS"
showing 10 items of 449 documents
Capacity Estimation of ADSL links
2008
Most tools designed to estimate the capacity of an Internet path require access on both end hosts of the path, which makes them difficult to deploy and use. In this paper we present a single-sided technique for measuring the capacity without the active cooperation of the destination host, focusing particularly on ADSL links. Compared to current methods used on broadband hosts, our approach generates two orders of magnitude less traffic and is much less intrusive. Our tool, DSLprobe, exploits the typical characteristics of ADSL, namely its bandwidth asymmetry and the relatively low absolute bandwidth, in order to measure both downlink and uplink capacities and to mitigate the impact of cross…
Attacks Against the WAP WTLS Protocol
1999
The WAP WTLS protocol was designed to provide privacy, data integrity, and authentication for wireless terminals. The protocol is currently being fielded, and it is expected that the protocol will be contained in millions of devices in a few years.
Construction of Disjoint Virtual Backbones for Wireless Sensor Networks
2020
A wireless sensor network is a wireless network of sensors aimed at monitoring physical events. It has ingratiated itself into almost all areas of human endeavors. Data dissemination in these networks is quite challenging and is generally accomplished by flooding. But flooding introduces broadcast storm problem due from implosion and overlap. To overcome this, topology management can prescribe a virtual backbone network to which routing is confined. In this paper we propose an algorithm that constructs multiple disjoint virtual backbone networks, using only nodes' locations. The disjointedness makes routing more robust and the network exploitation energy efficient. Simulations show our algo…
A New Scalable and Cost-Effective Congestion Management Strategy for Lossless Multistage Interconnection Networks
2005
In this paper, we propose a new congestion management strategy for lossless multistage interconnection networks that scales as network size and/or link bandwidth increase. Instead of eliminating congestion, our strategy avoids performance degradation beyond the saturation point by eliminating the HOL blocking produced by congestion trees. This is achieved in a scalable manner by using separate queues for congested flows. These are dynamically allocated only when congestion arises, and deallocated when congestion subsides. Performance evaluation results show that our strategy responds to congestion immediately and completely eliminates the performance degradation produced by HOL blocking whi…
Congestion Avoidance Using DYnamic COdec MAnagement: A solution for ISP
2005
The large diffusion of VoIP is an essential key for the success of emerging Internet service providers. These ISPs conflict with the interests of historical and predominant network maintainers which often control the network infrastructure and telephone services. To win this competition, emerging ISPs have to adopt strategic QoS solutions which will capture the attention of network users and phone clients. This paper presents a solution which is able to obtain the same performance of a 64 Kbps channel reducing the costs for over-provisioning network bandwidth. DyCoMa is a mechanism studied for VoIP applications in network with a limited bandwidth for multimedia services. It works preventing…
Optimal Relays Deployment for 802.16j Networks
2012
In this paper, we consider optimal relay station deployment for the IEEE 802.16j networks. IEEE 802.16j is an emerging wireless broadband networking standard that integrates infrastructure base stations with multihop relay technology. The proposed relay deployment mechanism allows us to maximize network capacity for every user or to maximize total network capacity, and, therefore, to reach greater network capacity values while employing smaller number of relay stations. With the proposed approach, the necessary number of relays for a region can be found.
Near field improvements of stochastic collaborative beamforming in wireless sensor networks
2020
Wireless sensor networks (WSN) are groups of small devices that contain a microcontroller in which a large number of sensors can be added. They transmit data and communicate to each other in the ISM band, standard IEEE 802.15.4, exchanging packets using a multi-hop routing. These devices are named motes and are nodes of the WSN. They are very simple and easy to program, powered by batteries of 1.5Volts (AA and AAA). The nodes are autonomous elements that can be deployed implementing any type of network. In a typical deployment the nodes communicate with each other and with a master node or Base Station (BS), which in turn transmits the information to an external server, which collects the e…
A Comprehensive Survey on Cooperative Relaying and Jamming Strategies for Physical Layer Security
2019
Physical layer security (PLS) has been extensively explored as an alternative to conventional cryptographic schemes for securing wireless links. Many studies have shown that the cooperation between the legitimate nodes of a network can significantly enhance their secret communications performance, relative to the noncooperative case. Motivated by the importance of this class of PLS systems, this paper provides a comprehensive survey of the recent works on cooperative relaying and jamming techniques for securing wireless transmissions against eavesdropping nodes, which attempt to intercept the transmissions. First, it provides a in-depth overview of various secure relaying strategies and sch…
Practical Considerations in the Implementation of Collaborative Beamforming on Wireless Sensor Networks
2017
Wireless Sensor Networks (WSNs) are composed of spatially distributed autonomous sensor devices, named motes. These motes have their own power supply, processing unit, sensors and wireless communications However with many constraints, such as limited energy, bandwidth and computational capabilities. In these networks, at least one mote called a sink, acts as a gateway to connect with other networks. These sensor networks run monitoring applications and then the data gathered by these motes needs to be retrieved by the sink. When this sink is located in the far field, there have been many proposals in the literature based on Collaborative Beamforming (CB), also known as Distributed or Cooper…
Relay selection in FDD amplify-and-forward cooperative networks
2017
In this paper, the problems of relay selection and distributed beamforming are investigated for bi-directional dual-hop amplify-and-forward frequency-division duplex cooperative wireless networks. When using individual per-relay maximum transmission power constraint, it has been proven that the relay selection and beamforming optimization problem becomes NP hard and requires exhaustive search to find the optimal solution. Therefore, we propose a computationally affordable sub-optimal multiple relay selection and beamforming optimization scheme based on the l1 norm squared relaxation. The proposed scheme performs the selection for the two transmission directions, simultaneously, while aiming…