iosr-JCE   Volume-16 ~ Issue-1 ~ Jan-Feb 2014

Abstract: Reversible computing has tremendous benefits in terms of power consumption, less heat dissipation and packaging density. Because its applications are found in diverse fields including quantum computing, nanotechnology, low power CMOS designs and cryptography, Reversible computing has gained attraction of many researchers recently. In order to incorporate fault testing capability in reversible circuits, a number of offline and online approaches have been proposed. In order to extend online testability of reversible circuits, an analysis followed by a Peres gate substitution is presented here. The proposed extension has identified online testing capabilities of MCF gates and has made all available libraries including MCT+MCF, MCT+P online testable. Furthermore a conversion for parity-preserving reversible circuits is presented. Finally the paper is concluded by proposing a generic online testable substitution of n*n reversible gate.

Keywords: Reversible circuits, online testable reversible circuits, online testable reversible substitution.

[1] R. Landauer, Irreversibility and heat generation in the computing process, IBM Journal of Research and Development, 5:183–191, July 1961.
[2] Bennet C., Logical Reversibility of Computation, IBM Journal of Research and Development, vol. 17, no. 6, pp. 525-532, 1973.
[3] R. Wille, M. Saeedi and R. Drechsler, Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost, International Workshop on Logic Synthesis (IWLS), USA, 2009.
[4] A. Peres, Reversible logic and quantum computers, Physical Review: A, vol. 32, no. 6, pp. 3266-3276, 1985.
[5] M. Arabzadeh, M. Saeedi, and M. Zamani, Rule-based optimization of reversible circuits, In Proceedings of Asia and South Pacific Design Automation Conference (ASPDAC), pages 849–854, 2010.
[6] J. Chen, X. Zhang, L. Wang, X. Wei, and W. Zhao, Extended Toffoli gate implementation with photons, In Proceedings of 9th International Conference on Solid-State and Integrated-Circuit Technology (ICSICT), pages 575–578, China, 20-23 Oct 2008.
[7] B. Parhami, Fault tolerant reversible circuits, In Proceedings of 40th Asimolar Conf. Signals, Systems, and Computers, Pacific Grove, CA, pp. 1726-1729, October 2006.
[8] E. Fredkin and T. Toffoli, Conservative logic, International Journal of Theoretical Physics, pp. 219-253, 1982.
[9] M. Haghparast and K. Navi, A novel fault tolerant reversible gate for nanotechnology based systems, Am. J. of App. Sci., vol. 5, no.5, pp. 519-523, 2008.
[10] S. Babazadeh and M. Haghparast, Design of a nanometric fault tolerant reversible multiplier circuit, J. Basic. Appl. Sci. Res., 2(2)1355-1361, 2012.

Abstract: Wireless operations allow services, such as long-range communications, that are impossible or impractical to implement with the use of wires. It is supported by well-liked technique known as Adhoc Protocol [1]. The term is commonly used in the telecommunications industry to refer to telecommunications systems e.g. radio transmitters and receivers, remote controls etc. which use some form of energy e.g. radio waves, acoustic energy, etc. to transfer information without the use of wires.[1] Information is transferred in this manner over both short and long distances.In this, routes may be detached due to lively movement of nodes. So route assortment and topology grouping is not easy and demanding issue. This type of networks is more vulnerable to both internal and external attacks due to presence of wicked neighbour nodes[1][2s. Paper see the sights new method using AODV protocol to find out good neighbour node and finding reliable path according to their signal strength, flow capacity relative position of node in network.

Keywords: AODV routing protocol, ad-hoc network, signal Strength, flow capacity, relative position of node Routing Table..

[1] Supriya Bamane .Rajesh Singh. AODV Based Improved Method for Detecting Good Neighbor Nodes International Journal of Emerging Technology and Advanced Engineering (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 7, July 2013)
[2] Prof. M.N. Hoda and Umang Singh, GNDA: Detecting Good Neighbour Nodes in Ad-hoc Routing Protocol 2011 Second International Conference on Emerging Applications of Information Technology, IEEE.
[3] C. E. Perkins and E. M. Royer, âA.Ad hoc on demand distance vector(AODV) routing,âAI Internet- Draft, draft-ietf-manet-aodv-02.txt, Nov.1998
[4] C.Siva Ram Murthy and B.S.Manoj,A.Ad hoc Wireless Networks AI,Pearson 2005.ISBN 81-297- 0945- 7 Sridhar K N and Mun Choon Chan ,A.Stability and Hop-Count based Approach for Route Computation in MANET,AI , 0-7803-9428- 3/05/ 2005 IEEE.
[5] Youngrag Kim, Shuhrat Dehkanov, Heejoo Park, Jaeil Kim, Chonggun Kim, âA.The Number of Necessary Nodes for Ad Hoc Network Areas AI, 2007 IEEE Asia-Pacific Services Computing Conference
[6] [ Srdjan Krco and Marina Dupcinov, Improved Neighbor Detection Algorithm for AODV Routing Protocol IEEE COMMUNICATIONS LETTERS, VOL. 7, NO. 12, DECEMBER 2003.
[7] Qing Li, Cong Liu, Hang Hong Jiang, The Routing Protocol of AODV Based on Link Failure Prediction ICSP2008 Proceedings, 978-1-4244-2179- 4/08/25.00 2008 IEEE
[8] M. Usha, S. Jayabharathi, Wahida Banu R, REAODV: An enhanced routing algorithm for QoS Support in Wireless Ad-hoc Sensor Networks ,2011, IEEE International conference on Recent trends in Information Technology.
[9] Che-Aron, Al-Khateeb, Anwar, An Enhancement of Fault-Tolerant routing protocol for wireless sensor network, 2010, IEEE International conference on computer and communication engineering.
[10] Wang N, Cao Yewen, An Improved AODV protocol with lower route cost and smaller delay, 2011, IEEE fourth international conference on intelligent computation technology and automation.

Abstract: Sorting algorithms are the main concepts of the subject Data Structures and It's Applications. These algorithms are designed in arranging the data elements in the sorted order. If the data elements are arranged in sorted order , then the searching is very easier. Some algorithms are comparison sort and some are non-comparison sort. The choice of a algorithm is based on the efficiency of the algorithm. I have designed one algorithm called as Alternate Sort. The main aspect is that different technique of comparisons is involed. I have presented the algorithm , It's working and the examples and finally my paper is consisting of the program listing.
Keywords: Alternate Array Efficiency Exchanges Sort.

[1] Website referring the Sorting algorithm from Wickepedia.