Abstract: Most of the concurrent transactional protocols consider
serializability as a correctness criterion of the transactions execution.
Usually, the proof of the serializability relies on mathematical proofs
for a fixed finite number of transactions. In this paper, we introduce
a protocol to deal with an infinite number of transactions which are
iterated infinitely often. We specify serializability of the transactions
and the protocol using a specification language based on temporal
logics. It is worthwhile using temporal logics such as LTL (Lineartime
Temporal Logic) to specify transactions, to gain full automatic
verification by using model checkers.
Abstract: The project was undertaken to determine the effects of modified tissue culture protocols e.g. age of culture and hormone levels (2,4-D) in generating somaclonal variation. Moreover, the utility of molecular markers (SSR and MSAP) in sorting off types/somaclones were investigated.
Results show that somaclonal variation is in effect due to prolonged subculture and high 2,4-D concentration. The resultant variation was observed to be due to high level of methylation events specifically cytosine methylation either at the internal or external cytosine and was identified by methylation sensitive amplification polymorphism (MSAP).Simple sequence repeats (SSR) on the other hand, was able to associate a marker to a trait of interest.
These therefore, show that molecular markers can be an important tool in sorting out variation/mutants at an early stage.
Abstract: MBMS is a unidirectional point-to-multipoint bearer
service in which data are transmitted from a single source entity to
multiple recipients. For a mobile to support the MBMS, MBMS client
functions as well as MBMS radio protocols should be designed and
implemented. In this paper, we analyze the MBMS client functions
and describe the implementation of them in our mobile test-bed. User
operations and signaling flows between protocol entities to control the
MBMS functions are designed in detail. Service announcement
utilizing the file download MBMS service and four MBMS user
services are demonstrated in the test-bed to verify the MBMS client
functions.
Abstract: Connected dominating set (CDS) problem in unit disk
graph has signi£cant impact on an ef£cient design of routing protocols
in wireless sensor networks, where the searching space for a
route is reduced to nodes in the set. A set is dominating if all the
nodes in the system are either in the set or neighbors of nodes in the
set. In this paper, a simple and ef£cient heuristic method is proposed
for £nding a minimum connected dominating set (MCDS) in ad hoc
wireless networks based on the new parameter support of vertices.
With this parameter the proposed heuristic approach effectively
£nds the MCDS of a graph. Extensive computational experiments
show that the proposed approach outperforms the recently proposed
heuristics found in the literature for the MCD
Abstract: We aimed to investigate how can target and optimize
pulmonary delivery distribution by changing physicochemical
characteristics of instilled liquid.Therefore, we created a new liquids
group:
a. eligible for desired distribution within lung because of
assorted physicochemical characteristics
b. capable of being augmented with a broad range of
chemicals inertly
c. no interference on respiratory function
d. compatible with airway surface liquid
We developed forty types of new liquid,were composed of
Carboxymethylcellulose sodium,Glycerin and different types of
Polysorbates.Viscosity was measured using a Programmable
Rheometer and surface tension by KRUSS Tensiometer.We
subsequently examined the liquids and delivery protocols by simple
and branched glass capillary tube models of airways.Eventually,we
explored pulmonary distribution of liquids being augmented with
technetium-99m in mechanically ventilated rabbits.We used a single
head large field of view gamma camera.Kinematic viscosity between
0.265Stokes and 0.289Stokes,density between 1g/cm3 and 1.5g/cm3
and surface tension between 25dyn/cm and 35dyn/cm were the most
acceptable.
Abstract: As originally designed for wired networks, TCP (transmission control protocol) congestion control mechanism is triggered into action when packet loss is detected. This implicit assumption for packet loss mostly due to network congestion does not work well in Mobile Ad Hoc Network, where there is a comparatively high likelihood of packet loss due to channel errors and node mobility etc. Such non-congestion packet loss, when dealt with by congestion control mechanism, causes poor TCP performance in MANET. In this study, we continue to investigate the impact of the interaction between transport protocols and on-demand routing protocols on the performance and stability of 802.11 multihop networks. We evaluate the important wireless networking events caused routing change, and propose a cross layer method to delay the unnecessary routing changes, only need to add a sensitivity parameter α , which represents the on-demand routing-s reaction to link failure of MAC layer. Our proposal is applicable to the plain 802.11 networking environment, the simulation results that this method can remarkably improve the stability and performance of TCP without any modification on TCP and MAC protocol.
Abstract: Ad hoc networks are characterized by multi-hop
wireless connectivity and frequently changing network topology.
Forming security association among a group of nodes in ad-hoc
networks is more challenging than in conventional networks due to the
lack of central authority, i.e. fixed infrastructure. With that view in
mind, group key management plays an important building block of
any secure group communication. The main contribution of this paper
is a low complexity key management scheme that is suitable for fully
self-organized ad-hoc networks. The protocol is also password
authenticated, making it resilient against active attacks. Unlike other
existing key agreement protocols, ours make no assumption about the
structure of the underlying wireless network, making it suitable for
“truly ad-hoc" networks. Finally, we will analyze our protocol to show
the computation and communication burden on individual nodes for
key establishment.
Abstract: To extract the important physiological factors related to
diabetes from an oral glucose tolerance test (OGTT) by mathematical
modeling, highly informative but convenient protocols are required.
Current models require a large number of samples and extended
period of testing, which is not practical for daily use. The purpose
of this study is to make model assessments possible even from a
reduced number of samples taken over a relatively short period.
For this purpose, test values were extrapolated using a support
vector machine. A good correlation was found between reference and
extrapolated values in evaluated 741 OGTTs. This result indicates
that a reduction in the number of clinical test is possible through a
computational approach.
Abstract: In this paper, we argue the security protocols of
ZigBee wireless sensor network in MAC layer. AES 128-bit
encryption algorithm in CCM* mode is secure transferred data;
however, AES-s secret key will be break within nearest future.
Efficient public key algorithm, ECC has been mixed with AES to
rescue the ZigBee wireless sensor from cipher text and replay attack.
Also, the proposed protocol can parallelize the integrity function to
increase system performance.
Abstract: Internal controls of accounting are an essential
business function for a growth-oriented organization, and include the
elements of risk assessment, information communications and even
employees' roles and responsibilities. Internal controls of accounting
systems are designed to protect a company from fraud, abuse and
inaccurate data recording and help organizations keep track of
essential financial activities. Internal controls of accounting provide a
streamlined solution for organizing all accounting procedures and
ensuring that the accounting cycle is completed consistently and
successfully. Implementing a formal Accounting Procedures Manual
for the organization allows the financial department to facilitate
several processes and maintain rigorous standards. Internal controls
also allow organizations to keep detailed records, manage and
organize important financial transactions and set a high standard for
the organization's financial management structure and protocols. A
well-implemented system also reduces the risk of accounting errors
and abuse. A well-implemented controls system allows a company's
financial managers to regulate and streamline all functions of the
accounting department. Internal controls of accounting can be set up
for every area to track deposits, monitor check handling, keep track
of creditor accounts, and even assess budgets and financial statements
on an ongoing basis. Setting up an effective accounting system to
monitor accounting reports, analyze records and protect sensitive
financial information also can help a company set clear goals and
make accurate projections. Creating efficient accounting processes
allows an organization to set specific policies and protocols on
accounting procedures, and reach its financial objectives on a regular
basis. Internal accounting controls can help keep track of such areas
as cash-receipt recording, payroll management, appropriate recording
of grants and gifts, cash disbursements by authorized personnel, and
the recording of assets. These systems also can take into account any
government regulations and requirements for financial reporting.
Abstract: Transmission control protocol (TCP) Vegas detects
network congestion in the early stage and successfully prevents
periodic packet loss that usually occurs in TCP Reno. It has been
demonstrated that TCP Vegas outperforms TCP Reno in many
aspects. However, TCP Vegas suffers several problems that affect its
congestion avoidance mechanism. One of the most important
weaknesses in TCP Vegas is that alpha and beta depend on a good
expected throughput estimate, which as we have seen, depends on a
good minimum RTT estimate. In order to make the system more
robust alpha and beta must be made responsive to network conditions
(they are currently chosen statically). This paper proposes a modified
Vegas algorithm, which can be adjusted to present good performance
compared to other transmission control protocols (TCPs). In order to
do this, we use PSO algorithm to tune alpha and beta. The simulation
results validate the advantages of the proposed algorithm in term of
performance.
Abstract: The main idea behind in network aggregation is that,
rather than sending individual data items from sensors to sinks,
multiple data items are aggregated as they are forwarded by the
sensor network. Existing sensor network data aggregation techniques
assume that the nodes are preprogrammed and send data to a central
sink for offline querying and analysis. This approach faces two major
drawbacks. First, the system behavior is preprogrammed and cannot
be modified on the fly. Second, the increased energy wastage due to
the communication overhead will result in decreasing the overall
system lifetime. Thus, energy conservation is of prime consideration
in sensor network protocols in order to maximize the network-s
operational lifetime. In this paper, we give an energy efficient
approach to query processing by implementing new optimization
techniques applied to in-network aggregation. We first discuss earlier
approaches in sensors data management and highlight their
disadvantages. We then present our approach “Energy Efficient
Indexed Aggregation" (EEIA) and evaluate it through several
simulations to prove its efficiency, competence and effectiveness.
Abstract: Mobile Ad hoc Networks is an autonomous system of
mobile nodes connected by multi-hop wireless links without
centralized infrastructure support. As mobile communication gains
popularity, the need for suitable ad hoc routing protocols will
continue to grow. Efficient dynamic routing is an important research
challenge in such a network. Bandwidth constrained mobile devices
use on-demand approach in their routing protocols because of its
effectiveness and efficiency. Many researchers have conducted
numerous simulations for comparing the performance of these
protocols under varying conditions and constraints. Most of them are
not aware of MAC Protocols, which will impact the relative
performance of routing protocols considered in different network
scenarios. In this paper we investigate the choice of MAC protocols
affects the relative performance of ad hoc routing protocols under
different scenarios. We have evaluated the performance of these
protocols using NS2 simulations. Our results show that the
performance of routing protocols of ad hoc networks will suffer when
run over different MAC Layer protocols.
Abstract: Resistance of denial of service attacks is a key security requirement in voting protocols. Acquisti protocol plays an important role in development of internet voting protocols and claims its security without strong physical assumptions. In this study firstly Acquisti protocol is modeled in extended applied pi calculus, and then resistance of denial of service attacks is proved with ProVerif. The result is that it is not resistance of denial of service attacks because two denial of service attacks are found. Finally we give the method against the denial of service attacks.
Abstract: According to conjugate gradient algorithm, a new consensus protocol algorithm of discrete-time multi-agent systems is presented, which can achieve finite-time consensus. Finally, a numerical example is given to illustrate our theoretical result.
Abstract: Recently, with the appearance of smart cards, many
user authentication protocols using smart card have been proposed to
mitigate the vulnerabilities in user authentication process. In 2004,
Das et al. proposed a ID-based user authentication protocol that is
secure against ID-theft and replay attack using smart card. In 2009,
Wang et al. showed that Das et al.-s protocol is not secure to randomly
chosen password attack and impersonation attack, and proposed an
improved protocol. Their protocol provided mutual authentication and
efficient password management. In this paper, we analyze the security
weaknesses and point out the vulnerabilities of Wang et al.-s protocol.
Abstract: This paper attempts to establish the fact that Multi
State Network Classification is essential for performance
enhancement of Transport protocols over Satellite based Networks. A
model to classify Multi State network condition taking into
consideration both congestion and channel error is evolved. In order
to arrive at such a model an analysis of the impact of congestion and
channel error on RTT values has been carried out using ns2. The
analysis results are also reported in the paper. The inference drawn
from this analysis is used to develop a novel statistical RTT based
model for multi state network classification.
An Adaptive Multi State Proactive Transport Protocol consisting
of Proactive Slow Start, State based Error Recovery, Timeout Action
and Proactive Reduction is proposed which uses the multi state
network state classification model. This paper also confirms through
detail simulation and analysis that a prior knowledge about the
overall characteristics of the network helps in enhancing the
performance of the protocol over satellite channel which is
significantly affected due to channel noise and congestion.
The necessary augmentation of ns2 simulator is done for
simulating the multi state network classification logic. This
simulation has been used in detail evaluation of the protocol under
varied levels of congestion and channel noise. The performance
enhancement of this protocol with reference to established protocols
namely TCP SACK and Vegas has been discussed. The results as
discussed in this paper clearly reveal that the proposed protocol
always outperforms its peers and show a significant improvement in
very high error conditions as envisaged in the design of the protocol.
Abstract: Wireless mobile communications have experienced
the phenomenal growth through last decades. The advances in
wireless mobile technologies have brought about a demand for high
quality multimedia applications and services. For such applications
and services to work, signaling protocol is required for establishing,
maintaining and tearing down multimedia sessions. The Session
Initiation Protocol (SIP) is an application layer signaling protocols,
based on request/response transaction model. This paper considers
SIP INVITE transaction over an unreliable medium, since it has been
recently modified in Request for Comments (RFC) 6026. In order to
help in assuring that the functional correctness of this modification is
achieved, the SIP INVITE transaction is modeled and analyzed using
Colored Petri Nets (CPNs). Based on the model analysis, it is
concluded that the SIP INVITE transaction is free of livelocks and
dead codes, and in the same time it has both desirable and
undesirable deadlocks. Therefore, SIP INVITE transaction should be
subjected for additional updates in order to eliminate undesirable
deadlocks. In order to reduce the cost of implementation and
maintenance of SIP, additional remodeling of the SIP INVITE
transaction is recommended.
Abstract: Cryptographic protocols are widely used in various
applications to provide secure communications. They are usually
represented as communicating agents that send and receive messages.
These agents use their knowledge to exchange information and
communicate with other agents involved in the protocol. An agent
knowledge can be partitioned into explicit knowledge and procedural
knowledge. The explicit knowledge refers to the set of information
which is either proper to the agent or directly obtained from other
agents through communication. The procedural knowledge relates to
the set of mechanisms used to get new information from what is
already available to the agent.
In this paper, we propose a mathematical framework which specifies
the explicit knowledge of an agent involved in a cryptographic
protocol. Modelling this knowledge is crucial for the specification,
analysis, and implementation of cryptographic protocols. We also,
report on a prototype tool that allows the representation and the
manipulation of the explicit knowledge.
Abstract: Target tracking and localization are important applications
in wireless sensor networks. In these applications, sensor nodes
collectively monitor and track the movement of a target. They have
limited energy supplied by batteries, so energy efficiency is essential
for sensor networks. Most existing target tracking protocols need to
wake up sensors periodically to perform tracking. Some unnecessary
energy waste is thus introduced. In this paper, an energy efficient
protocol for target localization is proposed. In order to preserve
energy, the protocol fixes the number of sensors for target tracking,
but it retains the quality of target localization in an acceptable
level. By selecting a set of sensors for target localization, the other
sensors can sleep rather than periodically wake up to track the target.
Simulation results show that the proposed protocol saves a significant
amount of energy and also prolongs the network lifetime.