Pub Date : 2023-01-01DOI: 10.24138/jcomss-2023-0080
Salima Nebti, Mohammed Redjimi
Wireless networks are frequently installed in arduous environments, heightening the importance of their consistent operation. To achieve this, effective strategies must be implemented to extend the lifespan of nodes. Energy-conserving routing protocols have emerged as the most prevalent methodology, as they strive to elongate the network's lifetime while guaranteeing reliable data routing with minimal latency. In this paper, a plethora of studies have been done with the purpose of improving network routing, such as the integration of clustering techniques, heterogeneity, and swarm intelligence-inspired approaches. A comparative investigation was conducted on a variety of swarm-based protocols, including a new coevolutionary binary grey wolf optimizer (Co-BGWO), a BGWO, a binary whale optimization, and a binary Salp swarm algorithm. The objective was to optimize cluster heads (CHs) positions and their number during the initial stage of both two-level and three-level heterogeneous networks. The study concluded that these newly developed protocols are more reliable, stable, and energy-efficient than the standard SEP and EDEEC heterogeneous protocols. Specifically, in 150 m2 area of interest, the Co-BGWO and BGWO protocols of two levels were found the most efficient, with over than 33% increase in remaining energy percentage compared to SEP, and over 24% more than EDEEC in three-level networks.
{"title":"A Co-evolutionary Algorithm-based Enhanced Grey Wolf Optimizer for the Routing of Wireless Sensor Networks","authors":"Salima Nebti, Mohammed Redjimi","doi":"10.24138/jcomss-2023-0080","DOIUrl":"https://doi.org/10.24138/jcomss-2023-0080","url":null,"abstract":"Wireless networks are frequently installed in arduous environments, heightening the importance of their consistent operation. To achieve this, effective strategies must be implemented to extend the lifespan of nodes. Energy-conserving routing protocols have emerged as the most prevalent methodology, as they strive to elongate the network's lifetime while guaranteeing reliable data routing with minimal latency. In this paper, a plethora of studies have been done with the purpose of improving network routing, such as the integration of clustering techniques, heterogeneity, and swarm intelligence-inspired approaches. A comparative investigation was conducted on a variety of swarm-based protocols, including a new coevolutionary binary grey wolf optimizer (Co-BGWO), a BGWO, a binary whale optimization, and a binary Salp swarm algorithm. The objective was to optimize cluster heads (CHs) positions and their number during the initial stage of both two-level and three-level heterogeneous networks. The study concluded that these newly developed protocols are more reliable, stable, and energy-efficient than the standard SEP and EDEEC heterogeneous protocols. Specifically, in 150 m2 area of interest, the Co-BGWO and BGWO protocols of two levels were found the most efficient, with over than 33% increase in remaining energy percentage compared to SEP, and over 24% more than EDEEC in three-level networks.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136305716","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}
Pub Date : 2023-01-01DOI: 10.24138/jcomss-2022-0143
Karthik Desingu, Daniel Mark Isaac, M. P., Bharathi B., Cherry Mathew Philipose
{"title":"LocateMyBus: IoT-Driven Smart Bus Transit","authors":"Karthik Desingu, Daniel Mark Isaac, M. P., Bharathi B., Cherry Mathew Philipose","doi":"10.24138/jcomss-2022-0143","DOIUrl":"https://doi.org/10.24138/jcomss-2022-0143","url":null,"abstract":"","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69100256","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}
Pub Date : 2023-01-01DOI: 10.24138/jcomss-2022-0130
Ni Made Ary Esta Dewi Wirastuti, Komang Oka Saputra, W. Teng
{"title":"A Regular Pattern of Timestamps Between Machines with Built-in System Time","authors":"Ni Made Ary Esta Dewi Wirastuti, Komang Oka Saputra, W. Teng","doi":"10.24138/jcomss-2022-0130","DOIUrl":"https://doi.org/10.24138/jcomss-2022-0130","url":null,"abstract":"","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69099959","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}
Pub Date : 2023-01-01DOI: 10.24138/jcomss-2022-0177
Vadym S. Hapanchak, António D. Costa
—Multipath communication has recently arisen as a promising tool to address reliable communication in vehicular networks. The architecture of Multipath TCP (MPTCP) is designed to facilitate concurrent utilization of multiple network interfaces, thereby enabling the system to optimize network throughput. In the context of vehicular environments, MPTCP offers a promising solution for seamless roaming, as it enables the system to maintain a stable connection by switching be-tween available network interfaces. This paper investigates the suitability of MPTCP to support resilient and efficient Vehicle-to-Infrastructure (V2I) communication over heterogeneous networks. First, we identify and discuss several challenges that arise in heterogeneous vehicular networks, including issues such as Head-of-Line (HoL) blocking and service interruptions during handover events. Then, we propose a cross-layer path management scheme for MPTCP, that leverages real-time network information to improve the reliability and efficiency of multipath vehicular communication. Our emulation results demonstrate that the proposed scheme not only achieves seamless mobility across heterogeneous networks but also significantly reduces handover latency, packet loss, and out-of-order packet delivery. These improvements have a direct impact on the quality of experience for vehicular users, as they lead to lower application layer delay and higher throughput.
{"title":"A Cross-layer Approach for MPTCP Path Management in Heterogeneous Vehicular Networks","authors":"Vadym S. Hapanchak, António D. Costa","doi":"10.24138/jcomss-2022-0177","DOIUrl":"https://doi.org/10.24138/jcomss-2022-0177","url":null,"abstract":"—Multipath communication has recently arisen as a promising tool to address reliable communication in vehicular networks. The architecture of Multipath TCP (MPTCP) is designed to facilitate concurrent utilization of multiple network interfaces, thereby enabling the system to optimize network throughput. In the context of vehicular environments, MPTCP offers a promising solution for seamless roaming, as it enables the system to maintain a stable connection by switching be-tween available network interfaces. This paper investigates the suitability of MPTCP to support resilient and efficient Vehicle-to-Infrastructure (V2I) communication over heterogeneous networks. First, we identify and discuss several challenges that arise in heterogeneous vehicular networks, including issues such as Head-of-Line (HoL) blocking and service interruptions during handover events. Then, we propose a cross-layer path management scheme for MPTCP, that leverages real-time network information to improve the reliability and efficiency of multipath vehicular communication. Our emulation results demonstrate that the proposed scheme not only achieves seamless mobility across heterogeneous networks but also significantly reduces handover latency, packet loss, and out-of-order packet delivery. These improvements have a direct impact on the quality of experience for vehicular users, as they lead to lower application layer delay and higher throughput.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69100761","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}
Pub Date : 2022-01-01DOI: 10.24138/jcomss-2022-0115
M. Al-Rayif
—When dealing with the phenomenon of unexpected high peak-to-average power ratio (PAPR) caused by multicarrer techniques, it is rarely to find a proposed solution that addresses the most important challenges together, that are; reducing the PAPR, achieving performance identical, mostly, to the theoretical curve and a reasonable level of computational complexity. This paper presents a new proposal that is able to achieve these three criteria together as the following. First, reducing the PAPR curves through easy development in the selective mapping (SLM) struc- ture. Second, identifying the original transmitted phase block by taking advantage of the cyclic prefix structure and its mechanism, without any explicit side information, while maintaining the system performance. Lastly, these achievements were obtained at low computational complexity comparing to the traditional methods of SLM PAPR reduction schemes. This proposed method is referred to as; Injected and Extracted Short-SLM to and from the Cyclic Prefix (IES-SLM-CP). The appropriate short phase sub-block is injected to a specific locations of CP, and at the receiver side, this sub-block can be extracted from the CP to reconstruct the whole original phase block.
{"title":"Investment of Cyclic Prefix to Reduce the Peak-to-Average Power Ratio and Recover Original Phases Blindly","authors":"M. Al-Rayif","doi":"10.24138/jcomss-2022-0115","DOIUrl":"https://doi.org/10.24138/jcomss-2022-0115","url":null,"abstract":"—When dealing with the phenomenon of unexpected high peak-to-average power ratio (PAPR) caused by multicarrer techniques, it is rarely to find a proposed solution that addresses the most important challenges together, that are; reducing the PAPR, achieving performance identical, mostly, to the theoretical curve and a reasonable level of computational complexity. This paper presents a new proposal that is able to achieve these three criteria together as the following. First, reducing the PAPR curves through easy development in the selective mapping (SLM) struc- ture. Second, identifying the original transmitted phase block by taking advantage of the cyclic prefix structure and its mechanism, without any explicit side information, while maintaining the system performance. Lastly, these achievements were obtained at low computational complexity comparing to the traditional methods of SLM PAPR reduction schemes. This proposed method is referred to as; Injected and Extracted Short-SLM to and from the Cyclic Prefix (IES-SLM-CP). The appropriate short phase sub-block is injected to a specific locations of CP, and at the receiver side, this sub-block can be extracted from the CP to reconstruct the whole original phase block.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69100347","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}
Pub Date : 2022-01-01DOI: 10.24138/jcomss-2021-0139
Shkurte Luma-Osmani, F. Ismaili, Pankaj Pathak, Xhemal Zenuni
—This paper presents an etiological cyberstalking study, meaning the use of various technologies and internet in general to harass or to stalk someone. The novelty of the paper is the multivariate empirical approach of cyberstalking victimization that has received less attention from the research community. Also, there is a lack of such studies from the causal perspective. It happens, since in most of the studies, a priority is given on a single causation identification, whereas the data examination used for mining causal relationships in this paper presents a novel and great potential to detect combined or multiple cause factors. The paper focuses in the impact that variables such as age, gender and the fact whether the participant has ever harassed someone, is related to the fact of being victim of cyberstalking. The research aims to find the causes of cyberstalking in high school’s teenagers. Furthermore, an exploratory data analysis has been performed. A weak and moderate correlation between the factors on the dataset is emphasized. The odds ratio among the variables has been calculated, which implies that girls are twice as likely as boys to be cyberstalked. Similarly, concerning outcomes related to cyberstalking frequency recidivism are noticed.
{"title":"Identifying Causal Structures from Cyberstalking: Behaviors Severity and Association","authors":"Shkurte Luma-Osmani, F. Ismaili, Pankaj Pathak, Xhemal Zenuni","doi":"10.24138/jcomss-2021-0139","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0139","url":null,"abstract":"—This paper presents an etiological cyberstalking study, meaning the use of various technologies and internet in general to harass or to stalk someone. The novelty of the paper is the multivariate empirical approach of cyberstalking victimization that has received less attention from the research community. Also, there is a lack of such studies from the causal perspective. It happens, since in most of the studies, a priority is given on a single causation identification, whereas the data examination used for mining causal relationships in this paper presents a novel and great potential to detect combined or multiple cause factors. The paper focuses in the impact that variables such as age, gender and the fact whether the participant has ever harassed someone, is related to the fact of being victim of cyberstalking. The research aims to find the causes of cyberstalking in high school’s teenagers. Furthermore, an exploratory data analysis has been performed. A weak and moderate correlation between the factors on the dataset is emphasized. The odds ratio among the variables has been calculated, which implies that girls are twice as likely as boys to be cyberstalked. Similarly, concerning outcomes related to cyberstalking frequency recidivism are noticed.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098640","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}
Pub Date : 2022-01-01DOI: 10.24138/jcomss-2021-0188
P. Munster, T. Horváth, Petr Dejdar, E. Skaljo
A remotely pumped Erbium-doped system for the amplification of an optical signal for long-reach (LR) next-generation passive optical networks (NG-PONs) is presented in this paper. The next-generation networks will be deployed with/over the current point to multi-point technology with/without backward compatibility. Remote pumping allows extending the reach of the optical distribution networks and the magnification of the splitting ratio as well, which is most important for increasing the number of end users in the PON network. In our laboratory, we have successfully verified the functionality of the unidirectional and bidirectional remote pumping system based on an Erbium-doped fiber inserted into the route and remote pumping from a central office. Our measurement results prove that it is possible to extend the total reaching point to the multi-point system without the difficult incidence in the optical distribution network. Based on the results, the proposed amplifying passive optical network approach is capable of being used in passive optical networks in C band for extending the total reach of system or increasing the split ratio.
{"title":"Remote Pumping in Point to Multi-point Networks","authors":"P. Munster, T. Horváth, Petr Dejdar, E. Skaljo","doi":"10.24138/jcomss-2021-0188","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0188","url":null,"abstract":"A remotely pumped Erbium-doped system for the amplification of an optical signal for long-reach (LR) next-generation passive optical networks (NG-PONs) is presented in this paper. The next-generation networks will be deployed with/over the current point to multi-point technology with/without backward compatibility. Remote pumping allows extending the reach of the optical distribution networks and the magnification of the splitting ratio as well, which is most important for increasing the number of end users in the PON network. In our laboratory, we have successfully verified the functionality of the unidirectional and bidirectional remote pumping system based on an Erbium-doped fiber inserted into the route and remote pumping from a central office. Our measurement results prove that it is possible to extend the total reaching point to the multi-point system without the difficult incidence in the optical distribution network. Based on the results, the proposed amplifying passive optical network approach is capable of being used in passive optical networks in C band for extending the total reach of system or increasing the split ratio.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69099005","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}
Pub Date : 2022-01-01DOI: 10.24138/jcomss-2021-0178
Renato Soic, Marin Vukovic
In the field of natural language processing, language networks represent a method for observing linguistic units and their interactions in different linguistic contexts. This paper uses the previously presented Croatian language network for building a solution capable of generating spoken notifications in Croatian language. The novelty of this paper is that it proposes an approach for generating spoken notifications in smart environments by combining specialized services that enable interaction with the environment and human users. The process employed for generating spoken notifications is described in detail. Also, a novel contribution of this paper is the case-study evaluation of the proposed approach in a smart home
{"title":"N-gram Based Croatian Language Network: Application in a Smart Environment","authors":"Renato Soic, Marin Vukovic","doi":"10.24138/jcomss-2021-0178","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0178","url":null,"abstract":"In the field of natural language processing, language networks represent a method for observing linguistic units and their interactions in different linguistic contexts. This paper uses the previously presented Croatian language network for building a solution capable of generating spoken notifications in Croatian language. The novelty of this paper is that it proposes an approach for generating spoken notifications in smart environments by combining specialized services that enable interaction with the environment and human users. The process employed for generating spoken notifications is described in detail. Also, a novel contribution of this paper is the case-study evaluation of the proposed approach in a smart home","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098888","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}
Pub Date : 2022-01-01DOI: 10.24138/jcomss-2021-0121
S. Belattar, O. Abdoun, E. Haimoudi
—Counter-Propagation-Artificial-Neural-Networks (C P-ANNs) have been applied in several domains due to their learning and classification abilities. Regardless of their strength, the CP-ANNs still have some limitations in pattern recognition tasks when they encounter ambiguities during the learning process, which leads to the inaccurate classification of the Kohonen-Self-Organizing-Map (K-SOM). This problem has an impact on the performance of the CP-ANNs. Therefore, this paper proposes a novel strategy to improve the CP-ANNs by the Gram-Schmidt algorithm (GSHM) as a pre-processing step of the original data without changing their architecture. Three datasets examples from various domains, such as correlation, crop, and fertilizer, were employed for experimental validation. To obtain the results, we relied on two simulations. The first simulation uses CP-ANNs, and the datasets are inputted into the network without any prior pre-processing. The second simulation uses MCP-ANNs, and the datasets are pre-processed through the GSHM block. Experiment results show that the proposed MCP-ANNs recognize all patterns with a classification accuracy of 100% versus 62.5% for CP-ANNs in the Correlation Dataset. Furthermore, the proposed MCP-ANNs reduce the execution time and training parameter values in all datasets versus CP-ANNs. Thus, the proposed approach based on the GSHM algorithm significantly improves the performance of the CP-ANNs.
{"title":"A Novel Strategy for Improving the Counter Propagation Artificial Neural Networks in Classification Tasks","authors":"S. Belattar, O. Abdoun, E. Haimoudi","doi":"10.24138/jcomss-2021-0121","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0121","url":null,"abstract":"—Counter-Propagation-Artificial-Neural-Networks (C P-ANNs) have been applied in several domains due to their learning and classification abilities. Regardless of their strength, the CP-ANNs still have some limitations in pattern recognition tasks when they encounter ambiguities during the learning process, which leads to the inaccurate classification of the Kohonen-Self-Organizing-Map (K-SOM). This problem has an impact on the performance of the CP-ANNs. Therefore, this paper proposes a novel strategy to improve the CP-ANNs by the Gram-Schmidt algorithm (GSHM) as a pre-processing step of the original data without changing their architecture. Three datasets examples from various domains, such as correlation, crop, and fertilizer, were employed for experimental validation. To obtain the results, we relied on two simulations. The first simulation uses CP-ANNs, and the datasets are inputted into the network without any prior pre-processing. The second simulation uses MCP-ANNs, and the datasets are pre-processed through the GSHM block. Experiment results show that the proposed MCP-ANNs recognize all patterns with a classification accuracy of 100% versus 62.5% for CP-ANNs in the Correlation Dataset. Furthermore, the proposed MCP-ANNs reduce the execution time and training parameter values in all datasets versus CP-ANNs. Thus, the proposed approach based on the GSHM algorithm significantly improves the performance of the CP-ANNs.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098591","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}
Pub Date : 2022-01-01DOI: 10.24138/jcomss-2021-0094
Nariman Najeeb Hadaya, S. Alabady
The Objective Function (OF) can be used by the Routing protocol for low power lossy networks (RPL) to construct a Destination Oriented Directed Acyclic Graph (DODAG) based on routing metrics. The standard OFs suffer from long hops when selecting the route, which may cause consume the node’s energy faster. In this paper, we suggest an improvement of RPL OF that considers three metrics. The results show that the proposed protocol increases network lifetime by reducing energy consumption, increasing efficiency, increasing Packet Delivery Ratio (PDR), and decreasing packet loss ratio. In terms of PDR, packet loss ratio, and average power consumption, the best performance of the proposed protocol is shown in the network with 70 nodes and when the transmission range is 50m. Compared with the MRHOF, the proposed protocol increased the PDR by 58.425%, decreased the packet loss ratio by 0.21765, and decreased the total power consumption by 181.815mW. In terms of the average Expected Transmission Count (ETX) the best performance of the proposed protocol is shown in the network with 60 nodes and the transmission range is 40m. The proposed protocol reduced the average ETX by 49 compared to the MRHOF.
{"title":"New RPL Protocol for IoT Applications","authors":"Nariman Najeeb Hadaya, S. Alabady","doi":"10.24138/jcomss-2021-0094","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0094","url":null,"abstract":"The Objective Function (OF) can be used by the Routing protocol for low power lossy networks (RPL) to construct a Destination Oriented Directed Acyclic Graph (DODAG) based on routing metrics. The standard OFs suffer from long hops when selecting the route, which may cause consume the node’s energy faster. In this paper, we suggest an improvement of RPL OF that considers three metrics. The results show that the proposed protocol increases network lifetime by reducing energy consumption, increasing efficiency, increasing Packet Delivery Ratio (PDR), and decreasing packet loss ratio. In terms of PDR, packet loss ratio, and average power consumption, the best performance of the proposed protocol is shown in the network with 70 nodes and when the transmission range is 50m. Compared with the MRHOF, the proposed protocol increased the PDR by 58.425%, decreased the packet loss ratio by 0.21765, and decreased the total power consumption by 181.815mW. In terms of the average Expected Transmission Count (ETX) the best performance of the proposed protocol is shown in the network with 60 nodes and the transmission range is 40m. The proposed protocol reduced the average ETX by 49 compared to the MRHOF.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098497","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：