GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    In: International Journal of Engineering and Advanced Technology, Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP, Vol. 9, No. 1 ( 2019-10-30), p. 5402-5408
    Abstract: Queuing hypothesis is a quantitative method which comprises in building scientific models of different sorts of lining frameworks. Occupied time of the framework is broke down and mean holding up time in the stationary system processed. At long last, some numerical outcomes are introduced to demonstrate the impact of model parameters on the framework execution measures. The traveling server, nonetheless, comes back to landing which is used to offer at a low rate whereas the other server is occupied. At whatever point the framework ends up and the subsequent server leaves for a working excursion while the principal server stays inert in the framework. These models can be utilized for making expectations about how the framework can change with requests. The framework is examined in the enduring state utilizing lattice geometric strategy. The clients enter the line in the Poisson manner and the time of each bunch size is dared to be circulated exponentially as for mean ward clump size and clients may balk away or renege when the holding up the line of the clients, in general, be exceptionally enormous. This work exhibits the investigation of a recharging input different working excursions line with balking, reneging and heterogeneous servers. Queuing hypothesis manages the investigation of lines and lining conduct. Different execution proportions of the model, for example, anticipated framework length, anticipated balking rate and reneging rate have been talked about. The technique breaks down an M/M/2 lining framework with two heterogeneous servers, one of which is constantly accessible however the different travels without clients sitting tight for service. During a working vacation period, the subsequent server gives administration at a slower rate as opposed to totally ceasing service. The relentless state probabilities of the model are advantageous and recursive strategies.
    Type of Medium: Online Resource
    ISSN: 2249-8958
    URL: Issue
    Language: Unknown
    Publisher: Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP
    Publication Date: 2019
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP ; 2019
    In:  International Journal of Engineering and Advanced Technology Vol. 8, No. 6 ( 2019-08-30), p. 488-494
    In: International Journal of Engineering and Advanced Technology, Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP, Vol. 8, No. 6 ( 2019-08-30), p. 488-494
    Abstract: Secure data delivery, mobility, link lifetime, energy consumption and delay are the most important parameters to be highly concentrated in the self-organised network named manets. Where in Manets the nodes move unpredictably in any direction with restricted battery life, resulting in frequent change in topology and due to mobility the trust in packet delivery will suffer inside the network. These constraints are studied broadly to ensure the secured data delivery and the lifetime of such networks. In this paper we propose a PFCA(Predicted fitness based clustering) algorithm using fitness value. The cluster heads are selected based on the fitness value of the nodes. Whereas the fitness value is calculated using the trust value, link lifetime for different type of node mobility and energy consumed and the clusters are formed using the PFCA clustering algorithm. The proposed PFC algorithm is experimented in the NS-2 network simulator and the results are compared with the existing PSO-clustering algorithm. The results show the effectiveness of our proposed algorithm in terms of network overhead, average number of clusters formed, average number of re-clustering required, delay and packet delivery ratio.
    Type of Medium: Online Resource
    ISSN: 2249-8958
    Language: Unknown
    Publisher: Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP
    Publication Date: 2019
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...