Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29644


Select areas to restrict search in scientific publication database:
10004646
Dominating Set Algorithm and Trust Evaluation Scheme for Secured Cluster Formation and Data Transferring
Abstract:
This paper describes the proficient way of choosing the cluster head based on dominating set algorithm in a wireless sensor network (WSN). The algorithm overcomes the energy deterioration problems by this selection process of cluster heads. Clustering algorithms such as LEACH, EEHC and HEED enhance scalability in WSNs. Dominating set algorithm keeps the first node alive longer than the other protocols previously used. As the dominating set of cluster heads are directly connected to each node, the energy of the network is saved by eliminating the intermediate nodes in WSN. Security and trust is pivotal in network messaging. Cluster head is secured with a unique key. The member can only connect with the cluster head if and only if they are secured too. The secured trust model provides security for data transmission in the dominated set network with the group key. The concept can be extended to add a mobile sink for each or for no of clusters to transmit data or messages between cluster heads and to base station. Data security id preferably high and data loss can be prevented. The simulation demonstrates the concept of choosing cluster heads by dominating set algorithm and trust evaluation using DSTE. The research done is rationalized.
Digital Object Identifier (DOI):

References:

[1] Shengbo Yang, Chai Kiat Yeo, and Bu Sung Lee, “Toward Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks”, IEEE Transactions on Mobile Computing, Vol. 11, No. 1, Jan 2012
[2] Harold Robinson, Y., & Rajaram, M. (2015). “Trustworthy link failure recovery algorithm for highly dynamic mobile adhoc networks”, World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering, vol.9, no.2, 233–236.
[3] Kai Zeng, Wenjing Lou, Jie Yang, Donald R. Brown III, “On Throughput Efficiency of Geographic Opportunistic Routing in Multihop Wireless Networks”, Springer, Mobile Networks Application (2007) 12:347–357, 2007
[4] Robinson, Y. H., & Rajeswari, S. R. (2011). “Energy-based dynamic encryption for wireless sensor networks. Wireless Communication”, vol.3, no.9, pp. 661–663.
[5] Golden Julie, E., Tamil Selvi, S., & Harold Robinson, Y. (2014). Opportunistic routing with secure coded wireless multicast using MAS approach. World Academy of Science, Engineering and Technology, International Journal of Computer, Electrical, Automation, Control and Information Engineering, vol. 8, no.7, pp. 1247–1250.
[6] Sanjit Biswas, Robert Morris, “ExOR: opportunistic multi-hop routing for wireless networks”, Proceedings of conference on Applications, technologies, architectures, and protocols for computer communications, Pages 133-144, 2005
[7] A. Trivino-Cabrera, S. Canadas-Hurtado, “Survey on Opportunistic Routing in Multihop Wireless Networks”, International Journal of Communication Networks and Information Security (IJCNIS), Vol. 3, No. 2, August 2011
[8] Harold Robinson, Y., & Rajaram, M. (2016), “A memory aided broadcast mechanism with fuzzy classification on a device-to-device mobile Ad Hoc network”, Wireless Personal Communications, 1–23, doi:10.1007/s11277-016-3213-0.
[9] Harold Robinson, Y., & Rajaram, M. (2014). “A novel approach to allocate channels dynamically in wireless mesh networks”, World Academy of Science, Engineering and Technology, International Journal of Computer, Electrical, Automation, Control and Information Engineering, 8(10), 1865–1868.
[10] Stepanov, D. Herrscher, K. Rothermel, “On the impact of radio propagation models on MANET simulation results”, Proceedings of 7th International Conference on Mobile and Wireless Communications Networks (MWCN 2005), Marrakech, Morocco, September 2005.
[11] Harold Robinson, Y., & Rajaram, M. (2015), “Energy-aware multipath routing scheme based on particle swarm optimization in mobile ad hoc networks”, The Scientific World Journal, 1–9. doi:10.1155/2015/284276.
[12] Harold Robinson, Y., & Rajaram, M. (2015), “Establishing pairwise keys using key Predistribution schemes for sensor networks”, World Academy of Science, Engineering and Technology International Journal of Computer, Electrical, Automation, Control and Information Engineering, 9(2), 608–612.
Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007