Pub Date : 2011-05-08DOI: 10.1109/CTS.2011.5898934
Fei Li, Lizhi Zhou, Li Liu, Haibo Li
Multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) is considered as candidates for future broadband wireless services. In this paper a novel signal detection scheme based on Grover's quantum search algorithm is proposed for MIMO-OFDM systems. Grover's quantum search algorithm is based on the concept and principles of quantum computing, such as quantum bit, quantum register and quantum parallelism. An analysis is given to the theoretical basis of Grover's algorithm and the performance of Grover's algorithm is evaluated. A novel signal detector based on Grover's algorithm (GD) for MIMO-OFDM system is proposed. The simulation results show that the proposed detector has more powerful properties in bit error rate than MMSE detector and VBLAST-MMSE detector. The performance of the proposed GD detector is close to optimal when the failure probability is 0.001. When the failure probability is 0.00001, the performance of GD detector declines. In this case, our proposed improved Grover's algorithm based detector is still close to the optimal ML detector. The complexity of GD and IGD is O(√N). It's much better than classical ML detector which complexity is O(N).
{"title":"A quantum search based signal detection for MIMO-OFDM systems","authors":"Fei Li, Lizhi Zhou, Li Liu, Haibo Li","doi":"10.1109/CTS.2011.5898934","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898934","url":null,"abstract":"Multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) is considered as candidates for future broadband wireless services. In this paper a novel signal detection scheme based on Grover's quantum search algorithm is proposed for MIMO-OFDM systems. Grover's quantum search algorithm is based on the concept and principles of quantum computing, such as quantum bit, quantum register and quantum parallelism. An analysis is given to the theoretical basis of Grover's algorithm and the performance of Grover's algorithm is evaluated. A novel signal detector based on Grover's algorithm (GD) for MIMO-OFDM system is proposed. The simulation results show that the proposed detector has more powerful properties in bit error rate than MMSE detector and VBLAST-MMSE detector. The performance of the proposed GD detector is close to optimal when the failure probability is 0.001. When the failure probability is 0.00001, the performance of GD detector declines. In this case, our proposed improved Grover's algorithm based detector is still close to the optimal ML detector. The complexity of GD and IGD is O(√N). It's much better than classical ML detector which complexity is O(N).","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130739010","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898907
Xuqi Zhu, Yu Liu, Bin Li, Xun Wang, Wenbo Zhang, Lin Zhang
Compressed Sensing (CS) has developed rapidly as an innovation in signal processing domain. Considering the situation that there are multiple sparse signals with redundancy, the correlation between them need to be properly utilized for further compression. To this end, a CS scheme based on Belief Propagation (BP) algorithm is proposed to compress correlated sparse (compressible) signals in this paper. The BP algorithm is a kind of solution of Bayesian CS by considering CS problem as an analogy of channel coding. Inspired by this, we modify the original BP algorithm by the side information available only at the decoder to obtain better recovery performance with the same sensing rate. The simulation results show that the proposed scheme is superior to the separate BP scheme and the joint L1 scheme for the correlated sparse signals.
{"title":"Compressed sensing of correlated signals using belief propagation","authors":"Xuqi Zhu, Yu Liu, Bin Li, Xun Wang, Wenbo Zhang, Lin Zhang","doi":"10.1109/CTS.2011.5898907","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898907","url":null,"abstract":"Compressed Sensing (CS) has developed rapidly as an innovation in signal processing domain. Considering the situation that there are multiple sparse signals with redundancy, the correlation between them need to be properly utilized for further compression. To this end, a CS scheme based on Belief Propagation (BP) algorithm is proposed to compress correlated sparse (compressible) signals in this paper. The BP algorithm is a kind of solution of Bayesian CS by considering CS problem as an analogy of channel coding. Inspired by this, we modify the original BP algorithm by the side information available only at the decoder to obtain better recovery performance with the same sensing rate. The simulation results show that the proposed scheme is superior to the separate BP scheme and the joint L1 scheme for the correlated sparse signals.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133473438","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898955
Yang Cao, K. Yu, Xiaofei Wu
Nowadays Internet has become a gigantic and ubiquitous medium of all types of information. In such a large-scale and highly dynamic environments, the peer-to-peer (P2P) technologies have been used to distribute, share, and access resources. More and more P2P applications emerge on Internet and become part of our network life. In P2P networks, overlay topology has significant effect on network performance as well as user experience. In this paper, the correlation of P2P overlay structure and quality of experience (QoE) is studied. Based on a large sample of flow data collected from operational network, we construct overlay topologies of four types of P2P application, i.e. BitTorrent, Thunder, UUSee and PPLive. By using complex network theory, structure properties of different P2P applications are analyzed from user's perspective, including reachability, PageRank distribution and connection maintenance capability. Analysis results show the correlation between overlay topology properties and QoE, and can help us better understand the P2P systems and architectures for network optimization and service provision.
{"title":"Analyzing the topology characteristics of P2P overlay networks for QoE evaluation","authors":"Yang Cao, K. Yu, Xiaofei Wu","doi":"10.1109/CTS.2011.5898955","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898955","url":null,"abstract":"Nowadays Internet has become a gigantic and ubiquitous medium of all types of information. In such a large-scale and highly dynamic environments, the peer-to-peer (P2P) technologies have been used to distribute, share, and access resources. More and more P2P applications emerge on Internet and become part of our network life. In P2P networks, overlay topology has significant effect on network performance as well as user experience. In this paper, the correlation of P2P overlay structure and quality of experience (QoE) is studied. Based on a large sample of flow data collected from operational network, we construct overlay topologies of four types of P2P application, i.e. BitTorrent, Thunder, UUSee and PPLive. By using complex network theory, structure properties of different P2P applications are analyzed from user's perspective, including reachability, PageRank distribution and connection maintenance capability. Analysis results show the correlation between overlay topology properties and QoE, and can help us better understand the P2P systems and architectures for network optimization and service provision.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122064658","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898974
Yu Chen, I. Darwazeh
The IEEE 802.16 is a series of telecommunication standards that provides Broadband Wireless Access (BWA) services and has received great attention worldwide. The IEEE 802.16j emerged as a standard in the middle of 2009, specifying the procedure of supporting Mobile Multi-hop Relay (MMR) networks. The use of the “multi-hop” architectures not only requires a re-design of the functional implementations of both physical and link layers, because the topology in such networks is fundamentally different from that of single hop, but also necessitates further investigation of other “non-functional” properties, such as end-to-end packet delay performance, which is one of the Quality of Service (QoS) metrics and is considered to be critical for the future success of multi-hop network deployment. In this paper we report the development of a new Matlab/Simulink cross-layer simulation platform for integration on top of the IEEE 802.16 PHY standard model, and will use Effective Capacity (EC) multi-hop model [1] to evaluate and analyse the multi-hop end-to-end link-layer packet delay performance. We report simulation results for three-hop scenarios under different traffic load conditions and verify the efficacy of our newly developed model through comparisons to analytically derived models.
{"title":"End-to-end delay performance analysis in IEEE 802.16j Mobile Multi-hop Relay (MMR) networks","authors":"Yu Chen, I. Darwazeh","doi":"10.1109/CTS.2011.5898974","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898974","url":null,"abstract":"The IEEE 802.16 is a series of telecommunication standards that provides Broadband Wireless Access (BWA) services and has received great attention worldwide. The IEEE 802.16j emerged as a standard in the middle of 2009, specifying the procedure of supporting Mobile Multi-hop Relay (MMR) networks. The use of the “multi-hop” architectures not only requires a re-design of the functional implementations of both physical and link layers, because the topology in such networks is fundamentally different from that of single hop, but also necessitates further investigation of other “non-functional” properties, such as end-to-end packet delay performance, which is one of the Quality of Service (QoS) metrics and is considered to be critical for the future success of multi-hop network deployment. In this paper we report the development of a new Matlab/Simulink cross-layer simulation platform for integration on top of the IEEE 802.16 PHY standard model, and will use Effective Capacity (EC) multi-hop model [1] to evaluate and analyse the multi-hop end-to-end link-layer packet delay performance. We report simulation results for three-hop scenarios under different traffic load conditions and verify the efficacy of our newly developed model through comparisons to analytically derived models.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114702881","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898954
R. Radeke, Stefan Türk, R. Lehnert
Many localization algorithms require that at least some nodes in a network know their correct real position. Anchor-free localization algorithms manage to assign to all nodes virtual coordinates (VC) without knowledge of real location information. This is mostly done by node cooperation. These algorithms provide VCs for the usage of geographic routing in environments where real coordinate localization is impossible due to cost, time, energy, space or line of sight restrictions. This paper proposes improvements in generating VCs for wireless ad-hoc networks without location information. We present algorithms for improving the preparatory phase, which is used to obtain initial VCs as well as for the working phase, which adapts to network changes and node movement. Using simulations for different node densities and network sizes, we compare different approaches and show which algorithms outperform others.
{"title":"Optimization of 2d virtual node coordinates in anchor-free localization algorithms for geographic routing in ad-hoc networks","authors":"R. Radeke, Stefan Türk, R. Lehnert","doi":"10.1109/CTS.2011.5898954","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898954","url":null,"abstract":"Many localization algorithms require that at least some nodes in a network know their correct real position. Anchor-free localization algorithms manage to assign to all nodes virtual coordinates (VC) without knowledge of real location information. This is mostly done by node cooperation. These algorithms provide VCs for the usage of geographic routing in environments where real coordinate localization is impossible due to cost, time, energy, space or line of sight restrictions. This paper proposes improvements in generating VCs for wireless ad-hoc networks without location information. We present algorithms for improving the preparatory phase, which is used to obtain initial VCs as well as for the working phase, which adapts to network changes and node movement. Using simulations for different node densities and network sizes, we compare different approaches and show which algorithms outperform others.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129773211","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898915
N. Pantazis, Apostolos Pantazis, S. Nikolidakis, D. Vergados
This paper provides a performance evaluation of the existing S-MAC protocol in combination with energy efficient protocols that are used in Wireless Sensor Networks. The whole work is mainly concentrated on the study, analysis and performance evaluation of the existing S-MAC protocol. We have concentrated on improving the power consumption of the S-MAC protocol, by using the OLSR routing protocol. The improvement of the S-MAC protocol can increase sensor nodes' lifetime and thus, network connectivity and survivability. The evaluation and test results show that the combination of S-MAC protocol with OLSR consumes less power compared to the rest of the schemes using the routing protocols AODV, DSR and DSDV.
{"title":"A performance evaluation of S-MAC protocol in combination with energy efficient protocols for Wireless Sensor Networks","authors":"N. Pantazis, Apostolos Pantazis, S. Nikolidakis, D. Vergados","doi":"10.1109/CTS.2011.5898915","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898915","url":null,"abstract":"This paper provides a performance evaluation of the existing S-MAC protocol in combination with energy efficient protocols that are used in Wireless Sensor Networks. The whole work is mainly concentrated on the study, analysis and performance evaluation of the existing S-MAC protocol. We have concentrated on improving the power consumption of the S-MAC protocol, by using the OLSR routing protocol. The improvement of the S-MAC protocol can increase sensor nodes' lifetime and thus, network connectivity and survivability. The evaluation and test results show that the combination of S-MAC protocol with OLSR consumes less power compared to the rest of the schemes using the routing protocols AODV, DSR and DSDV.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125595391","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898983
Feichi Long, Tiejun Lv, Hui Gao, Pengfei Chang
A novel approach based on Dezert-Smarandache Theory (DSmT) is proposed for scheduling in opportunistic beamforming (OBF) systems. By jointly optimizing among system throughput, fairness and time delay of each user, the proposed algorithm can achieve larger system throughput and lower average time delay with approximately the same fairness and acceptable complexity, as compared with the proportional fair scheduler (PFS). Furthermore, unlike the case in PFS, the parameter used for tradeoff between system throughput and fairness is valid for various practical settings, since the weight that each user accounts for in the base station's (BS) choice can be appropriately calculated in DSmT's framework. Simulation results verify that the proposed algorithm outperforms PFS and other conventional scheduling algorithms in terms of the four proposed indexes.
{"title":"DSmT based scheduling algorithm in opportunistic beamforming systems","authors":"Feichi Long, Tiejun Lv, Hui Gao, Pengfei Chang","doi":"10.1109/CTS.2011.5898983","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898983","url":null,"abstract":"A novel approach based on Dezert-Smarandache Theory (DSmT) is proposed for scheduling in opportunistic beamforming (OBF) systems. By jointly optimizing among system throughput, fairness and time delay of each user, the proposed algorithm can achieve larger system throughput and lower average time delay with approximately the same fairness and acceptable complexity, as compared with the proportional fair scheduler (PFS). Furthermore, unlike the case in PFS, the parameter used for tradeoff between system throughput and fairness is valid for various practical settings, since the weight that each user accounts for in the base station's (BS) choice can be appropriately calculated in DSmT's framework. Simulation results verify that the proposed algorithm outperforms PFS and other conventional scheduling algorithms in terms of the four proposed indexes.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132849811","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898975
Yumei Wang, Bin Li, Qing Huang, Hao Cheng
Recently, distributed video coding (DVC) has become a hot research topic, as its low complexity encoder and high complixty decoder can suit for many emerging applications. However, the practical performance gap between DVC and traditional video coding is still large and need more research about it. In this paper, we propose to exploit the capabilities of side information (SI) extraction, online estimation of correlation noise model (CNM) parameters and joint bitplane decoding to construct an integrated and improved DVC framework for better system performance. The SI extraction along with online CNM parameters estimation is exploited to help decoding, and the joint bitplane decoding that we propose in this paper is used to reduce the transmission rate for the same PSNR performance. The experimental results show that the proposed DVC architecture could work efficiently and improve the PSNR performance by 2–3db for the test sequence.
{"title":"An improved framework of distributed video codec","authors":"Yumei Wang, Bin Li, Qing Huang, Hao Cheng","doi":"10.1109/CTS.2011.5898975","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898975","url":null,"abstract":"Recently, distributed video coding (DVC) has become a hot research topic, as its low complexity encoder and high complixty decoder can suit for many emerging applications. However, the practical performance gap between DVC and traditional video coding is still large and need more research about it. In this paper, we propose to exploit the capabilities of side information (SI) extraction, online estimation of correlation noise model (CNM) parameters and joint bitplane decoding to construct an integrated and improved DVC framework for better system performance. The SI extraction along with online CNM parameters estimation is exploited to help decoding, and the joint bitplane decoding that we propose in this paper is used to reduce the transmission rate for the same PSNR performance. The experimental results show that the proposed DVC architecture could work efficiently and improve the PSNR performance by 2–3db for the test sequence.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"23 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133865476","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898943
Farhan H. Mirani, Mahmoud Kherraz, N. Boukhatem
Use of multi-homing has became important in order to provide customers with better communication experience. This has been made possible with widespread use of mobile and wireless technology and its capacity to support many network interfaces simultaneously. Connection-oriented transport layer protocols ensure in-order delivery of data during transmission. However multipath transfers cause out-of-order data at receiver side which leads to higher re-ordering costs and data retransmissions. In this paper we present a transport layer implementation for a data scheduling mechanism, which offers to exploit multi-homing for parallel transfer of data. We implement our mechanism using a Linux-Kernel based version of Stream Control Transport Protocol (SCTP) as our testbed and prove that our mechanism significantly improves communication performance.
{"title":"Forward prediction scheduling: Implementation and performance evaluation","authors":"Farhan H. Mirani, Mahmoud Kherraz, N. Boukhatem","doi":"10.1109/CTS.2011.5898943","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898943","url":null,"abstract":"Use of multi-homing has became important in order to provide customers with better communication experience. This has been made possible with widespread use of mobile and wireless technology and its capacity to support many network interfaces simultaneously. Connection-oriented transport layer protocols ensure in-order delivery of data during transmission. However multipath transfers cause out-of-order data at receiver side which leads to higher re-ordering costs and data retransmissions. In this paper we present a transport layer implementation for a data scheduling mechanism, which offers to exploit multi-homing for parallel transfer of data. We implement our mechanism using a Linux-Kernel based version of Stream Control Transport Protocol (SCTP) as our testbed and prove that our mechanism significantly improves communication performance.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"53 4-5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134363359","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 : 2011-05-08DOI: 10.1109/CTS.2011.5898912
Charalambos Sergiou, V. Vassiliou
As Wireless Sensor Networks are evolving to applications where high load demands dominate and performance becomes a crucial factor, congestion remains a serious problem that has to be effectively and efficiently tackled. Congestion in WSNs is mitigated either by reducing the data load or by increasing capacity (employing sleep nodes). In either case due to the energy constraints and low processing capabilities of sensor nodes, congestion control and avoidance algorithms has to be kept as simple and efficient as possible while overhead must be limited. In this paper we propose a novel and simple Dynamic Alternative Path Selection Scheme (DAlPaS) attempting to face congestion by increasing capacity while attempts to maintain performance requirements. DAlPaS can efficiently and adaptively choose an alternative routing path in order to avoid congested nodes, by taking into consideration a number of critical parameters that affect the performance of a WSN while maintaining overhead in minimal levels. Simulation results show that DAlPaS algorithm can perform significant performance achievements over comparable schemes.
{"title":"DAlPaS: A performance aware congestion control algorithm in Wireless Sensor Networks","authors":"Charalambos Sergiou, V. Vassiliou","doi":"10.1109/CTS.2011.5898912","DOIUrl":"https://doi.org/10.1109/CTS.2011.5898912","url":null,"abstract":"As Wireless Sensor Networks are evolving to applications where high load demands dominate and performance becomes a crucial factor, congestion remains a serious problem that has to be effectively and efficiently tackled. Congestion in WSNs is mitigated either by reducing the data load or by increasing capacity (employing sleep nodes). In either case due to the energy constraints and low processing capabilities of sensor nodes, congestion control and avoidance algorithms has to be kept as simple and efficient as possible while overhead must be limited. In this paper we propose a novel and simple Dynamic Alternative Path Selection Scheme (DAlPaS) attempting to face congestion by increasing capacity while attempts to maintain performance requirements. DAlPaS can efficiently and adaptively choose an alternative routing path in order to avoid congested nodes, by taking into consideration a number of critical parameters that affect the performance of a WSN while maintaining overhead in minimal levels. Simulation results show that DAlPaS algorithm can perform significant performance achievements over comparable schemes.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133126426","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
扫码关注我们
求助内容：
应助结果提醒方式：