This paper presents a new routing strategy by introducing a tunable parameter into the minimum information path routing strategy we proposed previously. It is found that network transmission capacity can be considerab...This paper presents a new routing strategy by introducing a tunable parameter into the minimum information path routing strategy we proposed previously. It is found that network transmission capacity can be considerably enhanced by adjusting the parameter with various allocations of node capability for packet delivery. Moreover, the proposed routing strategy provides a traffic load distribution which can better match the allocation of node capability than that of traditional efficient routing strategies, leading to a network with improved transmission performance. This routing strategy, without deviating from the shortest-path routing strategy in the length of paths too much, produces improved performance indexes such as critical generating rate, average length of paths and average search information.展开更多
The body channel based wireless power transfer(BC-WPT)method utilizes the human body as the medium to transfer power for bioelectronics,which can achieve a lower transmission loss due to its higher conductivity.Howeve...The body channel based wireless power transfer(BC-WPT)method utilizes the human body as the medium to transfer power for bioelectronics,which can achieve a lower transmission loss due to its higher conductivity.However,except for the channel length,different on-body loca-tions of the transmitter and receiver also influence the power supply performance.This paper fo-cuses on the wrist-to-forehead path to show the potential of BC-WPT for the brain bioelectronics such as the brain computer interface device.The channel characteristics from 10 MHz to 60 MHz are measured by a vector network analyzer(VNA)and a prototype BC-WPT system with differ-ent copper electrodes and the lowest power loss locates between-22 dB and-33 dB.Furthermore,the minimum path loss limit is simulated in Advanced Design System(ADS)software and the low-est optimum path loss can reach nearly-13 dB.Finally,a rectifier circuit is also built at the receiv-er side to harvest d.c.voltage.The results show that the open-circuit voltage(OCV)can reach 1.75 V with the transmitter of 50Ωoutput impedance supplying 5V_(pp)sine voltage at 60 MHz when adopt-ing 1 cm-diameter circular electrodes.展开更多
This paper presents an algorithm for solving Bi-criteria Minimum Cost Dynamic Flow (BiCMCDF) problem with continuous flow variables. The approach is to transform a bi-criteria problem into a parametric one by building...This paper presents an algorithm for solving Bi-criteria Minimum Cost Dynamic Flow (BiCMCDF) problem with continuous flow variables. The approach is to transform a bi-criteria problem into a parametric one by building a single parametric linear cost out of the two initial cost functions. The algorithm consecutively finds efficient extreme points in the decision space by solving a series of minimum parametric cost flow problems with different objective functions. On each of the iterations, the flow is augmented along a cheapest path from the source node to the sink node in the time-space network avoiding the explicit time expansion of the network.展开更多
基金Project supported by the National Natural Science Foundation of China (Grant No. 60972165)the National High Technology Project of China (Grant No. 2007AA11Z210)+2 种基金the Doctoral Fund of Ministry of Education of China (Grant Nos. 20100092120012,20070286004)the Foundation of High Technology Project in Jiangsu Province,the Natural Science Foundation of Jiangsu Province(Grant No. BK2010240)the Special Scientific Foundation for the"Eleventh-Five-Year" Plan of China
文摘This paper presents a new routing strategy by introducing a tunable parameter into the minimum information path routing strategy we proposed previously. It is found that network transmission capacity can be considerably enhanced by adjusting the parameter with various allocations of node capability for packet delivery. Moreover, the proposed routing strategy provides a traffic load distribution which can better match the allocation of node capability than that of traditional efficient routing strategies, leading to a network with improved transmission performance. This routing strategy, without deviating from the shortest-path routing strategy in the length of paths too much, produces improved performance indexes such as critical generating rate, average length of paths and average search information.
文摘The body channel based wireless power transfer(BC-WPT)method utilizes the human body as the medium to transfer power for bioelectronics,which can achieve a lower transmission loss due to its higher conductivity.However,except for the channel length,different on-body loca-tions of the transmitter and receiver also influence the power supply performance.This paper fo-cuses on the wrist-to-forehead path to show the potential of BC-WPT for the brain bioelectronics such as the brain computer interface device.The channel characteristics from 10 MHz to 60 MHz are measured by a vector network analyzer(VNA)and a prototype BC-WPT system with differ-ent copper electrodes and the lowest power loss locates between-22 dB and-33 dB.Furthermore,the minimum path loss limit is simulated in Advanced Design System(ADS)software and the low-est optimum path loss can reach nearly-13 dB.Finally,a rectifier circuit is also built at the receiv-er side to harvest d.c.voltage.The results show that the open-circuit voltage(OCV)can reach 1.75 V with the transmitter of 50Ωoutput impedance supplying 5V_(pp)sine voltage at 60 MHz when adopt-ing 1 cm-diameter circular electrodes.
文摘This paper presents an algorithm for solving Bi-criteria Minimum Cost Dynamic Flow (BiCMCDF) problem with continuous flow variables. The approach is to transform a bi-criteria problem into a parametric one by building a single parametric linear cost out of the two initial cost functions. The algorithm consecutively finds efficient extreme points in the decision space by solving a series of minimum parametric cost flow problems with different objective functions. On each of the iterations, the flow is augmented along a cheapest path from the source node to the sink node in the time-space network avoiding the explicit time expansion of the network.
