The exponentially increasing number of heterogeneous Internet of Things(Io T)devices(e.g.,Wi Fi and Zig Bee)crowed in the same ISM band(2.4 G)and recent advances in CrossTechnology Communications(CTC)motivate us to ex...The exponentially increasing number of heterogeneous Internet of Things(Io T)devices(e.g.,Wi Fi and Zig Bee)crowed in the same ISM band(2.4 G)and recent advances in CrossTechnology Communications(CTC)motivate us to explore more efficient data collection and maximize network throughput.CTC enables Wi Fi and Zig Bee devices to communicate directly without any hardware changes or gateway equipment,which sheds light on a more efficient data collection design.In this work,we propose a distributed algorithm,named Max Bee,to compute the maximum network throughput,which is formulated as a linear programming problem.Considering that the problem turns out to be non-convex and hard to solve exactly,we propose a distributed algorithm to solve nonlinear programming by using the dual decomposition method and gradient/subgradient algorithms.Through extensive simulations on different sets of deployed Zig Bee and Wi Fi devices,we observe that the proposed algorithm significantly increases the network throughput based on CTC for Sensor Networks.展开更多
A layered network model for optical transport networks is proposed in this paper,which involves Internet Protocol(IP) ,Synchronous Digital Hierarchy(SDH) and Wavelength Division Mul-tiplexing(WDM) layers. The strategy...A layered network model for optical transport networks is proposed in this paper,which involves Internet Protocol(IP) ,Synchronous Digital Hierarchy(SDH) and Wavelength Division Mul-tiplexing(WDM) layers. The strategy of Dynamic Joint Routing and Resource Allocation(DJRRA) and its algorithm description are also presented for the proposed layered network model. DJRRA op-timizes the bandwidth usage of interface links between different layers and the logic links inside all layers. The simulation results show that DJRRA can reduce the blocking probability and increase network throughput effectively,which is in contrast to the classical separate sequential routing and resource allocation solutions.展开更多
With the rapid development of air transportation, network service ability has attracted a lot of attention in academe. Aiming to improve the throughput of the air route network （ARN）, we propose an effective local d...With the rapid development of air transportation, network service ability has attracted a lot of attention in academe. Aiming to improve the throughput of the air route network （ARN）, we propose an effective local dynamic routing strategy in this paper. Several factors, such as the rout- ing distance, the geographical distance and the real-time local traffic, are taken into consideration. When the ARN is in the normal free-flow state, the proposed strategy can recover the shortest path routing （SPR） strategy. When the ARN undergoes congestion, the proposed strategy changes the paths of flights based on the real-time local traffic information. The throughput of the Chinese air route network （CARN） is evaluated. Results confirm that the proposed strategy can significantly improve the throughput of CARN. Meanwhile, the increase in the average flying distance and time is tiny. Results also indicate the importance of the distance related factors in a routing strategy designed for the ARN.展开更多
The Novel Interconnection Network (NIN) based on inverted-graph topology and crossbar switch is a kind of lower latency and higher throughput interconnection network. But it has a vital disadvantage, high hardware com...The Novel Interconnection Network (NIN) based on inverted-graph topology and crossbar switch is a kind of lower latency and higher throughput interconnection network. But it has a vital disadvantage, high hardware complexity. In order to reduce system hardware cost, an improved NIN (ININ) structure is proposed. As same as NIN, ININ has constant network diameter. Besides of keeping advantages of NIN, hardware cost of ININ is lower than NIN. Furthermore, we design a new deadlock-free routing algorithm for the improved NIN. Key words NIN - ININ - inverted-graph interconnection network - hardware complexity - network band-width - network throughput CLC number TP 302 Foundation item: Supported by the National Natural Science Foundation of China (69873016)Biography: Li Fei (1974-), male, Ph. D candidate, research direction: architecture of interconnection network.展开更多
This paper investigates the uplink throughput of Cognitive Radio Cellular Networks(CRCNs).As oppose to traditional performance evaluation schemes which mainly adopt complex system level simulations,we use the theoreti...This paper investigates the uplink throughput of Cognitive Radio Cellular Networks(CRCNs).As oppose to traditional performance evaluation schemes which mainly adopt complex system level simulations,we use the theoretical framework of stochastic geometry to provide a tractable and accurate analysis of the uplink throughput in the CRCN.By modelling the positions of User Equipments(UEs)and Base Stations(BSs)as Poisson Point Processes(PPPs),we analyse and derive expressions for the link rate and the cell throughput in the Primary(PR)and Secondary(SR)networks.The expressions show that the throughput of the CRCN is mainly affected by the density ratios between the UEs and the BSs in both the PR and SR networks.Besides,a comparative analysis of the link rate between random and regular BS deployments is concluded,and the results confirm the accuracy of our analysis.Furthermore,we define the cognitive throughput gain and derive an expression which is dominated by the traffic load in the PR network.展开更多
How to improve the performance of the wireless Ad Hoc network by utilizing the spectrum resources efficiently has become a hot research topic in recent years. In this paper we propose a reactive routing algorithm that...How to improve the performance of the wireless Ad Hoc network by utilizing the spectrum resources efficiently has become a hot research topic in recent years. In this paper we propose a reactive routing algorithm that supports multiple channels to improve the performance of the Ad Hoc network based on the minimizing of the channel handoff. Our approach allocates the communication channel during the route discovery, and notifies the allocated channel information to the corresponding node in the route reply packets. Each node in the route tries its best to choose the same channel with the upstream node without interference. The simulation results show that our algorithm performs better than the K-hop distinct protocols in both average delays and network throughputs展开更多
Designing a multi-constrained QoS (Quality of service) communication protocol for mission-critical applications that seeks a path connecting source node and destination node that satisfies multiple QoS constrains such...Designing a multi-constrained QoS (Quality of service) communication protocol for mission-critical applications that seeks a path connecting source node and destination node that satisfies multiple QoS constrains such as energy cost, delay, and reliability imposes a great challenge in Wireless Sensor Networks (WSNs). In such challenging dynamic environment, traditional routing and layered infrastructure are inefficient and sometimes even infeasible. In recent research works, the opportunistic routing paradigm which delays the forwarding decision until reception of packets in forwarders by utilizing the broadcast nature of the wireless medium has been exploited to overcome the limitations of traditional routing. However, to guarantee the balance between the energy, delay and reliability requires the refinement of opportunistic routing through interaction between underlying layers known as cross-layer opportunistic routing. Indeed, these schemes fail to achieve optimal performance and hence require a new method to facilitate the adoption of the routing protocol to the dynamic challenging environments. In this paper, we propose a universal cross-layered opportunistic based communication protocol for WSNs for guaranteeing the user set constraints on multi-constrained QoS in low-duty-cycle WSN. Extensive simulation results show that the proposed work, Multi-Constrained QoS Opportunistic routing by optimal Power Tuning (MOR-PT) effectively achieves the feasible QoS trade-off constraints set by user by jointly considering the power control and selection diversity over established algorithms like DSF [1] and DTPC [2].展开更多
Frame aggregation is a wireless link optimization mechanism that aims to reduce transmission overheads by sending multiple flames as the payload of a single MAC flame. It is considered as one of the most efficient met...Frame aggregation is a wireless link optimization mechanism that aims to reduce transmission overheads by sending multiple flames as the payload of a single MAC flame. It is considered as one of the most efficient methods to improve the wireless channel utilization and the throughput of wireless networks. The static assignment of frame aggregation parameters can result in delay penalties due to variations in traffic type. We propose a frame aggregation scheme which is based on dyn- amic pricing and queue scheduling for a multi- traffic scenario. The scheme adopts a dynamic differential pricing scheme for different types of traffic. Meanwhile, it polls buffer queues in accordance with the optimal aggregation wei- ght factors to maximise the network revenue. Simulation results indicate that the proposed frame aggregation scheme can effectively improve the network revenue and the average throughput, while guaranteeing the delay requirements of all types of traffic.展开更多
How to reduce interference among neighbor nodes in wireless mesh networks is still an important and key issue nowa- days. In this paper, an optimized channel assignment algorithm （OCA） is proposed to solve this prob...How to reduce interference among neighbor nodes in wireless mesh networks is still an important and key issue nowa- days. In this paper, an optimized channel assignment algorithm （OCA） is proposed to solve this problem based on link throughput and node priority. The effects of the numbers of network interface cards and channels on the network throughput are analyzed and evaluated, When there are seven of the numbers of both network interface cards and channels, the efficiency of utilizing network interface card and channel reaches highest. Compared with cen- tralized channel assignment algorithm （CCA）, the proposed algo- rithm has less packet loss rate and more network throughput sig- nificantly.展开更多
Vehicle-to-grid technology is an emerging field that allows unused power from Electric Vehicles(EVs)to be used by the smart grid through the central aggregator.Since the central aggregator is connected to the smart gr...Vehicle-to-grid technology is an emerging field that allows unused power from Electric Vehicles(EVs)to be used by the smart grid through the central aggregator.Since the central aggregator is connected to the smart grid through a wireless network,it is prone to cyber-attacks that can be detected and mitigated using an intrusion detection system.However,existing intrusion detection systems cannot be used in the vehicle-to-grid network because of the special requirements and characteristics of the vehicle-to-grid network.In this paper,the effect of denial-of-service attacks of malicious electric vehicles on the central aggregator of the vehicle-to-grid network is investigated and an intrusion detection system for the vehicle-to-grid network is proposed.The proposed system,central aggregator–intrusion detection system(CA-IDS),works as a security gateway for EVs to analyze andmonitor incoming traffic for possible DoS attacks.EVs are registered with a Central Aggregator(CAG)to exchange authenticated messages,and malicious EVs are added to a blacklist for violating a set of predefined policies to limit their interaction with the CAG.A denial of service(DoS)attack is simulated at CAG in a vehicle-to-grid(V2G)network manipulating various network parameters such as transmission overhead,receiving capacity of destination,average packet size,and channel availability.The proposed system is compared with existing intrusion detection systems using different parameters such as throughput,jitter,and accuracy.The analysis shows that the proposed system has a higher throughput,lower jitter,and higher accuracy as compared to the existing schemes.展开更多
Efficient spectrum resource allocation in wireless heterogeneous networks is important for improving the system throughput and guaranteeing the user's Quality-of-Service(QoS).In this paper,we propose an enhanced a...Efficient spectrum resource allocation in wireless heterogeneous networks is important for improving the system throughput and guaranteeing the user's Quality-of-Service(QoS).In this paper,we propose an enhanced algorithm for spectrum resource allocation in heterogeneous networks.First,the bandwidth of each user is determined by the user's rate demand and the channel state.Second,graph theory is enhanced and used to improve the spectrum efficiency.Third,spectrum resource is dynamically split between macrocell and femtocells with the changes of users' conditions.Our simulation results show that the proposed algorithm improves the system throughput significantly and also guarantees the fairness for the users.展开更多
A Prioritized Medium Access Control （P-MAC） protocol is proposed for wireless routers of mesh networks with quality-of-service provisioning. The simple yet effective design of P-MAC offers strict service differentia...A Prioritized Medium Access Control （P-MAC） protocol is proposed for wireless routers of mesh networks with quality-of-service provisioning. The simple yet effective design of P-MAC offers strict service differentiation for prioritized packets. A Markov model is developed to yield important performance matrices including the packet blocking probability due to queue overflow and the packet reneging probability due to delay bound. It is further proved that the service time of P-MAC approximates exponential distribution, and can be effectively estimated. The analytic models with preemptive and non-preemptive schemes, validated via simulations, show that P-MAC can effectively support traffic differentiation and achieve very low packet dropping （both reneging and blocking） probabilities when the traffic load is below the channel capacity. When the network is overloaded, P-MAC can still maintain extremely stable and high channel throughput. Moreover, it is demonstrated that P-MAC performs superior in multihop networks, further proving the advantages of the proposed protocol.展开更多
A scheduling algorithm for the edge nodes of optical burst switching (OBS) networks is proposed to guarantee the delay requirement of services with different CoS (Class of Service) and provide lower burst loss ratio a...A scheduling algorithm for the edge nodes of optical burst switching (OBS) networks is proposed to guarantee the delay requirement of services with different CoS (Class of Service) and provide lower burst loss ratio at the same time. The performance of edge nodes based on the proposed algorithm is presented.展开更多
基金supported by The Project funded by China Postdoctoral Science Foundation(Grant No.2018T110505,2017M611828)The Priority Academic Program Development(PAPD)of Jiangsu Higher Education Institutions。
文摘The exponentially increasing number of heterogeneous Internet of Things(Io T)devices(e.g.,Wi Fi and Zig Bee)crowed in the same ISM band(2.4 G)and recent advances in CrossTechnology Communications(CTC)motivate us to explore more efficient data collection and maximize network throughput.CTC enables Wi Fi and Zig Bee devices to communicate directly without any hardware changes or gateway equipment,which sheds light on a more efficient data collection design.In this work,we propose a distributed algorithm,named Max Bee,to compute the maximum network throughput,which is formulated as a linear programming problem.Considering that the problem turns out to be non-convex and hard to solve exactly,we propose a distributed algorithm to solve nonlinear programming by using the dual decomposition method and gradient/subgradient algorithms.Through extensive simulations on different sets of deployed Zig Bee and Wi Fi devices,we observe that the proposed algorithm significantly increases the network throughput based on CTC for Sensor Networks.
基金the Science & Technology Foundation of Huawei Ltd. (No.YJCB2005040SW)the Creative Foundation of Xidian University (No.05030).
文摘A layered network model for optical transport networks is proposed in this paper,which involves Internet Protocol(IP) ,Synchronous Digital Hierarchy(SDH) and Wavelength Division Mul-tiplexing(WDM) layers. The strategy of Dynamic Joint Routing and Resource Allocation(DJRRA) and its algorithm description are also presented for the proposed layered network model. DJRRA op-timizes the bandwidth usage of interface links between different layers and the logic links inside all layers. The simulation results show that DJRRA can reduce the blocking probability and increase network throughput effectively,which is in contrast to the classical separate sequential routing and resource allocation solutions.
基金supported by the National Basic Research Program of China(No.2011CB707000)the Foundation for Innovative Research Groups of the National Natural Science Foundation of China(No.61221061)
文摘With the rapid development of air transportation, network service ability has attracted a lot of attention in academe. Aiming to improve the throughput of the air route network （ARN）, we propose an effective local dynamic routing strategy in this paper. Several factors, such as the rout- ing distance, the geographical distance and the real-time local traffic, are taken into consideration. When the ARN is in the normal free-flow state, the proposed strategy can recover the shortest path routing （SPR） strategy. When the ARN undergoes congestion, the proposed strategy changes the paths of flights based on the real-time local traffic information. The throughput of the Chinese air route network （CARN） is evaluated. Results confirm that the proposed strategy can significantly improve the throughput of CARN. Meanwhile, the increase in the average flying distance and time is tiny. Results also indicate the importance of the distance related factors in a routing strategy designed for the ARN.
文摘The Novel Interconnection Network (NIN) based on inverted-graph topology and crossbar switch is a kind of lower latency and higher throughput interconnection network. But it has a vital disadvantage, high hardware complexity. In order to reduce system hardware cost, an improved NIN (ININ) structure is proposed. As same as NIN, ININ has constant network diameter. Besides of keeping advantages of NIN, hardware cost of ININ is lower than NIN. Furthermore, we design a new deadlock-free routing algorithm for the improved NIN. Key words NIN - ININ - inverted-graph interconnection network - hardware complexity - network band-width - network throughput CLC number TP 302 Foundation item: Supported by the National Natural Science Foundation of China (69873016)Biography: Li Fei (1974-), male, Ph. D candidate, research direction: architecture of interconnection network.
基金supported by the National Key Basic Research Program of China (973 Program)under Grant No. 2009CB320401the National Natural Science Foundation of China under Grants No. 61171099, No. 61101117+1 种基金the National Key Scientific and Technological Project of China under Grants No. 2012ZX03004005-002, No. 2012ZX03003-007the Fundamental Research Funds for the Central Universities under Grant No. BUPT2012RC0112
文摘This paper investigates the uplink throughput of Cognitive Radio Cellular Networks(CRCNs).As oppose to traditional performance evaluation schemes which mainly adopt complex system level simulations,we use the theoretical framework of stochastic geometry to provide a tractable and accurate analysis of the uplink throughput in the CRCN.By modelling the positions of User Equipments(UEs)and Base Stations(BSs)as Poisson Point Processes(PPPs),we analyse and derive expressions for the link rate and the cell throughput in the Primary(PR)and Secondary(SR)networks.The expressions show that the throughput of the CRCN is mainly affected by the density ratios between the UEs and the BSs in both the PR and SR networks.Besides,a comparative analysis of the link rate between random and regular BS deployments is concluded,and the results confirm the accuracy of our analysis.Furthermore,we define the cognitive throughput gain and derive an expression which is dominated by the traffic load in the PR network.
基金Supported by the National Natural Science Foundation of China (No. 60772062)973 Program (2007CB310607)+1 种基金National Science & Technology Key Project (2009ZX 03003-002, 2011ZX03001-006-02, 2011ZX03005-004-03)863 Program (2009AA01Z241)
文摘How to improve the performance of the wireless Ad Hoc network by utilizing the spectrum resources efficiently has become a hot research topic in recent years. In this paper we propose a reactive routing algorithm that supports multiple channels to improve the performance of the Ad Hoc network based on the minimizing of the channel handoff. Our approach allocates the communication channel during the route discovery, and notifies the allocated channel information to the corresponding node in the route reply packets. Each node in the route tries its best to choose the same channel with the upstream node without interference. The simulation results show that our algorithm performs better than the K-hop distinct protocols in both average delays and network throughputs
文摘Designing a multi-constrained QoS (Quality of service) communication protocol for mission-critical applications that seeks a path connecting source node and destination node that satisfies multiple QoS constrains such as energy cost, delay, and reliability imposes a great challenge in Wireless Sensor Networks (WSNs). In such challenging dynamic environment, traditional routing and layered infrastructure are inefficient and sometimes even infeasible. In recent research works, the opportunistic routing paradigm which delays the forwarding decision until reception of packets in forwarders by utilizing the broadcast nature of the wireless medium has been exploited to overcome the limitations of traditional routing. However, to guarantee the balance between the energy, delay and reliability requires the refinement of opportunistic routing through interaction between underlying layers known as cross-layer opportunistic routing. Indeed, these schemes fail to achieve optimal performance and hence require a new method to facilitate the adoption of the routing protocol to the dynamic challenging environments. In this paper, we propose a universal cross-layered opportunistic based communication protocol for WSNs for guaranteeing the user set constraints on multi-constrained QoS in low-duty-cycle WSN. Extensive simulation results show that the proposed work, Multi-Constrained QoS Opportunistic routing by optimal Power Tuning (MOR-PT) effectively achieves the feasible QoS trade-off constraints set by user by jointly considering the power control and selection diversity over established algorithms like DSF [1] and DTPC [2].
基金the National Natural Science Foundation of Chinaunder Grants No.61072068,No.61201137the State Key Program of National Natural Science Foundation of China under Grant No.61231008the National Research Foundation of Korea (NRF) Grant funded by the Korea government (MEST) under Grant No.2010-0018116
文摘Frame aggregation is a wireless link optimization mechanism that aims to reduce transmission overheads by sending multiple flames as the payload of a single MAC flame. It is considered as one of the most efficient methods to improve the wireless channel utilization and the throughput of wireless networks. The static assignment of frame aggregation parameters can result in delay penalties due to variations in traffic type. We propose a frame aggregation scheme which is based on dyn- amic pricing and queue scheduling for a multi- traffic scenario. The scheme adopts a dynamic differential pricing scheme for different types of traffic. Meanwhile, it polls buffer queues in accordance with the optimal aggregation wei- ght factors to maximise the network revenue. Simulation results indicate that the proposed frame aggregation scheme can effectively improve the network revenue and the average throughput, while guaranteeing the delay requirements of all types of traffic.
基金Supported by the Scientific Research Fund of Liaoning Province(L2013433)
文摘How to reduce interference among neighbor nodes in wireless mesh networks is still an important and key issue nowa- days. In this paper, an optimized channel assignment algorithm （OCA） is proposed to solve this problem based on link throughput and node priority. The effects of the numbers of network interface cards and channels on the network throughput are analyzed and evaluated, When there are seven of the numbers of both network interface cards and channels, the efficiency of utilizing network interface card and channel reaches highest. Compared with cen- tralized channel assignment algorithm （CCA）, the proposed algo- rithm has less packet loss rate and more network throughput sig- nificantly.
基金Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education(NRF-2021R1A6A1A03039493).
文摘Vehicle-to-grid technology is an emerging field that allows unused power from Electric Vehicles(EVs)to be used by the smart grid through the central aggregator.Since the central aggregator is connected to the smart grid through a wireless network,it is prone to cyber-attacks that can be detected and mitigated using an intrusion detection system.However,existing intrusion detection systems cannot be used in the vehicle-to-grid network because of the special requirements and characteristics of the vehicle-to-grid network.In this paper,the effect of denial-of-service attacks of malicious electric vehicles on the central aggregator of the vehicle-to-grid network is investigated and an intrusion detection system for the vehicle-to-grid network is proposed.The proposed system,central aggregator–intrusion detection system(CA-IDS),works as a security gateway for EVs to analyze andmonitor incoming traffic for possible DoS attacks.EVs are registered with a Central Aggregator(CAG)to exchange authenticated messages,and malicious EVs are added to a blacklist for violating a set of predefined policies to limit their interaction with the CAG.A denial of service(DoS)attack is simulated at CAG in a vehicle-to-grid(V2G)network manipulating various network parameters such as transmission overhead,receiving capacity of destination,average packet size,and channel availability.The proposed system is compared with existing intrusion detection systems using different parameters such as throughput,jitter,and accuracy.The analysis shows that the proposed system has a higher throughput,lower jitter,and higher accuracy as compared to the existing schemes.
基金supported in part by National Natural Science Foundation(61231008)Natural Science Foundation of Shannxi Province(2015JQ6248)+1 种基金National S&T Major Project(2012ZX03003005-005)the 111 Project (B08038)
文摘Efficient spectrum resource allocation in wireless heterogeneous networks is important for improving the system throughput and guaranteeing the user's Quality-of-Service(QoS).In this paper,we propose an enhanced algorithm for spectrum resource allocation in heterogeneous networks.First,the bandwidth of each user is determined by the user's rate demand and the channel state.Second,graph theory is enhanced and used to improve the spectrum efficiency.Third,spectrum resource is dynamically split between macrocell and femtocells with the changes of users' conditions.Our simulation results show that the proposed algorithm improves the system throughput significantly and also guarantees the fairness for the users.
基金Supported in part by the National Science Foundation CAREER Award (No. CNS-0347686)US Department of Energy (DoE) (No. DE-FG02-04ER46136)
文摘A Prioritized Medium Access Control （P-MAC） protocol is proposed for wireless routers of mesh networks with quality-of-service provisioning. The simple yet effective design of P-MAC offers strict service differentiation for prioritized packets. A Markov model is developed to yield important performance matrices including the packet blocking probability due to queue overflow and the packet reneging probability due to delay bound. It is further proved that the service time of P-MAC approximates exponential distribution, and can be effectively estimated. The analytic models with preemptive and non-preemptive schemes, validated via simulations, show that P-MAC can effectively support traffic differentiation and achieve very low packet dropping （both reneging and blocking） probabilities when the traffic load is below the channel capacity. When the network is overloaded, P-MAC can still maintain extremely stable and high channel throughput. Moreover, it is demonstrated that P-MAC performs superior in multihop networks, further proving the advantages of the proposed protocol.
文摘A scheduling algorithm for the edge nodes of optical burst switching (OBS) networks is proposed to guarantee the delay requirement of services with different CoS (Class of Service) and provide lower burst loss ratio at the same time. The performance of edge nodes based on the proposed algorithm is presented.
