Laura García, L. Parra, J. M. Jiménez, Jaime Lloret, P. Lorenz
Due to environmental problems, such as the lack of water for irrigation, each day it becomes more necessary to control crops. Therefore, the use of precision agriculture becomes more evident. When it comes to making decisions on crops, it is evident the need to apply the concept of Smart Agriculture, that focuses on utilizing different sensors and actuators. As the number of IoT devices used in agriculture grows exponentially, it is necessary to design the implemented network so that the data is transmitted without problems. The present work shows a wireless network design, in which we use the information collected by the sensors of a Wireless Sensor Network (WSN), and a Wireless Mesh Network (WMN) formed by Access Points (AP) to transmit the data to a network that monitors agriculture for smart irrigation. In addition, through simulations we have presented a proposal of the maximum number of nodes that must be connected to an AP so that the network is efficient.
{"title":"Practical Design of a WSN to Monitor the Crop and its Irrigation System","authors":"Laura García, L. Parra, J. M. Jiménez, Jaime Lloret, P. Lorenz","doi":"10.5296/npa.v10i4.14147","DOIUrl":"https://doi.org/10.5296/npa.v10i4.14147","url":null,"abstract":"Due to environmental problems, such as the lack of water for irrigation, each day it becomes more necessary to control crops. Therefore, the use of precision agriculture becomes more evident. When it comes to making decisions on crops, it is evident the need to apply the concept of Smart Agriculture, that focuses on utilizing different sensors and actuators. As the number of IoT devices used in agriculture grows exponentially, it is necessary to design the implemented network so that the data is transmitted without problems. The present work shows a wireless network design, in which we use the information collected by the sensors of a Wireless Sensor Network (WSN), and a Wireless Mesh Network (WMN) formed by Access Points (AP) to transmit the data to a network that monitors agriculture for smart irrigation. In addition, through simulations we have presented a proposal of the maximum number of nodes that must be connected to an AP so that the network is efficient.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127085623","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}
Software-Defined Networking (SDN) is a new networking strategy designed to overcome issues experienced in traditional IP network e.g. high level of complexity and inability to adaptively respond to newly arisen Quality of Service (QoS) requirements in a timely fashion. In SDN, control plane and data plane are decoupled which justifies the need to have a central controller to receive the application requirements (e.g. Quality of Service requirements) and implements a set of network policies on the data plane to eventually satisfy the requirements of the application. Implementing a proper set of policies on data plane can be quite a challenging task. In many cases implementing a set of policies in order to satisfy the requirements of an application negates requirements of other applications. In this paper, a simulation study is conducted to evaluate the performance of a QoS policy (i.e. reserving bandwidth) on a specific type of multimedia traffic (e.g. video, audio and data) and its influences on other types of multimedia traffic. The outcome of the simulation study has motivated the authors to conduct a mathematical analysis on the sensitivity of network applications over all possible combination of network policies to eventually implement a proper set of policies that imposes minimum destructive impact on other network applications or services.
{"title":"Performance Analysis of Quality of Service in Software-Defined Networking","authors":"A. Moravejosharieh, Jaime Lloret","doi":"10.5296/npa.v10i4.14054","DOIUrl":"https://doi.org/10.5296/npa.v10i4.14054","url":null,"abstract":"Software-Defined Networking (SDN) is a new networking strategy designed to overcome issues experienced in traditional IP network e.g. high level of complexity and inability to adaptively respond to newly arisen Quality of Service (QoS) requirements in a timely fashion. In SDN, control plane and data plane are decoupled which justifies the need to have a central controller to receive the application requirements (e.g. Quality of Service requirements) and implements a set of network policies on the data plane to eventually satisfy the requirements of the application. Implementing a proper set of policies on data plane can be quite a challenging task. In many cases implementing a set of policies in order to satisfy the requirements of an application negates requirements of other applications. In this paper, a simulation study is conducted to evaluate the performance of a QoS policy (i.e. reserving bandwidth) on a specific type of multimedia traffic (e.g. video, audio and data) and its influences on other types of multimedia traffic. The outcome of the simulation study has motivated the authors to conduct a mathematical analysis on the sensitivity of network applications over all possible combination of network policies to eventually implement a proper set of policies that imposes minimum destructive impact on other network applications or services.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126359346","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}
Touhami Achouak, Benahmed Khelifa, Laura García, L. Parra, Jaime Lloret, Bounaama Fateh
The south of Algeria has a very hard climate. In summer, it is very hot and dry with a very violent sand wind and in winter very cold and dry, from where several plants cannot be cultivated in an open field. With rapid population growth, the production of fruits and vegetables cannot be sufficient. To solve these two major problems, we propose in this paper a new mechanism for the control of the climate inside a greenhouse. The objective of this work is to propose a new design for the greenhouse that can be managed and controlled automatically. The management and the control of this greenhouse are done because of our new proposed algorithms, and the use of new technologies such as sensors, actuators, microcontrollers, and the Internet of things to facilitate the tasks of farmers in the south of Algeria, and to improve the productiveness of the agriculture. We present the results of applying our proposal in a greenhouse during a short period of time and the changes on the environmental parameters inside the greenhouse.
{"title":"Sensor Network Proposal for Greenhouse Automation placed at the South of Algeria","authors":"Touhami Achouak, Benahmed Khelifa, Laura García, L. Parra, Jaime Lloret, Bounaama Fateh","doi":"10.5296/npa.v10i4.14155","DOIUrl":"https://doi.org/10.5296/npa.v10i4.14155","url":null,"abstract":"The south of Algeria has a very hard climate. In summer, it is very hot and dry with a very violent sand wind and in winter very cold and dry, from where several plants cannot be cultivated in an open field. With rapid population growth, the production of fruits and vegetables cannot be sufficient. To solve these two major problems, we propose in this paper a new mechanism for the control of the climate inside a greenhouse. The objective of this work is to propose a new design for the greenhouse that can be managed and controlled automatically. The management and the control of this greenhouse are done because of our new proposed algorithms, and the use of new technologies such as sensors, actuators, microcontrollers, and the Internet of things to facilitate the tasks of farmers in the south of Algeria, and to improve the productiveness of the agriculture. We present the results of applying our proposal in a greenhouse during a short period of time and the changes on the environmental parameters inside the greenhouse.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125054145","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}
Wireless sensor networks are increasingly being deployed in areas where several types of information need to be harvested. Monitoring a given area is one of the main goals of this technology. This consists in deploying sensor nodes in the Area of Interest (AoI) in order to detect any event occurring in this area, collect information and send them to the base station. However, in this type of configuration, the quantity and the quality of data collected are important factors in making better decisions by the end user. It therefore becomes crucial to deploy sensors in the AoI so that the latters can cover as much as possible the AoI, and propose mechanism to collect and send data to the base station while minimizing the energy consumption of the sensors. In this paper, we bring into focus a solution (A2CDC) to resolve this problem which performs in two main stages: in the first stage, we propose an algorithm that guarantees a maximal coverage of the AoI after a random deployment of static sensors and mobile sensors; and in the second stage, we propose a node activity scheduling that minimizes energy consumption of both static and mobile nodes while sending collected data to the base station. Compared to many other algorithms in the literature, our solution is better in term of coverage percentage of the AoI, data received by the base station and in term of energy minimization.
{"title":"A2CDC: Area Coverage, Connectivity and Data Collection in Wireless Sensor Networks","authors":"A. Bomgni, G. B. J. Mdemaya","doi":"10.5296/npa.v10i4.13977","DOIUrl":"https://doi.org/10.5296/npa.v10i4.13977","url":null,"abstract":"Wireless sensor networks are increasingly being deployed in areas where several types of information need to be harvested. Monitoring a given area is one of the main goals of this technology. This consists in deploying sensor nodes in the Area of Interest (AoI) in order to detect any event occurring in this area, collect information and send them to the base station. However, in this type of configuration, the quantity and the quality of data collected are important factors in making better decisions by the end user. It therefore becomes crucial to deploy sensors in the AoI so that the latters can cover as much as possible the AoI, and propose mechanism to collect and send data to the base station while minimizing the energy consumption of the sensors. In this paper, we bring into focus a solution (A2CDC) to resolve this problem which performs in two main stages: in the first stage, we propose an algorithm that guarantees a maximal coverage of the AoI after a random deployment of static sensors and mobile sensors; and in the second stage, we propose a node activity scheduling that minimizes energy consumption of both static and mobile nodes while sending collected data to the base station. Compared to many other algorithms in the literature, our solution is better in term of coverage percentage of the AoI, data received by the base station and in term of energy minimization.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133166806","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}
L. Parra, J. Marin, P. V. Mauri, Jaime Lloret, Virginia Torices, Alberto Massager
The monitoring of different parameters in the smart garden environment requires thousands of nodes and actuators. They form a multi-hop communication network. The scatternets formed with Bluetooth protocol is a communication solution. However, there is no current algorithm that considers the different capabilities of the devices (sensors or actuators) and assigns a role according to these capabilities. In this paper, we present a network topology formation algorithm for role assignment and connection establishment which considers the capabilities of the devices and use slave-slave Bridge to communicate the piconets. We design the algorithms needed for this protocol and test it. We have simulated the algorithms in order to evaluate the time needed for role assignment and to establish the first connections of the piconet. The results include different scenarios composed by one or two masters and one to seven slaves. In addition, we evaluate the established connections in piconets and bridges in a real case of the smart garden sensor network. Finally, we present the changes in the piconet connections after the deployment of two nodes in an existing network.
{"title":"Scatternet Formation Protocol for Environmental Monitoring in a Smart Garden","authors":"L. Parra, J. Marin, P. V. Mauri, Jaime Lloret, Virginia Torices, Alberto Massager","doi":"10.5296/npa.v10i3.14122","DOIUrl":"https://doi.org/10.5296/npa.v10i3.14122","url":null,"abstract":"The monitoring of different parameters in the smart garden environment requires thousands of nodes and actuators. They form a multi-hop communication network. The scatternets formed with Bluetooth protocol is a communication solution. However, there is no current algorithm that considers the different capabilities of the devices (sensors or actuators) and assigns a role according to these capabilities. In this paper, we present a network topology formation algorithm for role assignment and connection establishment which considers the capabilities of the devices and use slave-slave Bridge to communicate the piconets. We design the algorithms needed for this protocol and test it. We have simulated the algorithms in order to evaluate the time needed for role assignment and to establish the first connections of the piconet. The results include different scenarios composed by one or two masters and one to seven slaves. In addition, we evaluate the established connections in piconets and bridges in a real case of the smart garden sensor network. Finally, we present the changes in the piconet connections after the deployment of two nodes in an existing network.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129671456","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}
Optical Burst Switching networks are considered as an important candidate for the future transport networks. Many analysis models of OBS node with FDLs have been proposed recently. In this paper, we propose a novel retrial queueing model at OBS core node architecture SPL - feed-forward. Blocking probability will be calculated based on Markov multi-dimensional models. Numerical solution values from the proposed analysis method are compared with simulation, as well as between these models.
{"title":"A Retrial Queueing model with FDL at OBS core node","authors":"Chuong Dang Thanh, D. Pham, Thang Doan Van","doi":"10.5296/npa.v10i3.13431","DOIUrl":"https://doi.org/10.5296/npa.v10i3.13431","url":null,"abstract":"Optical Burst Switching networks are considered as an important candidate for the future transport networks. Many analysis models of OBS node with FDLs have been proposed recently. In this paper, we propose a novel retrial queueing model at OBS core node architecture SPL - feed-forward. Blocking probability will be calculated based on Markov multi-dimensional models. Numerical solution values from the proposed analysis method are compared with simulation, as well as between these models.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134294865","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}
S. Sendra, Ana Isabel Túnez-Murcia, Jaime Lloret, J. M. Jiménez
Currently, most of remote education systems use video streaming as the main basis to support teaching. These emissions can be seen in devices with different hardware features such as personal computers, tablets or smartphones through networks with different capacities. The use of different web browsers and coding options can also influence the network performance. Therefore, the quality of the video displayed may be different. This work presents a practical study to establish the best combination of web browsers and containers to encode multimedia files for videos streaming in personal computers running Windows 7 and Windows 10 operating systems. For this, a video encoded with different codecs and compressed with different containers have been transmitted through a 1000BaseT network. Finally, the results are analyzed and compared to determine which would be the most efficient combination of parameters according to the resolution of the transmitted video.
{"title":"Network Performance in HTML5 Video Connections","authors":"S. Sendra, Ana Isabel Túnez-Murcia, Jaime Lloret, J. M. Jiménez","doi":"10.5296/npa.v10i3.13933","DOIUrl":"https://doi.org/10.5296/npa.v10i3.13933","url":null,"abstract":"Currently, most of remote education systems use video streaming as the main basis to support teaching. These emissions can be seen in devices with different hardware features such as personal computers, tablets or smartphones through networks with different capacities. The use of different web browsers and coding options can also influence the network performance. Therefore, the quality of the video displayed may be different. This work presents a practical study to establish the best combination of web browsers and containers to encode multimedia files for videos streaming in personal computers running Windows 7 and Windows 10 operating systems. For this, a video encoded with different codecs and compressed with different containers have been transmitted through a 1000BaseT network. Finally, the results are analyzed and compared to determine which would be the most efficient combination of parameters according to the resolution of the transmitted video.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115097976","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}
A large scale of spectrum sensing techniques are proposed to improve the use of spectrum resources. However, the EE (energy efficiency) should be guaranteed for both primary and secondary users, especially under various detection performance constraints. In this regard, the linking between activities of PU (primary user) and dynamic access behaviors of SUs (secondary users) should be considered in an integrated way. This survey has compared different existing scenarios and frameworks on EE optimizations. The principal objective is to enhance the system throughput and to coordinate on the physical layer of both PU and SUs, in order to enable a high-quality spectrum detection and a more efficient spectrum access. In the technical part, several optimization methods are introduced under PU’s constraints, and different methods based on game theory are applied to suitable cooperative sensing scenarios for SUs’ optimal access. Finally, the complexity of algorithms is compared, to further reduce the execution time and deploy real-time adaptation for users with lower delay.
{"title":"A Survey of EE Optimization Methods for Primary and Secondary Users in Cognitive Radio Networks","authors":"Tian Yang, M. Esseghir, L. Khoukhi","doi":"10.5296/npa.v10i3.13807","DOIUrl":"https://doi.org/10.5296/npa.v10i3.13807","url":null,"abstract":"A large scale of spectrum sensing techniques are proposed to improve the use of spectrum resources. However, the EE (energy efficiency) should be guaranteed for both primary and secondary users, especially under various detection performance constraints. In this regard, the linking between activities of PU (primary user) and dynamic access behaviors of SUs (secondary users) should be considered in an integrated way. This survey has compared different existing scenarios and frameworks on EE optimizations. The principal objective is to enhance the system throughput and to coordinate on the physical layer of both PU and SUs, in order to enable a high-quality spectrum detection and a more efficient spectrum access. In the technical part, several optimization methods are introduced under PU’s constraints, and different methods based on game theory are applied to suitable cooperative sensing scenarios for SUs’ optimal access. Finally, the complexity of algorithms is compared, to further reduce the execution time and deploy real-time adaptation for users with lower delay.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133135232","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}
Amir Abdelkader Aouiz, Sofiane Boukli-Hacene, P. Lorenz, Marc Gilg
Mobile ad hoc network presents generally several challenges such as high dynamic topology, packet loss and frequent routes discovering that result in low throughput and reduced packet delivery ratio. To reduce the number of route discovering process, multipath routing protocols makes use of alternate paths to continue packets transmission. Ad Hoc On-demand, multipath distance vector routing protocol or AOMDV, is one of the well-known multipath protocols that relays on the hop count metric to route packets. However maintaining disjoint active routes can reduce nodes life time and lead to more control messages like error and discovering packets. In this paper, a pre-emptive approach is proposed based on the historical values of nodes energy. Nodes that excessively consume energy in time are considered overloaded and are excluded from route discovering, hence nodes with reduced energy variation are selected to route packets. Simulation results show reduced number of dead nodes by 30 %, overhead by 16%.
{"title":"Network Life Time maximization of the AOMDV Protocol Using Nodes Energy Variation","authors":"Amir Abdelkader Aouiz, Sofiane Boukli-Hacene, P. Lorenz, Marc Gilg","doi":"10.5296/npa.v10i2.13322","DOIUrl":"https://doi.org/10.5296/npa.v10i2.13322","url":null,"abstract":"Mobile ad hoc network presents generally several challenges such as high dynamic topology, packet loss and frequent routes discovering that result in low throughput and reduced packet delivery ratio. To reduce the number of route discovering process, multipath routing protocols makes use of alternate paths to continue packets transmission. Ad Hoc On-demand, multipath distance vector routing protocol or AOMDV, is one of the well-known multipath protocols that relays on the hop count metric to route packets. However maintaining disjoint active routes can reduce nodes life time and lead to more control messages like error and discovering packets. In this paper, a pre-emptive approach is proposed based on the historical values of nodes energy. Nodes that excessively consume energy in time are considered overloaded and are excluded from route discovering, hence nodes with reduced energy variation are selected to route packets. Simulation results show reduced number of dead nodes by 30 %, overhead by 16%.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116515035","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}
Cristina Lopez-Pavon, S. Sendra, J. Valenzuela-Valdés
Wireless sensor networks are a technology in full evolution with great future and a huge quantity of applications. This document lists some of the limitations existing in WSN networks. In addition, several existing techniques are collected to maximize the network's lifetime, demonstrating that efficient use of energy is very important to achieve this goal. Due to the importance of knowing the behaviour of this type of network before its launch, a comparative is established for the options offered by the WSN network simulators available in the market, compared to those offered by CupCarbon. The objective of this project is the evaluation of the CupCarbon simulator through the implementation of an algorithm that aims to maximize the life time of the network, as well as collecting the results offered by this algorithm. In this way, a Dijkstra routing algorithm is developed whose selection of routes depends on the battery level contained in the nodes that constitute the network. This algorithm is referred as dynamic Dijkstra in the present document. To achieve the objectives described, we pretend to simulate the dynamic Dijkstra in CupCarbon, for this aim, the source code is modified, since it is a free code tool. As a result, it is possible to create the original Dijkstra, but certain problems are presented, to develop the part that depends on the energy, related to the functionalities offered by CupCarbon. As an alternative to determine the results associated to the created algorithm, theoretical analyses are accomplished. Consequently, it is concluded that the evaluation of CupCarbon is not satisfactory enough, while the algorithm created maximizes the network's lifetime.
{"title":"Evaluation of CupCarbon Network Simulator for Wireless Sensor Networks","authors":"Cristina Lopez-Pavon, S. Sendra, J. Valenzuela-Valdés","doi":"10.5296/npa.v10i2.13201","DOIUrl":"https://doi.org/10.5296/npa.v10i2.13201","url":null,"abstract":"Wireless sensor networks are a technology in full evolution with great future and a huge quantity of applications. This document lists some of the limitations existing in WSN networks. In addition, several existing techniques are collected to maximize the network's lifetime, demonstrating that efficient use of energy is very important to achieve this goal. Due to the importance of knowing the behaviour of this type of network before its launch, a comparative is established for the options offered by the WSN network simulators available in the market, compared to those offered by CupCarbon. The objective of this project is the evaluation of the CupCarbon simulator through the implementation of an algorithm that aims to maximize the life time of the network, as well as collecting the results offered by this algorithm. In this way, a Dijkstra routing algorithm is developed whose selection of routes depends on the battery level contained in the nodes that constitute the network. This algorithm is referred as dynamic Dijkstra in the present document. To achieve the objectives described, we pretend to simulate the dynamic Dijkstra in CupCarbon, for this aim, the source code is modified, since it is a free code tool. As a result, it is possible to create the original Dijkstra, but certain problems are presented, to develop the part that depends on the energy, related to the functionalities offered by CupCarbon. As an alternative to determine the results associated to the created algorithm, theoretical analyses are accomplished. Consequently, it is concluded that the evaluation of CupCarbon is not satisfactory enough, while the algorithm created maximizes the network's lifetime.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125474866","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
扫码关注我们
求助内容：
应助结果提醒方式：