Abstract: According to the mobility of the satellite network nodes and the characteristic of management domain dynamic partition in the satellite network, the login and logout mechanism of the satellite network dynamic management domain partition was proposed in the paper. In the mechanism, a ground branch-station sends the packets of login broadcasting to satellites in view. After received the packets, the SNMP agents on the satellites adopt link-delay test to respond. According to the mechanism, the SNMP primitives were extended, and the new added primitives were as follows: broadcasting, login, login confirmation,delay_testing, test responses, and logout. The definition of primitives, which followed RFC1157 criterion, could be encoded by the BER coding. The policy of the dynamic management domain partition on the basis of the login and logout mechanism, which was supported by the SNMP protocol, was realized by the design of the extended primitives.
Abstract: IPsec protocol[1] is a set of security extensions
developed by the IETF and it provides privacy and authentication
services at the IP layer by using modern cryptography. In this paper,
we describe both of H/W and S/W architectures of our router system,
SRS-10. The system is designed to support high performance routing
and IPsec VPN. Especially, we used Cavium-s CN2560 processor to
implement IPsec processing in inline-mode.
Abstract: The performance results of the athletes competed in
the 1988-2008 Olympic Games were analyzed (n = 166). The data
were obtained from the IAAF official protocols. In the principal
component analysis, the first three principal components explained
70% of the total variance. In the 1st principal component (with
43.1% of total variance explained) the largest factor loadings were
for 100m (0.89), 400m (0.81), 110m hurdle run (0.76), and long jump
(–0.72). This factor can be interpreted as the 'sprinting performance'.
The loadings on the 2nd factor (15.3% of the total variance)
presented a counter-intuitive throwing-jumping combination: the
highest loadings were for throwing events (javelin throwing 0.76;
shot put 0.74; and discus throwing 0.73) and also for jumping events
(high jump 0.62; pole vaulting 0.58). On the 3rd factor (11.6% of
total variance), the largest loading was for 1500 m running (0.88); all
other loadings were below 0.4.
Abstract: An on-demand routing protocol for wireless ad hoc
networks is one that searches for and attempts to discover a route to
some destination node only when a sending node originates a data
packet addressed to that node. In order to avoid the need for such a
route discovery to be performed before each data packet is sent, such
routing protocols must cache routes previously discovered. This
paper presents an analysis of the effect of intelligent caching in a non
clustered network, using on-demand routing protocols in wireless ad
hoc networks. The analysis carried out is based on the Dynamic
Source Routing protocol (DSR), which operates entirely on-demand.
DSR uses the cache in every node to save the paths that are learnt
during route discovery procedure. In this implementation, caching
these paths only at intermediate nodes and using the paths from these
caches when required is tried. This technique helps in storing more
number of routes that are learnt without erasing the entries in the
cache, to store a new route that is learnt.
The simulation results on DSR have shown that this technique
drastically increases the available memory for caching the routes
discovered without affecting the performance of the DSR routing
protocol in any way, except for a small increase in end to end delay.
Abstract: In the world of Peer-to-Peer (P2P) networking
different protocols have been developed to make the resource sharing
or information retrieval more efficient. The SemPeer protocol is a
new layer on Gnutella that transforms the connections of the nodes
based on semantic information to make information retrieval more
efficient. However, this transformation causes high clustering in the
network that decreases the number of nodes reached, therefore the
probability of finding a document is also decreased. In this paper we
describe a mathematical model for the Gnutella and SemPeer
protocols that captures clustering-related issues, followed by a
proposition to modify the SemPeer protocol to achieve moderate
clustering. This modification is a sort of link management for the
individual nodes that allows the SemPeer protocol to be more
efficient, because the probability of a successful query in the P2P
network is reasonably increased. For the validation of the models, we
evaluated a series of simulations that supported our results.
Abstract: Reliable secure multicast communication in mobile
adhoc networks is challenging due to its inherent characteristics of
infrastructure-less architecture with lack of central authority, high
packet loss rates and limited resources such as bandwidth, time and
power. Many emerging commercial and military applications require
secure multicast communication in adhoc environments. Hence key
management is the fundamental challenge in achieving reliable
secure communication using multicast key distribution for mobile
adhoc networks. Thus in designing a reliable multicast key
distribution scheme, reliability and congestion control over
throughput are essential components. This paper proposes and
evaluates the performance of an enhanced optimized multicast cluster
tree algorithm with destination sequenced distance vector routing
protocol to provide reliable multicast key distribution. Simulation
results in NS2 accurately predict the performance of proposed
scheme in terms of key delivery ratio and packet loss rate under
varying network conditions. This proposed scheme achieves
reliability, while exhibiting low packet loss rate with high key
delivery ratio compared with the existing scheme.
Abstract: Opportunistic Data Forwarding (ODF) has drawn much attention in mobile adhoc networking research in recent years. The effectiveness of ODF in MANET depends on a suitable routing protocol which provides a powerful source routing services. PLSR is featured by source routing, loop free and small routing overhead. The update messages in PLSR are integrated into a tree structure and no need to time stamp routing updates which reduces the routing overhead.
Abstract: Wireless sensor networks have been used in wide
areas of application and become an attractive area for researchers in
recent years. Because of the limited energy storage capability of
sensor nodes, Energy consumption is one of the most challenging
aspects of these networks and different strategies and protocols deals
with this area. This paper presents general methods for designing low
power wireless sensor network. Different sources of energy
consumptions in these networks are discussed here and techniques for
alleviating the consumption of energy are presented.
Abstract: Nowadays companies strive to survive in a
competitive global environment. To speed up product
development/modifications, it is suggested to adopt a collaborative
product development approach. However, despite the advantages of
new IT improvements still many CAx systems work separately and
locally. Collaborative design and manufacture requires a product
information model that supports related CAx product data models. To
solve this problem many solutions are proposed, which the most
successful one is adopting the STEP standard as a product data model
to develop a collaborative CAx platform. However, the improvement
of the STEP-s Application Protocols (APs) over the time, huge
number of STEP AP-s and cc-s, the high costs of implementation,
costly process for conversion of older CAx software files to the STEP
neutral file format; and lack of STEP knowledge, that usually slows
down the implementation of the STEP standard in collaborative data
exchange, management and integration should be considered. In this
paper the requirements for a successful collaborative CAx system is
discussed. The STEP standard capability for product data integration
and its shortcomings as well as the dominant platforms for supporting
CAx collaboration management and product data integration are
reviewed. Finally a platform named LAYMOD to fulfil the
requirements of CAx collaborative environment and integrating the
product data is proposed. The platform is a layered platform to enable
global collaboration among different CAx software
packages/developers. It also adopts the STEP modular architecture
and the XML data structures to enable collaboration between CAx
software packages as well as overcoming the STEP standard
limitations. The architecture and procedures of LAYMOD platform
to manage collaboration and avoid contradicts in product data
integration are introduced.
Abstract: Today, node-disjoint routing becomes inessential
technique in communication of packets among various nodes in
networks. Meanwhile AODV (Ad Hoc On-demand Multipath
Distance Vector) creates single-path route between a pair of source
and destination nodes. Some researches has done so far to make
multipath node-disjoint routing based on AODV protocol. But
however their overhead and end-to-end delay are relatively high,
while the detail of their code is not available too. This paper proposes
a new approach of multipath node-disjoint routing based on AODV
protocol. Then the algorithm of analytical model is presented. The
extensive results of this algorithm will be presented in the next paper.
Abstract: Since IEC61850 substation communication standard represents the trend to develop new generations of Substation Automation System (SAS), many IED manufacturers pursue this technique and apply for KEMA. In order to put on the market to meet customer demand as fast as possible, manufacturers often apply their products only for basic environment standard certification but claim to conform to IEC61850 certification. Since verification institutes generally perform verification tests only on specific IEDs of the manufacturers, the interoperability between all certified IEDs cannot be guaranteed. Therefore the interoperability between IEDs from different manufacturers needs to be tested. Based upon the above reasons, this study applies the definitions of the information models, communication service, GOOSE functionality and Substation Configuration Language (SCL) of the IEC61850 to build the concept of communication protocols, and build the test environment. The procedures of the test of the data collection and exchange of the P2P communication mode and Client / Server communication mode in IEC61850 are outlined as follows. First, test the IED GOOSE messages communication capability from different manufacturers. Second, collect IED data from each IED with SCADA system and use HMI to display the SCADA platform. Finally, problems generally encountered in the test procedure are summarized.
Abstract: Blind Signature were introduced by Chaum. In this
scheme, a signer can “sign” a document without knowing the
document contain. This is particularly important in electronic voting.
CryptO-0N2 is an electronic voting protocol which is development of
CryptO-0N. During its development this protocol has not been
furnished with the requirement of blind signature, so the choice of
voters can be determined by counting center. In this paper will be
presented of implementation of blind signature using RSA algorithm.
Abstract: Checkpointing is one of the commonly used techniques to provide fault-tolerance in distributed systems so that the system can operate even if one or more components have failed. However, mobile computing systems are constrained by low bandwidth, mobility, lack of stable storage, frequent disconnections and limited battery life. Hence, checkpointing protocols having lesser number of synchronization messages and fewer checkpoints are preferred in mobile environment. There are two different approaches, although not orthogonal, to checkpoint mobile computing systems namely, time-based and index-based. Our protocol is a fusion of these two approaches, though not first of its kind. In the present exposition, an index-based checkpointing protocol has been developed, which uses time to indirectly coordinate the creation of consistent global checkpoints for mobile computing systems. The proposed algorithm is non-blocking, adaptive, and does not use any control message. Compared to other contemporary checkpointing algorithms, it is computationally more efficient because it takes lesser number of checkpoints and does not need to compute dependency relationships. A brief account of important and relevant works in both the fields, time-based and index-based, has also been included in the presentation.
Abstract: This paper introduces our first efforts of developing a
new team for RoboCup Middle Size Competition. In our robots we
have applied omni directional based mobile system with omnidirectional
vision system and fuzzy control algorithm to navigate
robots. The control architecture of MRL middle-size robots is a three
layered architecture, Planning, Sequencing, and Executing. It also
uses Blackboard system to achieve coordination among agents.
Moreover, the architecture should have minimum dependency on low
level structure and have a uniform protocol to interact with real
robot.
Abstract: In this paper we present a full performance analysis of an energy conserving routing protocol in mobile ad hoc network, named ER-AODV (Energy Reverse Ad-hoc On-demand Distance Vector routing). ER-AODV is a reactive routing protocol based on a policy which combines two mechanisms used in the basic AODV protocol. AODV and most of the on demand ad hoc routing protocols use single route reply along reverse path. Rapid change of topology causes that the route reply could not arrive to the source node, i.e. after a source node sends several route request messages, the node obtains a reply message, and this increases in power consumption. To avoid these problems, we propose a mechanism which tries multiple route replies. The second mechanism proposes a new adaptive approach which seeks to incorporate the metric "residual energy " in the process route selection, Indeed the residual energy of mobile nodes were considered when making routing decisions. The results of simulation show that protocol ER-AODV answers a better energy conservation.
Abstract: Topological changes in mobile ad hoc networks
frequently render routing paths unusable. Such recurrent path failures
have detrimental effects on quality of service. A suitable technique
for eliminating this problem is to use multiple backup paths between
the source and the destination in the network. This paper proposes an
effective and efficient protocol for backup and disjoint path set in ad
hoc wireless network. This protocol converges to a highly reliable
path set very fast with no message exchange overhead. The paths
selection according to this algorithm is beneficial for mobile ad hoc
networks, since it produce a set of backup paths with more high
reliability. Simulation experiments are conducted to evaluate the
performance of our algorithm in terms of route numbers in the path
set and its reliability. In order to acquire link reliability estimates, we
use link expiration time (LET) between two nodes.
Abstract: In this article we propose to model Net-banking
system by game theory. We adopt extensive game to model our web
application. We present the model in term of players and strategy.
We present UML diagram related the protocol game.
Abstract: The increasing development of wireless networks and
the widespread popularity of handheld devices such as Personal
Digital Assistants (PDAs), mobile phones and wireless tablets
represents an incredible opportunity to enable mobile devices as a
universal payment method, involving daily financial transactions.
Unfortunately, some issues hampering the widespread acceptance of
mobile payment such as accountability properties, privacy protection,
limitation of wireless network and mobile device. Recently, many
public-key cryptography based mobile payment protocol have been
proposed. However, limited capabilities of mobile devices and
wireless networks make these protocols are unsuitable for mobile
network. Moreover, these protocols were designed to preserve
traditional flow of payment data, which is vulnerable to attack and
increase the user-s risk. In this paper, we propose a private mobile
payment protocol which based on client centric model and by
employing symmetric key operations. The proposed mobile payment
protocol not only minimizes the computational operations and
communication passes between the engaging parties, but also
achieves a completely privacy protection for the payer. The future
work will concentrate on improving the verification solution to
support mobile user authentication and authorization for mobile
payment transactions.
Abstract: Due to the limited energy resources, energy efficient operation of sensor node is a key issue in wireless sensor networks. Clustering is an effective method to prolong the lifetime of energy constrained wireless sensor network. However, clustering in wireless sensor network faces several challenges such as selection of an optimal group of sensor nodes as cluster, optimum selection of cluster head, energy balanced optimal strategy for rotating the role of cluster head in a cluster, maintaining intra and inter cluster connectivity and optimal data routing in the network. In this paper, we propose a protocol supporting an energy efficient clustering, cluster head selection/rotation and data routing method to prolong the lifetime of sensor network. Simulation results demonstrate that the proposed protocol prolongs network lifetime due to the use of efficient clustering, cluster head selection/rotation and data routing.
Abstract: Internet Protocol version 4 (IPv4) address is decreasing and a rapid transition method to the next generation IP address (IPv6) should be established. This study aims to evaluate and select the best performance of the IPv6 address network transitionmechanisms, such as IPv4/IPv6 dual stack, transport Relay Translation (TRT) and Reverse Proxy with additional features. It is also aim to prove that faster access can be done while ensuring optimal usage of available resources used during the test and actual implementation. This study used two test methods such asInternet Control Message Protocol (ICMP)ping and ApacheBenchmark (AB) methodsto evaluate the performance.Performance metrics for this study include aspects ofaverageaccessin one second,time takenfor singleaccess,thedata transfer speed and the costof additional requirements.Reverse Proxy with Caching featureis the most efficientmechanism because of it simpler configurationandthe best performerfrom the test conducted.