Pub Date : 2010-08-01DOI: 10.4108/CHINACOM.2010.159
D. Zhang, Xiaoming Tao, Youzheng Wang, Jianhua Lu
The fundamental limit of wireless communication is the tradeoff between efficiency and reliability. In order to improve system efficiency and reliability simultaneously, we have to create and explore new degrees of freedom. Multi-domain collaboration can be regarded as a systematic approach to solve this issue. From a broader and higher perspective, multi-domain is utilized to create the degrees of freedom, and collaboration is adopted to exploit the benefit of new degrees of freedom. In this paper, we illustrate this essential idea with three scenarios of link, multiuser and network. To provide an overview of the core idea of of multi-domain collaboration, we also summarize some of our recent works under the general framework from a new perspective of degrees of freedom.
{"title":"Multi-domain collaboration: Create and exploit the degrees of freedom in wireless communication","authors":"D. Zhang, Xiaoming Tao, Youzheng Wang, Jianhua Lu","doi":"10.4108/CHINACOM.2010.159","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.159","url":null,"abstract":"The fundamental limit of wireless communication is the tradeoff between efficiency and reliability. In order to improve system efficiency and reliability simultaneously, we have to create and explore new degrees of freedom. Multi-domain collaboration can be regarded as a systematic approach to solve this issue. From a broader and higher perspective, multi-domain is utilized to create the degrees of freedom, and collaboration is adopted to exploit the benefit of new degrees of freedom. In this paper, we illustrate this essential idea with three scenarios of link, multiuser and network. To provide an overview of the core idea of of multi-domain collaboration, we also summarize some of our recent works under the general framework from a new perspective of degrees of freedom.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133461818","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.135
Shenli Zhang, Bin Chen, Linghao Cheng, Zhaohui Li, Chao Lu, Hui Wang
In current optical coherent communication systems, balanced photo-detectors are typically employed, which preserve the product of the received optical signals and the local oscillators (LO) for detection but cancel out the power of both. Since only the product of the received optical signals and the LO is used to estimate the transmitted complex symbol, such detection scheme is suboptimal due to the loss of some useful information embedded in the transmitted signal power. Different from that, this paper proposes a new detection scheme which maintains full information obtained from the photo-detectors. Specifically, we first extract the transmitted signal power from the output of the photo-detector. After that, we use not only the product of the signals and the LO but also the power of signals to estimate the target signals. For 16-qudrature-amplitude-modulation (16-QAM) and 64-QAM signals, the simulation results show that our new scheme can outperform the conventional ones by more than 1 dB.
{"title":"Enhancing the coherent detection of optical QAM signals by exploiting the information of received optical power","authors":"Shenli Zhang, Bin Chen, Linghao Cheng, Zhaohui Li, Chao Lu, Hui Wang","doi":"10.4108/CHINACOM.2010.135","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.135","url":null,"abstract":"In current optical coherent communication systems, balanced photo-detectors are typically employed, which preserve the product of the received optical signals and the local oscillators (LO) for detection but cancel out the power of both. Since only the product of the received optical signals and the LO is used to estimate the transmitted complex symbol, such detection scheme is suboptimal due to the loss of some useful information embedded in the transmitted signal power. Different from that, this paper proposes a new detection scheme which maintains full information obtained from the photo-detectors. Specifically, we first extract the transmitted signal power from the output of the photo-detector. After that, we use not only the product of the signals and the LO but also the power of signals to estimate the target signals. For 16-qudrature-amplitude-modulation (16-QAM) and 64-QAM signals, the simulation results show that our new scheme can outperform the conventional ones by more than 1 dB.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117167986","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.63
T. Hanselmann, Yu Zhang, M. Morelande, Mohd Ifran Md Nor, J. J. Tan, Xingshe Zhou, Yee Wei Law
A centralized self-localization algorithm is used to estimate sensor locations. From the known positions of at least 3 anchor nodes the remaining sensor positions are estimated using an efficient particle filter (PF) with progressive correction. The measurement model is a simple two-parameter log-normal shadowing model, where the parameters are estimated concurrently. Experiments using Crossbow Imote2 motes show that an error of less than 16% is achievable in an indoor environment. The results demonstrate that by using PF with progressive correction, a small number of measurements and a simple signal propagation model are sufficient to give low localization errors.
{"title":"Self-localization in wireless sensor networks using particle filtering with progressive correction","authors":"T. Hanselmann, Yu Zhang, M. Morelande, Mohd Ifran Md Nor, J. J. Tan, Xingshe Zhou, Yee Wei Law","doi":"10.4108/CHINACOM.2010.63","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.63","url":null,"abstract":"A centralized self-localization algorithm is used to estimate sensor locations. From the known positions of at least 3 anchor nodes the remaining sensor positions are estimated using an efficient particle filter (PF) with progressive correction. The measurement model is a simple two-parameter log-normal shadowing model, where the parameters are estimated concurrently. Experiments using Crossbow Imote2 motes show that an error of less than 16% is achievable in an indoor environment. The results demonstrate that by using PF with progressive correction, a small number of measurements and a simple signal propagation model are sufficient to give low localization errors.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116678032","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.137
Weigang Hou, Lei Guo, Xingwei Wang
In recent years, as the increasing effect of greenhouse and extremely consumption of worldwide energy, port-cost and energy-consumption savings are becoming a dual of new objectives of further developing an optical network. Using hybrid technology to replace Optical-Electrical-Optical (OEO) fabric with an all optical (OOO) one to save more consumed energy and using hierarchical technology to aggregate several wavelengths into wavebands to perform port-cost savings is an attractive solution for next-generation optical networks. In this paper, we jointly consider port-cost and energy-consumption in hybrid hierarchical optical network and develop efficient approaches ranging from Integer Linear Programming (ILP) models to heuristics. Simulation results of two heuristic approaches show that, the cost of Transmitting Ports (TPs) used in OOO switch is contrary to the energy consumed by OEO part of hybrid hierarchical Optical Cross Connect (OXC) node, and it is necessary to make a new design to obtain satisfactory trade-off performance.
{"title":"Energy efficient algorithm with considering port-cost in hybrid hierarchical optical networks","authors":"Weigang Hou, Lei Guo, Xingwei Wang","doi":"10.4108/CHINACOM.2010.137","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.137","url":null,"abstract":"In recent years, as the increasing effect of greenhouse and extremely consumption of worldwide energy, port-cost and energy-consumption savings are becoming a dual of new objectives of further developing an optical network. Using hybrid technology to replace Optical-Electrical-Optical (OEO) fabric with an all optical (OOO) one to save more consumed energy and using hierarchical technology to aggregate several wavelengths into wavebands to perform port-cost savings is an attractive solution for next-generation optical networks. In this paper, we jointly consider port-cost and energy-consumption in hybrid hierarchical optical network and develop efficient approaches ranging from Integer Linear Programming (ILP) models to heuristics. Simulation results of two heuristic approaches show that, the cost of Transmitting Ports (TPs) used in OOO switch is contrary to the energy consumed by OEO part of hybrid hierarchical Optical Cross Connect (OXC) node, and it is necessary to make a new design to obtain satisfactory trade-off performance.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115246210","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.72
Hui Ji, Ju Liu, Dapeng Zhang, Guowei Zhang, Yuxi Liu
Unitary space-time modulation (USTM) is ideally suited for rapid fading scenarios, where neither the transmitter nor the receiver have the channel state information (CSI). However, it has received limited attention compared with the space-time coding schemes that need CSI. An important reason for that is USTM needs too large calculation amount when meeting with a large size constellation. We propose a size-reduced method for unitary space-time constellations in the sight of interleaving. Resorting to the UST (Unitary Space-Time) symbol-wise interleaving, we give a pseudo-random fading effect to the transmitted signals for the receiver to meet the channel requirement in theory. Simulation results show that compared with existing almost unachievable schemes, our method can greatly reduce the complexity of calculation only with a slight penalty in theory.
{"title":"Construction of Unitary Space-Time constellations in the interleaving sight","authors":"Hui Ji, Ju Liu, Dapeng Zhang, Guowei Zhang, Yuxi Liu","doi":"10.4108/CHINACOM.2010.72","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.72","url":null,"abstract":"Unitary space-time modulation (USTM) is ideally suited for rapid fading scenarios, where neither the transmitter nor the receiver have the channel state information (CSI). However, it has received limited attention compared with the space-time coding schemes that need CSI. An important reason for that is USTM needs too large calculation amount when meeting with a large size constellation. We propose a size-reduced method for unitary space-time constellations in the sight of interleaving. Resorting to the UST (Unitary Space-Time) symbol-wise interleaving, we give a pseudo-random fading effect to the transmitted signals for the receiver to meet the channel requirement in theory. Simulation results show that compared with existing almost unachievable schemes, our method can greatly reduce the complexity of calculation only with a slight penalty in theory.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116757442","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.110
Jian Li, Xiaoqiang Ji, Xue Liu, Jianguo Yao, S. Gopalakrishnan, F. Hu
We address the issue of supporting real-time message dissemination in a publish/subscribe system. The asynchronous operation and connection brokering approach embodied in the publish/subscribe paradigm aid scalability and support varied topologies. These advantages, however, create challenges for providing predictable performance for real-time applications. We propose an efficient design for message queuing and forwarding by brokers in a publish/subscribe system. We differentiate messages by topics and not just be publishers or subscribers. Our real-time publish/subscribe design is analogous to the design of packet routers for high-speed networks. We manage input and output message queues per-client and per-topic. This approach facilitates a multiple-input multiple-output architecture and provides performance isolation for different topics. This approach differs from conventional system architectures that either use first-in first-out ordering of messages or employ per-client (not per-topic) prioritization. Our framework can provide deterministic upper bounds on delay for periodic and general (σ; ρ)-bounded real-time message flow in a publish/subscribe system with low overhead.
{"title":"Topic-based resource allocation for real-time publish/subscribe communication systems","authors":"Jian Li, Xiaoqiang Ji, Xue Liu, Jianguo Yao, S. Gopalakrishnan, F. Hu","doi":"10.4108/CHINACOM.2010.110","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.110","url":null,"abstract":"We address the issue of supporting real-time message dissemination in a publish/subscribe system. The asynchronous operation and connection brokering approach embodied in the publish/subscribe paradigm aid scalability and support varied topologies. These advantages, however, create challenges for providing predictable performance for real-time applications. We propose an efficient design for message queuing and forwarding by brokers in a publish/subscribe system. We differentiate messages by topics and not just be publishers or subscribers. Our real-time publish/subscribe design is analogous to the design of packet routers for high-speed networks. We manage input and output message queues per-client and per-topic. This approach facilitates a multiple-input multiple-output architecture and provides performance isolation for different topics. This approach differs from conventional system architectures that either use first-in first-out ordering of messages or employ per-client (not per-topic) prioritization. Our framework can provide deterministic upper bounds on delay for periodic and general (σ; ρ)-bounded real-time message flow in a publish/subscribe system with low overhead.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115042555","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}
Iterative probabilistic decoding of binary low-density parity-check (LDPC) codes have been studied extensively. Non-binary LDPC codes have recently attracted an increasing attention. Most of the existing non-binary codes are built over GF(2q), and decoding methods developed for binary LDPC codes cannot be used directly with multilevel modulations. In this paper, we first extend the binary parity-check codes to the case with multiple symbols over modular arithmetic. Then, we develop a sum-product algorithm to decode this new type of codes at the symbol level. Finally, we propose an effective constellation mapping method for multilevel modulations. Error performances of this type of codes with 4-PAM, 4-PSK, and 16-PSK modulations over AWGN channels are provided. Compared with uncoded systems, the coding gain of a medium-size regular LDPC code of rate 8/9 with 4-PAM and 4-PSK modulations is about 5 dB. With 16-PSK and an appropriate constellation mapping at a code rate 3/4, the proposed code's performance is comparable to that of trellis codes.
{"title":"Iterative symbol-by-symbol decoding of LDPC codes and constellation mapping for multilevel modulation","authors":"Hongtao Jiang, Zhongfeng Wang, Huaping Liu","doi":"10.4108/CHINACOM.2010.7","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.7","url":null,"abstract":"Iterative probabilistic decoding of binary low-density parity-check (LDPC) codes have been studied extensively. Non-binary LDPC codes have recently attracted an increasing attention. Most of the existing non-binary codes are built over GF(2q), and decoding methods developed for binary LDPC codes cannot be used directly with multilevel modulations. In this paper, we first extend the binary parity-check codes to the case with multiple symbols over modular arithmetic. Then, we develop a sum-product algorithm to decode this new type of codes at the symbol level. Finally, we propose an effective constellation mapping method for multilevel modulations. Error performances of this type of codes with 4-PAM, 4-PSK, and 16-PSK modulations over AWGN channels are provided. Compared with uncoded systems, the coding gain of a medium-size regular LDPC code of rate 8/9 with 4-PAM and 4-PSK modulations is about 5 dB. With 16-PSK and an appropriate constellation mapping at a code rate 3/4, the proposed code's performance is comparable to that of trellis codes.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123242362","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.20
Jie Zhao, Stephen Culver, M. Gidlund
Ultra-wideband (UWB) communication is currently considered as a key technology of the next generation wireless personal area network (WPAN) and wireless local area network (WLAN). UWB operation do not require a spectrum license but UWB devices are required to share spectrum with licensed narrow band users. This paper presents a novel system for direct sequence (DS) UWB and the proposed dynamic bandwidth direct sequence (DBDS) system focuses on exploring a new idea rather than concentrating on impulse manipulation, provides a cognitive solution for DS-based UWB in a much simpler and more efficient way. The proposed system is able to transfer data under a fraction of original spread spectrum signal bandwidth and different spectral shapes while maintaining the same data rate. The system does not require generating specific impulse for working environment, therefore significantly reduces the system complexity. Simulation results demonstrate that the DBDS has a very exciting performance. Even received with different bandwidths and different spectral shapes, the data information can still be fully recovered at the same data rate.
{"title":"Performance of UWB communication based on dynamic bandwidth direct sequence","authors":"Jie Zhao, Stephen Culver, M. Gidlund","doi":"10.4108/CHINACOM.2010.20","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.20","url":null,"abstract":"Ultra-wideband (UWB) communication is currently considered as a key technology of the next generation wireless personal area network (WPAN) and wireless local area network (WLAN). UWB operation do not require a spectrum license but UWB devices are required to share spectrum with licensed narrow band users. This paper presents a novel system for direct sequence (DS) UWB and the proposed dynamic bandwidth direct sequence (DBDS) system focuses on exploring a new idea rather than concentrating on impulse manipulation, provides a cognitive solution for DS-based UWB in a much simpler and more efficient way. The proposed system is able to transfer data under a fraction of original spread spectrum signal bandwidth and different spectral shapes while maintaining the same data rate. The system does not require generating specific impulse for working environment, therefore significantly reduces the system complexity. Simulation results demonstrate that the DBDS has a very exciting performance. Even received with different bandwidths and different spectral shapes, the data information can still be fully recovered at the same data rate.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123333259","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.48
Zhixiong Liang, Xingcheng Liu
Many applications of Wireless Sensor Networks (WSNs) require sensor nodes know their positions. Equipping GPS modules can solve this problem easily, but it is of high cost. In this paper, we propose a centralized localization algorithm for WSN based on mesh relaxation method. Computer simulations show that with our algorithm the positions of nodes can be estimated in a relative coordinate system, which can be transformed to the global coordinate system with the aid of a few anchor nodes. The proposed algorithm can avoid folds and flips through firstly stretching the mesh of the network by pulling some fringe nodes towards different directions, and then making the mesh to shrink by relaxing it. The position results achieved have higher precision than those with other positioning methods. Our algorithm can be used based on ranging or connectivity.
{"title":"A centralized localization algorithm based on mesh relaxation in Wireless Sensor Networks","authors":"Zhixiong Liang, Xingcheng Liu","doi":"10.4108/CHINACOM.2010.48","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.48","url":null,"abstract":"Many applications of Wireless Sensor Networks (WSNs) require sensor nodes know their positions. Equipping GPS modules can solve this problem easily, but it is of high cost. In this paper, we propose a centralized localization algorithm for WSN based on mesh relaxation method. Computer simulations show that with our algorithm the positions of nodes can be estimated in a relative coordinate system, which can be transformed to the global coordinate system with the aid of a few anchor nodes. The proposed algorithm can avoid folds and flips through firstly stretching the mesh of the network by pulling some fringe nodes towards different directions, and then making the mesh to shrink by relaxing it. The position results achieved have higher precision than those with other positioning methods. Our algorithm can be used based on ranging or connectivity.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123934608","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.24
Yun Li, Zhun Wang, X. You, Qilie Liu, M. Daneshmand
Reliable transmission in Intermittently Connected Mobile Networks (ICMNs) is a challenging work because the effective and reliable connection between the source and destination can not be sustained in ICMNs. To reliably hand over data to the destination, many dissemination-based routing protocols are proposed. Dissemination-based routing protocols assure nodes including intermediate nodes and destinations have more chances to receive packets, which will increase the probability that the packets can be correctly received by the destination. However, the existing error recovery mechanisms in network layer use the simple CRC to check the data packets independently, and discard the error packets even if one correct packet can be obtained from more than one partly error packet. In this paper, we propose a novel Network layer Error Recovery method based on FEC, named NER. NER divides a data packet into RS blocks and insert redundancy to each block. So the intermediate nodes and destinations can recover a correct data packet from multiple partially error copies of the same packet. The simulation results show that NER can obviously increase the delivery-ratio in ICMNs.
{"title":"Error recovery based on FEC in network-layer for Intermittently Connected Mobile Networks","authors":"Yun Li, Zhun Wang, X. You, Qilie Liu, M. Daneshmand","doi":"10.4108/CHINACOM.2010.24","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.24","url":null,"abstract":"Reliable transmission in Intermittently Connected Mobile Networks (ICMNs) is a challenging work because the effective and reliable connection between the source and destination can not be sustained in ICMNs. To reliably hand over data to the destination, many dissemination-based routing protocols are proposed. Dissemination-based routing protocols assure nodes including intermediate nodes and destinations have more chances to receive packets, which will increase the probability that the packets can be correctly received by the destination. However, the existing error recovery mechanisms in network layer use the simple CRC to check the data packets independently, and discard the error packets even if one correct packet can be obtained from more than one partly error packet. In this paper, we propose a novel Network layer Error Recovery method based on FEC, named NER. NER divides a data packet into RS blocks and insert redundancy to each block. So the intermediate nodes and destinations can recover a correct data packet from multiple partially error copies of the same packet. The simulation results show that NER can obviously increase the delivery-ratio in ICMNs.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129771780","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
扫码关注我们
求助内容：
应助结果提醒方式：