Using the Wireless Sensor Networks WSNs in a wide variety of applications is currently considered one of the most challenging solutions. For instance, this technology has evolved the agriculture field, with the precision agriculture challenge. In fact, the cost of sensors and communication infrastructure continuously trend down as long as the technological advances. So, more growers dare to implement WSN for their crops. This technology has drawn substantial interests by improving agriculture productivity. The idea consists of deploying a number of sensors in a given agricultural parcel in order to monitor the land and crop conditions. These readings help the farmer to make the right inputs at the right moment. In this paper, we propose a complete solution for gathering different type of data from variable fields of a large agricultural parcel. In fact, with the in-field variability, adopting a unique data gathering solution for all kinds of fields reveals an inconvenient approach. Besides, as a fault-tolerant application, precision agriculture does not require a high precision value of sensed data. So, our approach deals with a context aware data gathering strategy. In other words, depending on a defined context for the monitored field, the data collector will decide the data gathering strategy to follow. We prove that this approach improves considerably the lifetime of the application.
{"title":"Context Aware Wireless Sensor Network Suitable for Precision Agriculture","authors":"Nour Brinis, L. Saidane","doi":"10.4236/WSN.2016.81001","DOIUrl":"https://doi.org/10.4236/WSN.2016.81001","url":null,"abstract":"Using the Wireless Sensor Networks WSNs in a wide variety of applications is currently considered one of the most challenging solutions. For instance, this technology has evolved the agriculture field, with the precision agriculture challenge. In fact, the cost of sensors and communication infrastructure continuously trend down as long as the technological advances. So, more growers dare to implement WSN for their crops. This technology has drawn substantial interests by improving agriculture productivity. The idea consists of deploying a number of sensors in a given agricultural parcel in order to monitor the land and crop conditions. These readings help the farmer to make the right inputs at the right moment. In this paper, we propose a complete solution for gathering different type of data from variable fields of a large agricultural parcel. In fact, with the in-field variability, adopting a unique data gathering solution for all kinds of fields reveals an inconvenient approach. Besides, as a fault-tolerant application, precision agriculture does not require a high precision value of sensed data. So, our approach deals with a context aware data gathering strategy. In other words, depending on a defined context for the monitored field, the data collector will decide the data gathering strategy to follow. We prove that this approach improves considerably the lifetime of the application.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70902686","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}
The trade-off between users’ fairness and network throughput may be unacceptable in a multi-rate 802.11 WLAN environment. In this paper, we will design a new intuitive simplified mathematical model called simplified coefficient of variation (SCV) to closely reflect our topic. Through controlling the power of Access Points, SCV can optimize and improve the performance. Since our topic is a NP-hard problem, we use Ant Colony Algorithm to solve our model in a practical scenario. The simulation shows excellent results indicating that our model is efficient and superior to an existing method. Also we use software SAS to further reveal the relationships among the three indicators to illustrate the essence of our approach and an existing algorithm.
{"title":"Enhancing Performance of Multi-Rate WLANs: Ant Colony Approach","authors":"Q. Ma, A. Al-Dhelaan, Mznah Al-Rodhaan","doi":"10.4236/WSN.2015.712014","DOIUrl":"https://doi.org/10.4236/WSN.2015.712014","url":null,"abstract":"The trade-off between users’ fairness and network throughput may be unacceptable in a multi-rate 802.11 WLAN environment. In this paper, we will design a new intuitive simplified mathematical model called simplified coefficient of variation (SCV) to closely reflect our topic. Through controlling the power of Access Points, SCV can optimize and improve the performance. Since our topic is a NP-hard problem, we use Ant Colony Algorithm to solve our model in a practical scenario. The simulation shows excellent results indicating that our model is efficient and superior to an existing method. Also we use software SAS to further reveal the relationships among the three indicators to illustrate the essence of our approach and an existing algorithm.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70902107","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}
Congestion in Wireless Sensor Network (WSN) is an issue of concern for several researchers in recent years. The key challenge is to develop an algorithmic rule which may realize the optimased route on the idea of parameters like residual energy, range of retransmissions and the distance between source and destination. The Firefly Algorithmic rule is implemented in this paper that relies on the attractiveness issue of the firefly insect to control congestion in WSN at transport layer. The results additionally show that the projected approach is best as compared to Congestion Detection and Avoidance (CODA) and Particle Swarm Optimization (PSO) on network lifetime and throughput of the network.
{"title":"Congestion Control in Wireless Sensor Networks Based on Bioluminescent Firefly Behavior","authors":"M. S. Manshahia, M. Dave, S. Singh","doi":"10.4236/WSN.2015.712013","DOIUrl":"https://doi.org/10.4236/WSN.2015.712013","url":null,"abstract":"Congestion in Wireless Sensor Network (WSN) is an issue of concern for several researchers in recent years. The key challenge is to develop an algorithmic rule which may realize the optimased route on the idea of parameters like residual energy, range of retransmissions and the distance between source and destination. The Firefly Algorithmic rule is implemented in this paper that relies on the attractiveness issue of the firefly insect to control congestion in WSN at transport layer. The results additionally show that the projected approach is best as compared to Congestion Detection and Avoidance (CODA) and Particle Swarm Optimization (PSO) on network lifetime and throughput of the network.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70901696","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}
Mobile wireless sensor network (MWSN) has the features of self-organization, multiple-hop and limited energy resources. It is vulnerable to a wide set of security attacks, including those targeting the routing protocol functionality. In this paper, the existing security problems and solutions in MWSN are summarized, and then a trust management system based on neighbor monitoring is proposed. In the trust management system, the trust value is calculated by the neighbor monitoring mechanism, and the direct trust value and the indirect trust value are combined to establish the distributed trust model to detect the malicious nodes. The consistency check algorithm is capable of defending against the attacks on the trust model. In addition, because of the limited energy of the sensor nodes, the energy-balanced algorithm is introduced to prolong the lifespan of MWSN. The residual energy and energy density are considered in the routing decision. Finally, the simulation experiments show that the proposed algorithm can detect the malicious nodes effectively and achieve the energy-balanced goal to prolong the lifespan of MWSN.
{"title":"A Secure and Energy-Balanced Routing Scheme for Mobile Wireless Sensor Network","authors":"Beishui Liu, Yuanming Wu","doi":"10.4236/WSN.2015.711012","DOIUrl":"https://doi.org/10.4236/WSN.2015.711012","url":null,"abstract":"Mobile wireless sensor network (MWSN) has the features of self-organization, multiple-hop and limited energy resources. It is vulnerable to a wide set of security attacks, including those targeting the routing protocol functionality. In this paper, the existing security problems and solutions in MWSN are summarized, and then a trust management system based on neighbor monitoring is proposed. In the trust management system, the trust value is calculated by the neighbor monitoring mechanism, and the direct trust value and the indirect trust value are combined to establish the distributed trust model to detect the malicious nodes. The consistency check algorithm is capable of defending against the attacks on the trust model. In addition, because of the limited energy of the sensor nodes, the energy-balanced algorithm is introduced to prolong the lifespan of MWSN. The residual energy and energy density are considered in the routing decision. Finally, the simulation experiments show that the proposed algorithm can detect the malicious nodes effectively and achieve the energy-balanced goal to prolong the lifespan of MWSN.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70901725","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}
Satellite communication plays a vital role in the arena of telecommunication. The main objective of this manuscript is to examine the threats and problems like space debris, space weather and space weapons that could damage or disable the satellite system. In consequence, we discuss the role of wireless sensor networks (WSN) and nodes in space based technologies. The scope of this paper is to minimize the threats and vulnerabilities to the satellite systems and based on that, design the next generation and state of the art satellite communication system. We proposed the solutions for the vulnerabilities and surveillance of satellite system by integrating the energy efficient and cost effective WSN to the satellite system.
{"title":"Energy Efficient WSN-SAT System for Surveillance of Satellites","authors":"Hafiz Bilal Khalil, N. Abas, S. Rauf","doi":"10.4236/WSN.2015.710011","DOIUrl":"https://doi.org/10.4236/WSN.2015.710011","url":null,"abstract":"Satellite communication plays a vital role in the arena of telecommunication. The main objective of this manuscript is to examine the threats and problems like space debris, space weather and space weapons that could damage or disable the satellite system. In consequence, we discuss the role of wireless sensor networks (WSN) and nodes in space based technologies. The scope of this paper is to minimize the threats and vulnerabilities to the satellite systems and based on that, design the next generation and state of the art satellite communication system. We proposed the solutions for the vulnerabilities and surveillance of satellite system by integrating the energy efficient and cost effective WSN to the satellite system.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70901671","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}
Pocket switched Network (PSN) is an emerging research magnet that has been attracting researchers. This paper provides an introduction to PSN and covers some of its basic features and challenges. Continuous connectivity is difficult in infrastructure independent communication. In this paper, we will see how PSN provides an effective alternative. We also explain some routing protocols that can be incorporated for effective data forwarding. This paper also discusses possible applications and areas where PSN can be effectively used and some ideas that may foster future research in PSN routing.
{"title":"Survey on Routing in Pocket Switched Network","authors":"R. R. Sarkar, Khadija Rasul, Amitabha Chakrabarty","doi":"10.4236/WSN.2015.79010","DOIUrl":"https://doi.org/10.4236/WSN.2015.79010","url":null,"abstract":"Pocket switched Network (PSN) is an emerging research magnet that has been attracting researchers. This paper provides an introduction to PSN and covers some of its basic features and challenges. Continuous connectivity is difficult in infrastructure independent communication. In this paper, we will see how PSN provides an effective alternative. We also explain some routing protocols that can be incorporated for effective data forwarding. This paper also discusses possible applications and areas where PSN can be effectively used and some ideas that may foster future research in PSN routing.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70902641","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}
The advances in recent technology have lead to the development of wireless sensor nodes forming a wireless network, which over the years is used from military application to industry, household, medical etc. The deployment pattern of sensor nodes in Wireless Sensor Network (WSN) is always random for most of the applications. Such technique will lead to ineffective utilization of the network; for example fewer nodes are located at far distance and dense nodes are located at some reason and part of the region may be without the surveillance of any node, where the networks do consume additional energy or even may not transfer the data. The proposed work is intended to develop the optimized network by effective placement of nodes in circular and grid pattern, which we call as uniformity of nodes to be compared with random placement of nodes. Each of the nodes is in optimized positions at uniform distance with neighbors, followed by running a energy efficient routing algorithm that saves an additional energy further to provide connectivity management by connecting all the nodes. Simulation results are compared with the random placement of nodes, the residual energy of a network, lifetime of a network, energy consumption of a network shows a definite improvement for uniform network as that of with the random network.
{"title":"Multiple Node Placement Strategy for Efficient Routing in Wireless Sensor Networks","authors":"K. Y. Bendigeri, J. Mallapur","doi":"10.4236/WSN.2015.78009","DOIUrl":"https://doi.org/10.4236/WSN.2015.78009","url":null,"abstract":"The advances in recent technology have lead to the development of wireless sensor nodes forming a wireless network, which over the years is used from military application to industry, household, medical etc. The deployment pattern of sensor nodes in Wireless Sensor Network (WSN) is always random for most of the applications. Such technique will lead to ineffective utilization of the network; for example fewer nodes are located at far distance and dense nodes are located at some reason and part of the region may be without the surveillance of any node, where the networks do consume additional energy or even may not transfer the data. The proposed work is intended to develop the optimized network by effective placement of nodes in circular and grid pattern, which we call as uniformity of nodes to be compared with random placement of nodes. Each of the nodes is in optimized positions at uniform distance with neighbors, followed by running a energy efficient routing algorithm that saves an additional energy further to provide connectivity management by connecting all the nodes. Simulation results are compared with the random placement of nodes, the residual energy of a network, lifetime of a network, energy consumption of a network shows a definite improvement for uniform network as that of with the random network.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70901979","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}
In this paper, we propose a packet-interleaving scheme (PIS) for increasing packet reliability under burst errors in wireless sensor networks (WSN). In a WSN, packet errors could occur due to weak signal strength or interference. These erroneous packets have to be retransmitted, which will increase network load substantially. The proposed PIS, encoding data using Reed-Solomon (RS) codes, can classify data into two different types: high-reliability-required (HRR) data and non-HRR data. An HRR packet is encoded with a short RS symbol, while a non-HRR packet with a long RS symbol. When an HRR and a non-HRR packet arrive at a sensor, they are interleaved on a symbol-by-symbol basis. Thus, the effect of burst errors (BE) is dispersed and consequently the uncorrectable HRR packets can be reduced. For the purpose of evaluation, two models, the uniform bit-error model (UBEM) and the on-off bit-error model (OBEM), are built to analyze the packet uncorrectable probability. In the evaluation, we first change the lengths of BE, then we vary the shift positions in a BE period, and finally we increase the number of correctable symbols to observe the superiority of the proposed PIS in reducing packet uncorrectable probability.
{"title":"A Packet-Interleaving Scheme Using RS Code for Burst Errors in Wireless Sensor Networks","authors":"T. Sheu, Yen-Hsi Kuo, Zi-Tsan Chou","doi":"10.4236/WSN.2015.77008","DOIUrl":"https://doi.org/10.4236/WSN.2015.77008","url":null,"abstract":"In this paper, we propose a packet-interleaving scheme (PIS) for increasing packet reliability under burst errors in wireless sensor networks (WSN). In a WSN, packet errors could occur due to weak signal strength or interference. These erroneous packets have to be retransmitted, which will increase network load substantially. The proposed PIS, encoding data using Reed-Solomon (RS) codes, can classify data into two different types: high-reliability-required (HRR) data and non-HRR data. An HRR packet is encoded with a short RS symbol, while a non-HRR packet with a long RS symbol. When an HRR and a non-HRR packet arrive at a sensor, they are interleaved on a symbol-by-symbol basis. Thus, the effect of burst errors (BE) is dispersed and consequently the uncorrectable HRR packets can be reduced. For the purpose of evaluation, two models, the uniform bit-error model (UBEM) and the on-off bit-error model (OBEM), are built to analyze the packet uncorrectable probability. In the evaluation, we first change the lengths of BE, then we vary the shift positions in a BE period, and finally we increase the number of correctable symbols to observe the superiority of the proposed PIS in reducing packet uncorrectable probability.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70901906","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}
Fawaz Alassery, Walid K. M. Ahmed, M. Sarraf, V. Lawrence
Collision detection mechanisms in Wireless Sensor Networks (WSNs) have largely been revolving around direct demodulation and decoding of received packets and deciding on a collision based on some form of a frame error detection mechanism, such as a CRC check. The obvious drawback of full detection of a received packet is the need to expend a significant amount of energy and processing complexity in order to fully decode a packet, only to discover the packet is illegible due to a collision. In this paper, we propose a suite of novel, yet simple and power-efficient algorithms to detect a collision without the need for full-decoding of the received packet. Our novel algorithms aim at detecting collision through fast examination of the signal statistics of a short snippet of the received packet via a relatively small number of computations over a small number of received IQ samples. Hence, the proposed algorithms operate directly at the output of the receiver's analog-to-digital converter and eliminate the need to pass the signal through the entire. In addition, we present a complexity and power-saving comparison between our novel algorithms and conventional full-decoding (for select coding schemes) to demonstrate the significant power and complexity saving advantage of our algorithms.
{"title":"A Novel Low-Complexity Low-Latency Power Efficient Collision Detection Algorithm for Wireless Sensor Networks","authors":"Fawaz Alassery, Walid K. M. Ahmed, M. Sarraf, V. Lawrence","doi":"10.4236/WSN.2015.76006","DOIUrl":"https://doi.org/10.4236/WSN.2015.76006","url":null,"abstract":"Collision detection mechanisms in Wireless Sensor Networks (WSNs) have largely been revolving around direct demodulation and decoding of received packets and deciding on a collision based on some form of a frame error detection mechanism, such as a CRC check. The obvious drawback of full detection of a received packet is the need to expend a significant amount of energy and processing complexity in order to fully decode a packet, only to discover the packet is illegible due to a collision. In this paper, we propose a suite of novel, yet simple and power-efficient algorithms to detect a collision without the need for full-decoding of the received packet. Our novel algorithms aim at detecting collision through fast examination of the signal statistics of a short snippet of the received packet via a relatively small number of computations over a small number of received IQ samples. Hence, the proposed algorithms operate directly at the output of the receiver's analog-to-digital converter and eliminate the need to pass the signal through the entire. In addition, we present a complexity and power-saving comparison between our novel algorithms and conventional full-decoding (for select coding schemes) to demonstrate the significant power and complexity saving advantage of our algorithms.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70902336","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}
This paper presents a free market economy model that can be used to facilitate fully distributed autonomous control of resources in massive heterogeneous wireless sensor networks (WSNs). In the future, it is expected that WSNs will exist as part of the global Internet of Things (IoT), and different WSNs can work together in a massive network of heterogeneous WSNs in order to solve common problems. Control of valuable processing, sensing and communication resources, determining which nodes will remain awake during specific time periods in order to provide sensing services, and determining which nodes will forward other nodes’ packets are difficult problems that must be dealt with. It is proposed that just as the free market economy model enables the global human society to function reasonably well when individuals simply attempt to trade money and services in order to maximize their individual profits, and a similar model and mechanism should enable a massive network of heterogeneous WSNs to function well in a fully distributed autonomous manner. The main contributions of this paper are the introduction of the free market economy model for use with WSNs, the formal definition of a maximum profit price problem for multihop packet relaying, and the proposal of a distributed genetic algorithm for the solution of the maximum profit price problem. Simulation results show that the proposed distributed solution produces results that are 70% - 80% similar to a pareto optimal solution for this problem.
{"title":"A Free Market Economy Model for Resource Management in Wireless Sensor Networks","authors":"Byeong-il Bae, Jun-Y. Park, Sunggu Lee","doi":"10.4236/WSN.2015.76007","DOIUrl":"https://doi.org/10.4236/WSN.2015.76007","url":null,"abstract":"This paper presents a free market economy model that can be used to facilitate fully distributed autonomous control of resources in massive heterogeneous wireless sensor networks (WSNs). In the future, it is expected that WSNs will exist as part of the global Internet of Things (IoT), and different WSNs can work together in a massive network of heterogeneous WSNs in order to solve common problems. Control of valuable processing, sensing and communication resources, determining which nodes will remain awake during specific time periods in order to provide sensing services, and determining which nodes will forward other nodes’ packets are difficult problems that must be dealt with. It is proposed that just as the free market economy model enables the global human society to function reasonably well when individuals simply attempt to trade money and services in order to maximize their individual profits, and a similar model and mechanism should enable a massive network of heterogeneous WSNs to function well in a fully distributed autonomous manner. The main contributions of this paper are the introduction of the free market economy model for use with WSNs, the formal definition of a maximum profit price problem for multihop packet relaying, and the proposal of a distributed genetic algorithm for the solution of the maximum profit price problem. Simulation results show that the proposed distributed solution produces results that are 70% - 80% similar to a pareto optimal solution for this problem.","PeriodicalId":58712,"journal":{"name":"无线传感网络(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70902277","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
扫码关注我们
求助内容：
应助结果提醒方式：