3. CR parameters and Multi-Objective Fitness Function

Size: px
Start display at page:

Download "3. CR parameters and Multi-Objective Fitness Function"

Transcription

1 3 CR parameters and Mult-objectve Ftness Functon CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft of the exstng RF envronment. The desgn of the rado lnk for a partcular network confguraton and geographc based on multple parameters that are non-lnearly lnked. For example, operatng frequency, sgnal-to-nose rato, dfferent antenna types, data rate, transmtter power, modulaton scheme and nterference levels are a few of the parameters that should be consdered whle desgnng an rado lnk. These parameters are related to each other and have non-lnear and lnear lnked relatonshps and are dependent on mult-path fadng, nterference levels, and network topology. Fgure 3.1 Drected graph ndcatng how one objectve affects another objectve.

2 3 CR parameters and Mult-objectve Ftness Functon 42 Demandng a real-tme optmal soluton for these parameter values s an extremely complcated and trcky task. The result for each of the objectve managng these parameters vares and overlaps among each other and thus one objectve (source) affects another objectve (target) as shown n Fgure 3.1. In CR system desgnng, a several parameters as nputs must be descrbed. The decsons accuracy made by an AI technque are depends upon the qualty and amount of nputs to the system. More nputs to the system formulate the rado more knowledgeable, therefore permttng the decson makng process to produce decsons that are more precse. The decson varables are () at the physcal layer: modulaton and transmsson power order for each sub-carrer; () at the MAC layer: mnmum and maxmum contenton wndows szes, frame sze; () at the network layer: ndex of the assocated access pont and varable transmsson range [Alexandre de Baynast et al., Pages ]. A goal s to defne a set of decson varables concernng the CR physcal layer only and other layers are out of scope through out n ths thess. There are two sets of nputs to the system: transmsson parameters and envronmental parameters are dscussed n followng secton Transmsson Parameters In the CR system, decson varables correspond to the transmsson parameters that can be handled by the CR system that takes beneft of the SDR that controls the parameters, whch are nput to a ftness functon along wth the objectves, and envronmental parameters. The ftness functon provdes a value that represents optmal parameters for the specfed objectves. Ftness functons to be used by CR technques need a specfc lst of transmsson parameters that should be accessble to

3 3 CR parameters and Mult-objectve Ftness Functon 43 the system. These transmsson parameters are equvalent to the parameters that are controlled by SDR mechansm. Table 3.1 Lsts of Transmsson Parameters Parameters Transmt Power (P) Modulaton Type (Mod) Modulaton order (M) Bandwdth (B) Packet Sze (L) Symbol Rate (R s ) Descrpton Raw transmsson power Type of modulaton format Number of symbols for gven modulaton format Bandwdth of transmsson sgnal n Hz Transmsson packet sze n bytes Number of symbols per second The parameters selected based on lteratures cted as transmsson or rado parameters used by CRs [J. F. Haurs, pp , T. Chrstan James Reser s Dssertaton]. The transmsson or rado/antenna parameters nclude values that affect to rado performance and the complete lst of parameters used n ths thess to create a ftness functon s shown n Table Envronmental parameters The envronmental parameters are assocated to network layout and geographc topology. Envronmental measurements update the system of the surroundng envronment characterstcs. These parameters are nformaton concernng the exstng wreless envronments that are used as nputs to the CR system. These characterstcs may nclude nternal nformaton about the rado n use state, and perpheral nformaton representng the wreless channel envronment. The envronmental

4 3 CR parameters and Mult-objectve Ftness Functon 44 varables can be dvded nto two groups. The frst envronment varables that are drectly used by the ftness functon as key parameters to the functon. For example, the parameter of nose power of the channel whch s used n the mnmze BER. These parameters drectly mpact the ftness score of the partcular objectve functon. The second envronment parameters are observed by the CR system, and decsons regardng the objectve functon depend upon ther values. Table 3.2 Lsts of Envronmental Parameters Parameters Bt-Error-Rate (BER) Sgnal-to-nose rato (SNR) Nose power (N) Battery Status Power Utlzaton Descrpton Total bts have errors relatve to transmtted bts Rato of the sgnal power to the nose power Magntude n db of the nose power Predctable energy left n batteres Power utlzaton of present confguraton. For example battery status parameter, n ths regard the system may be observng ths parameter whle s reduces below a specfc threshold, the system may alter the weghtng on the objectve functons so as to provde the mnmze power consumpton. Decson-makng n CR engne to formulate a defnte output, the exstng wreless envronment should be modeled nternally. Ths model s formed wth envronmentally sensed data receved by the CR system by a perpheral sensor. Several sensors exst to detect characterstcs of the wreless envronment. The envronmental data also used to form the transmsson parameters and the wreless channel, performance objectves. The envronmental parameters lst used are shown n Table 3.2. All parameters dscussed as above wll utlzed n mult-objectve optmzaton and ts concept s explored n next followng secton.

5 3 CR parameters and Mult-objectve Ftness Functon Mult-Objectve Optmzaton Concepts Optmzaton problems are normally stated n a sngle-objectve way. In other words, the process must optmze a sngle-objectve functon complyng wth a seres of constrants that are based on constrants gven by the real world. A sngle-objectve optmzaton problem may be stated as follows [Mult-Objectve Optmzaton n Computer Networks Usng Metaheurstcs, by Auerbach]: Optmze [mnmze/maxmze] subject to y f ( x) (3.1) H ( x) 0 G( x) 0 In ths case, the functon to be optmzed (mnmze or maxmze) s f ( x ) vector x s the set of ndependent varables. Functons H ( x ) and G( x ) constrants of the model. where are the For ths problem we can defne three sets of solutons:. The unversal set whch n ths case are all possble values of x, whether feasble or non- feasble.. The set of feasble solutons whch are all the values of x that comply wth the H ( x ) and G( x ) constrants. In the real world, these varables would be all possble solutons that can be performed.

6 3 CR parameters and Mult-objectve Ftness Functon 46. The set of optmal solutons whch are those values of x that, n addton to beng feasble, comply wth the optmal value (mnmum or maxmum) of functon ( ) f x whether n a specfc, a b nterval or n a global, context. In ths case, one says that the set of optmal solutons may consst of a sngle element or several elements, provded that the followng characterstc s met: f x f x ', where x x '. In ths case there are two optmal values to the problem when vector x { x, x '}. But n real lfe, t s possble that when we want to solve a problem, ths may need to optmze more than one objectve functon. When ths happens, ths s referred to mult-objectve optmzaton. In general, a mult-objectve ftness functon problem can be presented as tryng to determne the correct records of a set of m parameters to a set of n objectves. A mult-objectve optmzaton model may be stated as follows: Optmze [mnmze/maxmze] F( x) { f ( x), f ( x),..., f ( x)} 1 2 n (3.2) subjected to H ( x) 0 G( x) 0 x ( x, x, x,..., x ) X m

7 3 CR parameters and Mult-objectve Ftness Functon 47 In ths case, the functons to be optmzed (whether mnmze or maxmze) are the set of functons F( x ), where the vector x s the set of ndependent varables and X s the parameter space. Functons H ( x ) and G( x ) are the constrants of the model. In a mult-objectve evolutonary algorthm, each f ( x ) corresponds to the ftness functon for a sngle objectve. The purpose s to merge them to obtan a sngle ftness functon, F( X ), consderng wth all objectve and parameters. In real world, problem such optmzaton technques dscussed n ths thess, the solutons found; objectve solutons even when they are conflctng, that s, when mnmzng one functon may worsen other functons. For example, mnmzng BER and mnmzng power smultaneously generate a dvergence because of the sngle parameter.e. transmt power, whch affects each objectve n a dfferent manner. Obtanng the optmal set of decson varables for a sngle objectve as mnmze power, often outcome n a non-optmal set wth respect to other objectves, e.g. mnmze BER and maxmze throughput. The optmal set for mult-objectve functons placed s known as the Pareto optmal front [ZHOU et al., E. Ztzler and L. Thele, pp , 1999]. Ths front corresponds to the set of solutons that cannot be enhanced upon n any measurement. The results on the Pareto front are best and co-exst due to the tradeoffs among the mult-objectves. A typcal plot of a Pareto front, usng a smple CR parameter state s shown n Fgure 3.2. The y-axs represents the score of the sngle objectve ftness functon for BER n the case of several modulaton types, whle the x-axs s the score for the rato of the energy per bt (E b ) to the nose power spectral densty (N 0 ). The parameter x corresponds to the decson vector of varable used as nputs to the ftness functons.

8 3 CR parameters and Mult-objectve Ftness Functon BER QPSK BPSK QAM Eb/No (db) Fgure 3.2 Pareto Front trade-off. Here, transmt power and modulaton was used as decson parameters. For every curve, as the ftness score for BER objectve decreases, the value for the Eb / N 0 ncreases. Ths trade-off has to be made by usng mult-objectve optmzaton. The ftness functons used for ths model are derved n Secton 3.2. In ths thess, ftness functons usng the defned set of parameters has been developed, that are used by CR engnes to establsh a sngle optmal transmsson parameter result. In Fgure 3.2, some parameter sets le on the Pareto front, but the ftness functon have to provde a search drecton that drects the system to a sngle resoluton. There are several methods that can be used to solve mult-objectve problems usng sngle-objectve approxmatons. Some of them are weghted sum, ε-constrant, weghted metrcs, Benson, and mn-max, among others [Mult-Objectve Optmzaton n Computer Networks Usng Metaheurstcs by Auerbach]. All of these methods try to fnd the

9 3 CR parameters and Mult-objectve Ftness Functon 49 optmal Pareto front usng dfferent approxmaton technques. Ths thess uses a weghted sum optmzaton method, whch conssts of creatng a sngle-objectve model by weghng the n objectve functons by assgnng a weght to each the functons. Ths method appears well wth the CR development snce t provdes a sutable procedure for applyng weghts to the objectves. Through the weghted sum method, the mult-objectve model (3.3) can be restated n the followng way: Optmze [mnmze/maxmze] n F( X ) w. f ( X ) (3.3) 1 subjected to H ( X ) 0 G( X ) 0 0 w 1, {1, 2,... n} n 1 w 1 In ths case one can see that each functon s multpled by a weght ( w ) whose value must be found between 0 and 1. Also, the sum of all the weghts appled to the functon must be 1. An analyss of ths type of soluton shows that functon F( X ) obtaned from the sum s a lnear combnaton of the functons f ( X ). What the weghted sum method does exactly s fnd the ponts of the optmal Pareto front, whch conssts of all the optmal solutons n the mult-objectve optmzaton, through

10 3 CR parameters and Mult-objectve Ftness Functon 50 the combnatons gven by the weghted vector W { w1, w2,... w n }. For example, n the case of two objectve functons would have the followng equaton. F( X ) w. f w. f Once the weghtng each objectve the value of weght s nvarable, thus the search drecton of the evolutonary algorthm s fxed. Ths s the proposed to fnd a sngle optmal result for a specfed envronment. However, varyng the objectve weghtng then the ftness functon wll nstantly nvoke the evolutonary algorthm to navgate a new soluton. For example, f a rado has to operate n a mnmze BER mode. In ths mode, the ftness functon wll gve hgher value to sets of parameter provded that a hgh transmt power, because the weght on the objectve of mnmze BER s the largest as shown n Fgure 3.2. In the case when the rado detects low battery power, t swtches the objectve weghtng to reproduce a mnmzng transmtted power. Ths s made by decreasng the weghts on other assocated objectves at the same tme as ncreasng the weght of the objectve of mnmze power. Once the weghts change, the ftness functon wll mmedately start gvng hgher scores to those parameter sets, whch offer lower power transmsson. Ths s the man characterstc that allows the objectve weghtng to order the rado goal state. DSA can be acheved by nstantaneously swtch operatng goals by just modfyng the vector of objectve weghtng.

11 3 CR parameters and Mult-objectve Ftness Functon Cogntve Rado Objectves The envronment of wreless communcatons requres some desrable objectves that the rado system would lke to acheve. T. Chrstan James Reser, reports usng GA s to resolve the optmzaton of wreless channel models and certan characterstcs of the wreless communcaton system. Based on ths work t was determned that a Ftness Measure (Ftness Functon or Cost Functon) requred to be derved. Ths thess defnes four objectves for the ftness functons n order to drect the system to a best possble state are gven n Table 3.3. Nowadays, n communcaton system, mnmzng the BER s a common goal n wreless world. Ths objectve mnmzes the amount of errors wth respect to the amount of bts beng sent and mproves the communcatons sgnal of the rado. Maxmzng the throughput correspond to the system s data throughput rate, ths objectve enhanced the system throughput. Table 3.3 Objectve Functon of CR. Ftness objectve Mnmze BER Maxmze Throughput Mnmze Power Utlzaton Mnmze Interference Descrpton Recover the on the whole BER/PER of the transmsson envronment. Increase the on the whole data throughput transmtted by the rado. Reduce the amount of power utlzed by the system. Reduce the rados nterference contrbutons. Mnmze power utlzaton s easy to understand and s used to drect the CR to a stuaton of mnmal power utlzaton. Mnmzng nterference objectve are used to

12 3 CR parameters and Mult-objectve Ftness Functon 52 avod overlappng transmssons wth other users that causes nterference. The proposed CR engne model has been shown n Fgure 3.3. CR Engne Envronmental Parameters Transmsson Parameters Decson-Makng (Evaluatng Ftness Functon) Operatng Modes (.e. Emergency Mode, Multmeda Mode, Low Power Mode, DSA Mode, etc.) Fgure 3.2 Typcal CR Engne Model Trade-off analyss between maxmzng throughput, mnmzng probablty of bt error, mnmzng power utlzaton and maxmze spectral effcency has been explored n chapter-4 of ths thess. The ftness functon has to descrbe the tradeoffs between each objectve by rankng the objectves accordng to ts mportance. Ths thess uses a weghted sum technque where each objectve be gven a weght on behalf of ts mportance [Mult-Objectve Optmzaton n Computer Networks Usng Metaheurstcs by Auerbach, Cogntve Rado Technology by Bruce Fette, J. F. Haurs pp ]. Ths method s selected because of the smplcty of mplementaton of mult-objectve optmzaton wthn the GA and PSO technque. Last secton defnes four CR objectves for requred system: relablty, throughput, power consumpton and spectral nterference. Next, defnng the resultant objectve functons of base-10 GA, PSO and hybrd (of these two) mplementaton n

13 3 CR parameters and Mult-objectve Ftness Functon 53 order to drect the system to an optmal condton. In order to make easy the selecton of the weghts of the objectve functons, normalzng each objectve functon score to the range [0, 1]. The mplementatons of four objectve functons are as follows: 1) Mnmze Bt-Error-Rate: The majorty n wreless communcaton systems s to obtan an error free sgnal, or to mnmze the BER of the transmsson n order to relablty. Determnng the theoretcal BER based on numerous transmsson parameters ncludes the transmt power, bandwdth, modulaton type, modulaton ndex and nose power. The most essental thng n determnng the BER s the modulaton and channel type n use. Every modulaton and channel type combnaton uses a dfferent method to conclude the BER of the system. One more vtal factor n determnng the BER of the system s the Eb / N 0 rato. Ths rato bascally s a measure of the quantty of energy per bt to the quantty of nose power n the system, or on the SNR bass. To determne the Eb / N 0 rato, denoted as, usng the receved power of sgnal, S that s determned by the transmtted sgnal power and path loss, shadowng and mult-path fadng as descrbed n [Wreless communcatons, Anderea Goldsmth]. From S, one can get the quantty of energy per symbol S / R s (=E s ) by usng the symbol rate R s. For a alphabet of sgnalng wth M alternatve symbols, each symbol represents k = log 2 M bts. k s the modulaton effcency measured n bts/symbol or bts per channel use (bpcu ). The energy per bt (E b ) can be obtaned by dvdng by the number of bts n each symbol as S Eb (W/b) (3.4) R k s

14 3 CR parameters and Mult-objectve Ftness Functon 54 The sngle-sded nose power spectral densty (W/Hz) s calculated by Boltzmann s equaton. N k T (J) (3.5) 0 b N N B (3.6) 0 Where 23 kb J / K (Boltzmann s constant), T s the nose temperature (290K), B s bandwdth of the channel, and N s the total computed nose power. The ultmate equaton for the value of that the BER functons utlzed s gven by: E b S S B 10log10 10log10 N0 RskN0 Rsk N S B 10 log 10 log ( db) N Rsk (3.7) The followng equatons gve the BER of BPSK, M-ary PSK and M-ary by assumng an AWGN channel model wth gray-coded bt assgnment [J. G. Proaks, Dgtal Communcatons]. For a BPSK sgnal constellaton, the bt error probablty s gven as be P Q (3.8) For M-ary PSK, the bt error probablty s defned as 2 Pbe Q 2k sn k M (3.9)

15 3 CR parameters and Mult-objectve Ftness Functon 55 And M-ary QAM, the bt error probablty s gven as P be 4 1 3k 1 Q k M M 1 (3.10) Lastly, Probablty of Packet-error (PER) s gven as [ P pe 1 (1 P ) L (3.11) be Suppose that the bt errors are ndependent of each other. For small bt error probabltes, ths s approxmated as P pe ( P ) L (3.12) be Therefore, probablty of bt-error can be determned form gven probablty of packet-error usng (3.11) and (3.12). One feasble objectve functon for defnng the relablty of the system s: f mn_ ber log(0.5) 1 (3.12) log( P ) be Where P be s the average probablty of bt error (BER) for a specfed modulaton system over N c ndependent sub-carrer. Ths objectve functon, whch was orgnally proposed by [Newman et al.], however, t does not ft well wth the common QoS requrement whch s based on a maxmum acceptable BER or PER and over ths threshold, the communcaton s nterrupted. In ths concern, a objectve functon for the relablty of the transmsson ensures that PER s equal to or lower than a target

16 3 CR parameters and Mult-objectve Ftness Functon 56 PER represented as PER * [Alexandre de Baynast et al., Pages ]. However, equaton of ths objectve functon stll havng error and modfed specfcally as, f mn_ ber * log10 max( PER, PER) 1, 1 1. * log10 max( PER, PER) * log 10( PER ) 1, otherwse. * log 10( PER ) (3.13) Ths objectve functon penalzes f PER * PER and mn_ ber 0 f, f PER * PER, also guarantee that value of the f mn_ ber wll be fall n range [0, 1] and t was not n the case of paper [Alexandre de Baynast et al., Pages ] QPSK BPSK QAM PER BER Fgure 3.4 A plot of bt-error-rate vs. packet-error-rate usng (3.11).

17 3 CR parameters and Mult-objectve Ftness Functon 57 However, choose 10 5 to be the best-case BER n order to zero PER as shown n Fgure 3.4 and all nvestgatonal values seen lower ths value wll be rounded up to ) Maxmze Throughput: Ths ncreases the overall data throughput transmtted by the rado. At the physcal layer, the pulse duraton T and that ts bandwdth B s approxmately equal to the recprocal of T. Thus, B=1/T and, T=k/R b = log 2 (M)/R, t s follow that, R b B (3.14) log 2 M Therefore, as M s ncreased, the channel bandwdth requred, when the bt rate R b s fxed, decreases. For mult-carrer sgnal T can be expressed n number of bts per N c symbol perod as T log 2( M ) / N, c where N c ndcate the total number of 1 channels that SU operates on t, where = 1,... N c, and N c beng the upper lmt of channels that a SU wll be operate on, M s the order of modulaton emtted on subcarrer, M max s the maxmum modulaton order wth typcal values 64 or 256 n wreless networks. M can take values from 1 to M max wth 1 specal case occurrng when sub-carrer s shut down. M = 1 means that the rate log 2 ( M ) s equal to zero; no nformaton s transmtted. In ths partcular case, the correspondng transmsson power P s set to zero. In ths partcular, 0 T log2 M max, where the value log 2 ( M ) s acheved when all sub-carrers are loaded wth symbols modulated wth the largest avalable modulaton order. Therefore, the objectve functon for the throughput s smply:

18 3 CR parameters and Mult-objectve Ftness Functon 58 f N 1 c 1 log ( M ) (3.15) max_ throughput 2 Nc log 2 ( M max ) 1 The functon f max_throughput s equal to 0 when all sub-carrers transmt wth largest modulaton order and equal to 1 when all sub-carrers are swtched off. 3) Mnmze Power Consumpton: Ths objectve functon decreases the amount of transmsson power and gven by f mn_ power Nc 1 P N P (3.16) c max 1 Where N c ndcate the total number of channels that SU operates on t, where = 1,... N c. where N c ndcate the total number of channels that SU operates on t. P s the transmsson power on sub-carrer takes values range [P mn, P max ] and P max s the maxmum possble transmsson power for a sngle sub-carrer. P can takes values zero,.e., no transmsson on sub-carrer f the channel fadng coeffcent n ths band s smaller than a pre-determned threshold [Alexandre de Baynast et al., Pages ]. In other words, f mn_ power 1, all subcarrers are transmttng wth P max. 0, all subcarrers are transmttng wth P mn. 4) Mnmzng nterference: Ths s an essental objectve n shared frequency bands. For example, ths objectve may be gven a hgh weghtng by a SU that operates spectrum n a PU band. Here, the PU has man concern n a partcular band of frequency and on the other hand SUs are permtted to transmt n the band gven causng no nterference to the PUs. Rado parameters such as bandwdth (B) and transmt power (P) are used to determne the estmated amount of spectral nterference

19 3 CR parameters and Mult-objectve Ftness Functon 59 produced by transmsson. Overlappng transmssons wth other users causes nterference. Ideally, to compute the total nterference, ntegratng over the spectral bandwdth that transmtted, and get the total power of overlappng transmssons. In ths thess, t has been assumed unform power transmsson over the bandwdth of transmsson permttng to obtan the nterference equaton gven by, fnt erference P B (3.17) As ncrease n nterference the bandwdth ncreases and, nterference s ncreases as the transmt power of the transmtter ncreases. Thus, ncreased n spectral leakage and more power nterfere wth another system. The normalzed spectral nterference s gven by, N 1 c fmn_ nt erference ( P B) (3.18) N P B c max max 1 Ths objectve functon s defned as, f fmn_ nt 1, then subjected to maxmum erference nterference, when fmn_ nt erference 0 then, there s no nterference or mnmum nterference Mult-Objectve goals The weghted sum approach permtted to merge the sngle objectve functons nto one cumulatve mult-objectve functon. Equaton (3.19) llustrates that each objectve s multpled by a weght w and added smultaneously to gve a sngle value that are equvalent to the value of a parameter set. The weghted sum approach

20 3 CR parameters and Mult-objectve Ftness Functon 60 attempts to mnmze the sum of the absolutely normalzed, weghted, sngle objectve scores of the parameter set soluton. The mult-objectve functon for mult-carrers can be obtaned n forms of sngle objecton functon by use of weghted sum approach that provde sngle scalar value usng four objectves (3.13), (3.15), (3.16) and (3.18) as, F w f w f w f w f (3.19) 1 mn_ ber 2 max_ throughput 3 mn_ ower 4 mn_nt erference Where, w1, w2, w3, w4 are the weghtng values that decde the search drecton for the evolutonary algorthm (EA). Ths technque suts the cogntve rado state as shown by Newman et al., snce t provdes a sutable process for applyng weghts to the objectves. As the weghtng for each objectve s constant, the search drecton of the EA s unchangng as example shown n Table 3.4. Ths s the preferred property when demanded to dscover a sngle optmal soluton for a partcular envronment. Varyng the objectve drecton of the ftness functon needs just a smple change of the weghtng vector. Table 3.4 Example Weghtng Scenaros. Scenaros Weght Vector w, w, w, w Mnmze BER (Emergency Mode) [0.70, 0.10, 0.10, 0.10] Maxmze Throughput (Multmeda Mode) [0.15, 0.60, 0.10, 0.15] Mnmze Power (low power mode) [0.10, 0.20, 0.55, 0.15] Mnmze Interference (DSA Mode) [0.10, 0.20, 0.10, 0.60] Usng the weght vectors shown n Table 3.4 and CR engne has been generated base- 10 GA and PSO convergence results by use of the ftness functons and s presented n Chapter 4.

21 3 CR parameters and Mult-objectve Ftness Functon Summary Ths chapter explores a precse lst of common parameters for CR. These parameters contan envronmentally consdered parameters from sensors nsde the CR system, and operaton of nternal nformaton on condtons that measurement concernng the nternal state of the rado. Ths nformaton s used n combnaton wth the CR objectves to decde the sutable transmsson parameters to use by SU. A multobjectve problem contans complextes whle all objectves are tryng to be acheved at once upon a tme. The man complexty s to fnd the trade-offs between the parameters of the mult-objectves. Ths work defnes four performance CR objectves for a SU n whch varous objectves overlapped as consder to maxmzng ther performance. All ftness functon used n ths thess to optmze QoS performance has been lsted n the Table gven below. Ftness Functon Mnmze BER f mn_ ber Table 3.5 Ftness Functon of Cogntve Rado. * log10 max( PER, PER) Functon Dervaton * log10 max( PER, PER) 1, 1 1. * log 10( PER ) 1, otherwse. * log 10( PER ) N Maxmze 1 c fmax_ throughput 1 log 2( ) Throughput M Nc log 2 ( M max ) 1 Mnmze Nc 1 Power fmn_ power P Utlzaton NcPmax 1 Mnmze Interference Sngle Functon for mult objectve N 1 c fmn_ nt erference ( P B) N P B c max max 1 F w f w f w f w f 1 mn_ ber 2 max_ throughput 3 mn_ ower 4 mn_nt erference

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis of Collaborative Distributed Admission Control in x Networks 1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

QoS-aware routing for heterogeneous layered unicast transmissions in wireless mesh networks with cooperative network coding

QoS-aware routing for heterogeneous layered unicast transmissions in wireless mesh networks with cooperative network coding Tarno et al. EURASIP Journal on Wreless Communcatons and Networkng 214, 214:81 http://wcn.euraspournals.com/content/214/1/81 RESEARCH Open Access QoS-aware routng for heterogeneous layered uncast transmssons

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION 24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

Routing in Degree-constrained FSO Mesh Networks

Routing in Degree-constrained FSO Mesh Networks Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng

More information

Network Coding as a Dynamical System

Network Coding as a Dynamical System Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.

More information

QoS-aware composite scheduling using fuzzy proactive and reactive controllers

QoS-aware composite scheduling using fuzzy proactive and reactive controllers Khan et al. EURASIP Journal on Wreless Communcatons and Networkng 2014, 2014:138 http://jwcn.euraspjournals.com/content/2014/1/138 RESEARCH Open Access QoS-aware composte schedulng usng fuzzy proactve

More information

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract 12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,

More information

MobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks

MobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks MobleGrd: Capacty-aware Topology Control n Moble Ad Hoc Networks Jle Lu, Baochun L Department of Electrcal and Computer Engneerng Unversty of Toronto {jenne,bl}@eecg.toronto.edu Abstract Snce wreless moble

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Cognitive Radio Resource Management Using Multi-Agent Systems

Cognitive Radio Resource Management Using Multi-Agent Systems Cogntve Rado Resource Management Usng Mult- Systems Jang Xe, Ivan Howtt, and Anta Raja Department of Electrcal and Computer Engneerng Department of Software and Informaton Systems The Unversty of North

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Online Policies for Opportunistic Virtual MISO Routing in Wireless Ad Hoc Networks

Online Policies for Opportunistic Virtual MISO Routing in Wireless Ad Hoc Networks 12 IEEE Wreless Communcatons and Networkng Conference: Moble and Wreless Networks Onlne Polces for Opportunstc Vrtual MISO Routng n Wreless Ad Hoc Networks Crstano Tapparello, Stefano Tomasn and Mchele

More information

SciFed Journal of Telecommunication Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network

SciFed Journal of Telecommunication Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network Ismal Abdullah,, 2017, 1:1 ScFed Journal of Telecommuncaton Research Artcle Open Access Sngle Ftness Functon to Optmze Energy usng Genetc Algorthms for Wreless Sensor Network *1 Ismal Abdullah, 2 Kald

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Optimal Scheduling of Capture Times in a Multiple Capture Imaging System

Optimal Scheduling of Capture Times in a Multiple Capture Imaging System Optmal Schedulng of Capture Tmes n a Multple Capture Imagng System Tng Chen and Abbas El Gamal Informaton Systems Laboratory Department of Electrcal Engneerng Stanford Unversty Stanford, Calforna 9435,

More information

SAO: A Stream Index for Answering Linear Optimization Queries

SAO: A Stream Index for Answering Linear Optimization Queries SAO: A Stream Index for Answerng near Optmzaton Queres Gang uo Kun-ung Wu Phlp S. Yu IBM T.J. Watson Research Center {luog, klwu, psyu}@us.bm.com Abstract near optmzaton queres retreve the top-k tuples

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks

Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks RESEARCH Open Access Performance analyss of dstrbuted cluster-based MAC protocol for multuser MIMO wreless networks Azadeh Ettefagh *, Marc Kuhn, Celal Eşl and Armn Wttneben Abstract It s known that multuser

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

A Saturation Binary Neural Network for Crossbar Switching Problem

A Saturation Binary Neural Network for Crossbar Switching Problem A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

ARTICLE IN PRESS. Signal Processing: Image Communication

ARTICLE IN PRESS. Signal Processing: Image Communication Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

THere are increasing interests and use of mobile ad hoc

THere are increasing interests and use of mobile ad hoc 1 Adaptve Schedulng n MIMO-based Heterogeneous Ad hoc Networks Shan Chu, Xn Wang Member, IEEE, and Yuanyuan Yang Fellow, IEEE. Abstract The demands for data rate and transmsson relablty constantly ncrease

More information

Voice capacity of IEEE b WLANs

Voice capacity of IEEE b WLANs Voce capacty of IEEE 82.b WLANs D. S. Amanatads, V. Vtsas, A. Mantsars 2, I. Mavrds 2, P. Chatzmsos and A.C. Boucouvalas 3 Abstract-There s a tremendous growth n the deployment and usage of Wreless Local

More information

A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics

A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics A Hybrd Genetc Algorthm for Routng Optmzaton n IP Networks Utlzng Bandwdth and Delay Metrcs Anton Redl Insttute of Communcaton Networks, Munch Unversty of Technology, Arcsstr. 21, 80290 Munch, Germany

More information

A Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks

A Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks A Sem-Dstrbuted oad Balancng Archtecture and Algorthm for Heterogeneous reless Networks Md. Golam Rabul Ala Choong Seon Hong * Kyung Hee Unversty, Korea rob@networkng.khu.ac.kr, cshong@khu.ac.kr Abstract

More information

Efficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications

Efficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications Effcent Loa-Balance IP Routng Scheme Base on Shortest Paths n Hose Moel E Ok May 28, 2009 The Unversty of Electro-Communcatons Ok Lab. Semnar, May 28, 2009 1 Outlne Backgroun on IP routng IP routng strategy

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks 2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng

More information

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems

More information

Real-Time Guarantees. Traffic Characteristics. Flow Control

Real-Time Guarantees. Traffic Characteristics. Flow Control Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

Transmit Power Control Algorithms in IEEE h Based Networks

Transmit Power Control Algorithms in IEEE h Based Networks Transmt Power Control Algorthms n IEEE 82.h Based Networks Andreas J. Könsgen, Zakr Hossan, Carmelta Görg Department of Communcaton Networks Center for Informaton and Communcaton Technology (IKOM) Unversty

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Internet Traffic Managers

Internet Traffic Managers Internet Traffc Managers Ibrahm Matta matta@cs.bu.edu www.cs.bu.edu/faculty/matta Computer Scence Department Boston Unversty Boston, MA 225 Jont work wth members of the WING group: Azer Bestavros, John

More information

NGPM -- A NSGA-II Program in Matlab

NGPM -- A NSGA-II Program in Matlab Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...

More information

EFT: a high throughput routing metric for IEEE s wireless mesh networks

EFT: a high throughput routing metric for IEEE s wireless mesh networks Ann. Telecommun. (2010) 65:247 262 DOI 10.1007/s12243-009-0130-1 EFT: a hgh throughput routng metrc for IEEE 802.11s wreless mesh networks Md. Sharful Islam Muhammad Mahbub Alam Md. Abdul Hamd Choong Seon

More information

Advanced radio access solutions for the new 5G requirements

Advanced radio access solutions for the new 5G requirements Advanced rado access solutons for the new 5G requrements Soumaya Hamouda Assocate Professor, Unversty of Carthage Tuns, Tunsa Soumaya.hamouda@supcom.tn IEEE Summt 5G n Future Afrca. May 3 th, 2017 Pretora,

More information

Utility Constrained Energy Minimization In Aloha Networks

Utility Constrained Energy Minimization In Aloha Networks Utlty Constraned Energy nmzaton In Aloha Networks Amrmahd Khodaan, Babak H. Khalaj, ohammad S. Taleb Electrcal Engneerng Department Sharf Unversty of Technology Tehran, Iran khodaan@ee.shrf.edu, khalaj@sharf.edu,

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Efficient Content Distribution in Wireless P2P Networks

Efficient Content Distribution in Wireless P2P Networks Effcent Content Dstrbuton n Wreless P2P Networs Qong Sun, Vctor O. K. L, and Ka-Cheong Leung Department of Electrcal and Electronc Engneerng The Unversty of Hong Kong Pofulam Road, Hong Kong, Chna {oansun,

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Adaptive Subband Allocation in FH-OFDMA with Channel Aware Frequency Hopping Algorithm

Adaptive Subband Allocation in FH-OFDMA with Channel Aware Frequency Hopping Algorithm Internatonal Journal on Communcatons Antenna and Propagaton (I.Re.C.A.P.), Vol. 2,. ISS 2039-5086 February 202 Adaptve Subband Allocaton n FH-OFDMA wth Channel Aware Frequency Hoppng Algorthm Ardalan Alzadeh,

More information

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.

More information

A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS

A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS Kumar Pardeep and Chaturved D.K., Pahua G.L. - A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS Kumar

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Delay Constrained Multiuser Scheduling Schemes Based on Upper-Layer Performance

Delay Constrained Multiuser Scheduling Schemes Based on Upper-Layer Performance Delay Constraned Multuser Schedulng Schemes Based on Upper-Layer Performance Hongyuan Zhang Dept. Electrcal and Computer Engneerng North Carolna Unversty Ralegh, NC USA hzhang@ncsu.edu Huayu Da Dept. Electrcal

More information

IP Camera Configuration Software Instruction Manual

IP Camera Configuration Software Instruction Manual IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More information

Priority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks

Priority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks Prorty-Based Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks Ja-Mng Lang, Jen-Jee Chen, You-Chun Wang, Yu-Chee Tseng, and Bao-Shuh P. Ln Department of Computer Scence Natonal Chao-Tung Unversty,

More information

A fair buffer allocation scheme

A fair buffer allocation scheme A far buffer allocaton scheme Juha Henanen and Kalev Klkk Telecom Fnland P.O. Box 228, SF-330 Tampere, Fnland E-mal: juha.henanen@tele.f Abstract An approprate servce for data traffc n ATM networks requres

More information

Technical Report. i-game: An Implicit GTS Allocation Mechanism in IEEE for Time- Sensitive Wireless Sensor Networks

Technical Report. i-game: An Implicit GTS Allocation Mechanism in IEEE for Time- Sensitive Wireless Sensor Networks www.hurray.sep.pp.pt Techncal Report -GAME: An Implct GTS Allocaton Mechansm n IEEE 802.15.4 for Tme- Senstve Wreless Sensor etworks Ans Koubaa Máro Alves Eduardo Tovar TR-060706 Verson: 1.0 Date: Jul

More information

Optimal Topologies for Wireless Sensor Networks

Optimal Topologies for Wireless Sensor Networks Rochester Insttute of Technology RIT Scholar Works Presentatons and other scholarshp 11-30-2004 Optmal Topologes for Wreless Sensor Networks Jason Tllett Rochester Insttute of Technology Shancheh Jay Yang

More information

Quantifying Responsiveness of TCP Aggregates by Using Direct Sequence Spread Spectrum CDMA and Its Application in Congestion Control

Quantifying Responsiveness of TCP Aggregates by Using Direct Sequence Spread Spectrum CDMA and Its Application in Congestion Control Quantfyng Responsveness of TCP Aggregates by Usng Drect Sequence Spread Spectrum CDMA and Its Applcaton n Congeston Control Mehd Kalantar Department of Electrcal and Computer Engneerng Unversty of Maryland,

More information

Annales UMCS Informatica AI 1 (2003) UMCS. Designing of multichannel optical communication systems topologies criteria optimization

Annales UMCS Informatica AI 1 (2003) UMCS. Designing of multichannel optical communication systems topologies criteria optimization Annales Informatca AI 1 (2003) 277-284 Annales Informatca Lubln-Polona Secto AI http://www.annales.umcs.lubln.pl/ Desgnng of multchannel optcal communcaton systems topologes crtera optmzaton Mrosław Hajder,

More information

Channel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7

Channel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7 Optmzed Regonal Cachng for On-Demand Data Delvery Derek L. Eager Mchael C. Ferrs Mary K. Vernon Unversty of Saskatchewan Unversty of Wsconsn Madson Saskatoon, SK Canada S7N 5A9 Madson, WI 5376 eager@cs.usask.ca

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Efficient QoS Provisioning at the MAC Layer in Heterogeneous Wireless Sensor Networks

Efficient QoS Provisioning at the MAC Layer in Heterogeneous Wireless Sensor Networks Effcent QoS Provsonng at the MAC Layer n Heterogeneous Wreless Sensor Networks M.Soul a,, A.Bouabdallah a, A.E.Kamal b a UMR CNRS 7253 HeuDaSyC, Unversté de Technologe de Compègne, Compègne Cedex F-625,

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Greedy Technique - Definition

Greedy Technique - Definition Greedy Technque Greedy Technque - Defnton The greedy method s a general algorthm desgn paradgm, bult on the follong elements: confguratons: dfferent choces, collectons, or values to fnd objectve functon:

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

More information

Optimization of Local Routing for Connected Nodes with Single Output Ports - Part I: Theory

Optimization of Local Routing for Connected Nodes with Single Output Ports - Part I: Theory U J.T. (: 33- (pr. 0 Optmzaton of Local Routng for Connected odes wth Sngle Output Ports - Part I: Theory Dobr tanassov Batovsk Faculty of Scence and Technology ssumpton Unversty Bangkok Thaland E-mal:

More information

DECA: distributed energy conservation algorithm for process reconstruction with bounded relative error in wireless sensor networks

DECA: distributed energy conservation algorithm for process reconstruction with bounded relative error in wireless sensor networks da Rocha Henrques et al. EURASIP Journal on Wreless Communcatons and Networkng (2016) 2016:163 DOI 10.1186/s13638-016-0662-9 RESEARCH Open Access DECA: dstrbuted energy conservaton algorthm for process

More information

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources

On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources On the Farness-Effcency Tradeoff for Packet Processng wth Multple Resources We Wang, Chen Feng, Baochun L, and Ben Lang Department of Electrcal and Computer Engneerng, Unversty of Toronto {wewang, cfeng,

More information