Volume-5 , Issue-12 , Dec - 2017 Go Back

Huge amount of genomic data are produced due to high-throughput sequencing technology. Those enormous volumes of sequence data require effective storage, fast transmission and provision of quick access for alignment and analysis to any record. It has been proved that standard general purpose lossless compression techniques failed to compress these sequences rather they may increase the size. But some general purpose compression method may be useful with a modification for genome compression. In this paper, a variation of statistical Huffman algorithm have been proposed named KMerHuffman, which instead of calculating frequency of individual character it comes as a substring of length four which we have experiment to be optimal due to redundancy of genome sequence. Then KMerHuffman result on benchmark sequence has been compare with the other biological sequence specific compression algorithm. The result shows that KMerHuffman is competitive with other method. Another important aspect is that there is no need of any reference sequence so it is useful for upcoming sequence.

Storage, Transmission, Alignment, Analysis, Compression, Huffman

[1] D.A. Huffman, “A method for the construction of minimum-redundancy codes”, Proc. Inst. Radio Eng., vol. 40, pp. 1098–1101, 1952.
[2] D.A. Lelewer, D.S. Hirschberg, “Data compression. Computing Surveys”, vol. 19, no. 3, pp. 261–296, 1987.
[3] A. Cannane, H.E. Williams, “General-Purpose Compression for Efficient Retrieval”, Journal of the American Society for Information Science & Technology, vol. 52, no. 5, pp. 430–437, 2001.
[4] Department of Chemistry, Queen Mary University of London, “Nomenclature for Incompletely Specified Bases in Nucleic Acid Sequences”.
[5] S. Wandelt, M. Bux, U. Leser, “Trends in Genome Compression”, June 4, 2013.
[6] P. R. Rajeswari and Dr. A. AppaRao, “DNABIT Compress – Genome compression algorithm”, Bioinformation,vol. 5 no. 8, (2011) January, pp. 350-360.
[7] S. Roy, A. Bhagat, K.A. Sharma, S. Khatua”, SBVRLDNACOMP: AN EFFECTIVE DNA SEQUENCE COMPRESSION ALGORITHM”, IJCSA, Vol.5, No.4, pp. 73-85, August 2015.
[8] S. Roy, S. Mondal, S. Khatua, M. Biswas, “An Efficient Compression Algorithm for Forthcoming New Species”, IJHIT, Vol.8, No.11, pp.323-332, November 2015.
[9] J. Ziv and A. Lempel, “A Universal Algorithm for Sequential Data Compression,” IEEE Trans. Information Theory, vol. IT-23, no. 3, pp. 337-343, May 1977.
[10] B. G. Chern, I. Ochoa, A. Manolakos, A. No, K. Venkat and T. Weissman, “Reference Based Genome Compression”, Information Systems Laboratory, Stanford University.
[11] M.C. Brandon, D.C. Wallace, P. Baldi, “Data structures and compression algorithms for genomic sequence data”, Bioinformatics, Vol. 25, no. 14, pages 1731–1738, May, 2009.
[12] http://site.iugaza.edu.ps/jroumy/files/Shanon-Fano.pdf
[13] A.S.E. Campos, “Arithmetic coding “http://www.arturocampos.com/ac_arithmetic.html. (Accessed 02 February 2009)
[14] G. Cormack, N. Horspool. Data compression using dynamic markov modelling. Comput. J., vol. 30: pp. 541-550, 1987.
[15] Ziv, Jacob and Lempel, Abraham, "A Universal Algorithm for Sequential Data Compression", IEEE Transactions on Information Theory, Vol. 23, no. 3, pp. 337–343, May 1977.
[16] Ziv, Jacob and Lempel, Abraham, "Compression of Individual Sequences via Variable-Rate Coding", IEEE Transactions on Information Theory, vol. 24, no. 5, pp. 530–536, September 1978.
[17] S. Kuruppu, S.J. Puglisi, and J. Zobel, “Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval,” Proc. 17th Int’l Conf. String Processing and Information Retrieval (SPIRE ’10), pp. 201-206, 2010.
[18] S. Kuruppu, S. Puglisi, and J. Zobel, “Optimized Relative Lempel- Ziv Compression of Genomes”, Australasian Computer Science Conf., 2011.
[19] S. Deorowicz and S. Grabowski, “Robust Relative Compression of Genomes with Random Access”, Bioinformatics, vol. 27, pp. 2979- 2986, Nov. 2011.
[20] S. Kuruppu, B. Beresford-Smith, T. Conway, and J. Zobel, “Iterative Dictionary Construction for Compression of Large DNA Data Sets”, IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 9, no. 1, Jan./Feb. 2012.
[21] S. Grumbach and F. Tahi, “Compression of DNA sequences”, IEEE Symp. on the Data Compression Conf., DCC-93, Snowbird, UT, (1993), pp. 340–350.
[22] S. Grumbach and F. Tahi, “A new challenge for compression algorithms: genetic sequences”, Info. Process. & Manage, Elsevier, (1994), pp.875-866.
[23] X. Chen, S. Kwong, M. Li, “A compression algorithm for DNA sequences and its applications in genome comparison”, In Proc. 4th Annual Int. Conf. Computation. Molecular Biol. (RECOMB), pp.107 – 117, 2000.
[24] X. Chen, M. Li, B. Ma and J. Tromp, “DNACompress: Fast and Effective DNA Sequence Compression”, Bioinformatics, vol. 18, (2002) June, pp. 1696-1698.
[25] G. Korodi and I. Tabus, “An Efficient Normalized MaximumLikelihood Algorithm for DNA Sequence Compression”, ACM Trans. Information Systems, vol. 23, no. 1, pp. 3-34, 2005.
[26] J. Zhen, J. Zhou, L. Jiang, Q. H. Wu. Overview of DNA sequence data compression techniques. Acta Electronica Sinica, pp. 1113 – 1121, 2010.
[27] L. TAN, J. SUN, W. XIONG, “A Compression Algorithm for DNA Sequence Using Extended Operations”, Journal of Computational Information Systems, vol. 8, no. 18 pp. 7685–7691, 2012.
[28] The GeNML homepage: http://www.cs.tut.fi/~tabus/genml/results.html.

S.Roy, S.Khatua, "KMerHuffman upon Biological Sequence Compression," International Journal of Computer Sciences and Engineering, Vol.5, Issue.12, pp.201-206, 2017.

Tunnel blunders, venomous packet losses are two purposes behind bundle drops in a multi-jump remote specially appointed system. This examination, watching the gathering of bundle drops in a system have keen on deciding in those drops spawned burrow mistakes just, else in joined effect of tunnel blunders, venomous blunders. They especially intrigued by the inline assault scenario, where by venomous hubs that a piece of the path expounds those content to specifically tossed in a couple of bundles genuine for system execution. Due to the bundle losing rate, for the situation, is practically identical to the channel blunder rate, regular calculations that depend on distinguishing the packet loss rate can`t accomplish culminate discernment exactness. For expansion of observation precision, we invent to expound the connections on lost packets. Likewise, for guarantee honest to goodness computation of these associations, we build up a Homomorphic straight authenticator(HLA) typed open reviewing plan [1],[2],[10]that engages the identifier to attest the reliability of packet misfortune data pointed through hubs. Its headway is protection safeguarding, crash evidence, increases less correspondence, cutoff fixed costs. For decreasing the computation operation cost of the example plot, bundle-piece-based part is similarly created by empowering the acknowledgment precision for bringing down figuring unusualness. By these broad reproductions, we watch the designed systems achieve by and large best perception accuracy over normal procedures, for instance, a most extreme probability based identification.

Homomorphic linear authenticator(HLA), Packet block based mechanism, Denial of service(DOS), Multipath routing algorithms

[1] C. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, ―Provable data possession at untrusted stores,‖ in Proc. ACM Conf. Comput. and Commun. Secure., Oct. 2007, pp. 598– 610.
[2] G. Ateniese, S. Kamara, and J. Katz, ―Proofs of storage from homomorphic identification protocols,‖ in Proc. Int. Conf. Theory Appl. Cryptol. Inf. Security, 2009, pp. 319–333.
[3] B. Awerbuch, R. Curtmola, D. Holmer, C. Nita-

Rotaru, and H. Rubens, ―ODSBR: An on-demand fixed byzantine resilient routing protocol for remote ad hoc networks,‖ ACM Trans. Inform. Syst. Security, vol. 10, no. 4, pp. 1–35, 2008.
[4] T. Hayajneh, P. Krishnamurthy, D. Tipper, and T.

Kim, ―Detecting venomous packet dropping in the presence of collisions and channel blunders in remote ad hoc networks,‖ in Proc. IEEE Int. Conf. Commun.,

2009, pp. 1062–1067.
[5] D. B. Johnson, D. A. Maltz, and J. Broch, “DSR: The dynamic source routing protocol for multi-hop remote ad hoc networks,” in Ad Hoc Networking. Reading, MA, USA: Addison-Wesley, 2001, ch. 5, pp. 139–172.
[6] G. Noubir and G. Lin, “Low-power DoS assaults in data wireless lans and countermeasures,” ACM SIGMOBILE Mobile Comput. Commun. Rev., vol. 7, no. 3, pp. 29–30, Jul. 2003.
[7] A. Proano and L. Lazos, “Selective jamming assaults in remote networks,” in Proc. IEEE ICC Conf., 2010, pp. 1–6.
[8] A. Proano and L. Lazos, “Packet-hiding methods for preventing selective jamming assaults,” IEEE Trans. Depend. Fixed Comput., vol. 9, no. 1, pp. 101–114, Jan./Feb. 2012.
[9] R. Rao and G. Kesidis, “Detecting venomous packet dropping using statistically regular traffic patterns in multi-hop remote networks that are not bandwidth limited,” in Proc. IEEE GLOBECOM Conf., 2003, pp. 2957–2961.
[10] H. Shacham and B. Waters, “Compact Proofs of retrievability,” in Proc. Int. Conf. Theory Appl. Cryptol. Inf. Secure., Dec. 2008, pp. 90– 107.
[11] T. Shu, M. Krunz, and S. Liu, “Fixed data collection in remote sensor networks using randomized dispersive routes,” IEEE Trans. Mobile Comput., vol. 9, no. 7, pp. 941–954, Jul. 2010.
[12] T. Shu, S. Liu, and M. Krunz, “Fixed data collection in remote sensor networks using randomized dispersive routes,” in Proc. IEEE INFOCOM Conf., 2009, pp. 2846
2850.
[13] C. Wang, Q. Wang, K. Ren, and W. Lou, “Privacy-preserving public auditing for data storage security in cloud computing,” in Proc. IEEE INFOCOM Conf., Mar. 2010, pp. 1–9.
[14] W. Xu, W. Trappe, Y. Zhang, and T. Wood, “The feasibility of dropping and detecting jamming assaults in remote networks,” in Proc. ACM MobiHoc Conf., 2005, pp. 46–57.
[15] Y. Zhang, L. Lazos, and W. Kozma, “AMD: Audit-based misbehavior perception in remote ad hoc networks,” IEEE Trans. Mobile Comput., PrePrint, Vol. 99, published online on 6 Sept. 2013.
[16] L. Buttyan and J. P. Hubaux, “Stimulating cooperation in selforganizing mobile ad hoc networks,” ACM/Kluwer Mobile Netw. Appl., vol. 8, no. 5, pp. 579–592, Oct. 2003.
[17] S. Zhong, J. Chen, and Y. R. Yang, “Sprite: A simple cheat-proof, credit-based system for mobile ad-hoc networks,” in Proc. IEEE INFOCOM Conf., 2003, pp. 1987–1997.
[18] J. Crowcroft, R. Gibbens, F. Kelly, and S. Ostring, “Modelling incentives for collaboration in mobile ad hoc networks,” presented at the First Workshop Modeling Optimization Mobile, Ad Hoc Remote Netw., Sophia Antipolis, France, 2003.
[19] K. Liu, J. Deng, P. Varshney, and K. Balakrishnan, “An acknowledgement-based approach for the perception of routing misbehavior in MANETs,” IEEE Trans. Mobile Comput., vol. 6, no. 5, pp. 536–550, May 2006.
[20] V. N. Padmanabhan and D. R. Simon, “Fixed traceroute to detect faulty or venomous routing,” in Proc. ACM SIGCOMM Conf., 2003, pp. 77–82.
[21] P. Papadimitratos and Z. Haas, “Fixed message transmission in mobile ad hoc networks,” Ad Hoc Netw., vol. 1, no. 1, pp. 193–209, 2003.
[22] B. Awerbuch, R. Curtmola, D. Holmer, C. Nita-Rotaru, and H. Rubens, “ODSBR: An on-demand fixed byzantine resilient routing protocol for remote ad hoc networks,” ACM Trans. Inf. Syst. Secure., vol. 10, no. 4, pp. 11–35, 2008.
[23] K. Balakrishnan, J. Deng, and P. K. Varshney, “TWOACK: Preventing selfishness in mobile ad hoc networks,” in Proc. IEEE Remote Commun. Netw. Conf., 2005, pp. 2137–2142.
[24] Y. Xue and K. Nahrstedt, “Providing fault-tolerant ad-hoc routing service in adversarial environments,” Remote Pers. Commun., Special Issue Secure. Next Generation Commun., vol. 29, no. 3, pp. 367– 388, 2004

Chintagunta Mukundha, Usha Thalloju, "Privacy-Preserving and Truthful Detection of Packet Dropping Attacks in Wireless Ad Hoc Networks," International Journal of Computer Sciences and Engineering, Vol.5, Issue.12, pp.207-212, 2017.

Internet has assumed control over everything a rapid pace. With the growth of Internet, we tried to discover way through which we can exploit the internet to the fullest and reap its benefits. Cloud Technology was a result of such brainstorming. With Cloud, we could achieve great deal of benefits. This included access to our resources anytime, anywhere and at a very fast pace. This made the task of various organizations very easy as they could store data over these cloud servers and access them from anywhere at any time. Furthermore, this also brought down the costs for the organization, as they need not invest in creating data centers and servers. In spite of all benefits we are still today unsure about how secure is actually our data on cloud servers and whether our communication with this server is actually secure. The algorithm proposed in this paper when implemented provides a secure way to communicate and store data in cloud servers.

Cloud Computing, Encryption,Decryption,Algorithm, Key-Pair

[1] A.Kahate,"Cryptography & Network Security", McGrawHill Publications,India
[2] M.R.Shinde,R.D.Taur,"Encryption Algorithm for Data Security and Privacy in Cloud Storage", American Journal of Computer Science and Engineering Survey, Volume 3,Issue 1,pp 1-6,2015
[3] V.Alangar, "Cloud Computing Security and Encryption",International Journal of Advance Research in Computer Science and Management Studies,Volume 1,Issue 5,pp 1-3,2013
[4] J.Singh, S.Sharma, "Review on Cloud Computing Security Issues and Encryption Techniques",International Journal Of Engineering Development And Research,Volume 3,Issue 2,pp 1-2,2015
[5] S.S.Khan, R.R.Tuteja, "Security in Cloud Computing using Cryptographic Algorithms", International Journal of Innovative Research in Computer and Communication Engineering,Volume 3,Issue 1,pp 1-2,2015
[6] S.Kumar, R.H.Goudar, "Cloud Computing – Research Issues, Challenges,Architecture, Platforms and Applications: A Survey",International Journal of Future Computer and Communication,Volume 1, Issue 4,pp 1-3,2012
[7] Shaheen Ayyub, Devshree Roy, “Cloud Computing Characteristics and Security Issues”, International Journal of Computer Sciences and Engineering, Volume 1, Issue 4, pp1-5, 2013

Sanketh S. Iyer, Hiren Dand, Rajendra Patil, "An Algorithm for Encrypted Cloud Communication," International Journal of Computer Sciences and Engineering, Vol.5, Issue.12, pp.213-217, 2017.

The traffic flow forecasting is a very important aspect of traffic predication and congestion, it alleviates the increasing congestion problems that cause drivers to save a longer traveling time and economical loses, thus, it is one of the severe problems in big city areas. In tunnels the forecasting may help scheduling the ventilation fans. This way, the cost might be decreased while the air quality increased. The aspect of traffic prediction is that it may give the drivers to plan their travelling time and traveling the path, as they have the predictive data information. In this paper, the survey of different types used for traffic forecasting, the data for these techniques, the output provided by them and analysis insights is provided.

Traffic flow, traffic predication, information, forecasting

[1] Fricker, J. D., and S. K. Saha. Traffic Volume Forecasting Methods for Rural State Highways publication FHWA/IN/JHRP-86/20.Joint Highway Research Project, Indiana Department of Transportation and Purdue University, West Lafayette, Indiana, 1986.
[2] M. M. Hamed, H. R. Al-Masaeid, and Z. M. B. Said, “Short-term prediction of traffic volume in urban areas,” J. Transp. Eng. J. Transp. Eng., vol. 121, no. 3, pp. 249–254, 1995.
[3] D. Reinke, “Urban travel demand forecasting,” Transp. Res. Circular, vol. E-168, pp. 86–92, Nov. 2012.
[4] L. Li, X. Su, Y. Zhang, Y. Lin, and Z. Li, “Trend modeling for traffic time series analysis: An integrated study,” IEEE Trans. Its., vol. 16, no. 6, pp. 3430–3439, Dec. 2015.
[5] Mathieu Ntakiyemunga and Hang Zhang. Traffic volume forcasting model using elasticity method and exponential smooth model for national road of Rwanda Asian Journal of Applied Sciences (ISSN: 2321 – 0893) Masters Candidate at Wuhan University of Technology.
[6] J. Chiou, Y. Zhang, W. Chen, and C. Chang, “A functional data approach to missing value imputation and outlier detection for traffic flow data,” Transp. B, Transp. Dyn., vol. 2, no. 2, pp. 106–129, Feb. 2014.
[7] Yan-hong Tang* and Bao Xi “Dynamic forecasting of traffic volume based on Quantificational dynamics: A nearness perspective School of Management, Harbin Institute of Technology, 150001, Harbin, China. Accepted 21 January, 2010.
[8] Yuanchang Xie, Kaiguang Zhao, Ying Sun, and Dawei Chen,” Gaussian Processes for Short-Term Traffic Volume Forecasting”2010.
[9] Smith BL, Demetsky MJ (1994). Short-term traffic flow prediction: Neural network approach. Transport. Res. Rec. (1453): 98-104.
[10] Smith BL, Demetsky MJ (1997). Traffic flow forecasting: Comparison of modeling approaches. J. Transport. Eng. 123(4): 261-266.
[11] Kartikeya Jha1, Nishita Sinha2, Shriniwas S. Arkatkar3,* and Ashoke K. Sarkar4,”A comparative study on application of time series analysis for traffic forecasting in India: prospects and limitations”, CURRENT SCIENCE, VOL. 110, NO. 3, 10 FEBRUARY 2016.
[12] Haibo Chen and Susan Grant-Muller. Use of sequential learning for short-term traffic flow forecasting. Transportation Research Part C: Emerging Technologies, 9 (5): 319 – 336, 2001.
[13] Srinivasa Ravi Chandra Chilakamarri Venkata. SPATIO-TEMPORAL ANALYSES FOR PREDICTION OF TRAFFIC FLOW, SPEED AND OCCUPANCY ON I-4. PhD thesis, University of Central Florida, 2009.
[14] R. Chrobok, J. Wahle, and M. Schreckenberg. Traffic forecast using simulations of large scale networks. In Intelligent Transportation Systems, 2001. Proceedings. 2001 IEEE, pages 434 –439, 2001.
[15] S D CLARK, M S Dougherty, and H R KIRBY. The use of neural networks and time series models for Short term traffic forecasting: A comparative study. Pages 151–62, 1993.
[16] F.M. Sander C.P.IJ. Van Hinsbergen, J.W.C. van Lint. Short term traffic prediction models. ITS World Congress, Beijing, China, 2007.
[17] G. A. Davis, N. L. Nihan, M. M. Hamed, and L. N. Jacobson. Adaptive forecasting of freeway traffic congestion. Transportation Research Record, 1287:29–33, 1990.
[18] Gary A. Davis and Nancy L. Nihan. Nonparametric regression and short-term freeway traffic forecasting. Journal of Transportation Engineering, 117 (2):178–188, 1991.
[19] Iwao Okutani and Yorgos J. Stephanedes. Dynamic prediction of traffic volume through kalman filtering theory.
Transportation Research Part B: Methodological, 18(1):1 – 11, 1984.
[20] K. Lindveld J. Whittaker, S. Garside. Tracking and predicting a network traffic process. International Journal of Forecasting, pages 51–61, 1997.
[21] Guoqiang Yu, Jianming Hu, Changshui Zhang, Like Zhuang, and Jingyan Song. Short-term traffic flow Forecasting based on markov chain model. In Intelligent Vehicles Symposium, 2003. Proceedings. IEEE, pages 208– 212, June 2003.
[22] Kartikeya Jha, Nishita Sinha, Shriniwas Shrikant Arkatkar, Ashoke Kumar Sarkar, Department of Civil Engineering, Birla Institute of Technology and Science, Pilani, Rajasthan, India - 3330312 ,” modeling growth trend and forecasting techniques for vehicular population in India” Received 4 January 2013.

Aditi R. Pawar, Shailendra S. Aote, "Survey of Traffic Volume Forecasting," International Journal of Computer Sciences and Engineering, Vol.5, Issue.12, pp.218-222, 2017.

The optimization processes in mathematics, computer science and economics are solved effectively by choosing the best element from set of available alternatives elements. The most important and successful applications in the optimization refer to transportation problem, that is a special class of the linear programming in the operation research . The main objective of transportation problem solution methods is to minimize the cost or the time of transportation. Most of the currently used methods for solving transportation problems are trying to reach the optimal solution, whereby, most of these methods are considered complex and very expansive in term of the execution time. Finding an initial basic feasible solution is the prime requirement to obtain an optimal solution for the transportation problems. In this paper, a new method named minimum supply & demand method is proposed to find an initial basic feasible solution for the transportation problems. The method is also illustrated with numerical examples.

Transportation Problem(TP), Transportation Cost(TC), Initial Basic Feasible Solution (IBFS), Optimal Solution, Vogel’s approximation method(VAM), minimum supply & demand method (MSDM).

[1] V. Deshpande , “An Optimal method for Obtaining Initial Basic Feasible Solution of the Transportation Problem”, In National Conference on Emerging Trends in Mechanical Engineering, India , pp. 47-56, 2009.
[2] A. A. Hlayel, M. A. Alia, “ Solving Transportation PProblems Using The Best Candidates Method”,Computer Science & Engineering:
An International Journal (CSEIJ), Vol.2, Issue.5, pp.23-30, 2012.
[3] A. S.Soomro, G. A. Tularam, G.M. Bhayo, “A comparative study
of initial basic feasible solution methods for transportation
problems”, Mathematical Theory and Modeling,Vol.4 , Issue.1,
pp. 11-18, 2014.
[4] M. . Hakim, “An Alternative Method to Find Initial Basic Feasible
Solution of a Transportation Problem”, Annals of Pure and Applied
Mathematics, Vol. 1, Issue. 2, pp.203-209, 2012.
[5] A. Quddoos, S. Javaid, M. M. Khalid, “A New Method for Finding
an OptimalSolution for Transportation Problems” , International
Journal on Computer Science and Engineering , Vol. 4, Issue. 7,
pp.1271-1274, 2012.
[6] M.M. Ahmed, A.R.Khan, Md. S. Uddin, F. Ahmed, “A New
Approach to Solve Transportation Problems”, Open Journal of
Optimization, Vol.3 , Issue. 5, pp. 22-30, 2016.
[7] P.K.Gupta and M.Mohan, “ Problems in Operartions Research”, Sultan Chand & Sons Publisher , India, pp. 337 -400,1997.
[8] M. K. Hasan, “Direct Methods for Finding Optimal Solution of a Transportation Problem are not Always Reliable”, International Refereed Journal of Engineering and Science , Vol. 1, Issue. 2, pp.46-52, 2012.
[9] K. Jain, “Maximum Zero Method to Find Initial Basic Feasible
Solution of a Transportation Problem”, International Journal of
Applied Engineering Research, vol. 10, Issue.35 , pp.27542-27546,
2015.
[10] R.V.Joshi, “Optimization Techniques ,
[11] KAPOOR V. K., “Operations Research ( QuantitativeTechniques for management )”, Sultan Chand & Sons Publisher , pp. .5.3-5.97, India,
2008.
[12] K.Jain,S.Sood, “Maximum Zero Method to Find Initial Basic
Feasible Solution of a Transportation Problem”, International
Journal of Applied Engineering Research, Vol. 10, Issue.35,
pp.27542-27546, 2015.
[13] E. Hosseini, “Three New Methods to Find Initial Basic Feasible
Solution of Transportation Problems”, Applied Mathematical
Sciences, Vol. 11, Issue. 37, pp.1803 - 1814 , 2017.
[14] P.K.Gupta and D.S.Hira, “ Operartions Research”, Sultan Chand & Sons Publisher , India, pp. 148 -210,1997.
[15] S.D.Sharma , “ Operartions Research Thoery, Methods and Applications”, Kedar Nath Ram Nath & Co. , India, pp. 347 -434, 2003.

N.M. Morade , "New Method to find initial basic feasible solution of Transportation Problem using MSDM," International Journal of Computer Sciences and Engineering, Vol.5, Issue.12, pp.223-226, 2017.

Legacy heterogeneous network paradigm have reached the extremity where its competence to accustom to dynamic situation has become a hindrance. These traditional network platforms are very complicated to manage due to various challenges like interoperability, upgrade which require protocols and management techniques hard-coded into the underlying network platform. Software Defined Network is an emerging network architecture which allows automation of infrastructure configuration enabling the network operators to adapt their network to meet the real time application requirements. Now-a-days with the frequent and rapid inflation of number of clients associated with the network, it is very important to distribute the incoming request equally among all the servers. So by taking advantage of the overall view of the network by the controller, various load balancing strategies can be used to distribute the request in order to increase the overall performance of the system. Every load balancing technique has some pros and cons. This paper gives the comprehensive critical survey on various load balancing strategies used in SDN technology.

Software Defined Networking, Load Balancing, Openflow

[1] Kreutz, Diego, et al. "Software-defined networking: A comprehensive survey." Proceedings of the IEEE 103.1 (2015): 14-76.
[2] Vaughan-Nichols, Steven J. "OpenFlow: The next generation of the network?" Computer 44.8 (2011): 13-15.
[3] A. Voellmy and J. Wang, “Scalable software defined network controllers,” SIGCOMM Comput. Commun. Rev., vol. 42, no. 4, pp. 289–290, Aug. 2012.
[4] Serverwatch.com, “5 Load Balancers You Need to Know,”2015.
[5] “Load-Balancing: Hash Methods,” Calix, 2010.
[6] Koerner, Marc, and Odej Kao. "Multiple service load-balancing with OpenFlow." High Performance Switching and Routing (HPSR), 2012 IEEE 13th International Conference on.IEEE, 2012.
[7] Sherwood, Rob, et al. "Flowvisor: A network virtualization layer." OpenFlow Switch Consortium, Tech. Rep 1 (2009): 132.
[8] Zhou, Yuanhao, et al. "A method for load balancing based on software defined network." Advanced Science and Technology Letters 45 (2014): 43-48.
[9] Kaur, Sukhveer, et al. "Round-robin based load balancing in Software Defined Networking." Computing for Sustainable Global Development (INDIACom), 2015 2nd International Conference on. IEEE, 2015.
[10] Ghaffarinejad, Ashkan, and Violet R. Syrotiuk. "Load balancing in a campus network using software defined networking." Research and Educational Experiment Workshop (GREE), 2014 Third GENI. IEEE, 2014.
[11] Qilin, Mao, and Shen Weikang. "A load balancing method based on SDN." Measuring Technology and Mechatronics Automation (ICMTMA), 2015 Seventh International Conference on. IEEE, 2015.
[12] Sabiya, and Jaspinder Singh. “Weighted Round-Robin Load Balancing Using Software Defined Networking.” International Journal Of Advanced Research in Computer Science and Software Engineering, vol. 6, no. 6, June 2016, pp. 621–625.
[13] Kaur, Karamjeet, Sukhveer Kaur, and Vipin Gupta. "Flow statistics based load balancing in OpenFlow." Advances in Computing, Communications and Informatics (ICACCI), 2016 International Conference on. IEEE, 2016.
[14] Selvi, Hakan, Gürkan Gür, and Fatih Alagöz. "Cooperative load balancing for hierarchical SDN controllers." High Performance Switching and Routing (HPSR), 2016 IEEE 17th International Conference on. IEEE, 2016.
[15] Sufiev, Hadar, and Yoram Haddad. "A dynamic load balancing architecture for SDN." Science of Electrical Engineering (ICSEE), IEEE International Conference on the. IEEE, 2016.
[16] Zhou, Yuanhao, et al. "A load balancing strategy of sdn controller based on distributed decision." Trust, Security and Privacy in Computing and Communications (TrustCom), 2014 IEEE 13th International Conference on. IEEE, 2014.
[17] Blial, Othmane, Mouad Ben Mamoun, and Redouane Benaini. "An overview on SDN architectures with multiple controllers." Journal of Computer Networks and Communications 2016 (2016).
[18] Yu, Jinke, et al. "A load balancing mechanism for multiple SDN controllers based on load informing strategy." Network Operations and Management Symposium (APNOMS), 2016 18th Asia-Pacific.IEEE, 2016.
[19] Sroya, Manamrit Singh, and Vikramjit Singh. "LDDWRR: Least Delay Dynamic Weighted Round-Robin Load Balancing in Software Defined Networking." International Journal 8.5 (2017).
[20] Chen-Xiao, Cui, and Xu Ya-Bin. "Research on load balance method in SDN." International Journal of Grid and Distributed Computing 9.1 (2016): 25-36.

P. Kumari, D.Thakur, "Load Balancing in Software Defined Network," International Journal of Computer Sciences and Engineering, Vol.5, Issue.12, pp.227-232, 2017.

This paper proposes a new and efficient key agreement protocol where trusted third party (TTP) is involved. There are various available schemes which are based on number theoretic, elliptic curves etc. Due to the availability of modern computers, these schemes are vulnerable to man in the middle attack (MITM). So there is a requirement of new technique for key agreement which surprises the intruders and enhances the security of communication system. Our proposed protocol utilizes the property of a non commutative group. We have given the security proof of our protocol keeping the fact in mind that decomposition and conjugacy search problem are hard in a group which is non commutative.

Braid Decomposition Problem(BDP), Conjugacy Search Problem(CSP), Key Agreement, Non Commutative Groups, Trusted Third Party (TTP), Wireless Communication

[1] I.Anshel, M.Anshel, B.Fisher, D.Goldfeld, New key agreement protocols in braid group cryptography, Proc.of CT-RSA , LNCS (2020), Springer-Verlag, 2001, 1-15.
[2] I. Anshel, M. Anshel , D. Goldfeld, An algebraic method of public-key cryptography, Math. research letters, 6 ,1999, 287-291.
[3] K.H.Ko, D.H.Choi, M.S.Cho, J.W.Lee, New signature scheme using conjugacy problem, e print archive, http://eprint.iacr.org/2002/168.
[4] K.H. Ko, S.J. Lee, J.H. Cheon, J.W. Han, J.S. Kang, C Park, New public-key cryptosystem using braid groups, Advances in cryptology, proceeding of crypto - 2000, LNCS (1880) , Springer Verlag ,2000, 166-183.
[5] G. Kumar , H. Saini , Novel non commutative cryptography scheme using extra special group, Security and communication networks, 2017.
[6] Y. K. Peker, A new key agreement scheme based on the triple decomposition problem, International journal of network security (6), 2014, 426 – 436.
[7] H.Sibert, P.Dehornoy, M.Girault, Entity authentication schemes using braid word reduction, in International workshop on coding and cryptography (WCC) 2003, Discrete applied mathematics, 154-2, Elsevier, 2006, 420 – 436. (http://eprint.iacr.org/2002/187).
[8] V.Halava, T.Harju, R.Niskanen, I.Potapov, Weighted automata on infinite words in the context of attacker – defender games, Information and computation , Elsevier, 255 (1), 2017, 27 – 44.
[9] E. Artin, Theory of braids, Annals of math.48 (1947),101-126.
[10] W. Diffie, & M.Hellman, New directions in cryptography, IEEE trans. inform. theory, 22 (6),1976,644-654.
[11] J.Birman, Braids, links, and mapping class groups, Annals of math. studies, Princeton Univ. Press ,1975.
[12] F.A. Garside, The braid group and other groups, Quart. J. math. oxford 20-78 ,1969, 235-254.
[13] A.Chaturvedi, M.K.Misra,S.P.Tripathi,V.Shukla,N. Srivastava A New Key Agreement Protocol Using BDP and CSP in Non Commutative Groups, Int. J. Advanced Networking and Applications. 9(3) ,2017,3428-3431.
[14] A.Chaturvedi,V.Shukla,N.Srivastava A secure wireless peer to peer authentication protocol using triple decomposition problem, Asian journal of mathematics and computer research.22(2) 2017,63-69.
[15] L.Law, A.Menezes, M.Qu, J.Solinas, S.Vanstone, An efficient protocol for authenticated key agreement, Design, codes and cryptography, 28 (2), 2003, 119-134.
[16] M.Bellare, P.Rogaway, Entity authentication and key distribution, Proceeding of CRYPTO’93, Santa Barbara, USA,1994, 341-358.
[17] A.O. Baalghusun, O.F. Abusalem, Z. A. A. Abbas, J. P. Kar, Authenticated key agreement protocols: A comparative study, Journal of information security, (6), 2015, 51 – 58.
[18] A.Menezes, M.Qu, S.Vanstone, Key agreement and the need for authentication, in proceedings of PKS’95, 1995, 34 – 42.
[19] S. B. Wilson, D.Johnson, A.Menezes, Key agreement protocol and their security analysis, Proceedings of sixth IMA international conference on cryptography and coding, Cirencester, UK, 1997, 30 - 45.
[20] M.V.Bhaskar,G.A.Ramchandra,Y.Deepika,Multipath optimized link state protocol(OLSR) with security for moblle ad-hoc networks .International journal of computer science and engineering,5(11),2017,182-186.

Atul Chaturvedi, Manoj Kumar Misra, S.P. Tripathi, Varun Shukla, "An Authenticated Key Agreement Protocol Using Artin’s Braid Group," International Journal of Computer Sciences and Engineering, Vol.5, Issue.12, pp.233-236, 2017.

This review paper deals with the most recent expertise developed on Digital assisted examination for histopathology images. The development on digital assisted examination for locating, analyzing and classification of fatal diseases like cancer, using histopathology. The previously, the observer is completely based on the proficiency level of the pathologist, is done by the physical processes. The organizational structure of the analysis of digital slides, cell distribution and the shape of the cell is based on the action. The entire interior of this process informal for the observer as well as the external observer. Histopathological diagnosis of tissue-paper images from the quantitative analysis of the process to evaluate the computerized Image. Histopathology of digital image processing techniques that can be applied to the area of digital slide analysis is presented in the summary. Histopathology of discrimination in the automated retrieval of the digital slides is an important area of research in image processing.

Multiple Instances; Histopathology; Image Preprocessing; Classification

[1] J. P. Monaco, J. E. Tomaszewski, M. D. Feldman, I. Hagemann, M. Moradi, P. Mousavi, A. Boag, C. Davidson, P. Abolmaesumi, and A. Madabhushi, “High-throughput detection of prostate cancer in histological sections using probabilistic pairwise Markov models,” Medical Image Analysis, Elsevier, vol. 14(4), pp. 617–629, Aug. 2010.
[2] ["Cell culture supplements," http://www.integrated-bio.com/pro-RecombinantProteins.php, September 2015
[3] "How we make slides", http://bio-path.com/slides.htm, September 2015
[4] What is Histotechnology?," http://www.nyhisto.com/home/what-is-histotechnology/, September 2015.
[5] ["ParaffinProcessingofTissue," http://protocolsonline.com/histology/sample-preparation/paraffin-processing-of-tissue/, September
[6] "Tissue Processing For Histology: What Exactly Happens,?", http://bitesizebio.com/13469/tissue-processing-for-histology-what- exactly-happens/, September 2015.
[7] "How we make slides", http://bio-path.com/slides.htm, September 2015
[8] Simple Stain Kit for Plant Tissue," https://www.sciencelabsupplies.com/Simple-Stain-Kit-for-Plant-Tissue.html, September 2015.
[9] "H&E on Liver," http://sharedresources.fredhutch.org/images/he-liver, September 2015
Yassine Aribi, Ali Wali, Mohamed Chakroun, Adel M.Alimi, “Automatic definition of regions of interest on renal scintigraphic images,” AASRI Procedia, Elsevier, vol. 4, pp. 37-42, April 2013.
[10] M.T. McCann, J.A. Ozolek, C.A. Castro, B. Parvin, J. Kovacevic, "Automated histology analysis: opportunities for signal processing," Signal Processing Magazine, IEEE, vol 32(1), pp. 78-87, January 2015
[11] "CAD in pathology," http://www.healthcare-in-europe.com/en/article/15180-cad-in-pathology.html, September 2015
[12] J. P. Monaco, J. E. Tomaszewski, M. D. Feldman, I. Hagemann, M. Moradi, P. Mousavi, A. Boag, C. Davidson, P. Abolmaesumi, and A. Madabhushi, “High-throughput detection of prostate cancer in histological sections using probabilistic pairwise markov models.” Medical Image Analysis, Elsevier, vol. 14(4), pp. 617–629, August 2010.
[13] Lamia Jaafar Belaid and Walid Mourou, "Image segmentation: a watershed transformation algorithm," Image Anal Stereol, vol. 28, pp. 93-102, 2009.
[14] [Gowri Srinivasa, Matthew C. Fickus, Yusong Guo, Adam D. Linstedt, Jelena Kovacevic, "Active mask segmentation of fluorescence microscope images," IEEE Transactions On Image Processing, vol. 18(8), pp. 1817-1829, August 2009.
[15] P. Ghosh, S.K. Antani, L.R. Long, , G.R. Thoma,"Unsupervised Grow-Cut: Cellular Automata-Based Medical Image Segmentation," First IEEE International Conference on Healthcare Informatics, Imaging and Systems Biology, pp. 40-47, July2011.
[16] Rolf Adams and Leanne Bischof, "seeded region growing," IEEE Transaction on Pattern Analysis and Machine Intelligence, vol.
16(6), pp. 641-647, June 1994
[17] Chao-Hui Huang, Antoine Veillard, Ludovic Roux, Nicolas Lomenie, and Daniel Racoceanu, “Time-efficient sparse analysis ofhistopathological whole slide images,” Computerized Medical Imaging and Graphics, Elsevier, vol. 35, pp. 579–591, December
2011.
[18] [Vincent Roullier, Olivier Lézoray, Vinh-Thong Ta, and Abderrahim Elmoataz, “Multi-resolution graph-based analysis of histopathological whole slide images: application to mitotic cell extraction and visualization.” Computerized Medical Imaging and Graphics,Elsevier, vol. 35, pp. 603–615, May 2011.
[19] J. P. Monaco, J. E. Tomaszewski, M. D. Feldman, I. Hagemann, M. Moradi, P. Mousavi, A. Boag, C. Davidson, P. Abolmaesumi, and A. Madabhushi, “High-throughput detection of prostate cancer in histological sections using probabilistic pairwise Markov models,” Medical Image Analysis, Elsevier, vol. 14(4), pp. 617–629, Aug. 2010
[20] [Bilge Karacali and Aydin Tozeren, “Automated detection of regions of interest for tissue microarray experiments: an image textureanalysis,” BMC Med Imaging, March 2007.
[21] [2Ezgi Mercan, Selim Aksoy, Linda G. Shapiro, Donald L. Weaver, Tad Brunye, Joann G. Elmore, “Localization of diagnostically relevant regions of interest in whole slide images,” 22nd IAPR International Conference on Pattern Recognition, Stockholm, Sweden, August 2014.
[22] [Inoue Y, Yoshikawa K, Yoshioka N, Watanabe T, Saigua S, Kaneko Y, Yokoyama I, Ohtomo K, “Evaluation of renal function with99m-TC-MAG3 using semiautomated regions of interest,” J Nucl Med., vol. 41, pp. 1947–1954, December 2000.
[23] Y. Aribi, A. Wali, A.M.Alimi, "A system based on the fast marching method for analysis and processing DICOM images: the case of renal scintigraphy dynamic," International Conference on Computer Medical Applications, IEEE, pp. 1-6, January 2013.
[24] [Daniel Ståhl, Kalle Åström, Niels Christian Overgaard, Matilda Landgren, Karl Sjöstrand, Lars Edenbrandt, "Automatic compartment modelling and segmentation for dynamical renal scintigraphies," SCIA`11 Proceedings of the 17th Scandinavianconference on Image analysis, Springer, pp. 557–568, 2011
[25] [Ernest V. Garcia, Russell Folks, Samuel Pak and Andrew Taylor, "Totally automatic definition of renal regions-of-interest from TC-99m MAG3 renograms: validation in patients with normal kidneys and in patients with suspected renal obstruction," Nucl Med Commun., Vol. 31(5), pp.366-374, may 2010.
[26] Sushmita Mitra, B. Uma Shankar, “Medical image analysis for cancer management in natural computing framework,” Information Sciences, Elsevier, vol. 306, pp. 111-131, June 2015.
[27] Michael Derde, Laura Antanas, Luc De Raedt, Fabian Guiza Grandas, “An interactive learning approach to histology imagesegmentation,” 24th Benelux Conference on Artificial Intelligence,Benelux, pp. 1-8, October 2012
[28] [3N.R. Pal and S.K. Pal, “A review on image segmentation techniques”,Pattern Recognition Society, Printed in Great Britain, vol.26(9): pp. 1277–1294, March 1993.
[29] M.N. Gurcan, L.E. Boucheron, A. Can, A. Madabhushi, N.M. Rajpoot, and B.Yener, “Histopathological image analysis: a review”,IEEE Reviews in Biomedical Engineering, vol.2, pp. 147-171, October 2009
[30] “Features for histology images”, http://www.informed.unal.edu.co/jccaicedo/docs/review.pdf, November 2009
[31] Thomas Brox, Yoo-Jin Kim, Joachim Weickert, and Wolfgang Feiden,"Fully automated analysis of muscle fiber images with combined region and edge-based active contours," In Bildverarbeitung fur die Medizin, Springer pp. 86–90, 2006
[32] Alison G. Todman, and Ela Claridge, "Cell segmentation in histological images of striated muscle tissue- a perceptual grouping approach", Medical Image Understanding and Analysis, January 1997.
[33] Radu Rogojanu, Giovanna Bises, Cristian Smochina, and Vasile Manta, "Segmentation of cell nuclei within complex configuration s in images with colon sections," International Conference on Intelligent Computer Communication and Processing, IEEE, pp. 243–246, August 2010.
[34] R. Szeliski, "Computer vision: algorithms and applications," Springer-Verlag New York Inc, 2010
[35] Ching-Wei Wang, "A bayesian learning application to automated tumour segmentation for tissue microarray analysis," MachineLearning in Medical Imaging, Lecture Notes in Computer Science, Springer, vol. 6357, pp. 100-107, September 2010.
[36] Zhaozheng Yin, Ryoma Bise, Mei Chen, and Takeo Kanade, "Cell segmentation in microscopy imagery using a bag of local bayesian classifiers," International Symposium on Biomedical Imaging: From Nano to Macro, IEEE, pp. 125-128, April 2010.
[37] Marie Dumont, Raphael Maree, LouisWehenkel, and Pierre Geurts, "Fast multi class image annotation with random subwindows and multiple output randomized trees," In VISAPP, vol. 2, pp. 196–203. INSTICC, February 2009.

Vilas S.Gaikwad, Anilkumar N.Holambe, "Computerized Histopathological Image Analysis: A review on Multiple Instances," International Journal of Computer Sciences and Engineering, Vol.5, Issue.12, pp.237-242, 2017.

Mobile ad hoc network (MANET) is a multi-hop wireless network that requires no infrastructure. The major issue in developing the routing protocols for the MANETs is their dynamic topology. The traditional single path routing protocols are not efficient for secure communication. Multipath routing protocols provide higher throughput and security than uni-path routing protocols in MANETs. The objective of the paper is to study various security attacks relevant to multipath routing in MANET which helps in developing a reliable, secure multipath routing protocol with significant performance in MANETs.

MANET, multipath routing, security, performance

[1] S. Sarkar and R. Datta, “A secure and energy-efficient stochastic multipath routing for self-organized mobile ad hoc networks,” Ad Hoc Networks, vol. 37, pp. 209–227, Feb. 2016.
[2] P. K. Manohari and N. Ray, “Multipath routing protocols in MANETs: A study,” in 2016 1st International Conference on Innovation and Challenges in Cyber Security, ICICCS 2016, 2016, pp. 91–96.
[3] P. K. Manohari and N. K. Ray, “EAOMDV: An energy efficient multipath routing protocol for MANET,” in 2015 IEEE Power, Communication and Information Technology Conference, PCITC 2015 - Proceedings, 2016, pp. 710–715.
[4] B. Rajkumar and G. Narsimha, “Secure Multipath Routing and Data Transmission in MANET,” Int. J. Netw. Virtual Organ., vol. 16, no. 3, pp. 236–252, 2016.
[5] P. R. and R. N., “An improved multipath MANET routing using link estimation and swarm intelligence,” EURASIP Journal on Wireless Communications and Networking, vol. 2015, no. 1, p. 173, Dec. 2015.
[6] Y. V. R. and M. N. G Vijaya Kumar, “Current Research Work on Routing Protocols for MANET : A Literature Survey,” International Journal on Computer Science and Engineering (IJCSE), vol. 2, no. 3, pp. 706–713, 2010.
[7] C. E. Perkins and P. Bhagwat, “Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers,” ACM SIGCOMM Computer Communication Review, vol. 24, no. 4, pp. 234–244, 1994.
[8] S. Murthy and J. J. Garcia-Luna-Aceves, “An efficient routing protocol for wireless networks,” Mobile Networks and Applications, vol. 1, no. 2, pp. 183–197, 1996.
[9] W. Liu, C. Chiang, H. Wu, and C. Gerla, “Routing in Clustered Multihop Mobile Wireless Networks with Fading Channel,” in Proc. IEEE SICON’97, 1997, pp. 197–211.
[10] T. W. Chen and M. Gerla, “Global state routing: A new routing scheme for ad-hoc wireless networks,” in International Conference on Communications - Proceedings, 1998, vol. 1, pp. 171–175.
[11] A. Iwata, C.-C. Chiang, G. Pei, M. Gerla, and T.-W. Chen, “Scalable routing strategies for ad hoc wireless networks,” IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, pp. 1369–1379, 1999.
[12] M. Joa-Ng and I. T. Lu, “A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks,” IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, pp. 1415–1425, 1999.
[13] G. Pei, M. Gerla, and X. Hong, “LANMAR: Landmark routing for large scale wireless Ad Hoc Networks with group mobility,” in 2000 1st Annual Workshop on Mobile and Ad Hoc Networking and Computing, MobiHOC 2000, 2000, pp. 11–18.
[14] P. Jacquet, P. Mühlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Viennot, “Optimized link state routing protocol for ad hoc networks,” 5th IEEE Multi Topic Conference (INMIC 2001), p. 62, 2001.
[15] C.-K. Toh, “A Novel Distributed Routing Protocol To Support Ad-Hoc Mobile Computing,” in Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications, 1996, pp. 480–486.
[16] R. Dube, C. D. Rais, K. Y. Wang, and S. K. Tripathi, “Signal stability-based adaptive routing (SSA) for ad hoc mobile networks,” IEEE Personal Communications, vol. 4, no. 1, pp. 36–45, 1997.
[17] V. Park and M. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” … Annual Joint Conference of the IEEE …, pp. 1405–1413, 1997.
[18] T. Y. Jiang M, Li J, “Cluster Based Routing Protocol (CBRP),” IETF Draft, 1999. [Online]. Available: https://tools.ietf.org/wg/manet/draft-ietf-manet-cbrp-spec/. [Accessed: 25-Aug-2017].
[19] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, vol. 353, pp. 153–181, 1996.
[20] C. Perkings, E. Belding-Royer, and S. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” Ietf Rfc 3561, pp. 1–37, 2003.
[21] A. B. McDonald and T. Znati, “A dual-hybrid adaptive routing strategy for wireless ad hoc networks,” in 2000 IEEE Wireless Communications and Networking Conference, 2000, vol. 3, pp. 1125–1130.
[22] R. V. Boppana and S. P. Konduru, “An adaptive distance vector routing algorithm for mobile, ad hoc networks,” in Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 2001, vol. 3, pp. 1753–1762.
[23] Z. J. Haas, M. R. Pearlman, and P. Samar, “The Zone Routing Protocol (ZRP) for Ad Hoc Networks,” draftietfmanetzonezrp02 txt. p. 11, 2002.
[24] V. Ramasubramanian, Z. J. Haas, and E. G. Sirer, “SHARP: A hybrid adaptive routing protocol for mobile ad hoc networks,” in Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, 2003, pp. 303–314.
[25] A.-S. K. Pathan, M. M. Alam, M. M. Monowar, and M. F. Rabbi, “An efficient routing protocol for mobile ad hoc networks with neighbor awareness and multicasting,” E-Tech 2004: An International Multi-Topic Conference, pp. 97–100, 2004.
[26] L. X. and L. Cuthbert, “On- demand node-disjoint multipath routing in wireless ad hoc networks,” in In 29th Annual IEEE International Conference on Local Computer Networks, 2004, pp. 419–420.
[27] L. X. and L. Cuthbert, “Stable node-disjoint multipath routing with low overhead in mobile ad hoc networks,” in Proceedings of the IEEE Computer Society’s 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004, pp. 184–191.
[28] S. Lal, Chhagan, Vijay Laxmi, Manoj Gaur, “A node-disjoint multipath routing method based on AODV protocol for MANETs,” in IEEE 26th International Conference on Advanced Information Networking and Applications (AINA), 2012, pp. 399–405.
[29] S. Lee and M. Gerla, “Split multipath routing with maximally disjoint paths in ad hoc networks,” in Proceedings of the IEEE ICC, 2001, pp. 3201–3205.
[30] A. Nasipuri and S.R. Das, “On-Demand Multipath Routing for Mobile Ad Hoc Networks,” in Proceedings of IEEE ICCCN’99, 1999, pp. 64–70.
[31] R. B. I. Saritha Reddy Venna, “A survey on security in mobile ad hoc networks,” International Journal of Computer Science and Information Technologies (IJCSIT), vol. 7, no. 1, pp. 135–140, 2016.
[32] K. P. Manikandan, R. Satyaprasad, and K. Rajasekhararao, “A Survey on Attacks and Defense Metrics of Routing Mechanism in Mobile Ad hoc Networks,” International Journal of Advanced Computer Science and Applications, vol. 2, no. 3, pp. 7–12, 2011.
[33] R. Mavropodi, P. Kotzanikolaou, and C. Douligeris, “Performance Analysis of Secure Multipath Routing Protocols for Mobile Ad Hoc Networks,” Wired/ Wireless Internet Communications, Proceedings, vol. 3510, pp. 269–278, 2005.
[34] P. Kotzanikolaou, R. Mavropodi, and C. Douligeris, “Secure Multipath Routing for Mobile Ad Hoc Networks,” in Second Annual Conference on Wireless On-demand Network Systems and Services, 2005, pp. 89–96.
[35] M. Burmester and T. Van Les, “Secure Multipath Communication in Mobile Ad Hoc Networks,” in Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC 04), 2004, pp. 405–409.
[36] R. Mavropodi, P. Kotzanikolaou, and C. Douligeris, “SecMR - a secure multipath routing protocol for ad hoc networks,” Ad Hoc Networks, vol. 5, no. 1, pp. 87–99, Jan. 2007.
[37] M. Kefayati, H. R. Rabiee, and A. Khonsari, “Misbehavior Resilient Multi-path Data Transmission in Mobile Ad-hoc Networks Categories and Subject Descriptors,” Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks, pp. 91–100, 2006.
[38] W. Lou, W. Liu, and Y. Fang, “SPREAD: Enhancing data confidentiality in mobile ad hoc networks,” in Proceedings - IEEE INFOCOM, 2004, vol. 4, pp. 2404–2413.
[39] L. Chen and J. Leneutre, “On Multipath Routing in Multihop Wireless Networks: Security, Performance, and Their Tradeoff,” EURASIP Journal on Wireless Communications and Networking, vol. 2009, no. 6, pp. 1–13, 2009.

Y. Vasudeva Reddy, M. Nagendra, "A Study on Multipath Routing Security Protocols for Mobile Ad Hoc Networks," International Journal of Computer Sciences and Engineering, Vol.5, Issue.12, pp.243-248, 2017.

Minimum spanning tree can be obtained for undirected connected weighted edges with no negative weight using conventional algorithms such as genetic, Prim’s and Filter-Kruskal. This paper presents a survey on the conventional and the more recent algorithms with different techniques. This survey paper also contains comparisons of MST algorithm and their advantages and limitations.

MST, Graph, GA – Genetic Algorithm, DCC_Trees, DWCM - Difference Weighted Circuit Matrix

[1] Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekarn, “Fundamentals of Computer Algorithms (2nd Ed.)”, University Press (India) Private Ltd. – 500 029, pp. 236.
[2] Nimesh Patel, Dr. K. M. Patel, “A Survey on: Enhancement of Minimum Spanning Tree”, Nimesh Patel Int. Journal of Engineering Research and Applications, India, pp. 1, 2015.
[3] Abdullah-Al Mamun, Sanguthevar Rajasekaran, “An Efficient Minimum Spanning Tree Algorithm”, IEEE Symposium on Computers and Communication, (ISCC),pp. 1-2, 2016.
[4] Hong Liu, GenguiZhou, “Minimum Spanning Tree Problem Research based on Genetic Algorithm”, 2nd International Symposium on Computational Intelligence and Design, China, pp. 1-5, 2009.
[5] P.Praveen, B. Rama, T.Sampath Kumar, “An Efficient clustering algorithm of Minimum Spanning Tree”, 3rd International Conferences on Advances in Electrical, Electronics, Information, Communication and Bio-Informatics, pp. 1-5, 2017.
[6] Jerry John Kponyo , Yujun Kuang , Enzhan Zhang , Kamenyi Domenic, “VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim Clustering Algorithm”, in the proceedings of ICCP2013, China, pp. 2, 2013.
[7] Maumita Chakraborty, Ranjan Mehera and Rajat Kumar Pal, “A Divide-and- Conquer Algorithm for All Spanning Tree Generation”, Springer Nature Singapore Pte Ltd., R. Chaki et al. (eds.), Advanced Computing and Systems for Security, Advances in Intelligent Systems and Computing 567, pp. 6,14, 2017.
[8] Barun Biswas, Krishnendu Basuli, Saptarshi Naskar, Saomya Chakraborti and Samar Sen Sarma, "A combinatorial algorithm to generate all spanning trees of a weighted graph in order of increasing cost", CoRR, India, pp.2,3, 2012.
[9] Chaojun Li, "Euclidean Minimum Spanning Trees Based on Well Separated Pair Decompositions", Dave Mount, pp.2-4, 2014.
[10] K. Lakshmi1, T. Meyyappan, “Spanning Tree- Properties, Algorithms and Applications”, International Journal of Computer Sciences and Engineering, pp-4, Vol.5(10), 2017.

R. Gomathijayam, V. Santhi, "A Survey on: Comparative Study of Minimum Spanning Tree Algorithm," International Journal of Computer Sciences and Engineering, Vol.5, Issue.12, pp.249-253, 2017.