4,256 research outputs found
Improved IEEE 802.11 point coordination function considering fiber-delay difference in distributed antenna systems
In this paper, we present an improved IEEE 802.11 wireless local-area network (WLAN) medium access control (MAC) mechanism for simulcast radio-over-fiber-based distributed antenna systems where multiple remote antenna units (RAUs) are connected to one access point (AP). In the improved mechanism, the fiber delay between RAUs and central unit is taken into account in a modification to the conventional point coordination function (PCF) that achieves coordination by a centralized algorithm. Simulation results show that the improved PCF outperforms the distributed coordination function (DCF) in both the basic-access and request/clear-to-send modes in terms of the total throughput and the fairness among RAU
Wireless broadband access: WiMAX and beyond - Investigation of bandwidth request mechanisms under point-to-multipoint mode of WiMAX networks
The WiMAX standard specifies a metropolitan area broadband wireless access air interface. In order to support QoS for multimedia applications, various bandwidth request and scheduling mechanisms are suggested in WiMAX, in which a subscriber station can send request messages to a base station, and the base station can grant or reject the request according to the available radio resources. This article first compares two fundamental bandwidth request mechanisms specified in the standard, random access vs. polling under the point-to-multipoint mode, a mandatory transmission mode. Our results demonstrate that random access outperforms polling when the request rate is low. However, its performance degrades significantly when the channel is congested. Adaptive switching between random access and polling according to load can improve system performance. We also investigate the impact of channel noise on the random access request mechanism
Dynamic load balancing for the distributed mining of molecular structures
In molecular biology, it is often desirable to find common properties in large numbers of drug candidates. One family of
methods stems from the data mining community, where algorithms to find frequent graphs have received increasing attention over the
past years. However, the computational complexity of the underlying problem and the large amount of data to be explored essentially
render sequential algorithms useless. In this paper, we present a distributed approach to the frequent subgraph mining problem to
discover interesting patterns in molecular compounds. This problem is characterized by a highly irregular search tree, whereby no
reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely, a dynamic
partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiverinitiated
load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer
Instituteâs HIV-screening data set, where we were able to show close-to linear speedup in a network of workstations. The proposed
approach also allows for dynamic resource aggregation in a non dedicated computational environment. These features make it suitable
for large-scale, multi-domain, heterogeneous environments, such as computational grids
Scalable and Secure Aggregation in Distributed Networks
We consider the problem of computing an aggregation function in a
\emph{secure} and \emph{scalable} way. Whereas previous distributed solutions
with similar security guarantees have a communication cost of , we
present a distributed protocol that requires only a communication complexity of
, which we prove is near-optimal. Our protocol ensures perfect
security against a computationally-bounded adversary, tolerates
malicious nodes for any constant (not
depending on ), and outputs the exact value of the aggregated function with
high probability
Measuring relative opinion from location-based social media: A case study of the 2016 U.S. presidential election
Social media has become an emerging alternative to opinion polls for public
opinion collection, while it is still posing many challenges as a passive data
source, such as structurelessness, quantifiability, and representativeness.
Social media data with geotags provide new opportunities to unveil the
geographic locations of users expressing their opinions. This paper aims to
answer two questions: 1) whether quantifiable measurement of public opinion can
be obtained from social media and 2) whether it can produce better or
complementary measures compared to opinion polls. This research proposes a
novel approach to measure the relative opinion of Twitter users towards public
issues in order to accommodate more complex opinion structures and take
advantage of the geography pertaining to the public issues. To ensure that this
new measure is technically feasible, a modeling framework is developed
including building a training dataset by adopting a state-of-the-art approach
and devising a new deep learning method called Opinion-Oriented Word Embedding.
With a case study of the tweets selected for the 2016 U.S. presidential
election, we demonstrate the predictive superiority of our relative opinion
approach and we show how it can aid visual analytics and support opinion
predictions. Although the relative opinion measure is proved to be more robust
compared to polling, our study also suggests that the former can advantageously
complement the later in opinion prediction
- âŠ