First Asian Himalayas International Conference on Internet AH-ICI2009
The Next Generation of Mobile, Wireless and Optical Communications Networks

Mobility, Home -consumer communications and Health Networking, Electronic Commerce -Mobile Payment, Broadband access -Satellites
3rd, 4th and 5th of November, 2009


Important Dates
Call for Papers and Information for Contributors
Guidelines for Submission
Guidelines for Camera Ready
Conference Venue
Conference Program
Keynotes Speakers
Panel Sessions
Conference Journal Publication
Conference Program at-a–Glance
Information for Presenters
Hotel Accommodation
Visa Information

Keynote Speakers

Title: Cognitive Networks: Throughput, Delay Bounds and Routing Issues
by Professor Dr. Luigi Fratta, Politecnico di Milano, Milano, Italy

Abstract: Cognitive Radio Networks (CRNs) are composed of frequency-agile radio devices that allow licensed (primary) and unlicensed (secondary) users to coexist, where secondary users opportunistically access channels without interfering with the operation of primary ones. From the perspective of secondary users, spectrum availability is a time varying network resource over which multi-hop end-to-end connections must be maintained.

Analytical bounds on throughput and transmission delay of secondary users under different assumptions on secondary and primary users traffic statistics in a single channel scenario will be presented.

Then it will be discussed the problem of routing secondary user flows in a CRN with the aim of characterizing optimal sequences of routes over which a secondary flow is maintained. The optimality is defined according to a novel metric that considers the maintenance cost of a route as channels and/or links must be switched due to the primary user activity. Different from the traditional routing problem, the proposed approach considers subsequent path selections. The problem can be formulated as an integer programming optimization model and shown to be of polynomial time complexity in case of full knowledge of primary user activity. The use of heuristic algorithms, to solve the minimum maintenance cost routing problem when information on primary user activity is not complete, will be discussed. Some numerical results will allow to assess the optimality gap of a proposed heuristic routing algorithm.

About the Speaker: Professor Luigi Fratta received the Doctorate in Electrical Engineering from the Politecnico di Milano, Milano, Italy, in 1966.

From 1967 to 1970 he worked at the Laboratory of Electrical Communications, Politecnico di Milano. As a Research Assistant at the Department of Computer Science, University of California, Los Angeles, he participated in data network design under the ARPA project from 1970 to 1971. From November 1975 to September 1976 he was at the Computer Science Department of the IBM Thomas J. Watson Research Center, Yorktown Heights, NY, working on modeling analysis and optimization techniques for teleprocessing systems. In 1979 he was a Visiting Associate Professor in the Department of Computer Science at the University of Hawaii. In the summer of 1981 he was at the Computer Science Department, IBM Research Center, San José, CA, working on local area networks. During the summers of 1983, 1989 and 1992 he was with the Research in Distributed Processing Group, Department of Computer Science, U.C.L.A., working on fiber optic local area networks. During the summer of 1986 he was with Bell Communication Research working on metropolitan area networks. In 1994 he has been Visiting Scientist at NEC Network Research Lab, Japan. In 2000 he has been Visiting Professor at the University of Canterbury, New Zealand. Since 1980 he is a Full Professor at the Dipartimento di Elettronica e Informazione of the Politecnico di Milano. His current research interests include computer communication networks, packet switching networks, multiple access systems, modeling and performance evaluation of communication systems, local area networks, wireless cellular systems and integrated services over IP networks. Dr. Fratta is Fellow of IEEE.

Title: e-Government Implementation in Nepal
by Dr. Subarna Shakya, Executive Director, National Information Technology Center, MOEST, Government of Nepal

Imagine a situation in which all interaction with government can be done through one counter 24 hours a day, 7 days a week, without waiting in lines. In the near future this will be possible if governments are willing to decentralize responsibilities and processes, and if they start to use electronic means such as the Internet. Each citizen can then contact the government through a website where all forms, legislation, news and other information will be available. In other words, they do more work, with less people, in less time and with less and smaller offices, they use the Internet. Government, as a collector and source of information, could follow this trend, to serve its customers (citizens and businesses) better and to save costs by making internal operations more efficient.

The Keynote will cover the primary focuses on e-government implementation in Nepal on opportunities and challenges. The talk with cover the e-Government system architecture, e-Government benefits, e-Government Evolution in Nepal, Organization Model and also cover the Implementation Parameters and Challenges. The talk will also cover the Government Integrated Data Center (GIDC) is the foundation infrastructure of e-Government implementation in Nepal.

About the Speaker: Dr. Subarna Shakya holds Ph.D. in Computer Engineering from the State University "Lviv Polytechnic", Ukraine. He served as head of Department of Electronics and Computer Engineering, Director of Center for Information Technology and Chairman of Electronics and Computer Engineering Subject Committee, Institute of Engineering, Tribhuvan University. He is an associate Professor and currently serving as Executive Director of National Information Technology Center, Government of Nepal. He is also involving as a member secretary in steering committee headed by Chief Secretary and also project director , project management unit (PMU) of ICT development project under the Office of the Prime Minister and council of ministers(OPMCM),Government of Nepal. He is the founder president of Association of Computer Engineers Nepal (ACEN) and he is also currently president of Association of Computer Engineers Nepal (ACEN).He has published more than 50 technical and policy related articles in national as well as international journals. He has supervised more then 40 in master level student related to ICT, MIS and e-Government. He served as steering committee member in School on Internet (SOI), Kieo University, Japan. He has delivered his key note speech in Seoul National University, South Korea and United Nations University-International Institute for Software Technology (UNU-IIST), Macao. He is advisor, subject committee chairman/member and faculty board member in some national & international Universities. He has served as advisor, coordinator, chairman in National and International Conferences related to ICT. He is keen interest in research and development of ICT, e-government, multimedia, Simulation and modeling and e-Learning.

Title: Improvement of Algorithm in the Particle Tracking Velocimetry
by Prof. Dr. Sashidhar Ram Joshi, head of the Department of Electronics and Computer Engineering, Institute of Engineering, Pulchowk Campus, Nepal

Abstract: The neural network techniques are becoming a useful tool for the particle tracking algorithm of the PIV system software and among others, the self-organizing maps (SOM) model seems to have turned out particularly effective for this purpose. This is mainly because of the performance of the particle tracking itself, capacity of dealing with unpaired particles between two frames and no necessity for a priori knowledge on the flow field (e.g. maximum flow rate) to be measured. Initially, concept of SOM was applied to PIV by Labonte. It was modified by Ohmi and further modified algorithm is developed using the concept of Delta-Bar-Delt rule. It is a heuristic algorithm for modifying the learning rate as training progresses. Earlier, the treatment of unpaired particles, a specific problem to any type of PIV, is not fully considered and thereby, the tracking goes unsuccessfully for some particles. The present research is to bring about further improvement and practicability in this promising particle tracking algorithm. The computational complexity can be reduced employing modified algorithm compared to other algorithms. The modified algorithm is tested in the light of the synthetic PIV standard image as well as in particle images obtained from visualization experiments.

About the Speaker: S. R. Joshi (B.E’84–M.Sc. Engg’92–Research Fellow’98, Ph. D-2007) The author passed his Bachelor of Electrical Engineering from Sardar Ballavbhai Regional College of Engineering, South Gujarat University, Surat, India in 1984 with first class first with distinction. He passed his Master’s of Science in Electrical Engineering from University of Calgary, Canada in 1992. He was Research Fellow in Osaka Sangyo University, Japan for one year from 1998 to 1999. He did his Ph. D. in Electronics and Computer Engineering in 2007. His research topic was “Improvement of the algorithm in the Particle Tracking Velocimetry”. He has published several papers in the peer reviewed international journals. He has joined Institute of Engineering in 1985 and presently he is a professor and head of department in the Department of Electronics and Computer Engineering, Institute of Engineering, Pulchowk Campus, Nepal