Research Experiences



Honors & Awards 

Research Interests

Research Experiences


Job Experiences

Undergraduate Thesis  


Some Nice Poems

WiMAX Base Station Development
Currently working as a RnD Member at Commlink Info Tech Ltd. with a group of researchers to develop end-to-end solutions for WiMAX (Wireless Interoperability Microwave Access) technology. We devised modular design of BS control application through extensive research on WiMAX Forum and IEEE802.16e documents. Now we have completed the development of WiMAX Base Station as a compact microTCA unit consisting of two modules: Baseband and Radio Module. September 1, 2008 to till now

Peer-to-Peer Network Application Development
Studied various types of peer-to-peer network structure, NAT traversal algorithms (STUN, TURN, ICE) and their open source codes & documentations. At last Libjingle api (developed by Google) is selected for traversing NAT, breaking Firewalls & constructing connection between peers and Tigase server (XMPP server) for managing the presence information of peers. We thoroughly studied codes & documentation of Libjingle api & Tigase server and customized them according to our needs. We have developed an application which can efficiently manage Peer-to-Peer file sharing, File Streaming, Instant Messaging using any of TCP or UDP connection. February 15, 2008 to May 31, 2008.

Drawings of 3-Connected Cubic Planar Graphs with 4-Slopes(Undergraduate Thesis)
Studied various types of Graph drawing algorithms under the supervision of Dr. Saidur Rahman who is a prominent researcher in the field of Graph theory & Network Routing Protocol, and was former Associate Professor of Graduate School of Information Sciences ,Tohuku University, Japan. We focused on one of the problems of graph drawing is to draw graphs with minimum number of slopes or minimum number of segments. This has much application in case of Computer Networking, Cellular network planning, VLSI layout, software engineering, simulating molecular structures. We have studied many approaches to draw graphs with minimum number of slopes or minimize number of segments. In particular we focus on minimization on the number of slopes. Finally we have developed an algorithm that will draw 3-connected cubic planar graphs with at most 4-slopes allowing at most one bend on outercycle.
January 2006 to May 2007.