Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Dibyendu Chakrabarti"'
Publikováno v:
International Journal of Distributed Sensor Networks, Vol 1, Iss 3-4, Pp 345-354 (2005)
Externí odkaz:
https://doaj.org/article/f58613ff883347cfbf8c40a7ffe28cae
Publikováno v:
International Journal of Information Security. 5:105-114
In this paper, combinatorial design followed by randomized merging strategy is applied to key pre-distribution in sensor nodes. A transversal design is used to construct a (v, b, r, k) configuration and then randomly selected blocks are merged to for
Publikováno v:
International Journal of Distributed Sensor Networks, Vol 1, Iss 3-4, Pp 345-354 (2005)
Key pre-distribution is an important area of research in Distributed Sensor Networks (DSN). Two sensor nodes are considered connected for secure communication if they share one or more common secret key(s). It is important to analyse the largest subs
Autor:
Dibyendu Chakrabarti
Publikováno v:
2009 IEEE International Conference on Industrial Engineering and Engineering Management.
An important practical application of secure sensor networks is to monitor an area that may be divided into a square grid, where the sensor devices may be placed at the points of intersection with reasonable precision. In this paper, a simulation met
Autor:
Jennifer Seberry, Dibyendu Chakrabarti
Publikováno v:
RoboCup 2005: Robot Soccer World Cup IX ISBN: 9783540354376
ACNS
ACNS
Combinatorial designs are very effective tools for managing keys in an infrastructure where power and memory are two major constraints. None of the present day wireless technologies takes the advantage of combinatorial designs. In this paper, we have
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5506f34f1ea2dfc6db75fb55e0c5273b
https://doi.org/10.1007/11767480_25
https://doi.org/10.1007/11767480_25
Publikováno v:
Distributed Computing – IWDC 2005 ISBN: 9783540309598
IWDC
IWDC
Key pre-distribution is an important area of research in Distributed Sensor Networks (DSN). Two sensor nodes are considered connected for secure communication if they share one or more common secret key(s). It is important to analyze the largest subs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::efede97372bee2eb94763f3a976b9cf3
https://doi.org/10.1007/11603771_36
https://doi.org/10.1007/11603771_36
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540290018
ISC
ISC
In this paper, combinatorial design followed by a probabilistic merging is applied to key pre-distribution in sensor nodes. A transversal design is used to construct a (v, b, r, k) configuration and then randomly chosen blocks are merged to form sens
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e14b5d2aeee24c2c677973fd79ff16fd
https://doi.org/10.1007/11556992_7
https://doi.org/10.1007/11556992_7
Autor:
Subhroshekhar Ghosh, Partha Mukhopadhyay, Dibyendu Chakrabarti, Samuel L. Braunstein, Subhamoy Maitra, Byung-Soo Choi
We exploit Grover operator of database search algorithm for weight decision algorithm. In this research, weight decision problem is to find an exact weight w from given two weights as w1 and w2 where w1+w2=1 and 02. Hence the quantum algorithm achiev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46899c8b614ac84ebd3b88d12c40b015
http://arxiv.org/abs/quant-ph/0410043
http://arxiv.org/abs/quant-ph/0410043