Pub Date : 2013-12-31DOI: 10.1109/ICON.2013.6781953
Sotharith Tauch, William Liu, R. Pears
Intricate webs of interlinked critical infrastructures such as electrical grid, telecommunication, and transportation are essential for the minimal functioning of contemporary societies and economies. Advances in Information and Communication Technology (ICT) underpin the increasing interconnectivity of these systems which created new vulnerabilities that can be affected by hardware failure, link cut, human error, natural disaster, physical-attacks and cyber-attacks. Failures of a fraction on nodes may possibly lead to failures of the dependent nodes in another network. Therefore, the main objective of this paper is to investigate the cascades phenomena caused by load shedding between two interconnected networks using Bak-Tang-Wiesenfeld sandpile modeling. We have found that, largest avalanche occurred when node degree and/interconnectivity link become dense. In addition, coupled random-regular networks tend to be more robust than the coupled Erdös-Rényi networks. However, coupled randomregular networks are vulnerable to random attack and coupled Erdös-Rényi networks are vulnerable to target attack due to the degree distribution.
{"title":"Cascade effects of load shedding in coupled networks","authors":"Sotharith Tauch, William Liu, R. Pears","doi":"10.1109/ICON.2013.6781953","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781953","url":null,"abstract":"Intricate webs of interlinked critical infrastructures such as electrical grid, telecommunication, and transportation are essential for the minimal functioning of contemporary societies and economies. Advances in Information and Communication Technology (ICT) underpin the increasing interconnectivity of these systems which created new vulnerabilities that can be affected by hardware failure, link cut, human error, natural disaster, physical-attacks and cyber-attacks. Failures of a fraction on nodes may possibly lead to failures of the dependent nodes in another network. Therefore, the main objective of this paper is to investigate the cascades phenomena caused by load shedding between two interconnected networks using Bak-Tang-Wiesenfeld sandpile modeling. We have found that, largest avalanche occurred when node degree and/interconnectivity link become dense. In addition, coupled random-regular networks tend to be more robust than the coupled Erdös-Rényi networks. However, coupled randomregular networks are vulnerable to random attack and coupled Erdös-Rényi networks are vulnerable to target attack due to the degree distribution.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123610754","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 : 2013-12-12DOI: 10.1109/ICON.2013.6781948
Xue Jun Li
This paper presents an analytical method for one to compute the centroid of the overlapping area of two intersecting circles with arbitrary orientation. We also extend the solution to estimate the centroid of the overlapping area of three intersecting circles. Furthermore, based on the analytical solution of centroid computing, we propose a cell-based localization technique, namely Centroid Based Location (CBL) for wireless sensor networks. CBL works by finding the centroid of intersection of any two circles. In particular, we study the effect of power level mismatch among anchors. Simulation results show that CBL can significantly improve the accuracy while reducing the transmission power of anchors.
{"title":"An analytical method for centroid computing and its application in wireless localization","authors":"Xue Jun Li","doi":"10.1109/ICON.2013.6781948","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781948","url":null,"abstract":"This paper presents an analytical method for one to compute the centroid of the overlapping area of two intersecting circles with arbitrary orientation. We also extend the solution to estimate the centroid of the overlapping area of three intersecting circles. Furthermore, based on the analytical solution of centroid computing, we propose a cell-based localization technique, namely Centroid Based Location (CBL) for wireless sensor networks. CBL works by finding the centroid of intersection of any two circles. In particular, we study the effect of power level mismatch among anchors. Simulation results show that CBL can significantly improve the accuracy while reducing the transmission power of anchors.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121322185","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781952
Sahan L. Maldeniya, Ajantha S Atukorale, Wathsala W. Vithanage
Application of network classification can be seen in many domains. These varies from preserving the quality of network to analyzing personal characteristics of network users. However current methods applied for network data classification does not meet the expectations. This is because networks are dynamic which are prone to rapid changes, while methods used for the classification has been either trained using examples or defined using heuristics. World Wide Web itself is a big graph which is made out of number of URLS connecting each other via hyper-links. Hence in this work we have used this graph nature of WWW and applied graph theories to partition the network to classify network data. We have used results obtained by classifying the network traffic using k-means algorithm to evaluate the performance and usability of proposed method.
{"title":"Network data classification using graph partition","authors":"Sahan L. Maldeniya, Ajantha S Atukorale, Wathsala W. Vithanage","doi":"10.1109/ICON.2013.6781952","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781952","url":null,"abstract":"Application of network classification can be seen in many domains. These varies from preserving the quality of network to analyzing personal characteristics of network users. However current methods applied for network data classification does not meet the expectations. This is because networks are dynamic which are prone to rapid changes, while methods used for the classification has been either trained using examples or defined using heuristics. World Wide Web itself is a big graph which is made out of number of URLS connecting each other via hyper-links. Hence in this work we have used this graph nature of WWW and applied graph theories to partition the network to classify network data. We have used results obtained by classifying the network traffic using k-means algorithm to evaluate the performance and usability of proposed method.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123146877","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781967
Renuga Kanagavelu, Bu-Sung Lee, Miguel Rodel Felipe, Le Nguyen The Dat, Lu Mingjie
Data availability is a major challenge faced by today's Data Centers where a large number of high performance servers are organized into racks interconnected by a switching network. Data replication is an effective approach for data protection as redundancy ensures at least one copy of data is available in the event of failures. To achieve low latency and high throughput for data replication operations, the traffic load must be spread out evenly across various paths in a Data Center network to minimize congestion. Recently, software defined networking (SDN) has become an attractive solution which enables us to control traffic forwarding in a desired way to achieve our goal. We develop an SDN-based framework for effective data replication operations. We develop an adaptive routing scheme which routes the flows based on the current network state; specifically it chooses routes based on the current load on the paths. Our scheme monitors link- and path- loads and assigns traffic flows to appropriate paths in an efficient way so as to achieve high throughput. We develop a prototype using OpenFlow-enabled switches and carry out experiments to demonstrate the effectiveness of our proposed scheme.
{"title":"Software defined network based adaptive routing for data replication in Data Centers","authors":"Renuga Kanagavelu, Bu-Sung Lee, Miguel Rodel Felipe, Le Nguyen The Dat, Lu Mingjie","doi":"10.1109/ICON.2013.6781967","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781967","url":null,"abstract":"Data availability is a major challenge faced by today's Data Centers where a large number of high performance servers are organized into racks interconnected by a switching network. Data replication is an effective approach for data protection as redundancy ensures at least one copy of data is available in the event of failures. To achieve low latency and high throughput for data replication operations, the traffic load must be spread out evenly across various paths in a Data Center network to minimize congestion. Recently, software defined networking (SDN) has become an attractive solution which enables us to control traffic forwarding in a desired way to achieve our goal. We develop an SDN-based framework for effective data replication operations. We develop an adaptive routing scheme which routes the flows based on the current network state; specifically it chooses routes based on the current load on the paths. Our scheme monitors link- and path- loads and assigns traffic flows to appropriate paths in an efficient way so as to achieve high throughput. We develop a prototype using OpenFlow-enabled switches and carry out experiments to demonstrate the effectiveness of our proposed scheme.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114902823","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781976
Amirhossein Moravejosharieh, E. T. Yazdi, A. Willig
The channel scarcity phenomenon has recently introduced new challenges in the field of Wireless Body Sensor Networks (WBSNs). Within a WBSN, node's communication is restricted throughout their defined active period. As the number of WBSNs increases, the overlapping active periods are elevated due to inefficient utilization of the spectrum. This consequently results in higher packet loss ratio and eventually performance degradation of the WBSNs entirely. To overcome the aforementioned issue, in this paper, we have proposed a new scheme called “Greedy Channel Utilization” (GCU) scheme in which coordinators compete for slot reservation and attempt to utilize the channel voraciously by pushing other contestants in to sleep mode. To evaluate the performance of our proposed scheme, we compared it with the bare IEEE 802.15.4 Std. in terms of channel utilization percentage, packet loss ratio, sensor's orphan time and energy consumption of sensors and coordinator. Eventually, this study concludes the outperformance of GCU scheme over the blind scheme.
{"title":"Study of resource utilization in IEEE 802.15.4 Wireless Body Sensor Network, Part II: Greedy Channel Utilization","authors":"Amirhossein Moravejosharieh, E. T. Yazdi, A. Willig","doi":"10.1109/ICON.2013.6781976","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781976","url":null,"abstract":"The channel scarcity phenomenon has recently introduced new challenges in the field of Wireless Body Sensor Networks (WBSNs). Within a WBSN, node's communication is restricted throughout their defined active period. As the number of WBSNs increases, the overlapping active periods are elevated due to inefficient utilization of the spectrum. This consequently results in higher packet loss ratio and eventually performance degradation of the WBSNs entirely. To overcome the aforementioned issue, in this paper, we have proposed a new scheme called “Greedy Channel Utilization” (GCU) scheme in which coordinators compete for slot reservation and attempt to utilize the channel voraciously by pushing other contestants in to sleep mode. To evaluate the performance of our proposed scheme, we compared it with the bare IEEE 802.15.4 Std. in terms of channel utilization percentage, packet loss ratio, sensor's orphan time and energy consumption of sensors and coordinator. Eventually, this study concludes the outperformance of GCU scheme over the blind scheme.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121654512","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781993
Zhenjie Deng, Yinlong Liu, L. Qian, Yahui Hu, S. Ci
Concurrent Multipath Transfer (CMT) using multiple paths for simultaneous parallel transmission is a promising technology in next generation mobile networks, especially for bandwidth-hungry services. Due to the multi-homing feature of Stream Control Transmission Protocol (SCTP), researchers proposed to extend it to support CMT in order to distribute packets within the same flow over independent homogeneous paths. However, CMT over heterogeneous paths may cause the packet “reordering” problem in the receiver buffer and deteriorate the data delivery efficiency. To address this issue, we propose an Adaptive Delay-based Packet Splitting Mechanism (ADPSM) for CMT over heterogeneous paths. ADPSM defines an adaptive variable called sliding delay threshold to pick out the candidate set from all heterogeneous paths and distribute new arriving packets to the target path with minimum delay. Simulation results show that ADPSM mechanism is better than original CMT-SCTP with respect to the in-order packets arrival and average throughput, especially in the case of a low receiver buffer size.
{"title":"ADPSM: An Adaptive Delay-based Packet Splitting Mechanism for Concurrent Multipath Transfer over heterogeneous paths","authors":"Zhenjie Deng, Yinlong Liu, L. Qian, Yahui Hu, S. Ci","doi":"10.1109/ICON.2013.6781993","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781993","url":null,"abstract":"Concurrent Multipath Transfer (CMT) using multiple paths for simultaneous parallel transmission is a promising technology in next generation mobile networks, especially for bandwidth-hungry services. Due to the multi-homing feature of Stream Control Transmission Protocol (SCTP), researchers proposed to extend it to support CMT in order to distribute packets within the same flow over independent homogeneous paths. However, CMT over heterogeneous paths may cause the packet “reordering” problem in the receiver buffer and deteriorate the data delivery efficiency. To address this issue, we propose an Adaptive Delay-based Packet Splitting Mechanism (ADPSM) for CMT over heterogeneous paths. ADPSM defines an adaptive variable called sliding delay threshold to pick out the candidate set from all heterogeneous paths and distribute new arriving packets to the target path with minimum delay. Simulation results show that ADPSM mechanism is better than original CMT-SCTP with respect to the in-order packets arrival and average throughput, especially in the case of a low receiver buffer size.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126356783","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781933
S. Ishii, Eiji Kawai, Yoshihiko Kanaumi, Shuichi Saito, Tomoaki Takata, Kazumasa Kobayashi, S. Shimojo
The deployment of wide-area OpenFlow networks is essential for the global research community. Since 2011, we started to operat our wide-area OpenFlow networks as a RISE OpenFlow testbed for researchers and developpers. Through our operation, we got some issues. Especially, we focused on the issue caused by topology between sites. By this issue, we cannot assign user's OpenFlow Switches freely. Also, it may give some constraints to user's experiments. To solve this issue, we design and discuss topology management system called “RISE3.0” using OpenFlow.
{"title":"A study on designing OpenFlow controller RISE 3.0","authors":"S. Ishii, Eiji Kawai, Yoshihiko Kanaumi, Shuichi Saito, Tomoaki Takata, Kazumasa Kobayashi, S. Shimojo","doi":"10.1109/ICON.2013.6781933","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781933","url":null,"abstract":"The deployment of wide-area OpenFlow networks is essential for the global research community. Since 2011, we started to operat our wide-area OpenFlow networks as a RISE OpenFlow testbed for researchers and developpers. Through our operation, we got some issues. Especially, we focused on the issue caused by topology between sites. By this issue, we cannot assign user's OpenFlow Switches freely. Also, it may give some constraints to user's experiments. To solve this issue, we design and discuss topology management system called “RISE3.0” using OpenFlow.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121840075","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781973
Maneenate Puongmanee, T. Sanguankotchakorn
To ensure the performance of Multi-Constrained Path (MCP) problem with respect to Quality of Service (QoS) requirements is NP-complete problem. The algorithm has to find the complete path from source to destination satisfying more than one constraint. This research aims to improve the performance of existing algorithm by assigning the appropriate priority to each link weight component. We use two main concepts which are nonlinear cost function and look-ahead concept in our modified algorithm. In the simulation, we use five different networks with two link-weight scenarios generated randomly from uniform and normal distributions. Then, we compare the results of success ratio (SR) and computational complexity as the performance measure. We found that our algorithm always gives a better performance in terms of SR than H_MCOP, but lesser performance in terms of computational complexity.
{"title":"Multiple constraints QoS routing using priority metrics with control variables","authors":"Maneenate Puongmanee, T. Sanguankotchakorn","doi":"10.1109/ICON.2013.6781973","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781973","url":null,"abstract":"To ensure the performance of Multi-Constrained Path (MCP) problem with respect to Quality of Service (QoS) requirements is NP-complete problem. The algorithm has to find the complete path from source to destination satisfying more than one constraint. This research aims to improve the performance of existing algorithm by assigning the appropriate priority to each link weight component. We use two main concepts which are nonlinear cost function and look-ahead concept in our modified algorithm. In the simulation, we use five different networks with two link-weight scenarios generated randomly from uniform and normal distributions. Then, we compare the results of success ratio (SR) and computational complexity as the performance measure. We found that our algorithm always gives a better performance in terms of SR than H_MCOP, but lesser performance in terms of computational complexity.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128857855","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 : 2013-12-01DOI: 10.1109/ICON.2013.6782000
Xin Zhang, Liru Lu, M. Oodo, H. Harada
Pilot subcarriers are very useful in the measurement of channel indicator such as CINR, frequency offset estimation and channel estimation. They are applied widely in many existing standards such as IEEE 802.11, IEEE 802.16 and IEEE 802.22. In this paper, a set of pilot patten is proposed for a network operating in VHF/UHF band based on 802.16 WiMax design pattern. Rationales behind the choice of the pattern will be explained. Evaluation of the performance for the proposed pilot pattern and the WiMax pilot pattern is carried out with different decoding method under AWGN and under different channel models in the VHF/UHF band. The effects of different pilot symbol insertion schemes on the error performance of OFDM-QPSK are evaluated and a mathematical relationship for calculating the gain shift caused by different pilot symbols occupation rate is derived and discussed.
{"title":"The evaluation of pilot symbol pattern in OFDM system from practical perspective","authors":"Xin Zhang, Liru Lu, M. Oodo, H. Harada","doi":"10.1109/ICON.2013.6782000","DOIUrl":"https://doi.org/10.1109/ICON.2013.6782000","url":null,"abstract":"Pilot subcarriers are very useful in the measurement of channel indicator such as CINR, frequency offset estimation and channel estimation. They are applied widely in many existing standards such as IEEE 802.11, IEEE 802.16 and IEEE 802.22. In this paper, a set of pilot patten is proposed for a network operating in VHF/UHF band based on 802.16 WiMax design pattern. Rationales behind the choice of the pattern will be explained. Evaluation of the performance for the proposed pilot pattern and the WiMax pilot pattern is carried out with different decoding method under AWGN and under different channel models in the VHF/UHF band. The effects of different pilot symbol insertion schemes on the error performance of OFDM-QPSK are evaluated and a mathematical relationship for calculating the gain shift caused by different pilot symbols occupation rate is derived and discussed.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131695081","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781944
Ke Wang, T. Chai, L. Wong
In wireless ad hoc networks, power control has great impact on routing since transmission range is directly determined by a node's transmission power. Higher power can give higher connectivity and shorter path. However, larger transmission range causes more interference to nearby neighbors and may further impair overall network performance. We propose a Q-Learning-based Power-Controlled Routing (QLPCR) protocol which makes use of Q learning techniques for routing and power control to optimize delay performance of the whole network. A Markov chain CSMA/CA delay model is used to estimate delay of each link in order to determine the optimal power level for all possible routing options.
{"title":"A Q-Learning-based Power-Controlled Routing protocol in multihop wireless ad hoc network","authors":"Ke Wang, T. Chai, L. Wong","doi":"10.1109/ICON.2013.6781944","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781944","url":null,"abstract":"In wireless ad hoc networks, power control has great impact on routing since transmission range is directly determined by a node's transmission power. Higher power can give higher connectivity and shorter path. However, larger transmission range causes more interference to nearby neighbors and may further impair overall network performance. We propose a Q-Learning-based Power-Controlled Routing (QLPCR) protocol which makes use of Q learning techniques for routing and power control to optimize delay performance of the whole network. A Markov chain CSMA/CA delay model is used to estimate delay of each link in order to determine the optimal power level for all possible routing options.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115421402","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
扫码关注我们
求助内容：
应助结果提醒方式：