Pub Date : 2017-02-01DOI: 10.1016/S1005-8885(17)60190-0
Gao Na , Han Xiaoguang , Chen Zengqiang , Zhang Qing
The reachability problem of synchronizing transitions bounded Petri net systems (BPNSs) is investigated in this paper by constructing a mathematical model for dynamics of BPNS. Using the semi-tensor product (STP) of matrices, the dynamics of BPNSs, which can be viewed as a combination of several small bounded subnets via synchronizing transitions, are described by an algebraic equation. When the algebraic form for its dynamics is established, we can present a necessary and sufficient condition for the reachability between any marking (or state) and initial marking. Also, we give a corresponding algorithm to calculate all of the transition paths between initial marking and any target marking. Finally, an example is shown to illustrate proposed results. The key advantage of our approach, in which the set of reachable markings of BPNSs can be expressed by the set of reachable markings of subnets such that the big reachability set of BPNSs do not need generate, is partly avoid the state explosion problem of Petri nets (PNs).
{"title":"Modeling and reachability analysis of synchronizing transitions bounded Petri net systems based upon semi-tensor product of matrices","authors":"Gao Na , Han Xiaoguang , Chen Zengqiang , Zhang Qing","doi":"10.1016/S1005-8885(17)60190-0","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60190-0","url":null,"abstract":"<div><p>The reachability problem of synchronizing transitions bounded Petri net systems (BPNSs) is investigated in this paper by constructing a mathematical model for dynamics of BPNS. Using the semi-tensor product (STP) of matrices, the dynamics of BPNSs, which can be viewed as a combination of several small bounded subnets via synchronizing transitions, are described by an algebraic equation. When the algebraic form for its dynamics is established, we can present a necessary and sufficient condition for the reachability between any marking (or state) and initial marking. Also, we give a corresponding algorithm to calculate all of the transition paths between initial marking and any target marking. Finally, an example is shown to illustrate proposed results. The key advantage of our approach, in which the set of reachable markings of BPNSs can be expressed by the set of reachable markings of subnets such that the big reachability set of BPNSs do not need generate, is partly avoid the state explosion problem of Petri nets (PNs).</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 1","pages":"Pages 77-86"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60190-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72228589","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 : 2016-10-01DOI: 10.1016/S1005-8885(16)60053-5
Lü Xiaojun , Jia Xinchun , Han Zongyuan , Yang Bo , Hao Jun
Opportunistic routing (OR) could adapt to dynamic wireless sensor networks (WSNs) because of its inherent broadcast nature. Most of the existing OR protocols focus on the variations of propagation environment which are caused by channel fading. However, a few works deal with the dynamic scenario with mobile nodes. In this paper, a mobile node (MN) aware OR (MN-OR) is proposed and applied to a WSN in the high-speed railway scenario where the destination node is deployed inside a high speed moving train, and the MN-OR not only considers the mobility of node but also utilizes the candidate waiting time induced by the timer-based coordination scheme. Specifically, to reduce the number of duplicate transmissions and mitigate the delay of information transmission, a new selection strategy of the candidate forwarders is presented. In addition, two priority assignment methods of the candidate forwarders are proposed for the general relay nodes (GRNs) and the rail-side nodes (RSNs) according to their different routing requirements. Extensive simulation results demonstrate that the proposed MN-OR protocol can achieve better network performances compared with some existing routing schemes such as the well-known Ad-hoc on-demand distance vector routing (AODV) and the extremely opportunistic routing (ExOR) protocols.
{"title":"Mobile node aware opportunistic routing in dynamic wireless sensor network","authors":"Lü Xiaojun , Jia Xinchun , Han Zongyuan , Yang Bo , Hao Jun","doi":"10.1016/S1005-8885(16)60053-5","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60053-5","url":null,"abstract":"<div><p>Opportunistic routing (OR) could adapt to dynamic wireless sensor networks (WSNs) because of its inherent broadcast nature. Most of the existing OR protocols focus on the variations of propagation environment which are caused by channel fading. However, a few works deal with the dynamic scenario with mobile nodes. In this paper, a mobile node (MN) aware OR (MN-OR) is proposed and applied to a WSN in the high-speed railway scenario where the destination node is deployed inside a high speed moving train, and the MN-OR not only considers the mobility of node but also utilizes the candidate waiting time induced by the timer-based coordination scheme. Specifically, to reduce the number of duplicate transmissions and mitigate the delay of information transmission, a new selection strategy of the candidate forwarders is presented. In addition, two priority assignment methods of the candidate forwarders are proposed for the general relay nodes (GRNs) and the rail-side nodes (RSNs) according to their different routing requirements. Extensive simulation results demonstrate that the proposed MN-OR protocol can achieve better network performances compared with some existing routing schemes such as the well-known Ad-hoc on-demand distance vector routing (AODV) and the extremely opportunistic routing (ExOR) protocols.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 5","pages":"Pages 15-25"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60053-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72269210","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 : 2016-04-01DOI: 10.1016/S1005-8885(16)60014-6
Yang Chao , Wang Mei , Zheng Lin , Tang Jianming
The output of each individual channel in multi-carrier system can be processed to detect moving targets by the approach used in tradition narrowband pulse Doppler (PD) radar and then using non-coherent integration to promote signal noise ratio (SNR). However, due to the difference of Doppler on sub-carriers, there occurs Doppler dispersion during non-coherent integration, which causes attenuation and extension on target's amplitude. Especially, it can deteriorate performance of target detection under wideband multicarrier system or fast-moving target scene. In this paper, a modified Fourier transform kernel is proposed to solve Doppler dispersion for multi-carrier chirp signal. It can achieve accumulation at the same frequency point for the target's Doppler of each subcarrier. The simulation results indicate that this method can effectively eliminate the integral loss caused by Doppler dispersion.
{"title":"Suppression of Doppler dispersion in the target detection with multi-carrier signal","authors":"Yang Chao , Wang Mei , Zheng Lin , Tang Jianming","doi":"10.1016/S1005-8885(16)60014-6","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60014-6","url":null,"abstract":"<div><p>The output of each individual channel in multi-carrier system can be processed to detect moving targets by the approach used in tradition narrowband pulse Doppler (PD) radar and then using non-coherent integration to promote signal noise ratio (SNR). However, due to the difference of Doppler on sub-carriers, there occurs Doppler dispersion during non-coherent integration, which causes attenuation and extension on target's amplitude. Especially, it can deteriorate performance of target detection under wideband multicarrier system or fast-moving target scene. In this paper, a modified Fourier transform kernel is proposed to solve Doppler dispersion for multi-carrier chirp signal. It can achieve accumulation at the same frequency point for the target's Doppler of each subcarrier. The simulation results indicate that this method can effectively eliminate the integral loss caused by Doppler dispersion.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 2","pages":"Pages 1-5, 30"},"PeriodicalIF":0.0,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60014-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72233691","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 : 2016-04-01DOI: 10.1016/S1005-8885(16)60025-0
Bai Huifeng, Wang Dongshan, Wang Licheng, Wang Xiang
Aimed to enhance the supporting ability for diversified services, this paper proposes a hierarchy echo state network (HESE) based service-awareness (SA) (HESN-SA) mechanism in 10 Gbit/s Ethernet passive optical network (10G-EPON). In this HESN-SA, hierarchy architecture is adopted to realize echo state network (ESN) classification based SA. According to the network architecture of 10G-EPON, the parent-ESN (p-ESN) module works in the optical line terminal (OLT), while the sub-ESN (s-ESN) module is embedded in optical network units (ONUs). Thus, the p-ESN plays the main function of SA with a total view of this system, and s-ESN in each ONU conducts the SA function under the control of p-ESN. Thus, resources allocation and transport policy are both determined by the proposed mechanism through cooperation between OLT and ONUs. Simulation results show that the HESN-SA can improve the supporting ability for multiple services.
{"title":"Hierarchy echo state network based service-awareness in 10G-EPON","authors":"Bai Huifeng, Wang Dongshan, Wang Licheng, Wang Xiang","doi":"10.1016/S1005-8885(16)60025-0","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60025-0","url":null,"abstract":"<div><p>Aimed to enhance the supporting ability for diversified services, this paper proposes a hierarchy echo state network (HESE) based service-awareness (SA) (HESN-SA) mechanism in 10 Gbit/s Ethernet passive optical network (10G-EPON). In this HESN-SA, hierarchy architecture is adopted to realize echo state network (ESN) classification based SA. According to the network architecture of 10G-EPON, the parent-ESN (p-ESN) module works in the optical line terminal (OLT), while the sub-ESN (s-ESN) module is embedded in optical network units (ONUs). Thus, the p-ESN plays the main function of SA with a total view of this system, and s-ESN in each ONU conducts the SA function under the control of p-ESN. Thus, resources allocation and transport policy are both determined by the proposed mechanism through cooperation between OLT and ONUs. Simulation results show that the HESN-SA can improve the supporting ability for multiple services.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 2","pages":"Pages 91-96"},"PeriodicalIF":0.0,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60025-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72234113","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 : 2015-08-01DOI: 10.1016/S1005-8885(15)60668-9
Liao Mingxia, Liu Yuan'an, Yuan Dongming, Hu Heifei, Ran Jing
The maximum traffic intensity supported by a low earth orbit (LEO) mobile satellite system (MSS) (LEO-MSS) is important in practical application for providing satisfactory service. An analytical approach is proposed for determining the maximum traffic intensity of guaranteed handover (GH) scheme and channel complete sharing (CCS) scheme in LEO-MSS under quality of service (QoS) constraints. By evaluating performance of these two schemes, the relationship between the traffic intensity and the QoS constraints is established. The expressions of maximum traffic intensity of GH scheme and CCS scheme are deduced. Compared with the traditional method, the proposed analytical approach is more computationally efficient owing to the needlessness of the repeated iteration calculation. It also avoids the complex choice of the initial value of new call traffic intensity and its increment. Lastly, the accuracy and validity of the analysis approach have been verified by computer simulations.
{"title":"Analysis of maximum traffic intensity for guaranteed handover and channel complete sharing scheme under pre-set QoS requirements in LEO-MSS","authors":"Liao Mingxia, Liu Yuan'an, Yuan Dongming, Hu Heifei, Ran Jing","doi":"10.1016/S1005-8885(15)60668-9","DOIUrl":"https://doi.org/10.1016/S1005-8885(15)60668-9","url":null,"abstract":"<div><p>The maximum traffic intensity supported by a low earth orbit (LEO) mobile satellite system (MSS) (LEO-MSS) is important in practical application for providing satisfactory service. An analytical approach is proposed for determining the maximum traffic intensity of guaranteed handover (GH) scheme and channel complete sharing (CCS) scheme in LEO-MSS under quality of service (QoS) constraints. By evaluating performance of these two schemes, the relationship between the traffic intensity and the QoS constraints is established. The expressions of maximum traffic intensity of GH scheme and CCS scheme are deduced. Compared with the traditional method, the proposed analytical approach is more computationally efficient owing to the needlessness of the repeated iteration calculation. It also avoids the complex choice of the initial value of new call traffic intensity and its increment. Lastly, the accuracy and validity of the analysis approach have been verified by computer simulations.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"22 4","pages":"Pages 56-65"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(15)60668-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72230338","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 : 2015-06-01DOI: 10.1016/S1005-8885(15)60656-2
Zhang Yi, Guo Yuchun, Chen Yishuai
Hybrid cloud peer to peer (P2P) system is widely used for content distribution by utilizing user's capabilities to relieve the cloud bandwidth pressure. However, as demands for large-size files grow rapidly, it is a challenge to support high speed downloading experience simultaneously in different swarms with limited cloud bandwidth resource in such system. Therefore, it requires an optimized cloud bandwidth allocation to improve overall downloading experience of users. In this paper, we propose a system performance model which characterizes the relationship between cloud uploading bandwidth and user download speed. Based on the model, we study the cloud uploading bandwidth allocation, with the goal of optimizing user's quality of experience (QoE) that mainly depends on downloading rate of desired contents. Furthermore, to decrease the computation complexity, we put forward a heuristic algorithm to approximate the optimized solution. Simulation results show that our heuristic algorithm can obtain higher user's QoE as compared with two typical bandwidth allocation algorithms.
{"title":"Optimized bandwidth allocation for maximizing user's QoE in hybrid cloud P2P content distribution","authors":"Zhang Yi, Guo Yuchun, Chen Yishuai","doi":"10.1016/S1005-8885(15)60656-2","DOIUrl":"https://doi.org/10.1016/S1005-8885(15)60656-2","url":null,"abstract":"<div><p>Hybrid cloud peer to peer (P2P) system is widely used for content distribution by utilizing user's capabilities to relieve the cloud bandwidth pressure. However, as demands for large-size files grow rapidly, it is a challenge to support high speed downloading experience simultaneously in different swarms with limited cloud bandwidth resource in such system. Therefore, it requires an optimized cloud bandwidth allocation to improve overall downloading experience of users. In this paper, we propose a system performance model which characterizes the relationship between cloud uploading bandwidth and user download speed. Based on the model, we study the cloud uploading bandwidth allocation, with the goal of optimizing user's quality of experience (QoE) that mainly depends on downloading rate of desired contents. Furthermore, to decrease the computation complexity, we put forward a heuristic algorithm to approximate the optimized solution. Simulation results show that our heuristic algorithm can obtain higher user's QoE as compared with two typical bandwidth allocation algorithms.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"22 3","pages":"Pages 84-91"},"PeriodicalIF":0.0,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(15)60656-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72265853","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 : 2015-02-01DOI: 10.1016/S1005-8885(15)60618-5
Qin Haijuan , Zhang Linghua
A new variable step-size (VSS) affine projection algorithm (APA) (VSS-APA) was proposed for adaptive feedback cancellation suitable for hearing aids. So, a nonlinear function between step-size and estimation error is established and automatically adjusted according to the change of the estimation error, which leads to low misalignment and fast convergence speed. Analysis of the proposed algorithm offers large capacities in converging to the objective system. Simulation shows that the proposed algorithm achieves lower misalignment and faster convergence speed compared to fixed step-size APA and conventional adaptive algorithms.
{"title":"Adaptive feedback cancellation based on variable step-size affine projection for hearing aids","authors":"Qin Haijuan , Zhang Linghua","doi":"10.1016/S1005-8885(15)60618-5","DOIUrl":"https://doi.org/10.1016/S1005-8885(15)60618-5","url":null,"abstract":"<div><p>A new variable step-size (VSS) affine projection algorithm (APA) (VSS-APA) was proposed for adaptive feedback cancellation suitable for hearing aids. So, a nonlinear function between step-size and estimation error is established and automatically adjusted according to the change of the estimation error, which leads to low misalignment and fast convergence speed. Analysis of the proposed algorithm offers large capacities in converging to the objective system. Simulation shows that the proposed algorithm achieves lower misalignment and faster convergence speed compared to fixed step-size APA and conventional adaptive algorithms.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"22 1","pages":"Pages 6-10, 56"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(15)60618-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72213876","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 : 2015-02-01DOI: 10.1016/S1005-8885(15)60631-8
Wang Zhao , Zhang Jie , Liao Xin , Wen Qiaoyan
An effective data hiding method based on pixel value differencing (PVD) and modulus function (MF) PVD (MF-PVD) was proposed. MF-PVD method was derived by Wang et al in which the MF was employed to adjust the remainder of two pixels for data embedding and extraction. In the proposed method, a new remainder function in a more general form is defined by selecting proper parameters, in which an indeterminate equation is constructed and an optimal solution is applied to revise the pixels. This strategy leads to a significant image distortion reduction compared with the original method. The experiment reveals that, by preserving the original embedding capacity, the method provides better embedding efficiency than both MF-PVD and PVD methods.
{"title":"Data embedding based on pixel value differencing and modulus function using indeterminate equation","authors":"Wang Zhao , Zhang Jie , Liao Xin , Wen Qiaoyan","doi":"10.1016/S1005-8885(15)60631-8","DOIUrl":"https://doi.org/10.1016/S1005-8885(15)60631-8","url":null,"abstract":"<div><p>An effective data hiding method based on pixel value differencing (PVD) and modulus function (MF) PVD (MF-PVD) was proposed. MF-PVD method was derived by Wang et al in which the MF was employed to adjust the remainder of two pixels for data embedding and extraction. In the proposed method, a new remainder function in a more general form is defined by selecting proper parameters, in which an indeterminate equation is constructed and an optimal solution is applied to revise the pixels. This strategy leads to a significant image distortion reduction compared with the original method. The experiment reveals that, by preserving the original embedding capacity, the method provides better embedding efficiency than both MF-PVD and PVD methods.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"22 1","pages":"Pages 95-100"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(15)60631-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72213582","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 : 2015-02-01DOI: 10.1016/S1005-8885(15)60621-5
Qi Xiaohang , Zhang Qi , Tian Qinghua , Tao Ying , Xin Xiangjun , Liu Naijin
In contention-based satellite communication system, collisions between data packets may occur due to the randomly sending of the packets. A proper delay before each transmission can reduce the data collision rate. As classical random multiple access protocol, the slotted ALOHA (S-ALOHA) reduces the data collision rate through time slot allocation and synchronous measures. In order to improve the stability and throughput of satellite network, a backoff algorithm based on S-ALOHA will be effective. A new adaptive backoff algorithm based on S-ALOHA using grey system was proposed, which calculates the backoff time adaptively according to the network condition. And the network condition is estimated by each user terminal according to the prediction of the channel access success ratio using the model GM (1,1) in grey system. The proposed algorithm is compared to other known schemes such as the binary exponential backoff (BEB) and the multiple increase multiple decrease (MIMD) backoff. The performance of the proposed algorithm is simulated and analyzed. It is shown that throughput of the system based on the proposed algorithm is better than of system based on BEB and MIMD backoff. And there are also some improvements of the delay performance compared to using BEB. The proposed algorithm is especially effective for large number of user terminals in the satellite networks.
{"title":"Design of adaptive backoff algorithm for satellite network using grey system","authors":"Qi Xiaohang , Zhang Qi , Tian Qinghua , Tao Ying , Xin Xiangjun , Liu Naijin","doi":"10.1016/S1005-8885(15)60621-5","DOIUrl":"https://doi.org/10.1016/S1005-8885(15)60621-5","url":null,"abstract":"<div><p>In contention-based satellite communication system, collisions between data packets may occur due to the randomly sending of the packets. A proper delay before each transmission can reduce the data collision rate. As classical random multiple access protocol, the slotted ALOHA (S-ALOHA) reduces the data collision rate through time slot allocation and synchronous measures. In order to improve the stability and throughput of satellite network, a backoff algorithm based on S-ALOHA will be effective. A new adaptive backoff algorithm based on S-ALOHA using grey system was proposed, which calculates the backoff time adaptively according to the network condition. And the network condition is estimated by each user terminal according to the prediction of the channel access success ratio using the model GM (1,1) in grey system. The proposed algorithm is compared to other known schemes such as the binary exponential backoff (BEB) and the multiple increase multiple decrease (MIMD) backoff. The performance of the proposed algorithm is simulated and analyzed. It is shown that throughput of the system based on the proposed algorithm is better than of system based on BEB and MIMD backoff. And there are also some improvements of the delay performance compared to using BEB. The proposed algorithm is especially effective for large number of user terminals in the satellite networks.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"22 1","pages":"Pages 24-30, 56"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(15)60621-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72213879","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 : 2015-02-01DOI: 10.1016/S1005-8885(15)60630-6
Qu Zhijian, Zhang Xianwei, Shi Shaojian, Cao Yanfeng, Zhao Mingbo
Wavelength division multiplexing (WDM) has been becoming a promising solution to meet the rapidly growing demands on bandwidth. Multicast in WDM networks by employing free wavelength is an efficient approach to saving bandwidth and cost. However, the free wavelength may not identical between different hops in a multicast light-path, particularly in heavy load optical WDM networks. In order to implement multicast applications efficiently, a network coding (NC) technique was introduced into all-optical WDM multicast networks to solve wavelength collision problem between the multicast request and the unicast request. Compared with the wavelength conversion based optical multicast, the network coding based optical multicast can achieve better multicast performance with paying lower cost.
{"title":"Network coding based all-optical multicast in WDM networks","authors":"Qu Zhijian, Zhang Xianwei, Shi Shaojian, Cao Yanfeng, Zhao Mingbo","doi":"10.1016/S1005-8885(15)60630-6","DOIUrl":"https://doi.org/10.1016/S1005-8885(15)60630-6","url":null,"abstract":"<div><p>Wavelength division multiplexing (WDM) has been becoming a promising solution to meet the rapidly growing demands on bandwidth. Multicast in WDM networks by employing free wavelength is an efficient approach to saving bandwidth and cost. However, the free wavelength may not identical between different hops in a multicast light-path, particularly in heavy load optical WDM networks. In order to implement multicast applications efficiently, a network coding (NC) technique was introduced into all-optical WDM multicast networks to solve wavelength collision problem between the multicast request and the unicast request. Compared with the wavelength conversion based optical multicast, the network coding based optical multicast can achieve better multicast performance with paying lower cost.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"22 1","pages":"Pages 89-94"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(15)60630-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72213869","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}