Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
Articles by Mohsen Heydarian
Total Records ( 2 ) for Mohsen Heydarian
  Mohsen Heydarian
  Managing the number of destination nodes for multicasting services is an important challenge in communication networks. When a Multicast Multichannel Path (MMCP) transmits packets from a source node to a group of destination nodes it might be possible the number of destination nodes change. This means that during a multicast data transmission session, either removing some current destination nodes or adding some new destination nodes can be happen. Removing a current destination node loses packets which are being transmitted to that node. Therefore, increasing or decreasing the number of destination nodes causes that the router compulsorily changes or re-computes the current multicast paths. Adding or removing the destination nodes must be done by a dynamic routing algorithms because static routing algorithms do not support dynamic changes in network topology. Re-computing multicasting path must be dynamically done because static computations may disconnect multicasting path and halt data transmission. When a current path is replaced with another new path, some packets cannot be forwarded to their destinations and they will be lost. This affair removes packets and then wastes bandwidth. In this study, we will present a new Dynamic Routing Algorithm, Optimal Dy-namic Multicast Multichannel Routing (ODMMR) which prevents from losing packets and wasting network resources. Our new algorithm is based on the multichannel constraint-based routing (a traffic engineering approach) and supports Quality of Services (QoS). Computational results and simulation analysis will show that our new algorithm is more efficient than other available routing algorithms.
  Mohsen Heydarian and Arman Farahbakhsh
  There is a great requirement to reduce air pollution and transportation delay in cities roads. This paper presents a new routing algorithm, Optimal Traffic and Pollution Control Routing algorithm (OTPCR), based on the mathematical modeling and Infrastructure communication (V2I) strategy to minimize vehicle traveling delay and air pollution in city roads. Our new routing algorithm (OTPCR) at first will construct a mathematical model which formulate: vehicles traffic, roads topology and air pollution parameters and next it solves the obtained mathematical model in order to compute and find the best path (π) between source and destination for traveling vehicle. The Mathematical model which is called Vehicular Network Linear Programming Model (VLPM) is based on the Linear Integer Programming Formulation (LIPF) and Simplex optimization rules. Note that the best path is an optimal path and can minimize air pollution in city roads and transportation delay of vehicles. V2I communication strategy uses a Mobile Ad Hoc Networks (MANET) system to transfer vehicle traffic information. Our simulation results show that our new algorithm is more efficient than other available routing algorithms. Time complexity of our algorithm is acceptable and can reduce message distribution across the network.
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility