Abstract: Wireless capsule Endoscopy (WCE) has rapidly
shown its wide applications in medical domain last ten years
thanks to its noninvasiveness for patients and support for thorough
inspection through a patient-s entire digestive system including
small intestine. However, one of the main barriers to efficient
clinical inspection procedure is that it requires large amount of
effort for clinicians to inspect huge data collected during the
examination, i.e., over 55,000 frames in video. In this paper, we
propose a method to compute meaningful motion changes of
WCE by analyzing the obtained video frames based on regional
optical flow estimations. The computed motion vectors are used to
remove duplicate video frames caused by WCE-s imaging nature,
such as repetitive forward-backward motions from peristaltic
movements. The motion vectors are derived by calculating
directional component vectors in four local regions. Our
experiments are performed on small intestine area, which is of
main interest to clinical experts when using WCEs, and our
experimental results show significant frame reductions comparing
with a simple frame-to-frame similarity-based image reduction
method.
Abstract: Due to insufficient frequency band and tremendous growth of the mobile users, complex computation is needed for the use of resources. Long distance communication began with the introduction of telegraphs and simple coded pulses, which were used to transmit short messages. Since then numerous advances have rendered reliable transfer of information both easier and quicker. Wireless network refers to any type of computer network that is wireless, and is commonly associated with a telecommunications network whose interconnections between nodes is implemented without the use of wires. Wireless network can be broadly categorized in infrastructure network and infrastructure less network. Infrastructure network is one in which we have a base station to serve the mobile users and in the infrastructure less network is one in which no infrastructure is available to serve the mobile users this kind of networks are also known as mobile Adhoc networks. In this paper we have simulated the result for different scenarios with protocols like AODV and DSR; we simulated the result for throughput, delay and receiving traffic in the given scenario.
Abstract: This paper proposes an implementation for the
directed diffusion paradigm aids in studying this paradigm-s
operations and evaluates its behavior according to this
implementation. The directed diffusion is evaluated with respect to
the loss percentage, lifetime, end-to-end delay, and throughput.
From these evaluations some suggestions and modifications are
proposed to improve the directed diffusion behavior according to
this implementation with respect to these metrics. The proposed
modifications reflect the effect of local path repair by introducing a
technique called Loop-free Local Path Repair (LLPR) which
improves the directed diffusion behavior especially with respect to
packet loss percentage by about 92.69%. Also LLPR improves the
throughput and end-to-end delay by about 55.31% and 14.06%
respectively, while the lifetime decreases by about 29.79%.
Abstract: With the rapid popularization of internet services, it is apparent that the next generation terrestrial communication systems must be capable of supporting various applications like voice, video, and data. This paper presents the performance evaluation of turbo- coded mobile terrestrial communication systems, which are capable of providing high quality services for delay sensitive (voice or video) and delay tolerant (text transmission) multimedia applications in urban and suburban areas. Different types of multimedia information require different service qualities, which are generally expressed in terms of a maximum acceptable bit-error-rate (BER) and maximum tolerable latency. The breakthrough discovery of turbo codes allows us to significantly reduce the probability of bit errors with feasible latency. In a turbo-coded system, a trade-off between latency and BER results from the choice of convolutional component codes, interleaver type and size, decoding algorithm, and the number of decoding iterations. This trade-off can be exploited for multimedia applications by using optimal and suboptimal performance parameter amalgamations to achieve different service qualities. The results are therefore proposing an adaptive framework for turbo-coded wireless multimedia communications which incorporate a set of performance parameters that achieve an appropriate set of service qualities, depending on the application's requirements.
Abstract: SDMA (Space-Division Multiple Access) is a MIMO
(Multiple-Input and Multiple-Output) based wireless communication
network architecture which has the potential to significantly increase
the spectral efficiency and the system performance. The maximum
likelihood (ML) detection provides the optimal performance, but its
complexity increases exponentially with the constellation size of
modulation and number of users. The QR decomposition (QRD)
MUD can be a substitute to ML detection due its low complexity and
near optimal performance. The minimum mean-squared-error
(MMSE) multiuser detection (MUD) minimises the mean square
error (MSE), which may not give guarantee that the BER of the
system is also minimum. But the minimum bit error rate (MBER)
MUD performs better than the classic MMSE MUD in term of
minimum probability of error by directly minimising the BER cost
function. Also the MBER MUD is able to support more users than
the number of receiving antennas, whereas the rest of MUDs fail in
this scenario. In this paper the performance of various MUD
techniques is verified for the correlated MIMO channel models based
on IEEE 802.16n standard.
Abstract: Sensor relocation is to repair coverage holes caused by node failures. One way to repair coverage holes is to find redundant nodes to replace faulty nodes. Most researches took a long time to find redundant nodes since they randomly scattered redundant nodes around the sensing field. To record the precise position of sensor nodes, most researches assumed that GPS was installed in sensor nodes. However, high costs and power-consumptions of GPS are heavy burdens for sensor nodes. Thus, we propose a fast sensor relocation algorithm to arrange redundant nodes to form redundant walls without GPS. Redundant walls are constructed in the position where the average distance to each sensor node is the shortest. Redundant walls can guide sensor nodes to find redundant nodes in the minimum time. Simulation results show that our algorithm can find the proper redundant node in the minimum time and reduce the relocation time with low message complexity.
Abstract: Considering payload, reliability, security and operational lifetime as major constraints in transmission of images we put forward in this paper a steganographic technique implemented at the physical layer. We suggest transmission of Halftoned images (payload constraint) in wireless sensor networks to reduce the amount of transmitted data. For low power and interference limited applications Turbo codes provide suitable reliability. Ensuring security is one of the highest priorities in many sensor networks. The Turbo Code structure apart from providing forward error correction can be utilized to provide for encryption. We first consider the Halftoned image and then the method of embedding a block of data (called secret) in this Halftoned image during the turbo encoding process is presented. The small modifications required at the turbo decoder end to extract the embedded data are presented next. The implementation complexity and the degradation of the BER (bit error rate) in the Turbo based stego system are analyzed. Using some of the entropy based crypt analytic techniques we show that the strength of our Turbo based stego system approaches that found in the OTPs (one time pad).
Abstract: As mobile ad hoc networks (MANET) have different
characteristics from wired networks and even from standard wireless
networks, there are new challenges related to security issues that
need to be addressed. Due to its unique features such as open nature,
lack of infrastructure and central management, node mobility and
change of dynamic topology, prevention methods from attacks on
them are not enough. Therefore intrusion detection is one of the
possible ways in recognizing a possible attack before the system
could be penetrated. All in all, techniques for intrusion detection in
old wireless networks are not suitable for MANET. In this paper, we
classify the architecture for Intrusion detection systems that have so
far been introduced for MANETs, and then existing intrusion
detection techniques in MANET presented and compared. We then
indicate important future research directions.
Abstract: The wireless sensor networks have been extensively
deployed and researched. One of the major issues in wireless sensor
networks is a developing energy-efficient clustering protocol.
Clustering algorithm provides an effective way to prolong the lifetime
of a wireless sensor networks. In the paper, we compare several
clustering protocols which significantly affect a balancing of energy
consumption. And we propose an Energy-Efficient Distributed
Unequal Clustering (EEDUC) algorithm which provides a new way of
creating distributed clusters. In EEDUC, each sensor node sets the
waiting time. This waiting time is considered as a function of residual
energy, number of neighborhood nodes. EEDUC uses waiting time to
distribute cluster heads. We also propose an unequal clustering
mechanism to solve the hot-spot problem. Simulation results show that
EEDUC distributes the cluster heads, balances the energy
consumption well among the cluster heads and increases the network
lifetime.
Abstract: In this paper we consider a one-dimensional random
geometric graph process with the inter-nodal gaps evolving according
to an exponential AR(1) process. The transition probability matrix
and stationary distribution are derived for the Markov chains concerning
connectivity and the number of components. We analyze the
algorithm for hitting time regarding disconnectivity. In addition to
dynamical properties, we also study topological properties for static
snapshots. We obtain the degree distributions as well as asymptotic
precise bounds and strong law of large numbers for connectivity
threshold distance and the largest nearest neighbor distance amongst
others. Both exact results and limit theorems are provided in this
paper.
Abstract: Wireless Sensor networks have a wide spectrum of civil and military applications that call for secure communication such as the terrorist tracking, target surveillance in hostile environments. For the secure communication in these application areas, we propose a method for generating a hierarchical key structure for the efficient group key management. In this paper, we apply A* algorithm in generating a hierarchical key structure by considering the history data of the ratio of addition and eviction of sensor nodes in a location where sensor nodes are deployed. Thus generated key tree structure provides an efficient way of managing the group key in terms of energy consumption when addition and eviction event occurs. A* algorithm tries to minimize the number of messages needed for group key management by the history data. The experimentation with the tree shows efficiency of the proposed method.
Abstract: IEEE 802.11e is the enhanced version of the IEEE
802.11 MAC dedicated to provide Quality of Service of wireless
network. It supports QoS by the service differentiation and
prioritization mechanism. Data traffic receives different priority
based on QoS requirements. Fundamentally, applications are divided
into four Access Categories (AC). Each AC has its own buffer queue
and behaves as an independent backoff entity. Every frame with a
specific priority of data traffic is assigned to one of these access
categories. IEEE 802.11e EDCA (Enhanced Distributed Channel
Access) is designed to enhance the IEEE 802.11 DCF (Distributed
Coordination Function) mechanisms by providing a distributed
access method that can support service differentiation among
different classes of traffic. Performance of IEEE 802.11e MAC layer
with different ACs is evaluated to understand the actual benefits
deriving from the MAC enhancements.
Abstract: In this paper, our focus is to assure a global frequency synchronization in OFDMA-based wireless mesh networks with local information. To acquire the global synchronization in distributed manner, we propose a novel distributed frequency synchronization (DFS) method. DFS is a method that carrier frequencies of distributed nodes converge to a common value by repetitive estimation and averaging step and sharing step. Experimental results show that DFS achieves noteworthy better synchronization success probability than existing schemes in OFDMA-based mesh networks where the estimation error is presented.
Abstract: This paper describes the development of a WLAN
propagation model, using Spectral Analyzer measurements. The
signal is generated by two Access Points (APs) on the base floor at
the administrative Communication School of ESPOL building. In
general, users do not have a Q&S reference about a wireless network;
however, this depends on the level signal as a function of frequency,
distance and other path conditions between receiver and transmitter.
Then, power density of the signal decrease as it propagates through
space and data transfer rate is affected. This document evaluates and
implements empirical mathematical formulation for the
characterization of WLAN radio wave propagation on two aisles of
the building base floor.
Abstract: In this paper, with the purpose of further reducing the
complexity of the system, while keeping its temporal and spatial
focusing performance, we investigate the possibility of using optimal
one bit time reversal (TR) system for impulse radio ultra wideband
multi-user wireless communications. The results show that, by optimally
selecting the number of used taps in the pre-filter the optimal
one bit TR system can outperform the full one bit TR system. In
some cases, the temporal and spatial focusing performance of the
optimal one bit TR system appears to be compatible with that of the
original TR system. This is a significant result as the overhead cost
is much lower than it is required in the original TR system.
Abstract: Wireless sensor networks include small nodes which
have sensing ability; calculation and connection extend themselves
everywhere soon. Such networks have source limitation on
connection, calculation and energy consumption. So, since the nodes
have limited energy in sensor networks, the optimized energy
consumption in these networks is of more importance and has created
many challenges. The previous works have shown that by organizing
the network nodes in a number of clusters, the energy consumption
could be reduced considerably. So the lifetime of the network would
be increased. In this paper, we used the Queen-bee algorithm to
create energy efficient clusters in wireless sensor networks. The
Queen-bee (QB) is similar to nature in that the queen-bee plays a
major role in reproduction process. The QB is simulated with J-sim
simulator. The results of the simulation showed that the clustering by
the QB algorithm decreases the energy consumption with regard to
the other existing algorithms and increases the lifetime of the
network.
Abstract: Delay-Tolerant Networks (DTNs) are sparse, wireless
networks where disconnections are common due to host mobility and
low node density. The Message Ferrying (MF) scheme is a mobilityassisted
paradigm to improve connectivity in DTN-like networks. A
ferry or message ferry is a special node in the network which has
a per-determined route in the deployed area and relays messages
between mobile hosts (MHs) which are intermittently connected.
Increased contact opportunities among mobile hosts and the ferry
improve the performance of the network, both in terms of message
delivery ratio and average end-end delay. However, due to the inherent
mobility of mobile hosts and pre-determined periodicity of the
message ferry, mobile hosts may often -miss- contact opportunities
with a ferry. In this paper, we propose the combination of stationary
ferry access points (FAPs) with MF routing to increase contact
opportunities between mobile hosts and the MF and consequently
improve the performance of the DTN. We also propose several
placement models for deploying FAPs on MF routes. We evaluate the
performance of the FAP placement models through comprehensive
simulation. Our findings show that FAPs do improve the performance
of MF-assisted DTNs and symmetric placement of FAPs outperforms
other placement strategies.
Abstract: Wireless Sensor Network is widely used in electronics. Wireless sensor networks are now used in many applications including military, environmental, healthcare applications, home automation and traffic control. We will study one area of wireless sensor networks, which is the routing protocol. Routing protocols are needed to send data between sensor nodes and the base station. In this paper, we will discuss two routing protocols, such as datacentric and hierarchical routing protocol. We will show the output of the protocols using the NS-2 simulator. This paper will compare the simulation output of the two routing protocol using Nam. We will simulate using Xgraph to find the throughput and delay of the protocol.
Abstract: Multicast Network Technology has pervaded our
lives-a few examples of the Networking Techniques and also for the
improvement of various routing devices we use. As we know the
Multicast Data is a technology offers many applications to the user
such as high speed voice, high speed data services, which is presently
dominated by the Normal networking and the cable system and
digital subscriber line (DSL) technologies. Advantages of Multi cast
Broadcast such as over other routing techniques. Usually QoS
(Quality of Service) Guarantees are required in most of Multicast
applications. The bandwidth-delay constrained optimization and we
use a multi objective model and routing approach based on genetic
algorithm that optimizes multiple QoS parameters simultaneously.
The proposed approach is non-dominated routes and the performance
with high efficiency of GA. Its betterment and high optimization has
been verified. We have also introduced and correlate the result of
multicast GA with the Broadband wireless to minimize the delay in
the path.
Abstract: Three new algorithms based on minimization of autocorrelation of transmitted symbols and the SLM approach which are computationally less demanding have been proposed. In the first algorithm, autocorrelation of complex data sequence is minimized to a value of 1 that results in reduction of PAPR. Second algorithm generates multiple random sequences from the sequence generated in the first algorithm with same value of autocorrelation i.e. 1. Out of these, the sequence with minimum PAPR is transmitted. Third algorithm is an extension of the second algorithm and requires minimum side information to be transmitted. Multiple sequences are generated by modifying a fixed number of complex numbers in an OFDM data sequence using only one factor. The multiple sequences represent the same data sequence and the one giving minimum PAPR is transmitted. Simulation results for a 256 subcarrier OFDM system show that significant reduction in PAPR is achieved using the proposed algorithms.