963 research outputs found
Improved Fair-Zone technique using Mobility Prediction in WSN
The self-organizational ability of ad-hoc Wireless Sensor Networks (WSNs) has
led them to be the most popular choice in ubiquitous computing. Clustering
sensor nodes organizing them hierarchically have proven to be an effective
method to provide better data aggregation and scalability for the sensor
network while conserving limited energy. It has some limitation in energy and
mobility of nodes. In this paper we propose a mobility prediction technique
which tries overcoming above mentioned problems and improves the life time of
the network. The technique used here is Exponential Moving Average for online
updates of nodal contact probability in cluster based network.Comment: 10 pages, 7 figures, Published in International Journal Of Advanced
Smart Sensor Network Systems (IJASSN
IOT – Attacks and Challenges
Internet of Things (IoT) is becoming a big boom in the wireless networking. This is connectivity among different entities or things. As the devices are directly connected to each other to share the information there occurs a challenging issues in security.This is a study paper which focuses on the vulnerabilities and various attacks in each layer of the IoT
A comparative study of clusterhead selection algorithms in wireless sensor networks
In Wireless Sensor Network, sensor nodes life time is the most critical
parameter. Many researches on these lifetime extension are motivated by LEACH
scheme, which by allowing rotation of cluster head role among the sensor nodes
tries to distribute the energy consumption over all nodes in the network.
Selection of clusterhead for such rotation greatly affects the energy
efficiency of the network. Different communication protocols and algorithms are
investigated to find ways to reduce power consumption. In this paper brief
survey is taken from many proposals, which suggests different clusterhead
selection strategies and a global view is presented. Comparison of their costs
of clusterhead selection in different rounds, transmission method and other
effects like cluster formation, distribution of clusterheads and creation of
clusters shows a need of a combined strategy for better results.Comment: 12 pages, 3 figures, 5 tables, Int JournaL, International Journal of
Computer Science & Engineering Survey (IJCSES) Vol.2, No.4, November 201
Lih Wang and Dittert Conjectures on Permanents
Let denote the set of all doubly stochastic matrices of order .
Lih and Wang conjectured that for , perperper, for all and all , where
is the matrix with each entry equal to . This
conjecture was proved partially for . \\ \indent Let denote the
set of non-negative matrices whose elements have sum . Let
be a real valued function defined on by
- per for with
row sum vector and column sum vector . A
matrix is called a -maximizing matrix if
for all . Dittert conjectured that is the unique
-maximizing matrix on . Sinkhorn proved the conjecture for and
Hwang proved it for . \\ \indent In this paper, we prove the Lih and Wang
conjecture for and Dittert conjecture for .Comment: 15 page
Permanental Mates: Perturbations and Hwang’s conjecture
AbstractLet Ωn denote the set of all n×n doubly stochastic matrices. Two unequal matrices A and B in Ωn are called permanental mates if the permanent function is constant on the line segment tA+(1−t)B,0≤t≤1, connecting A and B. We study the perturbation matrix A+E of a symmetric matrix A in Ωn as a permanental mate of A. Also we show an example to disprove Hwang’s conjecture, which states that, for n≥4, any matrix in the interior of Ωn has no permanental mate
Every Elementary Graph is Chromatic Choosable
Elementary graphs are graphs whose edges can be colored using two colors in
such a way that the edges in any induced get distinct colors. They
constitute a subclass of the class of claw-free perfect graphs. In this paper,
we show that for any elementary graph, its list chromatic number and chromatic
number are equal
- …