Work place: Faculty of Mathematics and Computer Science, Kharazmi University, Tehran, Iran
Research Interests: Computational Mathematics, Computer systems and computational processes, Data Structures and Algorithms, Analysis of Algorithms, Computational Geometry
Keivan Borna joined the Department of Computer Science at the Faculty of Mathematics and Computer Science of Kharazmi University as an Assistant Professor in 2008. He earned his Ph.D. in Computational Commutative Algebra from the Department of Mathematics, Statistics and Computer Science of the University of Tehran; where he previously received his M.Sc. in the same field. His research interests include a combination of Mathematics and Computer Science topics: Computer Algebra, Computational Geometry, Graph Algorithms, Designing Efficient Algorithms for Hard Problems, and so on. He is the author of the "Advanced Programming in JAVA" (in Persian) and is a life member of "Elite National Foundation of Iran".
DOI: https://doi.org/10.5815/ijcnis.2015.09.06, Pub. Date: 8 Aug. 2015
The Ad-Hoc networks are the kind of wireless networks that their configuration is done automatically and also the nodes are moving with a certain speed. For this reason the created paths (routes) are often unstable and these paths are usually broken by switching nodes. In this respect, choosing the right path and routing mechanism become more diverse in these networks.
In this research by applying some changes to the AODV routing protocols, two new protocols are presented: The first protocol is SAODV, which is a protocol for multi-path which finds the minimum length path between source and destination nodes and then sequentially sends the packets in these paths. The second protocol is SMAODV, which is a verified version of the first one but it finds multi-paths with minimum length for sending the control packets by the use of webpage rank algorithm and a smart mechanism for determining the amount of sending packets. This would cause the energy at any point in the network nodes with minimum variance and increase the network lifetime. The results of simulations in the NS-2 network simulator also verify that our proposed methods have better efficiency than the basic AODV protocol, and improve the network performance and decrease the end-to-end delay of receipt packets.
DOI: https://doi.org/10.5815/ijigsp.2015.09.03, Pub. Date: 8 Aug. 2015
All the works on writer's handwritten letters detection was based on the western languages and partly Chinese and Hindi, and there is a little study on Persian handwritten letters detection. Accordingly, in this paper a method is proposed to distinguish scanned Persian handwritten texts with image processing techniques. The proposed method assumes that the writer's handwritten are available in separate letters. The system trains with features extraction of these separate letters and then the trained system is used to detect individual handwritten among some indistinctive handwritten texts. The characteristics of our proposed method including high-speed of training in too much number of handwritten, is the content inattention and visual features considering. The results of procedures on 100 persons also admitted that the proposed method has a very good performance on Persian handwritten texts detection.[...] Read more.
Subscribe to receive issue release notifications and newsletters from MECS Press journals