1,909 research outputs found
A Dynamic Multimedia User-Weight Classification Scheme for IEEE_802.11 WLANs
In this paper we expose a dynamic traffic-classification scheme to support
multimedia applications such as voice and broadband video transmissions over
IEEE 802.11 Wireless Local Area Networks (WLANs). Obviously, over a Wi-Fi link
and to better serve these applications - which normally have strict bounded
transmission delay or minimum link rate requirement - a service differentiation
technique can be applied to the media traffic transmitted by the same mobile
node using the well-known 802.11e Enhanced Distributed Channel Access (EDCA)
protocol. However, the given EDCA mode does not offer user differentiation,
which can be viewed as a deficiency in multi-access wireless networks.
Accordingly, we propose a new inter-node priority access scheme for IEEE
802.11e networks which is compatible with the EDCA scheme. The proposed scheme
joins a dynamic user-weight to each mobile station depending on its outgoing
data, and therefore deploys inter-node priority for the channel access to
complement the existing EDCA inter-frame priority. This provides efficient
quality of service control across multiple users within the same coverage area
of an access point. We provide performance evaluations to compare the proposed
access model with the basic EDCA 802.11 MAC protocol mode to elucidate the
quality improvement achieved for multimedia communication over 802.11 WLANs.Comment: 15 pages, 8 figures, 3 tables, International Journal of Computer
Networks & Communications (IJCNC
Survey of Spectrum Sharing for Inter-Technology Coexistence
Increasing capacity demands in emerging wireless technologies are expected to
be met by network densification and spectrum bands open to multiple
technologies. These will, in turn, increase the level of interference and also
result in more complex inter-technology interactions, which will need to be
managed through spectrum sharing mechanisms. Consequently, novel spectrum
sharing mechanisms should be designed to allow spectrum access for multiple
technologies, while efficiently utilizing the spectrum resources overall.
Importantly, it is not trivial to design such efficient mechanisms, not only
due to technical aspects, but also due to regulatory and business model
constraints. In this survey we address spectrum sharing mechanisms for wireless
inter-technology coexistence by means of a technology circle that incorporates
in a unified, system-level view the technical and non-technical aspects. We
thus systematically explore the spectrum sharing design space consisting of
parameters at different layers. Using this framework, we present a literature
review on inter-technology coexistence with a focus on wireless technologies
with equal spectrum access rights, i.e. (i) primary/primary, (ii)
secondary/secondary, and (iii) technologies operating in a spectrum commons.
Moreover, we reflect on our literature review to identify possible spectrum
sharing design solutions and performance evaluation approaches useful for
future coexistence cases. Finally, we discuss spectrum sharing design
challenges and suggest future research directions
A study on stryi-icnos potatorum and pisum sativum as natural coagulants for meat food processing wastewater
Slow maintained load test is widely used by contractors in Malaysia to ensure the driven pile could accommodate the design load of the structure. Slow maintained load test is a test to determine load-settlement curve and pile capacity for a period of time using conventional load test. Conventional static pile load test equipment is large in size thus making it heavier and takes a long time to install. In addition, it consumes a lot of space which causes congestion at construction sites. Therefore, the objective of this thesis is to conduct a conventional load test by replacing the pile kentledge load with anchorage and reaction pile. Preparations of ten designs comprising six commercial designs were reviewed. In addition, four proposed designs were suggested for the setup. Final design was produced based on its safety factors and criteria referred via literature review. The test frame consists of reaction frame with four reaction helical pile with two helixes per reaction pile. The deformation shapes, safety factor, stress, and strain of the design and finite element of the model has been analysed with the use of SolidWorks and Pia.xis 30 software. SolidWorks software emphasizes on the model load-deflection relationship while Plaxis 30 ensures a correlation of reaction between pile uplift force and soil. Then, the model was tested on site to determine the relationship between physical loaddeflection and pile-soil uplift force. The results of uplift force and displacement for numerical and physical test were nearly identical which increment of loaddisplacement graph pattern. The higher the uplift force, the higher the displacement obtained. In conclusion, the result obtained and the design may be considered as a guideline for future application of sustainable slow maintained pile load test
State-of-the-art of distributed channel assignment
Channel assignment for Wireless Mesh Networks (WMNs) attempts to increase the
network performance by decreasing the interference of simultaneous
transmissions. The reduction of interference is achieved by exploiting the
availability of fully or partially non-overlapping channels. Although it is
still a young research area, many different approaches have already been
developed. These approaches can be distinguished into centralized and
distributed. Centralized algorithms rely on a central entity, usually called
Channel Assignment Server (CAS), which calculates the channel assignment and
sends the result to the mesh routers. In distributed approaches, each mesh
router calculates its channel assignment decision based on local information.
Distributed approaches can react faster to topology changes due to node
failures or mobility and usually introduce less protocol overhead since
communication with the CAS is not necessary. As a result, distributed
approaches are more suitable once the network is operational and running.
Distributed approaches can further be classified into static and dynamic, in
regard to the modus of channel switching. In dynamic approaches, channels can
be switched on a per-packet basis, whereas in static approaches radios stay on
a specific channel for a longer period of time. Static assignments have been
more in focus, since the channel switching time for current Institute of
Electrical and Electronics Engineers (IEEE) 802.11 hardware is in the order of
milliseconds which is two orders higher than the packet transmission time.
Recently, surveys of channel assignment algorithms have been presented which
cover certain aspects of the research field. The survey in [1] introduces the
problem and presents a couple of distributed algorithms and [2] gives a broad
introduction to centralized and distributed approaches. The survey herein is
focused on distributed approaches for peer- to-peer network architectures.
This report describes the problem formulation for channel assignment in WMNs
and the fundamental concepts and challenges of this research area. We present
different distributed channel assignment algorithms and characterize them
according to a set of classification keys. Since channel assignment algorithms
may change the connectivity and therefore the network topology, they may have
a high impact on routing. Therefore, we present routing metrics that consider
channel diversity and adapt better to the multi- radio multi-channel scenario
than traditional routing metrics designed for single channel networks. The
presented algorithms are discussed and compared focusing on practical
evaluations in testbed and network environments. The implementation for real
networks is a hard and labor-intensive task because the researcher has to deal
with the complexity of the hardware, operating system, and wireless network
interface drivers. As a result, frameworks emerged in order to simplify the
implementation process. We describe these frameworks and the mechanisms used
to help researchers implementing their algorithms and show their limitations
and restrictions
- …