FIGURE
9: RESULTS
Electronics (ISIE), 2010 IEEE International Symposium on , vol., no.,
pp.3477,3482, 4-7 July 2010 doi: 10.1109/ISIE.2010.5637779
[2] Dimokas, N.; Katsaros, D.; Manolopoulos, Y., ”Node Clustering in
Wireless Sensor Networks by Considering Structural Characteristics of
the Network Graph,” Information Technology,
2007. ITNG ’07. Fourth International Conference, pp.122 -127, 2-4
April 2007 doi: 10.1109/ITNG.2007.136
TABLE 4: TIME CONSUMPTION VALUES FOR EACH PHASE
X. CONCLUSION
The scheme has been proposed for encryption and decryption over elliptic
curves making it less complex because of the lower key sizes in Elliptic
Curve Cryptography. It is a concoction of routing and clustering for
first bunching up the spatially scattered nodes of a wireless sensor
network using the fuzzy c-means clustering algorithm and providing them
unique identities using the Chinese Remainder Theorem Secret Sharing
Scheme. A-STAR Routing algorithm is used for obtaining the shortest path
for message transmission from a node to a cluster head according to the
degree of membership assigned to each cluster head by fuzzy logic thus
an ordered approach for transmission is followed which eradicates the
prospect of lawlessness in the network. The time–stamp mechanism, also
a subset of time-lapse cryptography has enhanced the security and
reliability of the scheme by making the decryption key available only
after a particular time. The time and space complexity of the scheme is
very low as compared to others using higher key sizes and different
secret sharing schemes.
XI. FUTURE SCOPE
Although ECC has a great potential for WSN security due to its smaller
key size & its high strength of security per bit as proposed in the
mechanism but still there is a room to further reduce the key size to
meet the potential application in the hostile WSN environment. The
scalar multiplication in ECC nearly takes about 80%of the key
calculation time on the WSN nodes. The complexity and the computational
time involved in performing the scalar multiplication can be drastically
reduced by either opting for an optimized algorithm which offers less
hamming weight or opting for hyper-elliptic curve based cryptosystems.
REFERENCES
.
[1] Hoang, D. C.; Kumar, R.; Panda, S.K., ”Fuzzy C-Means clustering
protocol for Wireless Sensor Networks,” Industrial
[3] Time-Lapse Cryptography
Michael O. Rabin_ Christopher Thorpe Harvard University, School of
Engineering and Applied Science, Cambridge MA
02138
[4] Routing Protocols for Wireless Sensor Networks Basil
Etefia, Electrical Engineering, Loyol Marymount University
[5] Yao Liang Rui Li ;”Routing Topology Inference for Wireless
Sensor Networks”, ACM SIGCOMM Computer Communication Review
[6] Harneet Arora, Gurbhej Singh, Design and Architectural Issues in
Wireless Sensor Networks International Journal of Advanced Research in
Computer Science and Software Engineering, Volume 3, Issue 1, January
2013 ISSN: 2277
128X
[7] Keerthi M, Dr. B. Satish Babu, “An Improved FCM’s Clustering
Protocol for Wireless Sensor Networks” International Journal of
Electronics and Communications (IJEC), Volume – 1, Issue – 1, August
2012 ISSN 2279 –
0098
[8] Jaydip Sen”A Survey on Wireless Sensor Network Security”, Tata
Consultancy Services Limited, Wireless & Multimedia Innovation Lab,
International Journal of Communication Networks and Information Security
(IJCNIS) Vol. 1, No. 2
[9] Indra, G.; Taneja, R., ”An ECC-Time Stamp Based Mutual
Authentication and Key Management Scheme for WSNs,” Advanced Information
Networking and Applications Workshops (WAINA), 2013 27th International
Conference on , vol., no., pp.883,889, 25-28 March 2013 doi:
10.1109/WAINA.2013.52
[10] Jian Li; Yun Li ; Jian Ren ; Jie Wu, “Hop-by-Hop Message
Authentication and Source Privacy in Wireless Sensor Networks”, Volume
25, Issue 5, Parallel and Distributed Systems, IEEE Transactions, 2013,
ISSN: 1045-9219, DOI:
10.1109/TPDS.2013.119
[11] Indra G.; Taneja R.; “A time stamp-based elliptic curve
cryptosystem for wireless ad-hoc sensor networks” International Journal
of Space-Based and Situated Computing (IJSSC), Vol. 4, No. 1, 2014