{"title":"An Improved Firefly Algorithm for Routing in Flying Ad-hoc Networks","authors":"Amrita Yadav, S. Verma","doi":"10.1504/ijcnds.2021.10039689","DOIUrl":"https://doi.org/10.1504/ijcnds.2021.10039689","url":null,"abstract":"","PeriodicalId":45170,"journal":{"name":"International Journal of Communication Networks and Distributed Systems","volume":"1 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66727283","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Factorial exploration of the appropriation of academicscompetenciesand the accompanying needs of future teachers","authors":"","doi":"10.30534/ijns/2020/02962020","DOIUrl":"https://doi.org/10.30534/ijns/2020/02962020","url":null,"abstract":"This study is conducted among students in training. Its objective is to analyse, through factorial exploration, students' perceptions of their levels of appropriation of academic competencies and their support needs. To this effect, an exploratory factorial analysis is carried out using data from asurvey composedof 12 dimensions and 62 statements. The latter measures 11 oral skills, 09 written skills, 08 practical skills and 12 parameters for asserting support needs. The factorial exploration determined 10 latent variables or factors. This was based on a sample of 147 participants F (n=53;36.1%) M (n=94;63.9%). The factor structure was examined under SPSS 21 using a maximum likelihood extraction method with Varimax axis rotation assuming moderate inter-factor correlations (Elliot and McGregor, 2001).Our results showed from this analysis the extraction of 10 factors explaining 74.38% of the total variance in the data on competencies required during training, as follows :Written Production (WP).This factor (relating to written competence) explained 6.52% of the variance. The analysis expresses a discrepancy of the items by (-.746 and .512). Participants tend to be less appropriate for compliance with instructions when they are able to organise themselves alone during investigative work or document exploration. Oral and Written Communication (OWC).This factor (relevant to oral competence) emerges with a 6.97% variance ratio and also included 2 items (Speaking in front of the audience, communicating ideas in writing to the teacher). The analysis expresses a variance indicated respectively by (.730 and -.711). The student's mastery of the oral situation does not therefore ensure the student's control of written expression or oral exchanges in a duel (student-teacher).Intensity of Effort and Artistic Expression (IEA).This factor (relating to physicalcompetence) accounted for 9.27% of the variance. The analysis expresses a discrepancy between the items. It is indicated respectively by (-.747 and .645). As a result, the ability to express intense effort is not at all favourable for artistic expression.As a result, intense physical effort is not compatible with grace and artistic expression. It has been found that the prior disparities between students (type of baccalaureate...) reveal pedagogical workcamps to be established later on during the readjustments of the different courses of study. According to these results, not all the participants have the same constraints or expectations in the curriculum of this training course.The declaratives representations on the appropriation of the competences identified, grouped and analysed, affirm that the so-called \"university\" or less professionally oriented courses are generally considered to be of little interest according to the conclusions of the participants Mean 2.54 ± sd .86, i.e. 45% n=67 of the interviewees. The assertions expressed in the results give rise to a measure of action, which is that of revie","PeriodicalId":45170,"journal":{"name":"International Journal of Communication Networks and Distributed Systems","volume":"12 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2020-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79486572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Attempt to model accompanying postures in training : Spatio-temporal analysis","authors":"","doi":"10.30534/ijns/2020/03962020","DOIUrl":"https://doi.org/10.30534/ijns/2020/03962020","url":null,"abstract":"Mustapha AKOULet al., International Journal of Networks and Systems, 9(6), October–November2020, 18-2618Attempt to model accompanying postures in training:Spatio-temporal analysisMustapha AKOUL1, Saïd LOTFI2, Mohamed RADID31Normal Superior School (ENS); Observatory of Research in Didactics and University Pedagogy (ORDPU), Faculty of Science of Ben M'sik, Hassan II University of Casablanca,BP 50069, Ghandi, Morocco. akoulmustapha@gmail.com2Researcher in Multidisciplinary Loboratory in Educations Sciences and Training Ingeneering. Assessment in Physical Activity and Sport (REAPS), Normal Superior School (ENS), Hassan II University of Casablanca, BP 50069, Ghandi, Morocco. lotfisaid@gmail.com3Researcher in the laboratory of chemistry of materials in Ben M’sik Faculty; Hassan II Casablanca University; Morocco. m.radid@gmail.com.ABSTRACTThis is an exploratory qualitative study. It is based on a selection of scientific articles published in recognized journals. It is also carried out through search engines (Google scholar/Hal.archivesouvertes.fr/Search.openedition.org, etc.), addressing the theme of support in general and particularly in the educational and training environment.This exploratory activity of textual data, allowed us to gather the articles and to structure them in a corpus of data. The latter generate a coherent body of knowledge on the subject of educational support and training.This textual material allowed us toidentify four analyzers and finally emerge four different postures on all of our decryptions on this subject. This is, at the outset, the time allotted to accompaniment by moving from permanent to periodical. The accompaniment, therefore, is analyzed on atemporal register: from permanent to occasional. Second, it will be the space where the exchanges between the person accompanied and the accompanist will take place:from a close distance or proximity to a remote space where the exchanges take place remotely.The purpose of this article is to sketch a modelling of qualitative genesis through four accompanying postures in the field of training and education:Posture (P1): proximity -permanent; Posture (P2): remote -permanent; Posture (P3): proximity -periodical;Posture (P4): remote -periodic.It is an exploration aimed at exploring a set of characteristics specific to each of the four postures found. The study also aims to clarify the specificities of these postures, the typical tools to their exercises, the expected effects and the conditions of their applications and finally, the limits of their adoptions in the different contexts. This modelling of the accompanying postures aims at a necessary step back in the involvement in any such devices. The continuum that we have proposed (Figure 2), is intended to be progressive and obedient to an evolutionary dynamic ranging from the most watchful posture on the person accompanied (P1), to the most empowering one for him (P4)","PeriodicalId":45170,"journal":{"name":"International Journal of Communication Networks and Distributed Systems","volume":"9 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2020-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86610606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Image Segmentation Based On K-Means With MAP","authors":"Bhavana R. Maale","doi":"10.30534/ijns/2020/01942020","DOIUrl":"https://doi.org/10.30534/ijns/2020/01942020","url":null,"abstract":"A major feature of quantitative cell biology is the identification of various cell compartments, cell types and their relationship. Automating of this problem has proven non-trivial, however, and it involves the object of multi-class image partition tasks that are difficult due to the high similarity of objects from various groups and irregularly found structures. To overcome this problem purpose, we propose k-means image segmentation method. And also in the current implementation of the proposed algorithm, the overall segmentation performance of the method can be confined by the graph generation quality. So the future work can be the development of a Maximum Posterior (MAP) estimation for graph generation that optimizes the graph structure jointly with label inference. On the other hand, it is valid to mentioning that the small margin of improvement by the proposed graph based spliting over segnet is because features learned by the CNN are minimizing the cost function rather than the cost function of the polytree.","PeriodicalId":45170,"journal":{"name":"International Journal of Communication Networks and Distributed Systems","volume":"58 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2020-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84776682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"OPS: A Fairness Link Allocation Based on SDN in Datacenter Networks","authors":"T. Kao, Y. Miao, San-Yuan Wang","doi":"10.1504/ijcnds.2020.10028907","DOIUrl":"https://doi.org/10.1504/ijcnds.2020.10028907","url":null,"abstract":"Nowadays, redundant topologies with multiple forwarding paths between original-destination (OD) pairs have been proposed for datacentre networks, such as fat-tree topology. To achieve resultant fairness (fair utilisation) in this topology, previous algorithms were based on traditional shortest path algorithms or equal-cost multiple paths algorithms (ECMP). However, these algorithms are facing with take up a lot of resources of the SDN controller and may cause a large amount of loss of resultant fairness for the network that has different configurations of link capacity. In this paper, we present out port selection (OPS) mechanisms, including modular out port selection (MOPS) and random out port selection (ROPS), novel methods to improve resultant fairness of fat-tree topology SDN-based datacentre network. Compare with static load-balance methods, our MOPS and ROPS can reduce 65% and 33% loss of fairness, respectively. Further, combining with elephant flows detecting and handling mechanisms, MOPSE and ROPSE can dynamically assign better forwarding path for elephant flows.","PeriodicalId":45170,"journal":{"name":"International Journal of Communication Networks and Distributed Systems","volume":"25 1","pages":"307-332"},"PeriodicalIF":1.3,"publicationDate":"2020-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43620525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Han Zejun, DI Hong-wei, Bao Li-yong, Yang Zhijun, Liu Qianlin
{"title":"Analysis of new multi-priority P-CSMA of non-persistent type random multiple access ad hoc network in MAC protocol analysis","authors":"Han Zejun, DI Hong-wei, Bao Li-yong, Yang Zhijun, Liu Qianlin","doi":"10.1504/IJCNDS.2020.108163","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.108163","url":null,"abstract":"A multichannel non-persistent of P-CSMA (NP-CSMA) random multiple access ad hoc network in MAC protocol based on variable collision length is proposed. It has important applications value in wireless ad hoc network and so on. When the channel is idle, the end-users are sent by P probability; while the channel is busy, it will not listen to the channel and wait for a certain period of time to send it again. The multi-priority mechanism is introduced to meet the needs of QoS in different priorities. By modelling the new multi-priority NP-CSMA protocol, the throughput of each channel is obtained by using the average cycle method. Compared with other protocols, the superiority of this protocol is obtained, and the accuracy of the protocol is verified through simulation experiments.","PeriodicalId":45170,"journal":{"name":"International Journal of Communication Networks and Distributed Systems","volume":"25 1","pages":"57-77"},"PeriodicalIF":1.3,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/IJCNDS.2020.108163","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66726693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance analysis of wireless communication networks with threshold activation process and interference signals","authors":"Xiangran Yu, Zhanyou Ma, Shanshan Guo, Li Chen","doi":"10.1504/IJCNDS.2020.10022392","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10022392","url":null,"abstract":"In order to reduce energy consumption in wireless communication networks, the sleep mode in the energy saving strategy and the threshold activation process of the base station are considered. Combining with practice, the existence of interference signals and possible errors in the transmission of data packets are considered. At the same time, considering that the wireless communication network system has two channels and one of them is incompletely reliable, a queuing model of repairable M/M/2 multiple working vacations with start-up period, negative customers, feedback and N-strategy is established. Using quasi birth-and-death process (QBD) and Gauss-Seidel iterative method, the expressions of the average delay of the data packet and other performance indicators are given. Then, using MATLAB software for numerical analysis, the influence of system parameters on the average delay and other performance indicators is analysed. Finally, the social optimal parameters are found by constructing benefit functions.","PeriodicalId":45170,"journal":{"name":"International Journal of Communication Networks and Distributed Systems","volume":"1 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42736663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design and Performance Analysis of Link-by-Link Congestion Avoidance (LbLCA) Algorithm","authors":"Sneha K. Thombre, L. Patnaik, A. S. Tavildar","doi":"10.1504/IJCNDS.2020.10022189","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10022189","url":null,"abstract":"In this paper, a simple but new approach, namely link-by-link congestion avoidance (LbLCA) algorithm, which works at the network layer, has been proposed. LbLCA is a proactive congestion avoidance algorithm. It uses explicit feedback to prevent congestion to happen in the first place. The novelty of LbLCA is that no per flow information is required, which makes it more scalable. Based on the design philosophy and equations, sizing of various router buffers has been arrived at for different typical network topologies. Buffer sizes depend upon the mean arrival rate at router input and outgoing link capacities and are independent of round trip time (RTT) and the number of flows passing through the router. The buffer sizes determined using LbLCA design are validated using extensive NS2 simulations. The performance evaluation has been done using NS2 simulations on the typical network topologies. The performance comparison between TCP and LbLCA reveals that proposed LbLCA algorithm gives improved performance for the end-to-end delay and packet delivery ratio. LbLCA is impartial to all flows, as LbLCA works at network layer and therefore, cannot differentiate between flows.","PeriodicalId":45170,"journal":{"name":"International Journal of Communication Networks and Distributed Systems","volume":"24 1","pages":"381-408"},"PeriodicalIF":1.3,"publicationDate":"2020-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42595160","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jia Chaochuan, Yang Ting, Wang Chuan-jiang, Fan Bing-hui, He Fugui
{"title":"A Improved Adaptive Cuckoo Search Algorithm Based the Population Feature and Iteration Information","authors":"Jia Chaochuan, Yang Ting, Wang Chuan-jiang, Fan Bing-hui, He Fugui","doi":"10.1504/IJCNDS.2020.10018198","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10018198","url":null,"abstract":"Cuckoo search (CS) is widely used to solve many optimisation problem, which is a biologically inspired the brood parasitic behaviour of a type of cuckoos and the Levy flights behaviour of some animals. However, it has been demonstrated to easily get trapped into local optimal solutions and slow convergence speed. Therefore, an improved adaptive cuckoo search (IACS) optimisation algorithm is proposed in this article. Two adaptive strategies based on the population feature and iteration information feedback which are integrated into the CS algorithm to adjust the parameters pa and α0. We compared the proposed algorithm to CS and five variants on the 30 benchmark functions proposed in CEC 2014. In addition, the proposed algorithm and CS are integrated into support vector machine (SVM) for classification. Experimental results certify that the modified algorithm is superior to the CS for most optimisation problems and has better performance than the other variants of CS algorithm.","PeriodicalId":45170,"journal":{"name":"International Journal of Communication Networks and Distributed Systems","volume":"24 1","pages":"233-248"},"PeriodicalIF":1.3,"publicationDate":"2020-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45373437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Karima Oukfif, Fatima Oulebsir-Boumghar, S. Bouzefrane, S. Banerjee
{"title":"Workflow scheduling with data transfer optimisation and enhancement of reliability in cloud data centres","authors":"Karima Oukfif, Fatima Oulebsir-Boumghar, S. Bouzefrane, S. Banerjee","doi":"10.1504/IJCNDS.2020.10021223","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10021223","url":null,"abstract":"Infrastructure as a service (IaaS) clouds offer huge opportunities to solve large-scale scientific problems. Executing workflows in such environments can be expensive in time if not scheduled rightly. Although scheduling workflows in the cloud is widely studied, most approaches focus on two user's quality of service requirements namely makespan (i.e., completion time) and costs. Other important features of cloud computing such as the heterogeneity of resources and reliability must be considered. In this paper, we present a reliability-aware method based on discrete particle swarm optimisation (RDPSO) for workflow scheduling in multiple and heterogeneous cloud data centres. Our aim is to optimise data transfer time while minimising makespan and enhancing reliability. Based on simulation, our results show a significant improvement in terms of makespan, transferred data and reliability relative to reliability-aware HEFT method (heterogeneous earliest finish time), for the real-world workflows.","PeriodicalId":45170,"journal":{"name":"International Journal of Communication Networks and Distributed Systems","volume":"24 1","pages":"262-283"},"PeriodicalIF":1.3,"publicationDate":"2020-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66726520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}