Other Technical Works
 

   Technical Works : 

                 This work was under the suggestions of Mr.J.COBB when doing the course Advanced Computer Networks. He observed that for any system with customer, service provider and peer relations with Acyclic Customer-Service Provider graph, the Guideline and export Policies suggested by Gao and Rexford in their IEEE/ACM Transactions on Networking paper, 2001 assures a stable path when using BGP. And in the work of G. W. Timothy G. Griffin, F. Bruce Shepherd published in IEEE/ACM Transactions on Networking paper, 2002, It is proved that any system with stable path will have an Acyclic Dispute Path, that is there will not be any Dispute Cycle. This implies that the guidelines and export policies suggested must also ensure a absence of  Dispute cycle.

                Out of curiosity and personal interest, I came up with a proof for this which was then verified  by professor to be a valid one.

                My Undergraduate, BE Thesis.

                My undergraduate research project was based on the issues faced in Initial Ranging for  OFDMA systems in IEEE 802.16[d]. Initial ranging is the process of detecting any new user in a cell and estimating their timing offset and received power. In this work two methods of Initial Ranging of which one method performs ranging in Time Domain and the other in Frequency Domain were analyzed and a method to improve the performance of Frequency Domain Method was proposed. Using MATLAB,  the three methods were simulated and their performance under various conditions were compared. It was shown that our proposed method outperforms the other two methods in terms of performance and computational complexity.