Dr. Yang Qin Profile

Dr. Yang Qin

at Nanyang Technological Univ

SPIE Involvement:

Author

Publications (2)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 28 April 2004 Paper

An improved dynamic source routing algorithm for MANETS

Yang Qin, Chia Yui Lee

Proceedings Volume 5284, (2004) https://doi.org/10.1117/12.520133

KEYWORDS: Wireless communications, Mobile communications, Computer simulations, Device simulation, Lead, C++, Process control, RF communications, Performance modeling, Floods

Read Abstract +

A mobile ad hoc network (MANET) facilitates mobile hosts to communicate with one another based on wireless infrastructure. There are no base stations in ad hoc networks and the mobile hosts act as routers for data packets. Since the mobile hosts in a MANET keep moving, topological changes take place frequently in the network. This cause routing information kept by the nodes to get outdated easily. Effective ways of getting updated routing information is needed. This problem becomes more complex in wireless networks, where bandwidth is limited. This paper proposes an improved dynamic source routing (DSR) algorithm as a solution to this problem. The proposed algorithm, the Improved Dynamic Source Routing (I-DSR), has a hybrid feature, combined proactive and reactive, that enables all the hosts to get updated changing topology information with a low cost in communication instead of enabling only a few hosts to get the information when there is a route request for a new moved destination. In anticipation of the need of a route request to the new moved destination by other hosts, the operations in the algorithm are designed to eliminate these needs for route request flooding and eventually generate a small number of control packets. Through simulations, we demonstrate that I-DSR gives better network performance than the well-known on-demanding routing protocol, Dynamic Source Routing (DSR) Protocol. As it is improved from DSR, it just needs a few modification on DSR and is easy to implement.

Proceedings Article | 9 August 2001 Paper

Effective wavelength assignment algorithms in a wavelength-routed network

Yang Qin, Chee Siew, Bo Li

Proceedings Volume 4599, (2001) https://doi.org/10.1117/12.436059

KEYWORDS: Genetic algorithms, Chemical elements, Optical networks, Wavelength division multiplexing, Genetics, Computer programming, Binary data, Switching, Transceivers, Algorithm development

Read Abstract +

This paper addresses the problem of wavelength assignment and wavelength routing in a wide-area optical network, where Wavelength Division Multiplexing (WDM) technology has emerged as the transmission and switching choice. One of the major design issues in this network is the assignment of the limited number of wavelengths among network stations so that higher aggregate capacity can be achieved. The problem of wavelength assignment and routing is proved to be NP-hard problem. The present literature on this topic is a large repertoire of heuristics that produce good solutions in a reasonable amount of time. These heuristic, however, have restricted applicability in a practical environment because they have a number of fundamental problems including high time complexity, lack of scalability with respect to optimal solutions. In this paper, we propose genetic based algorithm with an objective to simultaneously meet the goals of height performance and fast running time. In addition, we propose to apply the Greedy Random Adaptive Search Procedure (GRASP) to solve the wavelength assignment problem. We demonstrate that our proposed algorithms can achieve lower blocking probability while taking considerably less running time when compared to one of the best known heuristic wavelength assignment algorithms proposed by Zhang and Acampora, in which close to optimal solution can be obtained.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years