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 effective radio resource allocation al-gorithms, which satisfy diversiform requirements of mobile naltimedia services in wireless cellular net-works, have recently attracted more and more at-tention. This paper pr...The effective radio resource allocation al-gorithms, which satisfy diversiform requirements of mobile naltimedia services in wireless cellular net-works, have recently attracted more and more at-tention. This paper proposes a service-aware scheduling algorithm, in which the Mean Opinion Score （MOS） is chosen as the unified metric of the Quality of Experience （QoE）. As the network needs to provide satisfactory services to all the users, the fairness of QoE should be considered. The Propor- tional Fair （PF） principle is adopted to achieve the trade-off between the network perfonmnce and us- er fairness. Then, an integer progranming problem is formed and the QoE-aware PF scheduling princi-ple is derived by solving the relaxed problem. Simu-lation results show that the proposed scheduling principle can perform better in terms of user fair-ness than the previous principle maximizing the sum of MOS. It also outperfoms the max-rain scheduling principle in terms of average MOS.展开更多
Most of current wireless packet scheduling algorithms aim at resource allocation as fairly as possible or maximizing throughput. This paper proposed a new packet scheduling algorithm that aims at satisfying delay requ...Most of current wireless packet scheduling algorithms aim at resource allocation as fairly as possible or maximizing throughput. This paper proposed a new packet scheduling algorithm that aims at satisfying delay requirement and is the improvement of earliest due first (EDF) algorithm in wired networks. The main idea is to classify the packets based on their delay bound, scheduling the most "urgent" class of user and the users that have the best channel condition with higher priority. This algorithm can easily integrate with common buffer management algorithms, when buffer management algorithm cannot accept new arrival packets, try to modify scheduling policy. Packet scheduling algorithms in multiple bottleneck wireless networks were also discussed. A new variable multi-hop factor was defined to estimate the congestion situation (including channel condition) of future hops. Multi-hop factor can be integrated into packet scheduling algorithms as assistant and supplement to improve its performance in multi-bottleneck wireless networks.展开更多
Wireless mesh network （WMN） is a new multi-hop network for broadband accessing to intemet. However, there exists a server unfairness problem based on different hop distances in WMN. To solve this problem, the unfair...Wireless mesh network （WMN） is a new multi-hop network for broadband accessing to intemet. However, there exists a server unfairness problem based on different hop distances in WMN. To solve this problem, the unfairness issue was analyzed in test-bed experiment and NS2 simulation. A dynamic queue management scheme E-QMMN was proposed, which allocates the queue buffer according to the hop distance of every flow. The experimental results show that the proposed scheme can not only increase the hop distance fairness of the legacy scheme at most 50%, but also reduce the average round trip time at least 29% in congested WMN environments.展开更多
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.展开更多
To solve the slow congestion detection and rate convergence problems in the existing rate control based fair data collection schemes, a new fair data collection scheme is proposed, which is named the improved scheme w...To solve the slow congestion detection and rate convergence problems in the existing rate control based fair data collection schemes, a new fair data collection scheme is proposed, which is named the improved scheme with fairness or ISWF for short. In ISWF, a quick congestion detection method, which combines the queue length with traffic changes of a node, is used to solve the slow congestion detection problem, and a new solution, which adjusts the rate of sending data of a node by monitoring the channel utilization rate, is used to solve the slow convergence problem. At the same time, the probability selection method is used in ISWF to achieve the fairness of channel bandwidth utilization. Experiment and simulation results show that ISWF can effectively reduce the reaction time in detecting congestion and shorten the rate convergence process. Compared with the existing tree-based fair data collection schemes, ISWF can achieve better fairness in data collection and reduce the transmission delay effectively, and at the same time, it can increase the average network throughput by 9.1% or more.展开更多
基金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 paper was supported partially by the Program for New Century Excellent Talents in University under Crant No. NCET-11-0600 the National Natural Science Foundation of China under Crant NN76022 and the France Telecom R ＆ D Beijing Co. Ltd.
文摘The effective radio resource allocation al-gorithms, which satisfy diversiform requirements of mobile naltimedia services in wireless cellular net-works, have recently attracted more and more at-tention. This paper proposes a service-aware scheduling algorithm, in which the Mean Opinion Score （MOS） is chosen as the unified metric of the Quality of Experience （QoE）. As the network needs to provide satisfactory services to all the users, the fairness of QoE should be considered. The Propor- tional Fair （PF） principle is adopted to achieve the trade-off between the network perfonmnce and us- er fairness. Then, an integer progranming problem is formed and the QoE-aware PF scheduling princi-ple is derived by solving the relaxed problem. Simu-lation results show that the proposed scheduling principle can perform better in terms of user fair-ness than the previous principle maximizing the sum of MOS. It also outperfoms the max-rain scheduling principle in terms of average MOS.
文摘Most of current wireless packet scheduling algorithms aim at resource allocation as fairly as possible or maximizing throughput. This paper proposed a new packet scheduling algorithm that aims at satisfying delay requirement and is the improvement of earliest due first (EDF) algorithm in wired networks. The main idea is to classify the packets based on their delay bound, scheduling the most "urgent" class of user and the users that have the best channel condition with higher priority. This algorithm can easily integrate with common buffer management algorithms, when buffer management algorithm cannot accept new arrival packets, try to modify scheduling policy. Packet scheduling algorithms in multiple bottleneck wireless networks were also discussed. A new variable multi-hop factor was defined to estimate the congestion situation (including channel condition) of future hops. Multi-hop factor can be integrated into packet scheduling algorithms as assistant and supplement to improve its performance in multi-bottleneck wireless networks.
基金Projects(61163060,61103204,60963022) supported by the National Natural Science Foundation of ChinaProject(D018023) supported by the Natural Science Foundation of Guangxi Province,ChinaPostdoctoral Funding of Central South University,China
文摘Wireless mesh network （WMN） is a new multi-hop network for broadband accessing to intemet. However, there exists a server unfairness problem based on different hop distances in WMN. To solve this problem, the unfairness issue was analyzed in test-bed experiment and NS2 simulation. A dynamic queue management scheme E-QMMN was proposed, which allocates the queue buffer according to the hop distance of every flow. The experimental results show that the proposed scheme can not only increase the hop distance fairness of the legacy scheme at most 50%, but also reduce the average round trip time at least 29% in congested WMN environments.
基金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.
基金supported in part by the National Natural Science Foundation of China under Grants No. 61103178, No. 60803151the Research Fund for the Doctoral Program of Higher Education of China under Grant No. 20096102120045
文摘To solve the slow congestion detection and rate convergence problems in the existing rate control based fair data collection schemes, a new fair data collection scheme is proposed, which is named the improved scheme with fairness or ISWF for short. In ISWF, a quick congestion detection method, which combines the queue length with traffic changes of a node, is used to solve the slow congestion detection problem, and a new solution, which adjusts the rate of sending data of a node by monitoring the channel utilization rate, is used to solve the slow convergence problem. At the same time, the probability selection method is used in ISWF to achieve the fairness of channel bandwidth utilization. Experiment and simulation results show that ISWF can effectively reduce the reaction time in detecting congestion and shorten the rate convergence process. Compared with the existing tree-based fair data collection schemes, ISWF can achieve better fairness in data collection and reduce the transmission delay effectively, and at the same time, it can increase the average network throughput by 9.1% or more.
