Cognitive Radio Resource Management Using Multi-Agent Systems

Size: px
Start display at page:

Download "Cognitive Radio Resource Management Using Multi-Agent Systems"

Transcription

1 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 Carolna at Charlotte Emal: {jxe, lhowtt, Abstract Ths paper nvestgates cooperatve rado resource management for multple cogntve rado networks n nterference envronments. The objectve of ths research s to manage shared rado resources farly among multple noncooperatve cogntve rado networks to optmze the overall performance. We emphasze the underlyng predctablty of network condtons and promote management solutons talored to dfferent nterference envronments. A mult-agent-systembased approach s proposed to acheve nformaton sharng and decson dstrbuton among multple cogntve rado networks n a dstrbuted manner. We address the dstrbuted constrant optmzaton problem (DCOP) n cogntve rado networks and study the effectveness of DCOP algorthms to fnd the optmal rado resource assgnment through communcatons between dstrbuted agents. Keywords Spectrum management, dstrbuted constrant optmzaton problem (DCOP), predctve models, thrd-party-based archtecture I. INTRODUCTION Cogntve rados [] provde a potental soluton for more effcent spectrum utlzaton. To acheve effcent spectrum utlzaton, a balanced and ntegrated communcaton system s requred []. One soluton s to ncorporate spectrum management functonalty wth the software-defned rados attrbutes n communcaton systems. Ths paper provdes an ntal nvestgaton nto cooperatve resource management for multple cogntve rado networks. Interference from colocated, co-band, and non-coorporatve wreless technologes s antcpated and s a component of the study presented. The objectve of ths research s to manage shared rado resources farly among multple non-cooperatve cogntve rado networks to optmze the overall performance. We emphasze the underlyng predctablty of network condtons and promote management solutons talored to dfferent nterference envronments. A mult-agent-system-based approach s proposed to acheve nformaton sharng and decson dstrbuton among multple cogntve rado networks n a dstrbuted manner. Cogntve rado resource management requres a tght couplng between the spectrum management functonalty and the software-defned rados attrbutes,.e., modes of operaton supported by the physcal layer. Wreless local area networks (s) provde essental components for projected cogntve rado platforms. Snce predctve models can be readly Ths work s supported n part by the US Natonal Scence Foundaton (NSF) under Grant No. CNS developed for current s, they make an deal hardware platform for developng our resource management strategy. The rest of ths paper s organzed as follows. The proposed archtecture for the dstrbuted cogntve rado resource management s present n Secton II. A centralzed mplement s presented n Secton III and s used to llustrate the concept and provde a benchmark for the performance. A dstrbuted mplementaton based on mult-agent-systems s outlned n Secton IV, followed by the conclusons and future work n Secton V. II. ARCHITECTURE OF COGNITIVE RADIO RESOURCE MANAGEMENT USING MULTI-AGENT SYSTE One applcaton of cogntve rado resource management s the mult-doman envronment. In recent years, many hot-spots are emergng and multple s are beng deployed wthn small geographc vcnty. Dfferent s n a partcular area may be deployed by dfferent operators. In such a mult-doman envronment, there s a growng nterest n provders settng up recprocal agreements so that moble users may share the usage of multple s. A mult-agent system-based approach s proposed to acheve nformaton sharng and decson dstrbuton among multple s n a dstrbuted manner. provders may set up servce-level agreements among themselves on how much data can be exchanged among agents. Compared to usng a centralzed controller, a mult-agent system-based approach s more scalable. A. Mult--Based Archtecture We propose a resource management archtecture for multple s usng mult-agent systems, as shown n Fg.. Multple s are co-located wthn a partcular geographc area. Communcatons nsde the surroundng wreless personal area networks (WPANs) such as Bluetooth networks and wreless sensor networks (WSNs) generate nterference to actvtes. s are located nsde each access pont () and nteract wth other agents wthn ts neghborhood. An agent's neghborhood conssts of those agents wth whom t has frequent nteractons. These nteractons nclude sharng of data and negotatng about resource assgnments. Indvdual agents act as rado resource coordnators and cooperate wth agents n ther neghborhood to take care of resource management across multple s.

2 Interacton Neghborhood Mult - Meta Level B s Sphere of Influence C Physcal Operatonal Level C WPAN WSN A Fg.. Archtecture of resource management usng mult-agent systems. Through agent coordnaton, provders may offer nter- roamng servces to ther subscrbers as a value-added servce feature. They can also support communcatons wth betterqualty sgnals snce the mpact of nteractve nterference can be globally balanced through mult-agent control. The functons related to user authentcaton, bllng, securty and prvacy, and moblty management can also be mplemented n agents. Wthn the mult-agent system, the agents are leveraged to farly balance system-wde resources n order to accommodate more users wth the least amount of cost. The agent at each collects the statstcs from the measured operatonal envronment as well as ts neghborhood and estmates the requred parameters for optmzng system performance based on predctve models. The IEEE 80.k task group [3] s developng a rado resource measurement extenson to the IEEE 80. standard. As suggested by the IEEE 80.k task group, the sgnal characterstcs are obtaned drectly from s. The data can be augmented by an addtonal sensng component to provde addtonal data specfcally assocated wth WPAN nterference sources n the envronment. The agents use the measured data to generate local control decsons and try to optmze the performance of the entre system n a dstrbuted fashon through agent nteracton and coordnaton. nteracton s an essental aspect of ths archtecture. nteracton occurs on the backbone network connectng all the s. Therefore, the bandwdth requrement for agent nteracton s not a crtcal ssue. However, snce multple agents contrbute to the control of optmal resource allocaton across s, they need to decde what nformaton should be exchanged among neghbors, how often to exchange ths nformaton, and whch neghbors should act as relay nodes for the data. When a control decson s made, an agent also needs to decde what actons ts effector should take and how the control decson should be dstrbuted to the desred area. B. Mult--Based Archtecture Fg. presents a block dagram of a general framework for physcal envronment predcton and resource management usng agent technologes. The major functonal blocks are: and WPAN cluster, RF envronment sensng (RES), and agent operatons whch nclude predctve parameter estmaton (PPE) and resource management optmzaton. They are explaned n detals as follows. and WPAN Cluster: Each moble staton () n s operates wthn a dynamc RF envronment comprsng tme-varyng co-channel nterference sources and tme-varyng nterference sources from co-located WPANs. The agents nsde each perodcally collect measured statstcs from the dynamc RF envronment requred for resource management. RF Envronment Sensng (RES): Ths block s used to provde estmates of the sgnal characterstcs from both s wthn the cluster as well as potental nterference sources wthn the operatonal envronment. Part of the functons defned n ths block can be provded by the specfcatons of IEEE 80.k rado resource measurement. Statstcs related to WPAN envronmental nterference levels should be provded from an addtonal sensng component nsde each. It s mportant to remark that t does not mply measurng nstantaneous small-scale multpath sgnal characterstcs whch are very tme-senstve. Instead, measurements would be targeted at capturng large-scale changes n sgnal characterstcs due to varatons n shadowng, moblty, nterference sources, and nterference locatons. In other words, the RES needs to measure the factors whch nfluence the resource management of the performance. Operaton-Predctve Models for Parameter Estmaton (PPE): Estmates of sgnal characterstcs are nput to the agent nsde each. An agent also receves data from ts neghborhood through agent nteracton and coordnaton. The general concept for the PPE block s to use predctve models to generate parameter estmates requred by the resource management optmzaton. The parameters to be estmated nclude: Lnk Qualty: lnk qualty between each and ts. Moblty Rate: rate of changes n the expected lnk qualty between each and ts. Energy Expendture: energy requred to successfully transmt a packet between each and ts. Throughput: throughput for each cell based on Operaton Operaton Operaton Predctve Parameter Estmaton (PPE) Predctve Parameter Estmaton (PPE) Predctve Parameter Estmaton (PPE) RF Envronment Sensng (RES) WPAN WSN Dynamc RF Envronment C Resource Management Optmzaton Resource Management Optmzaton TxOptmzaton Resource Management Utlzaton Modelng Tx Modelng Utlzaton Assgnment Optmzaton Tx Optmzaton Utlzaton Assgnment LoadModelng Balance/Hand -Off Assgnment Optmzaton Load Balance/Hand -Off Strategy to Effect Load Balance/Hand -Off StrategyUtlzaton to Effect (EOU) Optmal Optmal StrategyUtlzaton to Effect (EOU) Optmal Utlzaton (EOU) Tx Tx Assgnment Assgnment -Off Tx Load Balance/Hand Operaton Load Balance/Hand Assgnment -Off Operaton Load Balance/Hand -Off Operaton Interacton Coordnaton Between Neghborhoods A Fg.. Block dagram of physcal envronment predcton and agent operatons.

3 the operatonal envronment characterstcs, current offered traffc, and projected offered traffc. Latency: expected tme delay and the varance n the tme delay between each and ts. Operaton-Resource Management Optmzaton: Ths block analyzes the parameter estmatons and makes nstructonal decsons to optmze the overall performance based on desgned optmzaton models. Instructonal decsons nclude the optmal transmt power at s, the optmal channel s should operate n order to mnmze nterference levels and make the best use of overall resources, whether or not to accept assocaton requests from specfc s, whether to drect specfc s to be assocated to another for load balancng, and so on. These decsons are updated perodcally n order to address changes n the traffc load and nterference envronment. They should target long-term performance mprovement. The operatonal changes are downloaded to the cluster wth the help of agent effectors and dstrbuted to the neghborhood of agents through agent nteracton and coordnaton. The resource management optmzaton block ncludes two components: Utlzaton Modelng and Optmzaton : Ths block fnds the optmal utlzaton,.e., the maxmum allowable throughput, of each based on the envronmental nformaton agents possess. The decson of the optmal utlzaton s used by the EOU block (whch s explaned n the followng) to generate specfc strateges to acheve the optmal utlzaton at each. Strategy to Effect Optmal Utlzaton (EOU): Gven the optmal utlzaton of each, nstructonal decsons are generated to acheve the optmal utlzaton whle mnmzng nterference to the envronment. Operatonal changes are negotated wthn the agent's neghborhood and appled to the cluster. They are also fed back to the UMO block to update the optmal utlzaton decson. III. ILLUSTRATIVE EXAMPLE: LOAD BALANCING IN AN INTERFERENCE CONSTRAINED In ths secton, we explan how to manage rado resource of mult-doman s usng a centralzed approach. In the next secton, a decentralzed approach s adopted based on mult-agent systems. The goal of our work s to adaptvely manage shared system-wde rado resources under tmevaryng network condtons among multple s. Ths rado resource management should ncorporate the mpact from the nterference envronment. Due to the co-locaton of s such as the IEEE 80.b and WPANs such as Bluetooth or the IEEE low-rate WPAN (LR-WPAN) whch operate n a shared spectrum, ther communcaton actvtes nterfere each other because of spectral overlap. Interference sources wll mpact moble statons dfferently due to varatons n RF path loss. These varatons make t dffcult and costly, n terms of network resources, to mantan performance requrements. Hence, t s mperatve that the dynamc effects of nterference be ncorporated nto network management and control decson-makng. Although a consderable amount of research on rado resource management n a sngle s proposed [4]-[7], cooperatve resource management for mult-doman s remans largely unexplored. Resource management schemes desgned for a sngle cannot be drectly appled to mult-doman s because the nteractve effect of nterdoman co-channel nterference s not taken nto consderaton. A. Thrd-Party-Based Archtecture We propose a thrd-party-based resource management archtecture to facltate the cooperatve mult-doman resource management. A trusted thrd-party agent s needed who s ndependent from each network provder's fnancal nterests. When a new s deployed, the provder does not need to set up drect servce level agreements wth all the other provders of the exstng s n the area. It only regsters to the thrd-party agent. The thrd-party controller can collect nformaton across multple domans and send control sgnals back to each doman, thereby makng rado resource management and other features possble []. A new entty, local network controller (LNC), s connected to all the s of multple s, as shown n Fg. 3. s under the control of an LNC form a cluster. The LNC acts as a rado resource coordnator across domans and takes care of ssues related to nter-doman roamng and resource sharng wthn a cluster. As the number of domans n a cluster ncreases, the LNC can be bult n a herarchcal structure to make t more scalable. As shown n Fg. 3, a global network controller (GNC) s connected to all LNCs supportng nter--cluster roamng and resource sharng. The LNC gathers the measured resource usage statstcs from all the s va Smple Network Management Protocol (SNMP) [8]. s collect sgnal characterstcs from clent statons n each doman based on IEEE 80.k specfcatons [3]. The measured data can then be used by the LNC to generate control decsons to optmze the performance of the entre cluster. B. Proposed Resource Management Scheme The goal of the proposed scheme s to mnmze the total system cost by adjustng resource allocaton n each doman. The cost s what the system needs to pay to support all the s to acheve performance requrements. It s related to the avalable rado resources for supportng the offered load n LNC Cluster GNC LNC Cluster Fg. 3. Thrd-party-based mult-doman resource management archtecture for s.

4 each doman and mtgatng nterference from the operatonal envronment. The LNC manages resource sharng across domans by controllng the maxmum allowable throughput of each. When the maxmum allowable throughput at an changes, the avalable rado resources of the cell s lmted. Consequently, the cell utlzaton changes whch leads to a dfferent system cost. Therefore, mnmzng the overall system cost s equvalent to fndng the optmal allowable throughput at each. In addton, WPAN nterference can adversely affect the performance by changng ts resource utlzaton requrements and therefore needs to be consdered. Moreover, due to the dynamcs n the RF envronment, sgnal characterstcs, traffc load, and nterference ntensty are tme-varant. As a result, the optmal resource allocaton decson should be dynamcally adjusted to reflect the nfluences of the tme-varyng envronment. The proposed resource management scheme ncludes three steps. Frst, based on the overall traffc load dstrbuton at all the s n a cluster, the mpact of co-channel nterference at each cell can be calculated. Then, by ncorporatng the mpact of nterference from other sources n the operatonal envronment, the communcaton cost of the overall system can be derved whch s a functon of cell load, co-channel nterference, and nterference from other wreless servces. Second, the LNC fnds the optmal pattern of maxmum allowable throughput at each n multple domans. In other words, the LNC decdes whch should provde how much capacty to ts users. Ths optmal throughput pattern results n the mnmum system cost. Fnally, the LNC sends control sgnals to s to nstruct them on how to update ther allowable resources for users based on the calculated optmal throughput. The mult-doman resource management ssue can be formulated as an optmzaton problem. The LNC perodcally optmzes the resource usage n each doman by mnmzng the overall system cost functon. The LNC not only fnds the optmal throughput pattern for all the s, but also determnes the optmal capacty for each doman. After the LNC fnds the optmal resource allocaton, resources at each doman should be updated. Both the co-channel nterference from other s and the nterference from co-located WPANs are consdered durng the optmzaton process. Therefore, the proposed mult-doman resource management scheme s able to mnmze the co-channel nterference across domans and mtgate other nterference from the operatonal envronment through far resource allocaton. Under the proposed scheme, resource utlzaton and co-channel nterference can be adaptvely balanced across the entre ntegrated system. C. Performance Evaluaton Usng Smulatons We smulate a two-doman envronment wth IEEE 80.b A and B co-located. Multple Bluetooth nodes are also co-located wth the two s. Ther communcatons nterfere wth each other. A two-state Markov traffc model s used for our smulaton. There are two Pareto dstrbutons nvolved n the model: one for the traffc load wth a cutoff value at 6Mbps and the other for the HIGH/LOW state duraton. The traffc s generated at both states wth a burst threshold 00kbps, whch means, when the generated traffc load s less than 00kbps, we assume the s at the LOW state. The Bluetooth traffc model s based on an ON- OFF Markov model and the traffc swtches from an ON to an OFF state wth probablty 0.6. Smulaton results demonstrated that the proposed multdoman cooperatve resource management scheme s more cost-effcent for a /WPAN nterference envronment. The proposed scheme can save up to 99.8% and 47.3% cost compared to the scheme that each doman optmzes resource usage ndependently wthout the consderaton of potental nterference from co-located WPANs and the scheme that LNC s nvolved to help control the resource allocaton n each doman but wthout the consderaton of potental nterference from co-located WPANs, respectvely. IV. MULTI-AGENTS PROVIDING A DISTRIBUTED IMPLEMENTATION We are nterested n solvng the resource allocaton problem nvolvng resource management n a decentralzed fashon usng mult-agent systems (MAS). As presented n the prevous secton, central to ths process s balancng the traffc load between dsparate s. A mechansm for mplementng load balancng s the handoff process of transferrng the resource usage of an from one to another. Ths process can be trggered by two events: Type : An requests a handoff from one due to moblty requrements; Type : An, sheds or acqures addtonal load n order to balance the traffc load wthn ts neghborhood set. We present a model based on mult-agent constrant optmzaton problem (MCOP) to optmze Type handoffs n ths paper n order to llustrate the approach. A dscrete mult-agent constrant optmzaton problem (MCOP) [9] s a tuple A, X, D, R, where A { A,, K A n s the set of agents nterested n the soluton, X X, K, X m s the set of varables; usually each agent A s assgned one varable, D d, K, d m s a set of domans of the varables, where each doman s a fnte dscrete set of possble values, and R r, K, r p s a set of relatons where a relaton r s a utlty functon whch provdes a measure of the value assocated wth a gven combnaton of varables. { { { * The objectve of the MCOP s to fnd an assgnment X for the varables X that maxmzes the sum of utltes of the mult-agent system. DPOP [0], a dstrbuted constrant optmzaton algorthm for general networks, uses dynamc programmng for ts utlty propagaton. DPOP has three phases: n phase, the algorthm performs a dstrbuted depth frst traversal of the general network to establsh a pseudotree [] structure; n phase, the algorthm propagates utlty A pseudo-tree of a graph G s a rooted tree wth the same vertces as G and has the property that adjacent vertces from the orgnal graph fall n the same

5 messages whch contan utlty vectors bottom-up along the pseudo-tree; n phase 3, the optmal value assgnments are propagated top-down from the root node. We map the resource allocaton problem to a mult-agent dstrbuted constrant optmzaton problem. Each s assgned an agent. However, at any pont n tme, only a subset of these agents wll be nvolved n the resourceallocaton process, whch means that the mult-agent system s constructed dynamcally. Perodcally, each agent lstens for event trggers. The frequency of event trggers can be an ssue. If they occur too often, then the envronment s too dynamc and a greedy reactve control would be preferable to planned delberaton,.e., DPOP, as the latter uses up tme only to have ts results become obsolete pror to beng appled to the ntended envronment, thus leadng to nstablty. Each event trgger wakes up the correspondng agent and the mult-agent system ntates the resource-allocaton process along wth every other agent that has been awakened. The varables belongng to each agent are recpent ds wth assocated handoff tmes. The doman for the varables s the set of s n s neghborhood set that are potental X recpents of s handoff. The recpent agents could nclude agents n s mmedate neghborhood as well as n ts nterference neghborhood. Consder the followng smple scenaro wth Type event trggers. Suppose at tme t 0, 3 s are trggered by 4 s. Each trgger s represented as where : ( t ) ( ) { x y t, s the requestng a handoff; ( ) current handler of x s the and t s the estmate of the tme by y s the set of { whch the handoff has to occur; and ( ) destnaton s n be handed off to and each estmate of the earlest tme X s neghborhood set that t t could t, the y has an assocated tme can be handed off to y. The handoff duraton tme could also be ncorporated as an addtonal parameter n each event trgger to represent the mnmum requrement of the requested handoff. As depcted n Fg., the utlty functon for the decsons s provded by the Utlzaton Modelng and Optmzaton block. The followng example gves an llustraton of the even trgger explaned above. ( t 0) { ( t 8) ( t 6) { 3 ( t 7) ( t 3) { ( t 5 ), 3 ( t 30) ( t 4) { ( t 7) : : 3 :. 4 : 3 branch of the tree. Pseudo-trees are used n search due to the relatve ndependence of nodes lyng n ts dfferent branches. If an has multple event trggers at the same tme, the correspondng agent wll assgn each a varable and solve the cumulatve resourceallocaton problem. The vertces of the pseudo-tree constructed n the DPOP algorthm are, and 3. The utlty vectors of the leaves are determned by the utlty functon from the UMO and the optmal assgnment of handoff destnatons and tmngs s computed usng the DPOP algorthm descrbed above. The resource allocaton process s trggered every tme a new set of event trggers occurs. The DPOP algorthm provdes the optmal soluton wthn a bounded tme,.e., the algorthm s guaranteed to converge to the optmal soluton. V. CONCLUSION AND FUTURE WORK In ths paper, we nvestgated how to dynamcally manage shared rado resources farly among multple non-cooperatve cogntve rado networks usng mult-agent systems. We explaned the components n our proposed archtecture for the dstrbuted cogntve rado resource management. We presented a centralzed mplement for mult-doman s. We then outlned a decentralzed mplementaton based on mult-agent systems and explaned how to map resource allocaton problem nto a DCOP usng mult-agent systems. We are currently studyng the effectveness of usng DCOP algorthms to fnd the optmal rado resource management and comparng the performance of ths dstrbuted approach to that of the centralzed approach. REFERENCES [] S. Haykn, Cogntve rado: bran-empowered wreless communcatons, IEEE Journal of Selected Areas n Communcaton, vol.3, no., pp. 0-0, February 005. [] I. F. Akyldz, W. Lee, M. C. Vuran, and S. Mohanty, NeXt generaton/dynamc spectrum access/cogntve rado wreless networks: A survey, Computer Networks (Elsever), vol. 50, no. 3, pp. 7-59, September 006. [3] IEEE 80. WG draft supplement - specfcaton for rado resource measurement, IEEE 80.k/D0.7. [4] Hlls and B. Frday, Rado resource management n wreless LANs, IEEE Communcatons Magazne, vol. 4, no., pp. S9--S4, December 004. [5] Y. Wang, L. G. Cuthbert, and J. Bgham, Intellgent rado resource management for IEEE 80., n Proc. IEEE Wreless Communcatons and Networkng Conference (WCNC), 004, vol. 3, pp [6] Y. Bejerano, S.-J. Han, and L. L, Farness and load balancng n wreless LANs usng assocaton control, n Proc. ACM MOBICOM, 004, pp [7] A. Balachandran, P. Bahl, and G. M. Voelker, Hot-spot congeston relef n publc-area wreless networks, n Proc. IEEE Workshop on Moble Computng Systems and Applcatons (WMCSA), 00, pp [8] D. Harrngton, R. Presuhn, and B. Wjnen, An archtecture for descrbng smple network management protocol (SNMP) management frameworks, Request for Comments (RFC) 34, IETF, December 00. [9] A. Petcu and B. Faltngs, A dstrbuted, complete method for multagent constrant optmzaton, n CP 004 Ffth Internatonal Workshop on Dstrbuted Constrant Reasonng (DCR 004), Toronto, Canada, September 004. [0] A. Petcu, B. Faltngs, A Scalable Method for Multagent Constrant Optmzaton, IJCAI 005: [] R. Dechter, Constrant Processng, Morgan Kaufmann, 003.

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

Dynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication

Dynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. Dynamc Bandwdth Provsonng wth Farness and Revenue Consderatons

More information

3. CR parameters and Multi-Objective Fitness Function

3. CR parameters and Multi-Objective Fitness Function 3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft

More information

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

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

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

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

RAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:

RAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems: Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:

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

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

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

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

Delay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks

Delay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network

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

Cost-efficient deployment of distributed software services

Cost-efficient deployment of distributed software services 1/30 Cost-effcent deployment of dstrbuted software servces csorba@tem.ntnu.no 2/30 Short ntroducton & contents Cost-effcent deployment of dstrbuted software servces Cost functons Bo-nspred decentralzed

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

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

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

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

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

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

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

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

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

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

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

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

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

NETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK

NETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK NETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK Prasana kumar. S 1, Deepak.N 2, Tajudeen. H 3, Sakthsundaram. G 4 1,2,3,4Student, Department of Electroncs and Communcaton,

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

DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS

DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS Arun Avudanayagam Yuguang Fang Wenjng Lou Department of Electrcal and Computer Engneerng Unversty of Florda Ganesvlle, FL 3261

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 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 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

an assocated logc allows the proof of safety and lveness propertes. The Unty model nvolves on the one hand a programmng language and, on the other han

an assocated logc allows the proof of safety and lveness propertes. The Unty model nvolves on the one hand a programmng language and, on the other han UNITY as a Tool for Desgn and Valdaton of a Data Replcaton System Phlppe Quennec Gerard Padou CENA IRIT-ENSEEIHT y Nnth Internatonal Conference on Systems Engneerng Unversty of Nevada, Las Vegas { 14-16

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

Pricing Network Resources for Adaptive Applications in a Differentiated Services Network

Pricing Network Resources for Adaptive Applications in a Differentiated Services Network IEEE INFOCOM Prcng Network Resources for Adaptve Applcatons n a Dfferentated Servces Network Xn Wang and Hennng Schulzrnne Columba Unversty Emal: {xnwang, schulzrnne}@cs.columba.edu Abstract The Dfferentated

More information

Video Proxy System for a Large-scale VOD System (DINA)

Video Proxy System for a Large-scale VOD System (DINA) Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,

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

Fast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems

Fast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems Fast Retransmsson of Real-Tme Traffc n HIPERLAN/ Systems José A Afonso and Joaqum E Neves Department of Industral Electroncs Unversty of Mnho, Campus de Azurém 4800-058 Gumarães, Portugal {joseafonso,

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

OPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET

OPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET OPTIMAL CONFIGURATION FOR NODE IN MIED CELLULAR AND MOBILE AD HOC NETWORK FOR INET Olusola Babalola D.E. Department of Electrcal and Computer Engneerng Morgan tate Unversty Dr. Rchard Dean Faculty Advsor

More information

Combined SINR Based Vertical Handoff Algorithm for Next Generation Heterogeneous Wireless Networks

Combined SINR Based Vertical Handoff Algorithm for Next Generation Heterogeneous Wireless Networks Combned SINR Based Vertcal Handoff Algorthm for Next Generaton Heterogeneous Wreless Networks Kemeng Yang, Iqbal Gondal, Bn Qu and Laurence S. Dooley Faculty of Informaton Technology Monash Unversty Melbourne,

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

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

QoS Bandwidth Estimation Scheme for Delay Sensitive Applications in MANETs

QoS Bandwidth Estimation Scheme for Delay Sensitive Applications in MANETs Communcatons and Network, 2013, 5, 1-8 http://dx.do.org/10.4236/cn.2013.51001 Publshed Onlne February 2013 (http://www.scrp.org/journal/cn) QoS Bandwdth Estmaton Scheme for Delay Senstve Applcatons n MANETs

More information

IJCTA Nov-Dec 2016 Available

IJCTA Nov-Dec 2016 Available Dr K Santh et al, Internatonal Journal of Computer Technology & Applcatons,Vol 7(6),773-779 Optmzed Route Technque for DSR Routng Protocol n MANET Dr.K.Santh, Assocate Professor, Dept. of Computer Scence,

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

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

Distributed Middlebox Placement Based on Potential Game

Distributed Middlebox Placement Based on Potential Game Int. J. Communcatons, Network and System Scences, 2017, 10, 264-273 http://www.scrp.org/ournal/cns ISSN Onlne: 1913-3723 ISSN Prnt: 1913-3715 Dstrbuted Mddlebox Placement Based on Potental Game Yongwen

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

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

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

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

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

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

Wightman. Mobility. Quick Reference Guide THIS SPACE INTENTIONALLY LEFT BLANK

Wightman. Mobility. Quick Reference Guide THIS SPACE INTENTIONALLY LEFT BLANK Wghtman Moblty Quck Reference Gude THIS SPACE INTENTIONALLY LEFT BLANK WIGHTMAN MOBILITY BASICS How to Set Up Your Vocemal 1. On your phone s dal screen, press and hold 1 to access your vocemal. If your

More information

AADL : about scheduling analysis

AADL : about scheduling analysis AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng

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

Advanced Computer Networks

Advanced Computer Networks Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans

More information

IP mobility support is becoming very important as the

IP mobility support is becoming very important as the 706 IEEE TRANSACTIONS ON COMPUTERS, VOL. 52, NO. 6, JUNE 2003 A New Scheme for Reducng Lnk and Sgnalng Costs n Moble IP Young J. Lee and Ian F. Akyldz, Fellow, IEEE Abstract IP moblty support s provded

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

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

Solutions for Real-Time Communication over Best-Effort Networks

Solutions for Real-Time Communication over Best-Effort Networks Solutons for Real-Tme Communcaton over Best-Effort Networks Anca Hangan, Ramona Marfevc, Gheorghe Sebestyen Techncal Unversty of Cluj-Napoca, Computer Scence Department {Anca.Hangan, Ramona.Marfevc, Gheorghe.Sebestyen}@cs.utcluj.ro

More information

Verification by testing

Verification by testing Real-Tme Systems Specfcaton Implementaton System models Executon-tme analyss Verfcaton Verfcaton by testng Dad? How do they know how much weght a brdge can handle? They drve bgger and bgger trucks over

More information

Concurrent Apriori Data Mining Algorithms

Concurrent Apriori Data Mining Algorithms Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng

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

A Decentralized Lifetime Maximization Algorithm for Distributed Applications in Wireless Sensor Networks

A Decentralized Lifetime Maximization Algorithm for Distributed Applications in Wireless Sensor Networks A Decentralzed Lfetme Maxmzaton Algorthm for Dstrbuted Applcatons n Wreless Sensor Networks Vrgna Pllon, Mauro Franceschell, Lug Atzor, Alessandro Gua Dept. of Electrcal and Electronc Engneerng, Unversty

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

Enhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks

Enhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks Enhanced Sgnalng Scheme wth Admsson Control n the Hybrd Optcal Wreless (HOW) Networks Yng Yan, Hao Yu, Henrk Wessng, and Lars Dttmann Department of Photoncs Techncal Unversty of Denmark Lyngby, Denmark

More information

PERFORMANCE ANALYSIS OF ROUTING ALGORITHMS OF RD-C/TDMA PACKET RADIO NETWORKS UNDER DYNAMIC RANDOM TOPOLOGY1

PERFORMANCE ANALYSIS OF ROUTING ALGORITHMS OF RD-C/TDMA PACKET RADIO NETWORKS UNDER DYNAMIC RANDOM TOPOLOGY1 PERFORMANCE ANALYSIS OF ROUTING ALGORITHMS OF 1- RD-C/TDMA PACKET RADIO NETWORKS UNDER DYNAMIC RANDOM TOPOLOGY1 A Thess Presented to The Faculty of the College of Engneerng and Technology Oho Unversty

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 Control for Loss-Sensitive Traffic in CDMA Networks

Resource Control for Loss-Sensitive Traffic in CDMA Networks Resource Control for Loss-Senstve Traffc n CDMA Networks Vaslos A. Srs Insttute of Computer Scence, FORTH and Department of Computer Scence, Unversty of Crete P. O. Box 1385, GR 711 1, Heraklon, Crete,

More information

MULTIHOP wireless networks are a paradigm in wireless

MULTIHOP wireless networks are a paradigm in wireless 400 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 17, NO. 1, JANUARY 2018 Toward Optmal Dstrbuted Node Schedulng n a Multhop Wreless Network Through Local Votng Dmtros J. Vergados, Member, IEEE, Natala

More information

HIERARCHICAL SCHEDULING WITH ADAPTIVE WEIGHTS FOR W-ATM *

HIERARCHICAL SCHEDULING WITH ADAPTIVE WEIGHTS FOR W-ATM * Copyrght Notce c 1999 IEEE. Personal use of ths materal s permtted. However, permsson to reprnt/republsh ths materal for advertsng or promotonal purposes or for creatng new collectve wors for resale or

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

An Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network

An Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network Purdue Unversty Purdue e-pubs ECE Techncal Reports Electrcal and Computer Engneerng 3--7 An Optmal Bandwdth Allocaton and Data Droppage Scheme for Dfferentated Servces n a Wreless Network Waseem Shekh

More information

Distributed Model Predictive Control Methods For Improving Transient Response Of Automated Irrigation Channels

Distributed Model Predictive Control Methods For Improving Transient Response Of Automated Irrigation Channels Dstrbuted Model Predctve Control Methods For Improvng Transent Response Of Automated Irrgaton Channels Al Khodabandehlou, Alreza Farhad and Al Parsa Abstract Ths paper presents dstrbuted model predctve

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Game Based Virtual Bandwidth Allocation for Virtual Networks in Data Centers

Game Based Virtual Bandwidth Allocation for Virtual Networks in Data Centers Avaable onlne at www.scencedrect.com Proceda Engneerng 23 (20) 780 785 Power Electroncs and Engneerng Applcaton, 20 Game Based Vrtual Bandwdth Allocaton for Vrtual Networks n Data Centers Cu-rong Wang,

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

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

Design and Experimental Evaluation of a Cross-Layer Deadline-Based Joint Routing and Spectrum Allocation Algorithm

Design and Experimental Evaluation of a Cross-Layer Deadline-Based Joint Routing and Spectrum Allocation Algorithm Desgn and Expermental Evaluaton of a Cross-Layer Deadlne-Based Jont Routng and Spectrum Allocaton Algorthm Jthn Jagannath, Sean Furman, Tommaso Meloda, and Andrew Drozd Abstract The desgn and mplementaton

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

Distributed constraint optimization for continuous mobile sensor coordination

Distributed constraint optimization for continuous mobile sensor coordination Delft Unversty of Technology Delft Center for Systems and Control Techncal report 18-014 Dstrbuted constrant optmzaton for contnuous moble sensor coordnaton J. Fransman, J. Sjs, H. Dol, E. Theunssen, and

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

Performance Comparison of a QoS Aware Routing Protocol for Wireless Sensor Networks

Performance Comparison of a QoS Aware Routing Protocol for Wireless Sensor Networks Communcatons and Network, 2016, 8, 45-55 Publshed Onlne February 2016 n ScRes. http://www.scrp.org/journal/cn http://dx.do.org/10.4236/cn.2016.81006 Performance Comparson of a QoS Aware Routng Protocol

More information

Vol. 4, No. 4 April 2013 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.

Vol. 4, No. 4 April 2013 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved. WP A Tree Based Response Tme Algorthm for Event Drven Wreless Sensor Networks 1 Itu Sngdh, 2 Saurabh Kumar 1 Department of Computer Scence and Engneerng, Brla Insttute of Technology, Mesra, Ranch, Jharkhand,

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

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

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

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

Neural Network Control for TCP Network Congestion

Neural Network Control for TCP Network Congestion 5 Amercan Control Conference June 8-, 5. Portland, OR, USA FrA3. Neural Network Control for TCP Network Congeston Hyun C. Cho, M. Sam Fadal, Hyunjeong Lee Electrcal Engneerng/6, Unversty of Nevada, Reno,

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

MOBILE Cloud Computing (MCC) extends the capabilities

MOBILE Cloud Computing (MCC) extends the capabilities 1 Resource Sharng of a Computng Access Pont for Mult-user Moble Cloud Offloadng wth Delay Constrants Meng-Hs Chen, Student Member, IEEE, Mn Dong, Senor Member, IEEE, Ben Lang, Fellow, IEEE arxv:1712.00030v2

More information

FORESIGHTED JOINT RESOURCE RECIPROCATION AND SCHEDULING STRATEGIES FOR REAL-TIME VIDEO STREAMING OVER PEER-TO-PEER NETWORKS

FORESIGHTED JOINT RESOURCE RECIPROCATION AND SCHEDULING STRATEGIES FOR REAL-TIME VIDEO STREAMING OVER PEER-TO-PEER NETWORKS FORESIGHTED JOINT RESOURCE RECIPROCATION AND SCHEDULING STRATEGIES FOR REAL-TIME VIDEO STREAMING OVER PEER-TO-PEER NETWORKS Sunghoon Ivan Lee, Hyunggon Park, and Mhaela van der Schaar Electrcal Engneerng

More information

Can Congestion Control and Traffic Engineering Be at Odds?

Can Congestion Control and Traffic Engineering Be at Odds? Can Congeston Control and Traffc Engneerng Be at Odds? Jayue He Dept. of EE, Prnceton Unversty Emal: jhe@prnceton.edu Mung Chang Dept. of EE, Prnceton Unversty Emal: changm@prnceton.edu Jennfer Rexford

More information

Reliability and Performance Models for Grid Computing

Reliability and Performance Models for Grid Computing Relablty and Performance Models for Grd Computng Yuan-Shun Da,2, Jack Dongarra,3,4 Department of Electrcal Engneerng and Computer Scence, Unversty of Tennessee, Knoxvlle 2 Department of Industral and Informaton

More information

End-to-end Distortion Estimation for RD-based Robust Delivery of Pre-compressed Video

End-to-end Distortion Estimation for RD-based Robust Delivery of Pre-compressed Video End-to-end Dstorton Estmaton for RD-based Robust Delvery of Pre-compressed Vdeo Ru Zhang, Shankar L. Regunathan and Kenneth Rose Department of Electrcal and Computer Engneerng Unversty of Calforna, Santa

More information

Bandwidth Allocation for Service Level Agreement Aware Ethernet Passive Optical Networks

Bandwidth Allocation for Service Level Agreement Aware Ethernet Passive Optical Networks Bandwdth Allocaton for Servce Level Agreement Aware Ethernet Passve Optcal Networks Dawd Nowak Performance Engneerng Laboratory School of Electronc Engneerng Dubln Cty Unversty Emal: nowakd@eengdcue Phlp

More information

Adaptive Energy and Location Aware Routing in Wireless Sensor Network

Adaptive Energy and Location Aware Routing in Wireless Sensor Network Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}

More information