Abstract: In this paper, we study the Minimum Latency Broadcast
Scheduling (MLBS) problem in wireless sensor networks (WSNs).
The main issue of the MLBS problem is to compute schedules
with the minimum number of timeslots such that a base station can
broadcast data to all other sensor nodes with no collisions. Unlike
existing works that utilize the traditional omni-directional WSNs,
we target the directional WSNs where nodes can collaboratively
determine and orientate their antenna directions. We first develop
a 7-approximation algorithm, adopting directional WSNs. Our ratio
is currently the best, to the best of our knowledge. We then validate
the performance of the proposed algorithm through simulation.
Abstract: In this paper, we study the data collection problem in
Wireless Sensor Networks (WSNs) adopting the two interference
models: The graph model and the more realistic physical interference
model known as Signal-to-Interference-Noise-Ratio (SINR). The
main issue of the problem is to compute schedules with the minimum
number of timeslots, that is, to compute the minimum latency
schedules, such that data from every node can be collected without
any collision or interference to a sink node. While existing works
studied the problem with unit-sized and unbounded-sized message
models, we investigate the problem with the bounded-sized message
model, and introduce a constant factor approximation algorithm.
To the best known of our knowledge, our result is the first result
of the data collection problem with bounded-sized model in both
interference models.
Abstract: The P300 from Event related potential (ERP) explains the psycho-physiological phenomenon in human body. The present study aims to identify the differences of amplitude and latency of P300 component from auditory stimuli, between ambiversion and extraversion types of personality. Ambivert (N=20) and extravert (N=20) undergoing ERP recording at the Hospital Universiti Sains Malaysia (HUSM) laboratory. Electroencephalogram data was recorded with oddball paradigm, counting auditory standard and target tones, from nine electrode sites (Fz, Cz, Pz, T3, T4, T5, T6, P3 and P4) by using the 128 HydroCel Geodesic Sensor Net. The P300 latency of the target tones at all electrodes were insignificant. Similarly, the P300 latency of the standard tones were also insignificant except at Fz and T3 electrode. Likewise, the P300 amplitude of the target and standard tone in all electrode sites were insignificant. Extravert and ambivert indicate similar characteristic in cognition processing from auditory task.
Abstract: In this paper, we analyze NEtwork MObility (NEMO) supporting problems in Content-Centric Networking (CCN), and propose the CCN-NEMO which can well support the deployment of the content-centric paradigm in large-scale mobile Internet. The CCN-NEMO extends the signaling message of the basic CCN protocol, to support the mobility discovery and fast trigger of Interest re-issuing during the network mobility. Besides, the Mobile Router (MR) is extended to optimize the content searching and relaying in the local subnet. These features can be employed by the nested NEMO to maximize the advantages of content retrieving with CCN. Based on the analysis, we compare the performance on handover latency between the basic CCN and our proposed CCN-NEMO. The results show that our scheme can facilitate the content-retrieving in the NEMO scenario with improved performance.
Abstract: Web Usage Mining is the application of data mining
techniques to find usage patterns from web log data, so as to grasp
required patterns and serve the requirements of Web-based
applications. User’s expertise on the internet may be improved by
minimizing user’s web access latency. This may be done by
predicting the future search page earlier and the same may be prefetched
and cached. Therefore, to enhance the standard of web
services, it is needed topic to research the user web navigation
behavior. Analysis of user’s web navigation behavior is achieved
through modeling web navigation history. We propose this technique
which cluster’s the user sessions, based on the K-medoids technique.
Abstract: The main issue in designing a wireless sensor network
(WSN) is the finding of a proper routing protocol that complies with
the several requirements of high reliability, short latency, scalability,
low power consumption, and many others. This paper proposes a
novel routing algorithm that complies with these design
requirements. The new routing protocol divides the WSN into several subnetworks
and each sub-network is divided into several clusters. This
division is designed to reduce the number of radio transmission and
hence decreases the power consumption. The network division may
be changed dynamically to adapt with the network changes and
allows the realization of the design requirements.
Abstract: The 5th generation of mobile networks is term used in
various research papers and projects to identify the next major phase
of mobile telecommunications standards. 5G wireless networks will
support higher peak data rate, lower latency and provide best
connections with QoS guarantees.
In this article, we discuss various promising technologies for 5G
wireless communication systems, such as IPv6 support, World Wide
Wireless Web (WWWW), Dynamic Adhoc Wireless Networks
(DAWN), BEAM DIVISION MULTIPLE ACCESS (BDMA), Cloud
Computing, cognitive radio technology and FBMC/OQAM.
This paper is organized as follows: First, we will give introduction
to 5G systems, present some goals and requirements of 5G. In the
next, basic differences between 4G and 5G are given, after we talk
about key technology innovations of 5G systems and finally we will
conclude in last Section.
Abstract: Purpose: The study aimed to assess the depressant or
antidepressant effects of several Nonsteroidal Anti-Inflammatory
Drugs (NSAIDs) in mice: the selective cyclooxygenase-2 (COX-2)
inhibitor meloxicam, and the non-selective COX-1 and COX-2
inhibitors lornoxicam, sodium metamizole, and ketorolac. The
current literature data regarding such effects of these agents are
scarce.
Materials and methods: The study was carried out on NMRI mice
weighing 20-35 g, kept in a standard laboratory environment. The
study was approved by the Ethics Committee of the University of
Medicine and Pharmacy „Carol Davila”, Bucharest. The study agents
were injected intraperitoneally, 10 mL/kg body weight (bw) 1 hour
before the assessment of the locomotor activity by cage testing (n=10
mice/ group) and 2 hours before the forced swimming tests (n=15).
The study agents were dissolved in normal saline (meloxicam,
sodium metamizole), ethanol 11.8% v/v in normal saline (ketorolac),
or water (lornoxicam), respectively. Negative and positive control
agents were also given (amitryptilline in the forced swimming test).
The cage floor used in the locomotor activity assessment was divided
into 20 equal 10 cm squares. The forced swimming test involved
partial immersion of the mice in cylinders (15/9cm height/diameter)
filled with water (10 cm depth at 28C), where they were left for 6
minutes. The cage endpoint used in the locomotor activity assessment
was the number of treaded squares. Four endpoints were used in the
forced swimming test (immobility latency for the entire 6 minutes,
and immobility, swimming, and climbing scores for the final 4
minutes of the swimming session), recorded by an observer that was
„blinded” to the experimental design. The statistical analysis used the
Levene test for variance homogeneity, ANOVA and post-hoc
analysis as appropriate, Tukey or Tamhane tests.
Results: No statistically significant increase or decrease in the
number of treaded squares was seen in the locomotor activity
assessment of any mice group. In the forced swimming test,
amitryptilline showed an antidepressant effect in each experiment, at
the 10 mg/kg bw dosage. Sodium metamizole was depressant at 100
mg/kg bw (increased the immobility score, p=0.049, Tamhane test),
but not in lower dosages as well (25 and 50 mg/kg bw). Ketorolac
showed an antidepressant effect at the intermediate dosage of 5
mg/kg bw, but not so in the dosages of 2.5 and 10 mg/kg bw,
respectively (increased the swimming score, p=0.012, Tamhane test).
Meloxicam and lornoxicam did not alter the forced swimming
endpoints at any dosage level.
Discussion: 1) Certain NSAIDs caused changes in the forced
swimming patterns without interfering with locomotion. 2) Sodium
metamizole showed a depressant effect, whereas ketorolac proved
antidepressant. Conclusion: NSAID-induced mood changes are not
class effects of these agents and apparently are independent of the
type of inhibited cyclooxygenase (COX-1 or COX-2).
Disclosure: This paper was co-financed from the European Social
Fund, through the Sectorial Operational Programme Human Resources Development 2007-2013, project number POSDRU /159
/1.5 /S /138907 "Excellence in scientific interdisciplinary research,
doctoral and postdoctoral, in the economic, social and medical fields
-EXCELIS", coordinator The Bucharest University of Economic
Studies.
Abstract: Future mobile networks following 5th generation will
be characterized by one thousand times higher gains in capacity;
connections for at least one hundred billion devices; user experience
capable of extremely low latency and response times. To be close to
the capacity requirements and higher reliability, advanced
technologies have been studied, such as multiple connectivity, small
cell enhancement, heterogeneous networking, and advanced
interference and mobility management. This paper is focused on the
multiple connectivity in heterogeneous cellular networks. We
investigate the performance of coverage and user throughput in several
deployment scenarios. Using the stochastic geometry approach, the
SINR distributions and the coverage probabilities are derived in case
of dual connection. Also, to compare the user throughput enhancement
among the deployment scenarios, we calculate the spectral efficiency
and discuss our results.
Abstract: Over the past era, there have been a lot of efforts and
studies are carried out in growing proficient tools for performing
various tasks in big data. Recently big data have gotten a lot of
publicity for their good reasons. Due to the large and complex
collection of datasets it is difficult to process on traditional data
processing applications. This concern turns to be further mandatory
for producing various tools in big data. Moreover, the main aim of
big data analytics is to utilize the advanced analytic techniques
besides very huge, different datasets which contain diverse sizes from
terabytes to zettabytes and diverse types such as structured or
unstructured and batch or streaming. Big data is useful for data sets
where their size or type is away from the capability of traditional
relational databases for capturing, managing and processing the data
with low-latency. Thus the out coming challenges tend to the
occurrence of powerful big data tools. In this survey, a various
collection of big data tools are illustrated and also compared with the
salient features.
Abstract: The society of 3rd Generation Partnership Project (3GPP) is completed developing Long Term Evolution Advanced (LTE-Advanced) systems as a standard 4G cellular system. This generation goals to produce conditions for a new radio-access technology geared to higher data rates, low latency, and better spectral efficiency. LTE-Advanced is an evolutionary step in the continuing development of LTE where the description in this article is based on LTE release 10. This paper provides a model of the traffic links of 4G system represented by LTE-Advanced system with the effect of the Transmission Control Protocols (TCP) and Stream Control Transmission Protocol (SCTP) in term of throughput and packet loss. Furthermore, the article presents the investigation and the analysis the behavior of SCTP and TCP variants over the 4G cellular systems. The traffic model and the scenario of the simulation developed using the network simulator NS-2 using different TCP source variants.
Abstract: Data Grid is a geographically distributed environment that deals with data intensive application in scientific and enterprise computing. Data replication is a common method used to achieve efficient and fault-tolerant data access in Grids. In this paper, a dynamic data replication strategy, called Enhanced Latest Access Largest Weight (ELALW) is proposed. This strategy is an enhanced version of Latest Access Largest Weight strategy. However, replication should be used wisely because the storage capacity of each Grid site is limited. Thus, it is important to design an effective strategy for the replication replacement task. ELALW replaces replicas based on the number of requests in future, the size of the replica, and the number of copies of the file. It also improves access latency by selecting the best replica when various sites hold replicas. The proposed replica selection selects the best replica location from among the many replicas based on response time that can be determined by considering the data transfer time, the storage access latency, the replica requests that waiting in the storage queue and the distance between nodes. Simulation results utilizing the OptorSim show our replication strategy achieve better performance overall than other strategies in terms of job execution time, effective network usage and storage resource usage.
Abstract: Periodic broadcast is a cost-effective solution for large-scale distribution of popular videos because this approach guarantees constant worst service latency, regardless of the number of video requests. An essential periodic broadcast method is the client-centric approach (CCA), which allows clients to use smaller receiving bandwidth to download broadcast data. An enhanced version, namely CCA++, was proposed to yield a shorter waiting time. This work further improves CCA++ in reducing client buffer requirements. The new scheme decreases the buffer requirements by as much as 52% when compared to CCA++. This study also provides an analytical evaluation to demonstrate the performance advantage, as compared with particular schemes.
Abstract: This paper presents the design, implementation and evaluation of a micro-network, or Network-on-Chip (NoC), based on a generic pipeline router architecture. The router is designed to efficiently support traffic generated by multimedia applications on embedded multi-core systems. It employs a simplest routing mechanism and implements the round-robin scheduling strategy to resolve output port contentions and minimize latency. A virtual channel flow control is applied to avoid the head-of-line blocking problem and enhance performance in the NoC. The hardware design of the router architecture has been implemented at the register transfer level; its functionality is evaluated in the case of the two dimensional Mesh/Torus topology, and performance results are derived from ModelSim simulator and Xilinx ISE 9.2i synthesis tool. An example of a multi-core image processing system utilizing the NoC structure has been implemented and validated to demonstrate the capability of the proposed micro-network architecture. To reduce complexity of the image compression and decompression architecture, the system use image processing algorithm based on classical discrete cosine transform with an efficient zonal processing approach. The experimental results have confirmed that both the proposed image compression scheme and NoC architecture can achieve a reasonable image quality with lower processing time.
Abstract: Long Term Evolution Advanced (LTE-Advanced) LTE-Advanced is not new as a radio access technology, but it is an evolution of LTE to enhance the performance. This generation is the continuation of 3GPP-LTE (3GPP: 3rd Generation Partnership Project) and it is targeted for advanced development of the requirements of LTE in terms of throughput and coverage. The performance evaluation process of any network should be based on many models and simulations to investigate the network layers and functions and monitor the employment of the new technologies especially when this network includes large-bandwidth and low-latency links such as LTE and LTE-Advanced networks. Therefore, it’s necessary to enhance the proposed models of high-speed and high-congested link networks to make these links and traffics fulfill the needs of the huge data which transferred over the congested links. This article offered an innovative model of the most correlated links of LTE-Advanced system using the Network Simulator 2 (NS-2) with investigation of the link parameters.
Abstract: The performance of state of the art worldwide telecommunication networks strongly depends on the efficiency of the applied routing mechanism. Game theoretical approaches to this problem offer new solutions. In this paper a new continuous network routing model is defined to describe data transfer in fixed telecommunication networks of multiple hosts. The nodes of the network correspond to routers whose latency is assumed to be traffic dependent. We propose that the whole traffic of the network can be decomposed to a finite number of tasks, which belong to various hosts. To describe the different latency-sensitivity, utility functions are defined for each task. The model is used to compare router and host intelligent types of routing methods, corresponding to various data transfer protocols. We analyze host intelligent routing as a transferable utility cooperative game with externalities. The main aim of the paper is to provide a framework in which the efficiency of various routing algorithms can be compared and the transferable utility game arising in the cooperative case can be analyzed.
Abstract: Fine-grained data replication over the Internet allows duplication of frequently accessed data objects, as opposed to entire sites, to certain locations so as to improve the performance of largescale content distribution systems. In a distributed system, agents representing their sites try to maximize their own benefit since they are driven by different goals such as to minimize their communication costs, latency, etc. In this paper, we will use game theoretical techniques and in particular auctions to identify a bidding mechanism that encapsulates the selfishness of the agents, while having a controlling hand over them. In essence, the proposed game theory based mechanism is the study of what happens when independent agents act selfishly and how to control them to maximize the overall performance. A bidding mechanism asks how one can design systems so that agents- selfish behavior results in the desired system-wide goals. Experimental results reveal that this mechanism provides excellent solution quality, while maintaining fast execution time. The comparisons are recorded against some well known techniques such as greedy, branch and bound, game theoretical auctions and genetic algorithms.
Abstract: This paper considers the benefits gained by using an
efficient quality of service management such as DiffServ technique to
improve the performance of military communications. Low delay and
no blockage must be achieved especially for real time tactical data.
All traffic flows generated by different applications do not need same
bandwidth, same latency, same error ratio and this scalable technique
of packet management based on priority levels is analysed. End to
end architectures supporting various traffic flows and including lowbandwidth
and high-delay HF or SHF military links as well as
unprotected Internet sub domains are studied. A tuning of Diffserv
parameters is proposed in accordance with different loads of various
traffic and different operational situations.
Abstract: Solar power plants(SPPs) have shown a lot of good outcomes
in providing a various functions depending on industrial expectations by
deploying ad-hoc networking with helps of light loaded and battery powered
sensor nodes. In particular, it is strongly requested to develop an algorithm to
deriver the sensing data from the end node of solar power plants to the sink node
on time. In this paper, based on the above observation we have proposed an
IEEE802.15.4 based self routing scheme for solar power plants. The proposed
beacon based priority routing Algorithm (BPRA) scheme utilizes beacon
periods in sending message with embedding the high priority data and thus
provides high quality of service(QoS) in the given criteria. The performance
measures are the packet Throughput, delivery, latency, total energy
consumption. Simulation results under TinyOS Simulator(TOSSIM) have
shown the proposed scheme outcome the conventional Ad hoc On-Demand
Distance Vector(AODV) Routing in solar power plants.
Abstract: This paper presents an efficient VLSI architecture
design to achieve real time video processing using Full-Search Block
Matching (FSBM) algorithm. The design employs parallel bank
architecture with minimum latency, maximum throughput, and full
hardware utilization. We use nine parallel processors in our
architecture and each controlled by a state machine. State machine
control implementation makes the design very simple and cost
effective. The design is implemented using VHDL and the
programming techniques we incorporated makes the design
completely programmable in the sense that the search ranges and the
block sizes can be varied to suit any given requirements. The design
can operate at frequencies up to 36 MHz and it can function in QCIF
and CIF video resolution at 1.46 MHz and 5.86 MHz, respectively.