Abstract: To meet the demands of wireless sensor networks
(WSNs) where data are usually aggregated at a single source prior to
transmitting to any distant user, there is a need to establish a tree
structure inside any given event region. In this paper , a novel
technique to create one such tree is proposed .This tree preserves the
energy and maximizes the lifetime of event sources while they are
constantly transmitting for data aggregation. The term Decentralized
Lifetime Maximizing Tree (DLMT) is used to denote this tree.
DLMT features in nodes with higher energy tend to be chosen as data
aggregating parents so that the time to detect the first broken tree link
can be extended and less energy is involved in tree maintenance. By
constructing the tree in such a way, the protocol is able to reduce the
frequency of tree reconstruction, minimize the amount of data loss
,minimize the delay during data collection and preserves the energy.
Abstract: In this work, we study the impact of dynamically
changing link slowdowns on the stability properties of packetswitched
networks under the Adversarial Queueing Theory
framework. Especially, we consider the Adversarial, Quasi-Static
Slowdown Queueing Theory model, where each link slowdown may
take on values in the two-valued set of integers {1, D} with D > 1
which remain fixed for a long time, under a (w, ¤ü)-adversary. In this
framework, we present an innovative systematic construction for the
estimation of adversarial injection rate lower bounds, which, if
exceeded, cause instability in networks that use the LIS (Longest-in-
System) protocol for contention-resolution. In addition, we show that
a network that uses the LIS protocol for contention-resolution may
result in dropping its instability bound at injection rates ¤ü > 0 when
the network size and the high slowdown D take large values. This is
the best ever known instability lower bound for LIS networks.
Abstract: The vertex connectivity of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. This work is devoted to the problem of vertex connectivity test of graphs in a distributed environment based on a general and a constructive approach. The contribution of this paper is threefold. First, using a preconstructed spanning tree of the considered graph, we present a protocol to test whether a given graph is 2-connected using only local knowledge. Second, we present an encoding of this protocol using graph relabeling systems. The last contribution is the implementation of this protocol in the message passing model. For a given graph G, where M is the number of its edges, N the number of its nodes and Δ is its degree, our algorithms need the following requirements: The first one uses O(Δ×N2) steps and O(Δ×logΔ) bits per node. The second one uses O(Δ×N2) messages, O(N2) time and O(Δ × logΔ) bits per node. Furthermore, the studied network is semi-anonymous: Only the root of the pre-constructed spanning tree needs to be identified.
Abstract: In this paper the authors propose a protocol, which uses Elliptic Curve Cryptography (ECC) based on the ElGamal-s algorithm, for sending small amounts of data via an authentication server. The innovation of this approach is that there is no need for a symmetric algorithm or a safe communication channel such as SSL. The reason that ECC has been chosen instead of RSA is that it provides a methodology for obtaining high-speed implementations of authentication protocols and encrypted mail techniques while using fewer bits for the keys. This means that ECC systems require smaller chip size and less power consumption. The proposed protocol has been implemented in Java to analyse its features and vulnerabilities in the real world.
Abstract: Mobile Ad hoc Network (MANET) is a wireless ad hoc self-configuring network of mobile routers (and associated hosts) connected by wireless links, the union of which forms an arbitrary topology, cause of the random mobility of the nodes. In this paper, an attempt has been made to compare these three protocols DSDV, AODV and DSR on the performance basis under different traffic protocols namely CBR and TCP in a large network. The simulation tool is NS2, the scenarios are made to see the effect of pause times. The results presented in this paper clearly indicate that the different protocols behave differently under different pause times. Also, the results show the main characteristics of different traffic protocols operating on MANETs and thus select the best protocol on each scenario.
Abstract: Many corporations are seriously concerned about
security of networks and therefore, their network supervisors are still
reluctant to install WLANs. In this regards, the IEEE802.11i standard
was developed to address the security problems, even though the
mistrust of the wireless LAN technology is still existing. The thought
was that the best security solutions could be found in open standards
based technologies that can be delivered by Virtual Private
Networking (VPN) being used for long time without addressing any
security holes for the past few years. This work, addresses this issue
and presents a simulated wireless LAN of IEEE802.11g protocol, and
analyzes impact of integrating Virtual Private Network technology to
secure the flow of traffic between the client and the server within the
LAN, using OPNET WLAN utility. Two Wireless LAN scenarios
have been introduced and simulated. These are based on normal
extension to a wired network and VPN over extension to a wired
network. The results of the two scenarios are compared and indicate
the impact of improving performance, measured by response time
and load, of Virtual Private Network over wireless LAN.
Abstract: In this paper, we implement a modern serial backplane
platform for telecommunication inter-rack systems. For combination
high reliability and low cost protocol property, we applied high level
data link control (HDLC) protocol with low voltage differential
signaling (LVDS) bus for card to card communicated over backplane.
HDLC protocol is a high performance with several operation modes
and is famous in telecommunication systems. LVDS bus is a high
reliability with high immunity against electromagnetic interference
(EMI) and noise.
Abstract: A mobile Ad-hoc network consists of wireless nodes
communicating without the need for a centralized administration. A
user can move anytime in an ad hoc scenario and, as a result, such a
network needs to have routing protocols which can adopt
dynamically changing topology. To accomplish this, a number of ad
hoc routing protocols have been proposed and implemented, which
include DSR, OLSR and AODV. This paper presents a study on the
QoS parameters for MANET application traffics in large-scale
scenarios with 50 and 120 nodes. The application traffics analyzed in
this study is File Transfer Protocol (FTP). In large scale networks
(120 nodes) OLSR shows better performance and in smaller scale
networks (50 nodes)AODV shows less packet drop rate and OLSR
shows better throughput.
Abstract: Smart Grids employ wireless sensor networks for
their control and monitoring. Sensors are characterized by limitations
in the processing power, energy supply and memory spaces, which
require a particular attention on the design of routing and data
management algorithms.
Since most routing algorithms for sensor networks, focus on
finding energy efficient paths to prolong the lifetime of sensor
networks, the power of sensors on efficient paths depletes quickly,
and consequently sensor networks become incapable of monitoring
events from some parts of their target areas. In consequence, the
design of routing protocols should consider not only energy
efficiency paths, but also energy efficient algorithms in general.
In this paper we propose an energy efficient routing protocol for
wireless sensor networks without the support of any location
information system. The reliability and the efficiency of this protocol
have been demonstrated by simulation studies where we compare
them to the legacy protocols. Our simulation results show that these
algorithms scale well with network size and density.
Abstract: Nowadays, Multimedia Communication has been developed and improved rapidly in order to enable users to communicate between each other over the Internet. In general, the multimedia communication consists of audio and video communication. However, this paper focuses on audio streams. The audio translation between protocols is a very critical issue due to solving the communication problems between any two protocols, as well as it enables people around the world to talk with each other at anywhere and anytime even they use different protocols. In this paper, a proposed method for an audio translation module between two protocols has been presented. These two protocols are InterAsterisk eXchange Protocol (IAX) and Real Time Switching Control Protocol (RSW), which they are widely used to provide two ways audio transfer feature. The result of this work is to introduce possibility of interworking together.
Abstract: As computer network technology becomes
increasingly complex, it becomes necessary to place greater
requirements on the validity of developing standards and the
resulting technology. Communication networks are based on large
amounts of protocols. The validity of these protocols have to be
proved either individually or in an integral fashion. One strategy for
achieving this is to apply the growing field of formal methods.
Formal methods research defines systems in high order logic so that
automated reasoning can be applied for verification. In this research
we represent and implement a formerly announced multicast protocol
in Prolog language so that certain properties of the protocol can be
verified. It is shown that by using this approach some minor faults in
the protocol were found and repaired. Describing the protocol as
facts and rules also have other benefits i.e. leads to a process-able
knowledge. This knowledge can be transferred as ontology between
systems in KQML format. Since the Prolog language can increase its
knowledge base every time, this method can also be used to learn an
intelligent network.
Abstract: Network exchange is now widely used. However, it still
cannot avoid the problems evolving from network exchange. For
example. A buyer may not receive the order even if he/she makes the
payment. For another example, the seller possibly get nothing even
when the merchandise is sent. Some studies about the fair exchange
have proposed protocols for the design of efficiency and exploited the
signature property to specify that two parties agree on the exchange.
The information about purchased item and price are disclosed in
this way. This paper proposes a new fair network payment protocol
with off-line trusted third party. The proposed protocol can protect
the buyers- purchase message from being traced. In addition, the
proposed protocol can meet the proposed requirements. The most
significant feature is Non-transfer property we achieved.
Abstract: To support user mobility for a wireless network new mechanisms are needed and are fundamental, such as paging, location updating, routing, and handover. Also an important key feature is mobile QoS offered by the WATM. Several ATM network protocols should be updated to implement mobility management and to maintain the already ATM QoS over wireless ATM networks. A survey of the various schemes and types of handover is provided. Handover procedure allows guarantee the terminal connection reestablishment when it moves between areas covered by different base stations. It is useful to satisfy user radio link transfer without interrupting a connection. However, failure to offer efficient solutions will result in handover important packet loss, severe delays and degradation of QoS offered to the applications. This paper reviews the requirements, characteristics and open issues of wireless ATM, particularly with regard to handover. It introduces key aspects of WATM and mobility extensions, which are added in the fixed ATM network. We propose a flexible approach for handover management that will minimize the QoS deterioration. Functional entities of this flexible approach are discussed in order to achieve minimum impact on the connection quality when a MT crosses the BS.
Abstract: In this paper optimization of routing in ad-hoc
networks is surveyed and a new method for reducing the complexity
of routing algorithms is suggested. Using binary matrices for each
node in the network and updating it once the routing is done, helps
nodes to stop repeating the routing protocols in each data transfer.
The algorithm suggested can reduce the complexity of routing to the
least amount possible.
Abstract: Bacterial magnetic nanoparticles have great useful potential in biotechnological and biomedical applications. In this study, a liquid growth medium was modified for cultivation a fastidious magnetotactic bacterium that has been isolated from Anzali
lagoon, Iran in our previous research. These modifications include
change in vitamin, mineral, carbon sources and etcetera. In our
experience, the serum bottles and designed air-tight laboratory bottles
were used to create microaerobic conditions in order to development
of a method for scale-up experiment. This information may serve as a
guide to green chemistry based biological protocols for the synthesis
of magnetic nanoparticles with control over the chemical
composition, morphology and size.
Abstract: Next generation wireless/mobile networks will be IP based cellular networks integrating the internet with cellular networks. In this paper, we propose a new architecture for a high speed transport system and a mobile management protocol for mobile internet users in a transport system. Existing mobility management protocols (MIPv6, HMIPv6) do not consider real world fast moving wireless hosts (e.g. passengers in a train). For this reason, we define a virtual organization (VO) and proposed the VO architecture for the transport system. We also classify mobility as VO mobility (intra VO) and macro mobility (inter VO). Handoffs in VO are locally managed and transparent to the CH while macro mobility is managed with Mobile IPv6. And, from the features of the transport system, such as fixed route and steady speed, we deduce the movement route and the handoff disruption time of each handoff. To reduce packet loss during handoff disruption time, we propose pre-registration scheme using pre-registration. Moreover, the proposed protocol can eliminate unnecessary binding updates resulting from sequence movement at high speed. The performance evaluations demonstrate our proposed protocol has a good performance at transport system environment. Our proposed protocol can be applied to the usage of wireless internet on the train, subway, and high speed train.
Abstract: The advancement in wireless technology with the wide
use of mobile devices have drawn the attention of the research and
technological communities towards wireless environments, such as
Wireless Local Area Networks (WLANs), Wireless Wide Area
Networks (WWANs), and mobile systems and ad-hoc networks.
Unfortunately, wired and wireless networks are expressively different
in terms of link reliability, bandwidth, and time of propagation delay
and by adapting new solutions for these enhanced
telecommunications, superior quality, efficiency, and opportunities
will be provided where wireless communications were otherwise
unfeasible. Some researchers define 4G as a significant improvement
of 3G, where current cellular network’s issues will be solved and data
transfer will play a more significant role. For others, 4G unifies
cellular and wireless local area networks, and introduces new routing
techniques, efficient solutions for sharing dedicated frequency bands,
and an increased mobility and bandwidth capacity. This paper
discusses the possible solutions and enhancements probabilities that
proposed to improve the performance of Transmission Control
Protocol (TCP) over different wireless networks and also the paper
investigated each approach in term of advantages and disadvantages.
Abstract: This paper focuses on reducing the power consumption
of wireless sensor networks. Therefore, a communication protocol
named LEACH (Low-Energy Adaptive Clustering Hierarchy) is modified.
We extend LEACHs stochastic cluster-head selection algorithm
by a modifying the probability of each node to become cluster-head
based on its required energy to transmit to the sink. We present
an efficient energy aware routing algorithm for the wireless sensor
networks. Our contribution consists in rotation selection of clusterheads
considering the remoteness of the nodes to the sink, and then,
the network nodes residual energy. This choice allows a best distribution
of the transmission energy in the network. The cluster-heads
selection algorithm is completely decentralized. Simulation results
show that the energy is significantly reduced compared with the
previous clustering based routing algorithm for the sensor networks.
Abstract: Web services are pieces of software that can be invoked via a standardized protocol. They can be combined via formalized taskflow languages. The Open Knowledge system is a fully distributed system using P2P technology, that allows users to publish the setaskflows, and programmers to register their web services or publish implementations of them, for the roles described in these workflows.Besides this, the system offers the functionality to select a peer that could coordinate such an interaction model and inform web services when it is their 'turn'. In this paper we describe the architecture and implementation of the Open Knowledge Kernel which provides the core functionality of the Open Knowledge system.
Abstract: In this paper, we design an integration security system
that provides authentication service, authorization service, and
management service of security data and a unified interface for the
management service. The interface is originated from XKMS protocol
and is used to manage security data such as XACML policies, SAML
assertions and other authentication security data including public keys.
The system includes security services such as authentication,
authorization and delegation of authentication by employing SAML
and XACML based on security data such as authentication data,
attributes information, assertions and polices managed with the
interface in the system. It also has SAML producer that issues
assertions related on the result of the authentication and the
authorization services.