Abstract: In this paper, we provide complete end-to-end delay analyses including the relay nodes for instant messages. Message Session Relay Protocol (MSRP) is used to provide congestion control for large messages in the Instant Messaging (IM) service. Large messages are broken into several chunks. These chunks may traverse through a maximum number of two relay nodes before reaching destination according to the IETF specification of the MSRP relay extensions. We discuss the current solutions of sending large instant messages and introduce a proposal to reduce message flows in the IM service. We consider virtual traffic parameter i.e., the relay nodes are stateless non-blocking for scalability purpose. This type of relay node is also assumed to have input rate at constant bit rate. We provide a new scheduling policy that schedules chunks according to their previous node?s delivery time stamp tags. Validation and analysis is shown for such scheduling policy. The performance analysis with the model introduced in this paper is simple and straight forward, which lead to reduced message flows in the IM service.
Abstract: This article describes design of the 8-bit asynchronous
microcontroller simulation model in VHDL. The model is created in
ISE Foundation design tool and simulated in Modelsim tool. This
model is a simple application example of asynchronous systems
designed in synchronous design tools. The design process of creating
asynchronous system with 4-phase bundled-data protocol and with
matching delays is described in the article. The model is described in
gate-level abstraction.
The simulation waveform of the functional construction is the
result of this article. Described construction covers only the
simulation model. The next step would be creating synthesizable
model to FPGA.
Abstract: This paper describes a UDP over IP based, server-oriented redundant host configuration protocol (RHCP) that can be used by collaborating embedded systems in an ad-hoc network to acquire a dynamic IP address. The service is provided by a single network device at a time and will be dynamically reassigned to one of the other network clients if the primary provider fails. The protocol also allows all participating clients to monitor the dynamic makeup of the network over time. So far the algorithm has been implemented and tested on an 8-bit embedded system architecture with a 10Mbit Ethernet interface.
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: This paper presents the findings of two experiments that were performed on the Redundancy in Wireless Connection Model (RiWC) using the 802.11b standard. The experiments were simulated using OPNET 11.5 Modeler software. The first was aimed at finding the maximum number of simultaneous Voice over Internet Protocol (VoIP) users the model would support under the G.711 and G.729 codec standards when the packetization interval was 10 milliseconds (ms). The second experiment examined the model?s VoIP user capacity using the G.729 codec standard along with background traffic using the same packetization interval as in the first experiment. To determine the capacity of the model under various experiments, we checked three metrics: jitter, delay and data loss. When background traffic was added, we checked the response time in addition to the previous three metrics. The findings of the first experiment indicated that the maximum number of simultaneous VoIP users the model was able to support was 5, which is consistent with recent research findings. When using the G.729 codec, the model was able to support up to 16 VoIP users; similar experiments in current literature have indicated a maximum of 7 users. The finding of the second experiment demonstrated that the maximum number of VoIP users the model was able to support was 12, with the existence of background traffic.
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: An efficient and green protocol for the synthesis of α-
aminonitriles derivatives by one-pot reaction of different aldehydes
with amines and trimethylsilyl cyanides has been developed using
natural alumina, alumina sulfuric acid (ASA), nano-γ-alumina, nanoalumina
sulfuric acid (nano-ASA) under microwave irradiation and
solvent-free conditions. The advantages of methods are short reaction
times, high yields, milder conditions and easy work up. The catalysts
can be recovered for the subsequent reactions and reused without any
appreciable loss of efficiency.
Abstract: Hierarchical Mobile IPv6 (HMIPv6) was designed to
support IP micro-mobility management in the Next Generation
Networks (NGN) framework. The main design behind this protocol is
the usage of Mobility Anchor Point (MAP) located at any level router
of network to support hierarchical mobility management. However,
the distance MAP selection in HMIPv6 causes MAP overloaded and
increase frequent binding update as the network grows. Therefore, to
address the issue in designing MAP selection scheme, we propose a
dynamic load control mechanism integrates with a speed detection
mechanism (DMS-DLC). From the experimental results we obtain
that the proposed scheme gives better distribution in MAP load and
increase handover speed.
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: Stevia rebaudiana Bertoni (natural sweetener) belongs
to Asteraceae family and can be used as substitute of artificial
sweeteners for diabetic patients. Conventionally, it is cultivated by
seeds or stem cutting, but seed viability rate is poor. A protocol for
callus induction and multiplication was developed to produce large
no. of calli in short period. Surface sterilized nodal, leaf and root
explants were cultured on Murashige and Skoog (MS) medium with
different concentrations of plant hormone like, IBA, kinetin, NAA,
2,4-D, and NAA in combination with 2,4-D. 100% callusing was
observed from leaf explants cultured on combination of NAA and
2,4-D after three weeks while with 2,4-D, only 10% callusing was
observed. Calli obtained from leaf and root explants were shiny green
while with nodal explants it was hard and brown. The present
findings deal with induction of callusing in Stevia to achieve the
rapid callus multiplication for study of steviol glycosides in callus
culture.
Abstract: This paper describes the performance of TCP Vegas
over the wireless IPv6 network. The performance of TCP Vegas is
evaluated using network simulator (ns-2). The simulation experiment
investigates how packet spacing affects the network delay, network
throughput and network efficiency of TCP Vegas. Moreover, we
investigate how the variable FTP packet sizes affect the network
performance. The result of the simulation experiment shows that as
the packet spacing is implements, the network delay is reduces,
network throughput and network efficiency is optimizes. As the FTP
packet sizes increase, the ratio of delay per throughput decreases.
From the result of experiment, we propose the appropriate packet size
in transmitting file transfer protocol application using TCP Vegas
with packet spacing enhancement over wireless IPv6 environment in
ns-2. Additionally, we suggest the appropriate ratio in determining
the appropriate RTT and buffer size in a network.
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: In this study, we introduced a communication system
where human body was used as medium through which data were
transferred. Multiple biosignal sensing units were attached to a subject
and wireless personal area network was formed. Data of the sensing
units were shared among them. We used wideband pulse
communication that was simple, low-power consuming and high data
rated. Each unit functioned as independent communication device or
node. A method of channel search and communication among the
modes was developed. A protocol of carrier sense multiple
access/collision detect was implemented in order to avoid data
collision or interferences. Biosignal sensing units should be located at
different locations due to the nature of biosignal origin. Our research
provided a flexibility of collecting data without using electrical wires.
More non-constrained measurement was accomplished which was
more suitable for u-Health monitoring.
Abstract: In order to monitor for traffic traversal, sensors can be
deployed to perform collaborative target detection. Such a sensor
network achieves a certain level of detection performance with the
associated costs of deployment and routing protocol. This paper
addresses these two points of sensor deployment and routing algorithm
in the situation where the absolute quantity of sensors or total energy
becomes insufficient. This discussion on the best deployment system
concluded that two kinds of deployments; Normal and Power law
distributions, show 6 and 3 times longer than Random distribution in
the duration of coverage, respectively. The other discussion on routing
algorithm to achieve good performance in each deployment system
was also addressed. This discussion concluded that, in place of the
traditional algorithm, a new algorithm can extend the time of coverage
duration by 4 times in a Normal distribution, and in the circumstance
where every deployed sensor operates as a binary model.
Abstract: IETF RFC 2002 originally introduced the wireless
Mobile-IP protocol to support portable IP addresses for mobile
devices that often change their network access points to the Internet.
The inefficiency of this protocol mainly within the handoff
management produces large end-to-end packet delays, during
registration process, and further degrades the system efficiency due to
packet losses between subnets. The criterion to initiate a simple and
fast full-duplex connection between the home agent and foreign
agent, to reduce the roaming duration, is a very important issue to be
considered by a work in this paper. State-transition Petri-Nets of the
modeling scenario-based CIA: communication inter-agents procedure
as an extension to the basic Mobile-IP registration process was
designed and manipulated. The heuristic of configuration file during
practical Setup session for registration parameters, on Cisco platform
Router-1760 using IOS 12.3 (15)T is created. Finally, stand-alone
performance simulations results from Simulink Matlab, within each
subnet and also between subnets, are illustrated for reporting better
end-to-end packet delays. Results verified the effectiveness of our
Mathcad analytical manipulation and experimental implementation. It
showed lower values of end-to-end packet delay for Mobile-IP using
CIA procedure. Furthermore, it reported packets flow between
subnets to improve packet losses between subnets.
Abstract: With getting older in the whole population, the
prevalence of stroke and its residual disability is getting higher and
higher recently in Taiwan. The functional electrical stimulation
cycling system (FESCS) is useful for hemiplegic patients. Because
that the muscle of stroke patients is under hybrid activation. The raw
electromyography (EMG) represents the residual muscle force of
stroke subject whereas the peak-to-peak of stimulus EMG indicates the
force enhancement benefiting from ES. It seems that EMG signals
could be used for a parameter of feedback control mechanism. So, we
design the feedback control protocol of FESCS, it includes
physiological signal recorder, FPGA biomedical module, DAC and
electrical stimulation circuit. Using the intensity of real-time EMG
signal obtained from patients, as a feedback control method for the
output voltage of FES-cycling system.
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: A wireless sensor network with a large number of tiny sensor nodes can be used as an effective tool for gathering data in various situations. One of the major issues in wireless sensor networks is developing an energy-efficient routing protocol which has a significant impact on the overall lifetime of the sensor network. In this paper, we propose a novel hierarchical with static clustering routing protocol called Energy-Efficient Protocol with Static Clustering (EEPSC). EEPSC, partitions the network into static clusters, eliminates the overhead of dynamic clustering and utilizes temporary-cluster-heads to distribute the energy load among high-power sensor nodes; thus extends network lifetime. We have conducted simulation-based evaluations to compare the performance of EEPSC against Low-Energy Adaptive Clustering Hierarchy (LEACH). Our experiment results show that EEPSC outperforms LEACH in terms of network lifetime and power consumption minimization.
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.