Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Proceeding of the Electrical Engineering Computer Science and Informatics
Amin Hosseini-Seno, Seyed
Computer Network Research Laboratory, Ferdowsi University of Mashhad
Computer Science & IT Electrical & Electronics Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
An Efficient Cluster-based Routing Protocol for Mobile Ad Hoc Networks Hakimifar, Fatemeh; Amin Hosseini-Seno, Seyed; Shenify and Rahmat Budiarto, Mohamed
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 1: EECSI 2014
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1058.797 KB) | DOI: 10.11591/eecsi.v1.380

Abstract

Clustering algorithm used in CBRP is a variation of simple lowest-ID clustering algorithm in which the node with a lowest ID among its neighbors is elected as the Cluster-head. Neglecting mobility and energy for selecting cluster-head is one of the weakness points of this protocol. In this paper the cluster formation algorithm is introduced, that uses the relative mobility metric, the residual energy and connectivity degree. After forming the cluster, whenever the cluster-head's energy is less than the aggregate energy of its member nodes, it remains as the cluster-head. Using NS-2 we evaluate rate of cluster-head changes, normalization routing overhead and packet delivery ratio. Comparisons denote that the proposed CBRP has better performances with respect to the original CBRP and Cross-CBRP.
Dynamic Prioritization of Path for Quality-of-Service Differentiation in Multi-Priority Traffic Banaie, Fatemeh; Amin Hosseini-Seno, Seyed; Hossein Yaghmaee, Mohammad; Budiarto, Rahmat
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 1: EECSI 2014
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (961.813 KB) | DOI: 10.11591/eecsi.v1.385

Abstract

The emergence of value added services relying on a higher interactivity has altered the requirements of current transport network. Diverse traffic classes are processed by a large-scale optical network, imposing a more efficient utilization of their network infrastructure resources. Such services generally cross multiple domains, but inter-domain path computation algorithms still have some limitations. This paper describes a priority based path computation algorithm to meet all QoS requirements with the available capacity. The proposed algorithm increases the rate of successful replies while minimizing the blockage in network. The dynamic traffic is classified into high and low priority, so it improves emergency response in network.
Co-Authors Banaie, Fatemeh Hakimifar, Fatemeh Hossein Yaghmaee, Mohammad Yundari, Yundari