As the increasing demand for mobile communications and the shrinking of the coverage of cells, handover mechanism will play an important role in future wireless networks to provide users with seamless mobile communica...As the increasing demand for mobile communications and the shrinking of the coverage of cells, handover mechanism will play an important role in future wireless networks to provide users with seamless mobile communication services. In order to guarantee the user experience, the handover decision should be made timely and reasonably. To achieve this goal, this paper presents a hybrid handover forecasting mechanism, which contains long-term and short-term forecasting models. The proposed mechanism could cooperate with the standard mechanisms, and improve the performance of standard handover decision mechanisms. Since most of the parameters involved are imprecise, fuzzy forecasting model is applied for dealing with predictions of them. The numerical results indicate that the mechanism could significantly decrease the rate of ping-pong handover and the rate of handover failure.展开更多
The κ-μ fading model is an advanced channel model in super dense wireless networks.In this paper,we evaluate the performance of the system over κ-μ fading channel in super dense relay networks with consideration o...The κ-μ fading model is an advanced channel model in super dense wireless networks.In this paper,we evaluate the performance of the system over κ-μ fading channel in super dense relay networks with consideration of multiple independent but not necessarily identically distributed(i.n.i.d.) cochannel interference(CCI) under interferencelimited environment.More specifically,we derive a useful and accurate cumulative distribution function(CDF) expression of the end-to-end signal-to-interference plus noise(SINR) ratio.Moreover,we derive novel analytical expressions of the outage probability(OP),average bit error probability(ABEP) and average capacity for binary modulation types and arbitrary positive values of κ-and μ of such system.Furthermore,we propose asymptotic analysis for both the OP and ABEP to give physical insights.A simplified analytical form for the ABEP at high-SNR regimes is provided as well.Finally,the accuracy of the derived expressions is well validated by Monte Carlo simulations.展开更多
Real traffic information was analyzed in the statistical characteristics and approximated as a Gaussian time series. A data source model, called two states constant bit rate (TSCBR), was proposed in dynamic traffic mo...Real traffic information was analyzed in the statistical characteristics and approximated as a Gaussian time series. A data source model, called two states constant bit rate (TSCBR), was proposed in dynamic traffic monitoring sensor networks. Analysis of autocorrelation of the models shows that the proposed TSCBR model matches with the statistical characteristics of real data source closely. To further verify the validity of the TSCBR data source model, the performance metrics of power consumption and network lifetime was studied in the evaluation of sensor media access control (SMAC) algorithm. The simulation results show that compared with traditional data source models, TSCBR model can significantly improve accuracy of the algorithm evaluation.展开更多
This paper considers a two-user Gaussian interference channel aided by a single relay. Two source-destination pairs and the relay share a single common chaunel, and the relay assists both sources in communicating the ...This paper considers a two-user Gaussian interference channel aided by a single relay. Two source-destination pairs and the relay share a single common chaunel, and the relay assists both sources in communicating the messages to their respective destinations. This paper mainly focuses on the ＂amplify-and-forward＂ （AF） relaying strategy for relay, and derives upper bound and lower bound on achievable sum rate accordingly. Next, the application of the above model in cognitive radio （CR） networks is considered. The schemes that can ensure the coexistence of the secondary user with the primary user are proposed, in the sense that there is no rate degradation for the primary user due to sharing of the channel. Further, the throughput of the secondary user in different communication scenarios is investigated.展开更多
Wireless Mesh Networks （WMNs） have many applications in homes, schools, enterprises, and public places because of their useful characteristics, such as high bandwidth, high speed, and wide coverage. However, the sec...Wireless Mesh Networks （WMNs） have many applications in homes, schools, enterprises, and public places because of their useful characteristics, such as high bandwidth, high speed, and wide coverage. However, the security of wireless mesh networks is a precondition for practical use. Intrusion detection is pivotal for increasing network security. Considering the energy limitations in wireless mesh networks, we adopt two types of nodes： Heavy Intrusion Detection Node （HIDN） and Light Intrusion Detection Node （LIDN）. To conserve energy, the LIDN detects abnorrml behavior according to probability, while the HIDN, which has sufficient energy, is always operational. In practice, it is very difficult to acquire accurate information regarding attackers. We propose an intrusion detection model based on the incomplete inforrmtion game （ID-IIG）. The ID-IIG utilizes the Harsanyi transformation and Bayesian Nash equilibrium to select the best strategies of defenders, although the exact attack probability is unknown. Thus, it can effectively direct the deployment of defenders. Through experiments, we analyze the perforrmnce of ID-IIG and verify the existence and attainability of the Bayesian Nash equilibrium.展开更多
The co-channel interference modeling is vital for evaluating the secrecy performance in random wireless networks,where the legitimate nodes and eavesdroppers are randomly distributed.In this paper,a new interference m...The co-channel interference modeling is vital for evaluating the secrecy performance in random wireless networks,where the legitimate nodes and eavesdroppers are randomly distributed.In this paper,a new interference model is proposed from the userdominant perspective.The model can provide a better analytical assessment of secrecy performance with interference coordination for the presence of eavesdroppers.The typical legitimate is assumed to be located at the origin,and chooses the closest base station(BS) as its serving BS.The field of interferers is obtained by excluding the desired BSs(including the serving BS and its cooperative BS(s)).In contract with the exiting interference model,it is assumed that desired BSs and interferers belong to the same Poisson Point Process(PPP),and eavesdroppers are distributed according to another independent PPP.Based on this model,the average secrecy transmission capacity is derived in simply analytical forms with interference coordination.Analysis and simulation results show that the secrecy performance can be significantly enhanced by exploiting interference coordination.Furthermore,the average secrecy transmission capacity increases with increasing number of cooperative BSs.展开更多
To deploy sensor nodes over the area of interest,a scheme,named node scattering manipulation,was proposed.It adopted the following method:during node scattering,the initial states of every node,including the velocity ...To deploy sensor nodes over the area of interest,a scheme,named node scattering manipulation,was proposed.It adopted the following method:during node scattering,the initial states of every node,including the velocity and direction,were manipulated so that it would land in a region with a certain probability;every sensor was relocated in order to improve the coverage and connectivity.Simultaneously,to easily analyze the process of scattering sensors,a trajectory model was also proposed.Integrating node scattering manipulation with trajectory model,the node deployment in wireless sensor network was thoroughly renovated,that is,this scheme can scatter sensors.In practice,the scheme was operable compared with the previous achievements.The simulation results demonstrate the superiority and feasibility of the scheme,and also show that the energy consumption for sensors relocation is reduced.展开更多
Data aggregation technology reduces traffic overhead of wireless sensor network and extends effective working time of the network,yet continued operation of wireless sensor networks increases the probability of aggreg...Data aggregation technology reduces traffic overhead of wireless sensor network and extends effective working time of the network,yet continued operation of wireless sensor networks increases the probability of aggregation nodes being captured and probability of aggregated data being tampered.Thus it will seriously affect the security performance of the network. For network security issues,a stateful public key based SDAM( secure data aggregation model) is proposed for wireless sensor networks( WSNs),which employs a new stateful public key encryption to provide efficient end-to-end security. Moreover,the security aggregation model will not impose any bound on the aggregation function property,so as to realize the low cost and high security level at the same time.展开更多
Network capacity is a key characteristic to evaluate the performance of wireless networks, The goal of this paper is to study the capacity of wireless ad hoe relay network. In the model, there is at lnost ns source no...Network capacity is a key characteristic to evaluate the performance of wireless networks, The goal of this paper is to study the capacity of wireless ad hoe relay network. In the model, there is at lnost ns source nodes transmitting signal simultaneously in the network and the arbitrarily complex network coding is allowed. The upper capacity bound of the network model are derived From the max-flow rain-cut theorem and the lower capacity bound are obtained by the rate-distortion function For the Gaussian source. Finally, simulation results show that the upper network capacity will decrease as the number of source nodes is increased.展开更多
How to energy-efficiently maintain the topology of wireless sensor networks(WSNs) is still a difficult problem because of their numerous nodes,highly dynamic nature,varied application scenarios and limited resources.A...How to energy-efficiently maintain the topology of wireless sensor networks(WSNs) is still a difficult problem because of their numerous nodes,highly dynamic nature,varied application scenarios and limited resources.An energy-efficient multi-mode clusters maintenance(M2CM) method is proposed based on localized and event-driven mechanism in this work,which is different from the conventional clusters maintenance model with always periodically re-clustered among the whole network style based on time-trigger for hierarchical WSNs.M2 CM can meet such demands of clusters maintenance as adaptive local maintenance for the damaged clusters according to its changes in time and space field.,the triggers of M2 CM include such events as nodes' residual energy being under the threshold,the load imbalance of cluster head,joining in or exiting from any cluster for new node or disable one,etc.Based on neighboring relationship of the damaged clusters,one can start a single cluster(inner-cluster) maintenance or clusters(inter-cluster) maintenance program to meet diverse demands in the topology management of hierarchical WSNs.The experiment results based on NS2 simulation show that the proposed method can significantly save energy used in maintaining a damaged network,effectively narrow down the influenced area of clusters maintenance,and increase transmitted data and prolong lifetime of network compared to the traditional schemes.展开更多
To address the issue of resource scarcity in wireless communication, a novel dynamic call admission control scheme for wireless mobile network was proposed. The scheme established a reward computing model of call admi...To address the issue of resource scarcity in wireless communication, a novel dynamic call admission control scheme for wireless mobile network was proposed. The scheme established a reward computing model of call admission of wireless cell based on Markov decision process, dynamically optimized call admission process according to the principle of maximizing the average system rewards. Extensive simulations were conducted to examine the performance of the model by comparing with other policies in terms of new call blocking probability, handoff call dropping probability and resource utilization rate. Experimental results show that the proposed scheme can achieve better adaptability to changes in traffic conditions than existing protocols. Under high call traffic load, handoff call dropping probability and new call blocking probability can be reduced by about 8%, and resource utilization rate can be improved by 2%-6%. The proposed scheme can achieve high source utilization rate of about 85%.展开更多
Based on the analysis of the feature of cognitive radio networks, a relevant interference model was built. Cognitive users should consider especially the problem of interference with licensed users and satisfy the sig...Based on the analysis of the feature of cognitive radio networks, a relevant interference model was built. Cognitive users should consider especially the problem of interference with licensed users and satisfy the signal-to-interference noise ratio （SINR） requirement at the same time. According to different power thresholds, an approach was given to solve the problem of coexistence between licensed user and cognitive user in cognitive system. Then, an uplink distributed power control algorithm based on traditional iterative model was proposed. Convergence analysis of the algorithm in case of feasible systems was provided. Simulations show that this method can provide substantial power savings as compared with the power balancing algorithm while reducing the achieved SINR only slightly, since 6% S1NR loss can bring 23% power gain. Through further simulations, it can be concluded that the proposed solution has better effect as the noise power or system load increases.展开更多
A novel distributed cognitive radio multichannel medium access protocol without common control channel was proposed.The protocol divided a transmission interval into two parts for exchanging control information and da...A novel distributed cognitive radio multichannel medium access protocol without common control channel was proposed.The protocol divided a transmission interval into two parts for exchanging control information and data,respectively.In addition to evaluating system saturation throughput of the proposed protocol,a three-dimensional multi channel Markov chain model to describe the sate of the cognitive users (CUs) in dynamic spectrum access was presented.The proposed analysis was applied to the packet transmission schemes employed by the basic,RTS/CTS access mechanism adopted in the normal IEEE 802.11.Analyzing the advantage of the two methods,a hybrid access mechanism was proposed to improve the system throughput.The simulation results show that the experiment results are close to the value computed by the model (less than 5%),and the proposed protocol significantly improves the performance of the system throughput by borrowing the licensed spectrum.By analyzing the dependence of throughput on system parameters,hybrid mechanism dynamically selecting access mechanism can maintain high throughput.展开更多
Dynamic spectrum access policy is crucial in improving the performance of over- lay cognitive radio networks. Most of the previ- ous works on spectrum sensing and dynamic spe- ctrum access consider the sensing effecti...Dynamic spectrum access policy is crucial in improving the performance of over- lay cognitive radio networks. Most of the previ- ous works on spectrum sensing and dynamic spe- ctrum access consider the sensing effective- ness and spectrum utilization as the design cri- teria, while ignoring the energy related issues and QoS constraints. In this article, we propose a QoS provisioning energy saving dynamic acc- ess policy using stochastic control theory con- sidering the time-varying characteristics of wir- eless channels because of fading and mobility. The proposed scheme determines the sensing action and selects the optimal spectrum using the corresponding power setting in each decis- ion epoch according to the channel state with the objective being to minimise both the flame error rate and energy consumption. We use the Hidden Markov Model （HMM） to model a wir- eless channel, since the channel state is not dir- ectly observable at the receiver, but is instead embedded in the received signal. The proced- ure of dynamic spectrum access is formulated as a Markov decision process which can be sol- ved using linear programming and the primal- dual index heuristic algorithm, and the obta- ined policy has an index-ability property that can be easily implemented in real systems. Sim- ulation results are presented to show the per- formance improvement caused by the propo- sed approach.展开更多
In Wireless Sensor Networks (WSNs), it is necessary to predict computational overheads of security mechanisms without final implementations to provide guidelines for system design. This paper presents an accurate and ...In Wireless Sensor Networks (WSNs), it is necessary to predict computational overheads of security mechanisms without final implementations to provide guidelines for system design. This paper presents an accurate and flexible model to predict overheads of these mechanisms. This model is based on overheads of basic operations frequently used in cryptography algorithms, which are essential elements of security mechanisms. Several popular cryptography algorithms and security mechanisms are evaluated using this model. According to simulation results, relative prediction errors are less than 7% for most cryptography algorithms and security mechanisms.展开更多
This paper proposes a distributed fair queuing algorithm which is based on compensation coordi- nation scheduling in wireless mesh networks, considering such problems as the location-dependent competition and unfair c...This paper proposes a distributed fair queuing algorithm which is based on compensation coordi- nation scheduling in wireless mesh networks, considering such problems as the location-dependent competition and unfair channel bandwidth allocation among nodes. The data communication process requiring the establishment of compensation coordination scheduling model is divided into three periods： the sending period, the compensation period and the dormancy period. According to model parameters, time constraint functions are designed to limit the execution length of each period. The algorithms guarantee that the nodes complete fair transmission of network packets together in accordance with the fixed coordination scheduling rule of the model. Simulations and analysis demonstrate the effectiveness of the proposed algorithm in network throughput and fairness.展开更多
基金supported in part by the National Major Project under Grant No.2018ZX030001016the National Natural Science Foundation of China under Grant No.61371092the China Mobile Program of Ministry of Education under Grants No.MCM20150102
文摘As the increasing demand for mobile communications and the shrinking of the coverage of cells, handover mechanism will play an important role in future wireless networks to provide users with seamless mobile communication services. In order to guarantee the user experience, the handover decision should be made timely and reasonably. To achieve this goal, this paper presents a hybrid handover forecasting mechanism, which contains long-term and short-term forecasting models. The proposed mechanism could cooperate with the standard mechanisms, and improve the performance of standard handover decision mechanisms. Since most of the parameters involved are imprecise, fuzzy forecasting model is applied for dealing with predictions of them. The numerical results indicate that the mechanism could significantly decrease the rate of ping-pong handover and the rate of handover failure.
基金supported by the NSFC project under grant No. 61101237the Fundamental Research Funds for the Central Universities No. 2014JBZ001China Postdoctoral Science Foundation No. 2014M560081
文摘The κ-μ fading model is an advanced channel model in super dense wireless networks.In this paper,we evaluate the performance of the system over κ-μ fading channel in super dense relay networks with consideration of multiple independent but not necessarily identically distributed(i.n.i.d.) cochannel interference(CCI) under interferencelimited environment.More specifically,we derive a useful and accurate cumulative distribution function(CDF) expression of the end-to-end signal-to-interference plus noise(SINR) ratio.Moreover,we derive novel analytical expressions of the outage probability(OP),average bit error probability(ABEP) and average capacity for binary modulation types and arbitrary positive values of κ-and μ of such system.Furthermore,we propose asymptotic analysis for both the OP and ABEP to give physical insights.A simplified analytical form for the ABEP at high-SNR regimes is provided as well.Finally,the accuracy of the derived expressions is well validated by Monte Carlo simulations.
基金The National Natural Science Foundation ofChia(No60372076)The Important cienceand Technology Key Item of Shanghai Science and Technology Bureau ( No05dz15004)
文摘Real traffic information was analyzed in the statistical characteristics and approximated as a Gaussian time series. A data source model, called two states constant bit rate (TSCBR), was proposed in dynamic traffic monitoring sensor networks. Analysis of autocorrelation of the models shows that the proposed TSCBR model matches with the statistical characteristics of real data source closely. To further verify the validity of the TSCBR data source model, the performance metrics of power consumption and network lifetime was studied in the evaluation of sensor media access control (SMAC) algorithm. The simulation results show that compared with traditional data source models, TSCBR model can significantly improve accuracy of the algorithm evaluation.
基金Supported by the National Natural Science Foundation of China （No. 60872049 60871042+1 种基金 60971082 60972073）, the National High Technology Research and Development Programme of China （No.2007AA10Z235）and the National Key Basic Research Program of China （No.2009CB320407）.
文摘This paper considers a two-user Gaussian interference channel aided by a single relay. Two source-destination pairs and the relay share a single common chaunel, and the relay assists both sources in communicating the messages to their respective destinations. This paper mainly focuses on the ＂amplify-and-forward＂ （AF） relaying strategy for relay, and derives upper bound and lower bound on achievable sum rate accordingly. Next, the application of the above model in cognitive radio （CR） networks is considered. The schemes that can ensure the coexistence of the secondary user with the primary user are proposed, in the sense that there is no rate degradation for the primary user due to sharing of the channel. Further, the throughput of the secondary user in different communication scenarios is investigated.
基金This work was partially supported by the National Natural Science Foundation of China under Cxants No. 61272451, No. 61103220, No. 61173154, No. 61173175 the National Critical Patented Projects in the next generation broadband wireless mobile communication network under Grant No. 2010ZX03006-001-01.
文摘Wireless Mesh Networks （WMNs） have many applications in homes, schools, enterprises, and public places because of their useful characteristics, such as high bandwidth, high speed, and wide coverage. However, the security of wireless mesh networks is a precondition for practical use. Intrusion detection is pivotal for increasing network security. Considering the energy limitations in wireless mesh networks, we adopt two types of nodes： Heavy Intrusion Detection Node （HIDN） and Light Intrusion Detection Node （LIDN）. To conserve energy, the LIDN detects abnorrml behavior according to probability, while the HIDN, which has sufficient energy, is always operational. In practice, it is very difficult to acquire accurate information regarding attackers. We propose an intrusion detection model based on the incomplete inforrmtion game （ID-IIG）. The ID-IIG utilizes the Harsanyi transformation and Bayesian Nash equilibrium to select the best strategies of defenders, although the exact attack probability is unknown. Thus, it can effectively direct the deployment of defenders. Through experiments, we analyze the perforrmnce of ID-IIG and verify the existence and attainability of the Bayesian Nash equilibrium.
基金This work is supported by the National Natural Science Foundation for Distinguished Young Scholar of China under Grant No. 61325006 and the National High-tech Research and Development Program of China under Grant No. 2014AA01A701.
文摘The co-channel interference modeling is vital for evaluating the secrecy performance in random wireless networks,where the legitimate nodes and eavesdroppers are randomly distributed.In this paper,a new interference model is proposed from the userdominant perspective.The model can provide a better analytical assessment of secrecy performance with interference coordination for the presence of eavesdroppers.The typical legitimate is assumed to be located at the origin,and chooses the closest base station(BS) as its serving BS.The field of interferers is obtained by excluding the desired BSs(including the serving BS and its cooperative BS(s)).In contract with the exiting interference model,it is assumed that desired BSs and interferers belong to the same Poisson Point Process(PPP),and eavesdroppers are distributed according to another independent PPP.Based on this model,the average secrecy transmission capacity is derived in simply analytical forms with interference coordination.Analysis and simulation results show that the secrecy performance can be significantly enhanced by exploiting interference coordination.Furthermore,the average secrecy transmission capacity increases with increasing number of cooperative BSs.
基金Project(2007AA01Z224) supported by National High-Tech Research and Development Program of China
文摘To deploy sensor nodes over the area of interest,a scheme,named node scattering manipulation,was proposed.It adopted the following method:during node scattering,the initial states of every node,including the velocity and direction,were manipulated so that it would land in a region with a certain probability;every sensor was relocated in order to improve the coverage and connectivity.Simultaneously,to easily analyze the process of scattering sensors,a trajectory model was also proposed.Integrating node scattering manipulation with trajectory model,the node deployment in wireless sensor network was thoroughly renovated,that is,this scheme can scatter sensors.In practice,the scheme was operable compared with the previous achievements.The simulation results demonstrate the superiority and feasibility of the scheme,and also show that the energy consumption for sensors relocation is reduced.
基金Support by the National High Technology Research and Development Program of China(No.2012AA120802)the National Natural Science Foundation of China(No.61302074)+1 种基金Specialized Research Fund for the Doctoral Program of Higher Education(No.20122301120004)Natural Science Foundation of Heilongjiang Province(No.QC2013C061)
文摘Data aggregation technology reduces traffic overhead of wireless sensor network and extends effective working time of the network,yet continued operation of wireless sensor networks increases the probability of aggregation nodes being captured and probability of aggregated data being tampered.Thus it will seriously affect the security performance of the network. For network security issues,a stateful public key based SDAM( secure data aggregation model) is proposed for wireless sensor networks( WSNs),which employs a new stateful public key encryption to provide efficient end-to-end security. Moreover,the security aggregation model will not impose any bound on the aggregation function property,so as to realize the low cost and high security level at the same time.
基金Supported in part by the Chinese Ministry of Science and Technology for 863 Programs (No.2003AA12331005), and in part by the National Natural Science Foundation of China (No.60496351).
文摘Network capacity is a key characteristic to evaluate the performance of wireless networks, The goal of this paper is to study the capacity of wireless ad hoe relay network. In the model, there is at lnost ns source nodes transmitting signal simultaneously in the network and the arbitrarily complex network coding is allowed. The upper capacity bound of the network model are derived From the max-flow rain-cut theorem and the lower capacity bound are obtained by the rate-distortion function For the Gaussian source. Finally, simulation results show that the upper network capacity will decrease as the number of source nodes is increased.
基金supported by the National Natural Science Foundation of China(Grant No.61170219)the Joint Research Foundation of the Ministry of Education of the People’s Republic of China and China Mobile(Grant No.MCM20150202)the Science and Technology Project Affiliated to Chongqing Education Commission(KJ1602201)
文摘How to energy-efficiently maintain the topology of wireless sensor networks(WSNs) is still a difficult problem because of their numerous nodes,highly dynamic nature,varied application scenarios and limited resources.An energy-efficient multi-mode clusters maintenance(M2CM) method is proposed based on localized and event-driven mechanism in this work,which is different from the conventional clusters maintenance model with always periodically re-clustered among the whole network style based on time-trigger for hierarchical WSNs.M2 CM can meet such demands of clusters maintenance as adaptive local maintenance for the damaged clusters according to its changes in time and space field.,the triggers of M2 CM include such events as nodes' residual energy being under the threshold,the load imbalance of cluster head,joining in or exiting from any cluster for new node or disable one,etc.Based on neighboring relationship of the damaged clusters,one can start a single cluster(inner-cluster) maintenance or clusters(inter-cluster) maintenance program to meet diverse demands in the topology management of hierarchical WSNs.The experiment results based on NS2 simulation show that the proposed method can significantly save energy used in maintaining a damaged network,effectively narrow down the influenced area of clusters maintenance,and increase transmitted data and prolong lifetime of network compared to the traditional schemes.
基金Project(60873082) supported by the National Natural Science Foundation of ChinaProject(09C794) supported by the Natural Science Foundation of Education Department of Hunan Province, China+1 种基金Project (S2008FJ3078) supported by the Science and Technology Program Foundation of Hunan Province, ChinaProject(07JJ6109) supported by the Natural Science Foundation of Hunan Province, China
文摘To address the issue of resource scarcity in wireless communication, a novel dynamic call admission control scheme for wireless mobile network was proposed. The scheme established a reward computing model of call admission of wireless cell based on Markov decision process, dynamically optimized call admission process according to the principle of maximizing the average system rewards. Extensive simulations were conducted to examine the performance of the model by comparing with other policies in terms of new call blocking probability, handoff call dropping probability and resource utilization rate. Experimental results show that the proposed scheme can achieve better adaptability to changes in traffic conditions than existing protocols. Under high call traffic load, handoff call dropping probability and new call blocking probability can be reduced by about 8%, and resource utilization rate can be improved by 2%-6%. The proposed scheme can achieve high source utilization rate of about 85%.
基金Project(61071104) supported by the National Natural Science Foundation of China
文摘Based on the analysis of the feature of cognitive radio networks, a relevant interference model was built. Cognitive users should consider especially the problem of interference with licensed users and satisfy the signal-to-interference noise ratio （SINR） requirement at the same time. According to different power thresholds, an approach was given to solve the problem of coexistence between licensed user and cognitive user in cognitive system. Then, an uplink distributed power control algorithm based on traditional iterative model was proposed. Convergence analysis of the algorithm in case of feasible systems was provided. Simulations show that this method can provide substantial power savings as compared with the power balancing algorithm while reducing the achieved SINR only slightly, since 6% S1NR loss can bring 23% power gain. Through further simulations, it can be concluded that the proposed solution has better effect as the noise power or system load increases.
基金Project(61071104) supported by the National Natural Science Foundation of China
文摘A novel distributed cognitive radio multichannel medium access protocol without common control channel was proposed.The protocol divided a transmission interval into two parts for exchanging control information and data,respectively.In addition to evaluating system saturation throughput of the proposed protocol,a three-dimensional multi channel Markov chain model to describe the sate of the cognitive users (CUs) in dynamic spectrum access was presented.The proposed analysis was applied to the packet transmission schemes employed by the basic,RTS/CTS access mechanism adopted in the normal IEEE 802.11.Analyzing the advantage of the two methods,a hybrid access mechanism was proposed to improve the system throughput.The simulation results show that the experiment results are close to the value computed by the model (less than 5%),and the proposed protocol significantly improves the performance of the system throughput by borrowing the licensed spectrum.By analyzing the dependence of throughput on system parameters,hybrid mechanism dynamically selecting access mechanism can maintain high throughput.
基金supported by the National Natural Science Foundation of China under Grant No.61101107the Beijing Higher Education Young Elite Teacher Project under Grant No.YETP0439
文摘Dynamic spectrum access policy is crucial in improving the performance of over- lay cognitive radio networks. Most of the previ- ous works on spectrum sensing and dynamic spe- ctrum access consider the sensing effective- ness and spectrum utilization as the design cri- teria, while ignoring the energy related issues and QoS constraints. In this article, we propose a QoS provisioning energy saving dynamic acc- ess policy using stochastic control theory con- sidering the time-varying characteristics of wir- eless channels because of fading and mobility. The proposed scheme determines the sensing action and selects the optimal spectrum using the corresponding power setting in each decis- ion epoch according to the channel state with the objective being to minimise both the flame error rate and energy consumption. We use the Hidden Markov Model （HMM） to model a wir- eless channel, since the channel state is not dir- ectly observable at the receiver, but is instead embedded in the received signal. The proced- ure of dynamic spectrum access is formulated as a Markov decision process which can be sol- ved using linear programming and the primal- dual index heuristic algorithm, and the obta- ined policy has an index-ability property that can be easily implemented in real systems. Sim- ulation results are presented to show the per- formance improvement caused by the propo- sed approach.
基金Supported by 863 Project of China (No.2006AA01Z224)
文摘In Wireless Sensor Networks (WSNs), it is necessary to predict computational overheads of security mechanisms without final implementations to provide guidelines for system design. This paper presents an accurate and flexible model to predict overheads of these mechanisms. This model is based on overheads of basic operations frequently used in cryptography algorithms, which are essential elements of security mechanisms. Several popular cryptography algorithms and security mechanisms are evaluated using this model. According to simulation results, relative prediction errors are less than 7% for most cryptography algorithms and security mechanisms.
基金Supported by the National Natural Science Foundation of China （61071096, 61003233, 61073103 ） and the Research Fund for the Doctoral Program of Higher Education （20100162110012）.
文摘This paper proposes a distributed fair queuing algorithm which is based on compensation coordi- nation scheduling in wireless mesh networks, considering such problems as the location-dependent competition and unfair channel bandwidth allocation among nodes. The data communication process requiring the establishment of compensation coordination scheduling model is divided into three periods： the sending period, the compensation period and the dormancy period. According to model parameters, time constraint functions are designed to limit the execution length of each period. The algorithms guarantee that the nodes complete fair transmission of network packets together in accordance with the fixed coordination scheduling rule of the model. Simulations and analysis demonstrate the effectiveness of the proposed algorithm in network throughput and fairness.
