Relayer Selection Strategies in Cellular Networks with Peer-to-Peer Relaying

Size: px
Start display at page:

Download "Relayer Selection Strategies in Cellular Networks with Peer-to-Peer Relaying"

Transcription

1 Relayer Seletion Strategie in Cellular Network with Peer-to-Peer Relaying V. Sreng, H. Yanikomeroglu, and D. D. Faloner Broadband Communiation and Wirele Sytem (BCWS) Centre Dept. of Sytem and Computer Engineering Carleton Univerity, Ottawa, Canada Abtrat We onider a TDMA ellular multihop network where relaying via wirele terminal that have a good ommuniation link to the bae tation i ued a a overage enhanement tehnique. Provided that the ubriber denity i not very low, relaying vi a wirele terminal an have a ignifiant impat on overage, apaity, and throughput. Thi i mainly due to the fat that the ignal only have to travel through horter ditane and/or improved path. In thi work, we invetigated the effet of relaying node eletion trategie (eentially a routing iue) and maximum relayer tranmit power level on overage. Our imulation reult how that with a very modet level of relaying node tranmit power and with ome moderate intelligene inorporated in the relaying node eletion heme, the (high data rate) overage an be improved ignifiantly through two-hop relaying without onuming any additional bandwidth. I. INTRODUCTION Peer-to-peer relaying tehnology originate in paket radio and ad-ho network where the traffi ignal have to be relayed through one or more intermediate node(), depending on the ditane between the oure and the detination node [1], [2]. Uing relaying via mobile terminal a a overage enhanement tehnique in a ellular network i a fairly novel onept, and i gaining a trong interet [3] and onideration in the reearh ommunity uh a the WWRF (World Wirele Reearh Forum) [4]. In [5] we preented a omparion of hannel eletion method for relaying purpoe, along with jut one pathlobaed relaying node eletion trategy. A major finding in that paper wa that the overage improvement obtained from relaying i rather inenitive to the relaying hannel eletion trategy provided that ome diligene i hown in relaying node eletion and power ontrol i applied. In thi paper, we invetigate the enitivity of relaying ytem to relaying node eletion (routing) and relaying node maximum power level, whih were not overed in [5]. Baially two form of relaying an be arried out - analog form or digital form. In the analog form of relaying, the ignal reeived are forwarded without any ignal proeing; hene, a the ignal i amplified, o i the noie. In the digital form, on the other hand, the reeived ignal are firt demodulated and deteted, and thu leaned from noie and interferene (a muh a poible), and then re-enoded and re-modulated before forwarding; thi proe i ometime referred to a deode-and-forward relaying [6],[7] or regenerative relaying [8]. Thu, when digital form of relaying i employed, there i no noie propagation from one hop to the next; however there i a danger of detetion error propagation [6],[7]. It hould be borne in mind that for delay enitive traffi, uh a voie, the digital form of relaying may not be uitable due to the inurred delay. Meanwhile, other traffi type, whih are le enitive to delay and whih require large bandwidth to aommodate high data rate, would require the digital form of relaying in order to prevent the noie propagation and thu to minimize the error rate. We onider only the digital form of relaying in thi paper. Routing i very ruial and hallenging in ad ho network. Routing protool mut be power-aware, robut, and reilient to hange in the network topology; moreover, thee protool hould ahieve all of thee goal without exeive overhead. Routing in ellular multihop network, on the other hand, i likely to be muh more manageable, mainly due to the preene of a entral node (whih i the ommon oure in the downlink and the ommon detination in the uplink) with muh more funtionality and intelligene, namely, the bae tation. Neverthele, routing (relaying node eletion) i till a non-trivial iue in ellular multihop network ine there will often be many andidate relaying node for a node 1 that require relaying aitane and not hooing the optimal relaying node an have potential impat on the overall performane improvement. Sine power i a very preiou entity at the wirele terminal, the power alloated for relaying other terminal ignal i an important parameter for the relaying terminal. In thi paper we only onider the downlink in two-hop ellular network; mobility i not taken into aount. II. RELAYING NODE AND RELAYING CHANNEL SELECTION SCHEMES In thi paper, we onider a relaying hannel eletion heme baed on the maximum SIR, whih we referred to in [5] a the Semi -Smart Channel Seletion. In our modeling, firt the relaying node eletion i performed for eah node 1 In thi paper, the term node, wirele terminal, and ubriber, are ued interhangeably.

2 that require relaying aitane, and the relaying hannel eletion proe then follow (i.e., the two eletion proee are equential). Chooing a relaying node olely baed on the phyial ditane will not be a effetive a hooing one baed on the pathlo (beaue of the hadowing effet); however, loation-baed relaying node eletion heme are attrative a they an be arried out quite imply with the aid of loation tehnique. In fat, loation-baed routing ha already been propoed for ad ho network in order to redue the routing overhead and to maintain a mall routing table at the mobile node [9]-[11]. Our reult for the loation-baed relaying node eletion heme are omewhat optimiti, ine we aume perfet knowledge of loation. In thi paper, the mall-ale multipath fading effet are exluded during the relaying node and hannel eletion proee ine it would be impratial to perform interrelaying node and inter-relaying hannel hand-off baed on multipath ondition. However, after the relaying node and hannel are eleted, the effet of multipath fading are inluded in the overage imulation. A. Relaying Node Seletion A.1 Seletion Baed on Phyial Ditane Let N denote the et of andidate relaying node defined a the node whih have an adequate link to the bae tation in a two-hop relaying network (ee (9) for the definition of adequate link). Let d n1 and d n2 be the ditane aoiated with the firt (between the bae tation to the andidate relaying node) and the eond (between the andidate relaying node to the relayed node) hop, repetively, along the n th route, where n N. Then, the eleted route, r, i determined a follow in eah eletion heme: Shortet Total Ditane (STD) Seletion: r = arg min ( d + d ) (1) n1 n2 Leat Longet Hop (LLH) Seletion: r = arg min (max( d n1, d n2 )) (2) alln N Shortet Relaying Hop Ditane (SRD) Seletion: r = min ( d ) (3) arg n2 alln N A.2 Seletion Baed on Pathlo A diued earlier, although it i expeted that a relaying node eletion baed on pathlo will be uperior to the one baed olely on ditane, the pathlo-baed eletion will inur higher ignaling overhead (mainly due the pathlo etimation tehnique whih are not onidered in thi paper); thi diadvantage mut be weighted againt the additional performane return. In the following, we invetigate three relaying node eletion heme in a two-hop relaying network: the firt i a heme that make the eletion baed on the leat pathlo in the two ombined hop; the eond i baed on a route that ha the lowet bottlenek (in term of pathlo); and the third i baed on the leat pathlo in only the eond hop (whih we all the relaying hop). Similar to the notation ued in the previou etion, let PL n1 and PL n2 denote the pathloe in db aoiated with the firt and the eond hop, repetively, along the n th route, where n N. Then, the eleted route, r, i determined a follow in eah eletion heme: Minimum Total Pathlo (MTP) Seletion: r = arg min ( PL + PL ) (4) n1 n 2 Leat Maximum Pathlo (LMP) Seletion (ued in [3]): r = arg min (max( PLn1, PLn 2 )) (5) all n N Minimum Relaying Hop Pathlo (MRP) Seletion: r = arg min{ PL } (6) n2 Fig. 1 illutrate a ell with a bae tation, a relayed node, and three andidate relaying node. Aoiated with eah andidate relaying node, there i a andidate path (route), marked a I, II, and III in Fig. 1. Path I orrepond to the minimum relaying hop pathlo eletion, path II orrepond to the minimum total pathlo eletion, and path III orrepond to the leat maximum pathlo eletion heme. There will be a many andidate path (route) a the number of node that have a good link with the bae tation (i.e., andidate relaying node). In pratie, however, eah node that require relaying aitane hould limit it andidate relaying node et to only a few in order to minimize the routing overhead. B. Channel Seletion One a relaying node ha been determined, an additional hannel mut be aigned for the relaying hop link to prevent feedbak loop. Baed on our previou paper [5], we propoe reuing hannel from the adjaent ell for relaying purpoe; the very appealing advantage of thi trategy i that no additional bandwidth i onumed in the relaying mode. One of the hannel eletion heme deribed in [5] i reintrodued here for onveniene. Let γ i be the ignal-tointerferene ratio (SIR) experiened at the relayed node i, on hannel, and B the et of all bae tation that ue hannel plu the relay node j whih will alo ue hannel for relaying purpoe (i.e., B i the augmented o-hannel et for hannel ). Then, G ji P j γ i =, (7) G P ki k k B, k j where G ji i the pathlo between the relayed node i and the relaying node j, and P j relaying node j. Similarly, G ki i the tranmitted power of the i the pathlo between the

3 relayed node i and a o-hannel bae tation k whoe hannel i being probed for reue, and Pk i the orreponding bae tation tranmit power. Alo, let L denote the et of all hannel in the adjaent ell (within the luter of the ubriber whih need relaying aitane). Then, a hannel, l, i eleted a follo w: Maximum SIR Seletion: l = arg max( γ ) (8) all L i III. SIMULATION MODEL We onider the downlink of a TDMA urban ellular network where two-hop relaying i ued whenever there doe not exit a uffiiently good diret link between a bae tation and a wirele terminal. Our propagation model onit of ditane-dependent attenuation with a propagation exponent of 4, lognormal hadowing (tandard deviation 10 db), and flat Rayleigh fading. The ame pathlo model i ued between a bae tation and a wirele terminal, and between one wirele terminal and another. The imulation area onit of 6x6 quare ell with wrap around edge. The luter ize i hoen to be 4. Only the 400x400 meter ell ize i onidered in thi paper, whih repreent an interferenelimited environment. Omnidiretional antenna are ued at both bae tation and wirele terminal. The arrier frequeny i taken to be 2.5 GHz and the tranmiion bandwidth 2 MHz. The thermal noie i alo onidered at the reeiver, with a noie figure of 8 db. Due to the large bandwidth and noie figure aumption, the digital form of relaying i ued throughout. We onidered only twohop relaying with ingle-la traffi where every wirele terminal ha the ame SINR requirement of 10 db (thi rather high value for SINR may orrepond to a partiular ontellation in a ytem employing adaptive modulation and oding). Simulation are run with the inorporation of tranmit power ontrol. Whenever power ontrol i employed, a naphot heme i ued for both relaying and non-relaying ae with a tep ize of 2 db. Power update are performed until the reeiver SINR fall between 10 and 12 db, or until a maximum of 10 update are reahed, whihever ome firt. The node within a ell are plaed randomly aording to a two-dimenional uniform ditribution. The number of hannel available in eah ell i aumed to be equal to the number of (ative) wirele terminal; that i, all the ell are aumed to be fully loaded before relaying, and therefore, a relaying hannel ha to be hoen among the already ued hannel in the adjaent ell. The imulation proe onit of the following tep: 1) Set the number of ubriber (node) per ell, S. 2) Plae the ubriber randomly aro the network while maintaining S ubriber per ell. Eah ubriber i given ervie through the loet bae tation. Aign an independent lognormal hadowing omponent between eah ubriber and it bae tation. 3) Determine whether eah ubriber ha a uffiiently good link with it bae tation or not. Toward that end, ollet 100 SINR ample for eah ubriber with eah ample undergoing independent Rayleigh fading (note that all of the 100 ample have the ame lognormal hadowing omponent). Exeute a naphot power ontrol before reording eah SINR ample. For a given ubriber, if 95% or more SINR ample turn out to be above the 10 db threhold, i.e., if Pr[ SINR 10 db] 95%, (9) then laify that ubriber a one having a uffiiently good link with it bae tation (uh a ubriber doe not require relaying; indeed, it ontitute a andidate relaying node for thoe ubriber whih need relaying aitane). Otherwie (i.e., if the omplement of (9) i true), laify it a a ubriber that ha a poor link (and therefore that ubriber will require relaying aitane). 4) For all ubriber that require relaying aitane, hooe a relaying node and a relaying hannel aording to the algorithm peified in Setion II (note that the multipath fading i not taken into aount in both relaying node and relaying hannel eletion heme). 5) With relaying inorporated, ollet one again 100 SINR ample for eah ubriber, inorporating independent Rayleigh fading in eah ample, alo inorporating naphot power ontrol for eah ample. For ubriber whih are erved by their bae tation through a ingle-hop, ue (11) to determine whether the link are uffiiently good; and for thoe ubriber whoe ignal are delivered in two-hop, ue the following riterion: Pr[{ SINR 1 & SINR2} 10 db] 95%. (10) In the above, ubript 1 and 2 orrepond to the firt and eond hop, repetively. In the SINR alulation, take into aount the interferene reated a a reult of relaying (an independent Rayleigh fading and a lognormal hadowing omponent are aoiated with all the interferene link). Reord the number of ubriber that have good link, aording to (9) or (10) a appropriate, only in the four ell that ontitute the innermot luter in the 9-luter wrap around network. 6) Repeat tep 2)-5) for a total of 1000 time. The fration of ubriber that have good link, out of the total number of 4 (number of ell in the innermot luter) x S (number of ubriber per ell) x 1000 (number of run) ubriber oberved, yield the deired overage value. 7) Go to tep 1) and repeat tep 1)-6) for variou S value.

4 IV. SIMULATION RESULTS For the reult hown below, the maximum bae tation tranmit power ued for any mobile node i 1 W (30 dbm). From Fig. 2, due to the hadowing effet we oberve that the relayer eletion heme baed on pathlo offer a onitently uperior performane in omparion to thoe baed on ditane alone, a expeted. It i worthy to note the performane differene among the three eletion heme. For the ditane-baed relayer eletion heme, the enhaned overage range from approximately 76% to 90%, at a ubriber denity of 64 and a maximum relaying node tranmit power of 20 mw, over the 70% ae with no relaying. Meanwhile, for the pathlo-baed eletion heme, we ee an even larger performane differene among the three heme. For intane, the highet overage improvement i approximately 97%, whih i baed on the Leat Maximum Pathlo (LMP) heme; meanwhile, the leat improvement, approximately 79%, i baed on the Minimum Total Pathlo (MTP) heme. Finally, Fig. 3 offer a perpetive on how the ubriber denity impat the range of maximum relaying node tranmit power level required to ahieve a maximum attainable overage improvement at that partiular ubriber denity. A an be oberved, at a low ubriber denity (16 and below) we ee that the ut off maximum relaying node tranmit power i approximately 30 dbm (1 W) before the performane improvement tart to aturate; while, at the high ubriber denity (32 and above), the ut off i approximately 24.8 dbm (300 mw). What thi reveal i that at a reaonably high ubriber denity, mot of the potential overage improvement an be obtained at fairly low relaying node maximum tranmit power level. V. DISCUSSIONS AND CONCLUSIONS In thi paper we invetigated the impat of variou relaying node eletion trategie on the ytem overage in a fully loaded ellular ytem. Our reult how that overage i enitive to the relaying node eletion trategy. Moreover, the degree of improvement depend on the denity and maximum tranmit power level of potential relaying node. In mall ell (interferene-limited ytem), the overage enhanement due to relaying an be inreaed ignifiantly (partiularly when uing pathlo-baed eletion heme) while uing only a low relaying node tranmit power. It hould be noted that thi dramati inreae i obtained with the ue of power ontrol. Moreover, thi performane improvement i obtained even without reerving extra hannel for relaying purpoe, ine the additional interferene due to relaying i onfined to within the viinity of the relaying/relayed node pair a a reult of power ontrol. Finally, baed on the reult in Fig. 3 it an be onluded that the higher the ubriber denity, the le tranmit power it i required of the relaying terminal ine a reaonably good relaying node eletion heme an be applied in order to aign the bet relaying/relayed node pair, whih will in turn have a poitive effet on the overage improvement. A imilar work i reported in [12] in whih ODMA (opportunity-driven multiple ae) type of relaying i onidered in a CDMA network to inreae the overage for voie ommuniation. Although a imilar finding to our i oberved there (i.e., overage i ignifiantly improved with relaying), it hould be noted that the power ontrol algorithm and the ignaling protool required are, in general, more tringent and omplex for CDMA-baed relaying network in omparion to TDMA-baed type; thi i mainly due to the inherent interferene-limited nature of CDMA network (we alo tried to make our imulation network a interferenelimited a poible by auming fully loaded ell). More information on ignaling and routing protool required to perform relaying in a ellular network an be found in [12]. Other iue that till remain open inlude relaying through fixed relayer veru wirele terminal (peer-to-peer relaying), two-hop veru multihop relaying, and mobility and handoff management in peer-to-peer relaying network. The advantage of uing fixed relayer inlude not onuming preiou reoure of the wirele terminal (whih would be the ae in peer-to-peer relaying), le handoff in a mobile environment, minimum ervie guarantee (finding a relayer will beome more diffiult in an unloaded peer-to-peer relaying network), and better eurity. The main diadvantage of fixed relayer, on the other hand, i the deployment ot. It i likely that future ellular network may upport relaying through both fixed relayer a well a wirele terminal. One final iue worth noting i that peer-to-peer relaying doe not work properly in the FDD (frequeny-diviion duplex) mode with the urrent wirele terminal tehnology. Thi i due to the fat in the FDD mode, the wirele terminal tranmit and reeived at two different frequeny band, although a relaying wirele terminal ha to be able to tranmit and reeive in both band. Therefore, TDD (timediviion duplex) i a more appropriate mode for peer-to-peer relaying. Sine fixed relayer may potentially be equipped with more advaned hardware and ignal proeing tehnique, their operation in the FDD mode may be poible. ACKNOWLEDGMENT Thi reearh wa upported by a grant from Nortel Network, Ottawa. In partiular, the author would like to thank to Dr. Baam Hahem (for pointing out the loationbaed tehnology a an aid in implifying routing) and Dr. Shalini Periyalwar of Nortel Network. REFERENCES [1] C. Chang and J. Chang, Optimal deign parameter in a multihop paket radio network uing random ae tehnique, IEEE Globeom, vol. 1, pp , [2] E. Royer, A review of urrent routing protool for ad ho mobile wirele network, IEEE Peronal Communiation, pp , April 1999.

5 [3] H. Yanikomeroglu, Fixed and mobile relaying tehnologie for ellular network, Seond Workhop on Appliation and Servie in Wirele Network (ASWN 02), pp , July 2002, Pari, Frane. [4] World Wirele Reearh Forum (WWRF) webite, [5] V. Sreng, H. Yanikomeroglu, D. Faloner, Coverage enhanement through two-hop relaying in ellular radio ytem, IEEE Wirele Commun. and Networking Conf. (WCNC 02), Marh 2002, Orlando, USA. [6] J. Laneman and G. Wornel, Energy effiient antenna haring and relaying for wirele network, IEEE Wirele Commun. and Networking Conf. (WCNC'00), pp. 7-12, Sept. 2000, Chiago, USA. [7] J. Boyer, D. D. Faloner, and H. Yanikomeroglu, A theoretial haraterization of the multihop wirele ommuniation hannel with diverity, IEEE Globeom, Nov. 2001, San Antonio, USA. [8] M. Hana and M. Alouini, End-to-end performane of tranmiion ytem with relay over Rayleigh fading hannel, ubmitted to IEEE Tranation on Wirele Communiation. [9] Y. Ko and N. Vaidya, Loation-aided routing (LAR) in mobile ad ho network, MobiCom, pp , [10] R. Jain, et. al, Geographial routing uing partial information for wirele ad ho network, IEEE Communiation Magazine, pp , Feb [11] I. Stojmenovi, Poition-baed routing in ad ho network, IEEE Communiation Magazine, pp , July [12] T. Roue, I. Band, and S. MLaughlin, Capaity and power invetigation of opportunity driven multiple ae (ODMA) network in TDD-CDMA baed ytem, IEEE Int. l Conf. on Commun. (ICC 02), pp , April 2002, New York, USA. Fig. 1. Illutration of three poible route baed on three different relaying node eletion heme (the number attahed to the edge indiate the pathloe in db). Fig. 2. Coverage v. number of ubriber per ell (with power ontrol, maximum relay node tx power: 20 mw (13 dbm)). Fig. 3. Coverage v. maximum relaying node tranmit power (with power ontrol, Leat Maximum Pathlo (LMP) eletion).

Description of Traffic in ATM Networks by the First Erlang Formula

Description of Traffic in ATM Networks by the First Erlang Formula 5th International Conferene on Information Tehnology and Appliation (ICITA 8) Deription of Traffi in ATM Network by the Firt Erlang Formula Erik Chromý, Matej Kavaký and Ivan Baroňák Abtrat In the paper

More information

Combined Radix-10 and Radix-16 Division Unit

Combined Radix-10 and Radix-16 Division Unit Combined adix- and adix-6 Diviion Unit Tomá ang and Alberto Nannarelli Dept. of Eletrial Engineering and Computer Siene, Univerity of California, Irvine, USA Dept. of Informati & Math. Modelling, Tehnial

More information

Incorporating Speculative Execution into Scheduling of Control-flow Intensive Behavioral Descriptions

Incorporating Speculative Execution into Scheduling of Control-flow Intensive Behavioral Descriptions Inorporating Speulative Exeution into Sheduling of Control-flow Intenive Behavioral Deription Ganeh Lakhminarayana, Anand Raghunathan, and Niraj K. Jha Dept. of Eletrial Engineering C&C Reearh Laboratorie

More information

Deterministic Access for DSRC/802.11p Vehicular Safety Communication

Deterministic Access for DSRC/802.11p Vehicular Safety Communication eterminiti Ae for SRC/802.11p Vehiular Safety Communiation Jihene Rezgui, Soumaya Cheraoui, Omar Charoun INTERLAB Reearh Laboratory Univerité de Sherbrooe, Canada {jihene.rezgui, oumaya.heraoui, omar.haroun

More information

KINEMATIC ANALYSIS OF VARIOUS ROBOT CONFIGURATIONS

KINEMATIC ANALYSIS OF VARIOUS ROBOT CONFIGURATIONS International Reearh Journal of Engineering and Tehnology (IRJET) e-in: 39-6 Volume: 4 Iue: May -7 www.irjet.net p-in: 39-7 KINEMATI ANALYI OF VARIOU ROBOT ONFIGURATION Game R. U., Davkhare A. A., Pakhale..

More information

1. Introduction. Abstract

1. Introduction. Abstract Automati Ontology Derivation Uing Clutering for Image Claifiation 1 Latifur Khan and Lei Wang Department of Computer Siene Univerity of Texa at Dalla, TX 75083-0688 Email: [lkhan, leiwang]@utdalla.edu

More information

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity

More information

Macrohomogenous Li-Ion-Battery Modeling - Strengths and Limitations

Macrohomogenous Li-Ion-Battery Modeling - Strengths and Limitations Marohomogenou Li-Ion-Battery Modeling - Strength and Limitation Marku Lindner Chritian Wieer Adam Opel AG Sope Purpoe of the reearh: undertand and quantify impat of implifiation in marohomogeneou model

More information

Visual Targeted Advertisement System Based on User Profiling and Content Consumption for Mobile Broadcasting Television

Visual Targeted Advertisement System Based on User Profiling and Content Consumption for Mobile Broadcasting Television Viual Targeted Advertiement Sytem Baed on Uer Profiling and ontent onumption for Mobile Broadating Televiion Silvia Uribe Federio Alvarez Joé Manuel Menéndez Guillermo inero Abtrat ontent peronaliation

More information

ISSN (Online), Volume 1, Special Issue 2(ICITET 15), March 2015 International Journal of Innovative Trends and Emerging Technologies

ISSN (Online), Volume 1, Special Issue 2(ICITET 15), March 2015 International Journal of Innovative Trends and Emerging Technologies International Journal of Innovative Trend and Emerging Tehnologie ROBUST SCAN TECHNIQUE FOR SECURED AES AGAINST DIFFERENTIAL CRYPTANALYSIS BASED SIDE CHANNEL ATTACK A.TAMILARASAN 1, MR.A.ANBARASAN 2 1

More information

Shortest Paths in Directed Graphs

Shortest Paths in Directed Graphs Shortet Path in Direted Graph Jonathan Turner January, 0 Thi note i adapted from Data Struture and Network Algorithm y Tarjan. Let G = (V, E) e a direted graph and let length e a real-valued funtion on

More information

Parametric Micro-level Performance Models for Parallel Computing

Parametric Micro-level Performance Models for Parallel Computing Computer Siene Tehnial Report Computer Siene 12-5-1994 Parametri Miro-level Performane Model for Parallel Computing Youngtae Kim Iowa State Univerity Mark Fienup Iowa State Univerity Jeffrey S. Clary Iowa

More information

COURSEWORK 1 FOR INF2B: FINDING THE DISTANCE OF CLOSEST PAIRS OF POINTS ISSUED: 9FEBRUARY 2017

COURSEWORK 1 FOR INF2B: FINDING THE DISTANCE OF CLOSEST PAIRS OF POINTS ISSUED: 9FEBRUARY 2017 COURSEWORK 1 FOR INF2B: FINDING THE DISTANCE OF CLOSEST PAIRS OF POINTS ISSUED: 9FEBRUARY 2017 Submiion Deadline: The ourework onit of two part (of a different nature) relating to one problem. A hown below

More information

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart. Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut

More information

Datum Transformations of NAV420 Reference Frames

Datum Transformations of NAV420 Reference Frames NA4CA Appliation Note Datum ranformation of NA4 Referene Frame Giri Baleri, Sr. Appliation Engineer Crobow ehnology, In. http://www.xbow.om hi appliation note explain how to onvert variou referene frame

More information

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks 62 Uplink Channel Alloation Sheme and QoS Management Mehanism for Cognitive Cellular- Femtoell Networks Kien Du Nguyen 1, Hoang Nam Nguyen 1, Hiroaki Morino 2 and Iwao Sasase 3 1 University of Engineering

More information

OSI Model. SS7 Protocol Model. Application TCAP. Presentation Session Transport. ISDN-UP Null SCCP. Network. MTP Level 3 MTP Level 2 MTP Level 1

OSI Model. SS7 Protocol Model. Application TCAP. Presentation Session Transport. ISDN-UP Null SCCP. Network. MTP Level 3 MTP Level 2 MTP Level 1 Direte Event Simulation of CCS7 DAP Benjamin, AE Krzeinki and S Staven Department of Computer Siene Univerity of Stellenboh 7600 Stellenboh, South Afria fbenj,aek,taveng@.un.a.za ABSTRACT: Complex imulation

More information

An Evolutionary Multiple Heuristic with Genetic Local Search for Solving TSP

An Evolutionary Multiple Heuristic with Genetic Local Search for Solving TSP An Evolutionary Multiple Heuriti with Geneti Loal Searh for Solving TSP Peng Gang Ihiro Iimura 2 and Shigeru Nakayama 3 Department of Information and Computer Siene Faulty of Engineering Kagohima Univerity

More information

Inverse Kinematics 1 1/29/2018

Inverse Kinematics 1 1/29/2018 Invere Kinemati 1 Invere Kinemati 2 given the poe of the end effetor, find the joint variable that produe the end effetor poe for a -joint robot, given find 1 o R T 3 2 1,,,,, q q q q q q RPP + Spherial

More information

Automatic design of robust PID controllers based on QFT specifications

Automatic design of robust PID controllers based on QFT specifications IFAC Conferene on Advane in PID Control PID'1 Breia (Italy), Marh 8-3, 1 Automati deign of robut PID ontroller baed on QFT peifiation R. Comaòliva*, T. Eobet* J. Quevedo* * Advaned Control Sytem (SAC),

More information

Pruning Game Tree by Rollouts

Pruning Game Tree by Rollouts Pruning Game Tree by Rollout Bojun Huang Mirooft Reearh bojhuang@mirooft.om Abtrat In thi paper we how that the α-β algorithm and it ueor MT-SSS*, a two lai minimax earh algorithm, an be implemented a

More information

Multi-Channel Wireless Networks: Capacity and Protocols

Multi-Channel Wireless Networks: Capacity and Protocols Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:

More information

Increasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment

Increasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in

More information

1 The secretary problem

1 The secretary problem Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two

More information

Correlation Models for Shadow Fading Simulation

Correlation Models for Shadow Fading Simulation Correlation Model for Shadow Fading Simulation IEEE 80.6 Preentation Submiion Template (Rev. 8.3) Document Number: IEEE S80.6m-07/060 Date Submitted: 007-03-3 Source: I-Kang Fu, Chi-Fang Li, E-mail: IKFu@itri.org.tw

More information

How to Select Measurement Points in Access Point Localization

How to Select Measurement Points in Access Point Localization Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,

More information

Routing Definition 4.1

Routing Definition 4.1 4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing

More information

Key Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.

Key Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing. Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in

More information

/06/$ IEEE 364

/06/$ IEEE 364 006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;

More information

Calculations for multiple mixers are based on a formalism that uses sideband information and LO frequencies: ( ) sb

Calculations for multiple mixers are based on a formalism that uses sideband information and LO frequencies: ( ) sb Setting frequeny parameter in the WASP databae A. Harri 24 Aug 2003 Calulation for multiple mixer are baed on a formalim that ue ideband information and LO frequenie: b b := ign f ig f LO f IF := f ig

More information

arxiv: v1 [physics.soc-ph] 17 Oct 2013

arxiv: v1 [physics.soc-ph] 17 Oct 2013 Emergene of Blind Area in Information Sreading arxiv:131707v1 [hyi.o-h] 17 Ot 2013 Zi-Ke Zhang 1,2,, Chu-Xu Zhang 1,3,, Xiao-Pu Han 1,2 and Chuang Liu 1,2 1 Intitute of Information Eonomy, Hangzhou Normal

More information

Kinematic design of a double wishbone type front suspension mechanism using multi-objective optimization

Kinematic design of a double wishbone type front suspension mechanism using multi-objective optimization 5 th utralaian Congre on pplied Mehani, CM 2007 10-12 Deember 2007, Bribane, utralia Kinemati deign of a double wihbone tpe front upenion mehanim uing multi-objetive optimiation J. S. wang 1, S. R. Kim

More information

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,

More information

SPH3UW Unit 7.1 The Ray Model of Light Page 2 of 5. The accepted value for the speed of light inside a vacuum is c m which we usually

SPH3UW Unit 7.1 The Ray Model of Light Page 2 of 5. The accepted value for the speed of light inside a vacuum is c m which we usually SPH3UW Unit 7. The Ray Model of Light Page of 5 Note Phyi Tool box Ray light trael in traight path alled ray. Index of refration (n) i the ratio of the peed of light () in a auu to the peed of light in

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

Stochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang

Stochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,

More information

Q1:Choose the correct answer:

Q1:Choose the correct answer: Q:Chooe the orret anwer:. Purpoe of an OS i a. Create abtration b. Multiple proee ompete for ue of proeor. Coordination. Sheduler deide a. whih proee get to ue the proeor b. when proee get to ue the proeor.

More information

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks Flow Demands Oriented Node Plaement in Multi-Hop Wireless Networks Zimu Yuan Institute of Computing Tehnology, CAS, China {zimu.yuan}@gmail.om arxiv:153.8396v1 [s.ni] 29 Mar 215 Abstrat In multi-hop wireless

More information

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic

More information

Topics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X

Topics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term

More information

An Experimental Study of Fractional Cooperation in Wireless Mesh Networks

An Experimental Study of Fractional Cooperation in Wireless Mesh Networks An Experimental tudy of Frational Cooperation in Wireless Mesh Networks Anthony Cale, Nariman Farsad, and Andrew W. Ekford Dept. of Computer iene and Engineering, York University 47 Keele treet, Toronto,

More information

Accommodations of QoS DiffServ Over IP and MPLS Networks

Accommodations of QoS DiffServ Over IP and MPLS Networks Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering

More information

SLA Adaptation for Service Overlay Networks

SLA Adaptation for Service Overlay Networks SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada

More information

The Association of System Performance Professionals

The Association of System Performance Professionals The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and

More information

A note on degenerate and spectrally degenerate graphs

A note on degenerate and spectrally degenerate graphs A note on degenerate and pectrally degenerate graph Noga Alon Abtract A graph G i called pectrally d-degenerate if the larget eigenvalue of each ubgraph of it with maximum degree D i at mot dd. We prove

More information

An efficient resource allocation algorithm for OFDMA cooperative relay networks with fairness and QoS guaranteed

An efficient resource allocation algorithm for OFDMA cooperative relay networks with fairness and QoS guaranteed Univerity of Wollongong Reearch Online Faculty of Informatic - Paper (Archive) Faculty of Engineering and Information Science 200 An efficient reource allocation algorithm for OFDMA cooperative relay network

More information

Lecture 14: Minimum Spanning Tree I

Lecture 14: Minimum Spanning Tree I COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce

More information

New Channel Allocation Techniques for Power Efficient WiFi Networks

New Channel Allocation Techniques for Power Efficient WiFi Networks ew Channel Alloation Tehniques for Power Effiient WiFi etworks V. Miliotis, A. Apostolaras, T. Korakis, Z. Tao and L. Tassiulas Computer & Communiations Engineering Dept. University of Thessaly Centre

More information

Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks

Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks Nearly Contant Approximation for Data Aggregation Scheduling in Wirele Senor Network Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Yinghu Li and France Yao Computer Science Department, City Univerity of

More information

UC Berkeley International Conference on GIScience Short Paper Proceedings

UC Berkeley International Conference on GIScience Short Paper Proceedings UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment

More information

A Handover Scheme for Mobile WiMAX Using Signal Strength and Distance

A Handover Scheme for Mobile WiMAX Using Signal Strength and Distance A Handover Scheme for Mobile WiMAX Uing Signal Strength and Ditance Mary Alatie, Mjumo Mzyece and Anih Kurien Department of Electrical Engineering/French South African Intitute of Technology (F SATI) Thwane

More information

Computer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder

Computer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal

More information

Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks

Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks Localized Minimum Spanning Tree Baed Multicat Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Senor Network Hanne Frey Univerity of Paderborn D-3398 Paderborn hanne.frey@uni-paderborn.de

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

(12) Patent Application Publication (10) Pub. No.: US 2011/ A1

(12) Patent Application Publication (10) Pub. No.: US 2011/ A1 (19) United State US 2011 0316690A1 (12) Patent Application Publication (10) Pub. No.: US 2011/0316690 A1 Siegman (43) Pub. Date: Dec. 29, 2011 (54) SYSTEMAND METHOD FOR IDENTIFYING ELECTRICAL EQUIPMENT

More information

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based

More information

Modeling of underwater vehicle s dynamics

Modeling of underwater vehicle s dynamics Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation

More information

Displacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks

Displacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks Displaement-based Route Update Strategies for Proative Routing Protools in Mobile Ad Ho Networks Mehran Abolhasan 1 and Tadeusz Wysoki 1 1 University of Wollongong, NSW 2522, Australia E-mail: mehran@titr.uow.edu.au,

More information

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,

More information

(12) Patent Application Publication (10) Pub. No.: US 2003/ A1

(12) Patent Application Publication (10) Pub. No.: US 2003/ A1 US 2003O196031A1 (19) United State (12) Patent Application Publication (10) Pub. No.: US 2003/0196031 A1 Chen (43) Pub. Date: Oct. 16, 2003 (54) STORAGE CONTROLLER WITH THE DISK Related U.S. Application

More information

Parallel MATLAB at FSU: Task Computing

Parallel MATLAB at FSU: Task Computing Parallel MATLAB at FSU: Tak John Burkardt Department of Scientific Florida State Univerity... 1:30-2:30 Thurday, 07 April 2011 499 Dirac Science Library... http://people.c.fu.edu/ jburkardt/preentation/...

More information

Detection of RF interference to GPS using day-to-day C/No differences

Detection of RF interference to GPS using day-to-day C/No differences 1 International Symposium on GPS/GSS Otober 6-8, 1. Detetion of RF interferene to GPS using day-to-day /o differenes Ryan J. R. Thompson 1#, Jinghui Wu #, Asghar Tabatabaei Balaei 3^, and Andrew G. Dempster

More information

About this Topic. Topic 4. Arithmetic Circuits. Different adder architectures. Basic Ripple Carry Adder

About this Topic. Topic 4. Arithmetic Circuits. Different adder architectures. Basic Ripple Carry Adder About thi Topi Topi 4 Arithmeti Ciruit Peter Cheung Department of Eletrial & Eletroni Engineering Imperial College London URL: www.ee.imperial.a.uk/pheung/ E-mail: p.heung@imperial.a.uk Comparion of adder

More information

We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors

We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors We are IntehOpen, the worl leaing publiher of Open Ae book Built by ientit, for ientit 4, 116, 12M Open ae book available International author an eitor Downloa Our author are among the 154 Countrie elivere

More information

Stress-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling

Stress-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling Stre-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling Menter F.R. ANSYS Germany GmbH Introduction It i oberved in many CFD imulation that RANS model how inherent technology limitation

More information

The norm Package. November 15, Title Analysis of multivariate normal datasets with missing values

The norm Package. November 15, Title Analysis of multivariate normal datasets with missing values The norm Package November 15, 2003 Verion 1.0-9 Date 2002/05/06 Title Analyi of multivariate normal dataet with miing value Author Ported to R by Alvaro A. Novo . Original by Joeph

More information

Audio-Visual Voice Command Recognition in Noisy Conditions

Audio-Visual Voice Command Recognition in Noisy Conditions Audio-Viual Voice Command Recognition in Noiy Condition Joef Chaloupka, Jan Nouza, Jindrich Zdanky Laboratory of Computer Speech Proceing, Intitute of Information Technology and Electronic, Technical Univerity

More information

Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks

Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Ho Wireless Networks Giorgio Quer, Federio Librino, Lua Canzian, Leonardo Badia, Mihele Zorzi, University of California San Diego La

More information

[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata

[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online

More information

Multi-Target Tracking In Clutter

Multi-Target Tracking In Clutter Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and

More information

Keywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE

Keywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE Volume 5, Iue 8, Augut 2015 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Verification of Agent

More information

Cluster-based Cooperative Communication with Network Coding in Wireless Networks

Cluster-based Cooperative Communication with Network Coding in Wireless Networks Cluster-based Cooperative Communiation with Network Coding in Wireless Networks Zygmunt J. Haas Shool of Eletrial and Computer Engineering Cornell University Ithaa, NY 4850, U.S.A. Email: haas@ee.ornell.edu

More information

A Novel Grey-RSS Navigation System Design for Mobile Robots

A Novel Grey-RSS Navigation System Design for Mobile Robots A vel Grey-RSS Navigation Sytem Deign for Mobile Robot Albert Wen-Long Yao*,, Hin-Te Liao, and Shiou-De Chen Department of Mechanical and Automation Engineering, National Kaohiung Firt Univerity of Science

More information

A SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS

A SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt

More information

Multi-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks

Multi-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks Multi-hop Fast Conflit Resolution Algorithm for Ad Ho Networks Shengwei Wang 1, Jun Liu 2,*, Wei Cai 2, Minghao Yin 2, Lingyun Zhou 2, and Hui Hao 3 1 Power Emergeny Center, Sihuan Eletri Power Corporation,

More information

A study on turbo decoding iterative algorithms

A study on turbo decoding iterative algorithms Buletinul Ştiinţific al Univerităţii "Politehnica" din Timişoara Seria ELECTRONICĂ şi TELECOMUNICAŢII TRANSACTIONS on ELECTRONICS and COMMUNICATIONS Tom 49(63, Facicola 2, 2004 A tudy on turbo decoding

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog

More information

Service and Network Management Interworking in Future Wireless Systems

Service and Network Management Interworking in Future Wireless Systems Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering

More information

Research Article Energy-Efficient Reservation-Based Medium Access Control Protocol for Wireless Sensor Networks

Research Article Energy-Efficient Reservation-Based Medium Access Control Protocol for Wireless Sensor Networks Hindawi Publihing Corporation EUASIP Journal on Wirele Communication and Networking Volume 2010, Article ID 878412, 22 page doi:101155/2010/878412 eearch Article Energy-Efficient eervation-baed Medium

More information

Shortest Path Routing in Arbitrary Networks

Shortest Path Routing in Arbitrary Networks Journal of Algorithm, Vol 31(1), 1999 Shortet Path Routing in Arbitrary Network Friedhelm Meyer auf der Heide and Berthold Vöcking Department of Mathematic and Computer Science and Heinz Nixdorf Intitute,

More information

Trainable Context Model for Multiscale Segmentation

Trainable Context Model for Multiscale Segmentation Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu

More information

In-Plane Shear Behavior of SC Composite Walls: Theory vs. Experiment

In-Plane Shear Behavior of SC Composite Walls: Theory vs. Experiment Tranation, MiRT, 6- November,, New Delhi, India Div-VI: Paper ID# 764 In-Plane hear Behavior of C Compoite Wall: Theory v. Experiment Amit H. Varma, ai Zhang, Hoeok Chi 3, Peter Booth 4, Tod Baker 5 Aoiate

More information

A Novel Method for Removing Image Staircase Artifacts

A Novel Method for Removing Image Staircase Artifacts Vol.139 (SIP 016, pp.56-63 http://dx.doi.org/10.1457/atl.016.139.54 A Novel Method for Removing Image Stairae Artifat Zhong Chen 1,, Zhiwei Hou 1, Yuegang Xing, Xiaobing Chen 1 1 Jiangu Key Laboratory

More information

SINR-based Network Selection for Optimization in Heterogeneous Wireless Networks (HWNs)

SINR-based Network Selection for Optimization in Heterogeneous Wireless Networks (HWNs) 48 J. ICT Res. Appl., Vol. 9, No., 5, 48-6 SINR-based Network Seletion for Optimization in Heterogeneous Wireless Networks (HWNs) Abubakar M. Miyim, Mahamod Ismail & Rosdiadee Nordin Department of Eletrial,

More information

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu

More information

See chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM

See chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive

More information

Acoustic Links. Maximizing Channel Utilization for Underwater

Acoustic Links. Maximizing Channel Utilization for Underwater Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy Email: {harris,davide.meneghetti,zorzi}@dei.unipd.it

More information

Bringin. Andrew. Cambridge, CB3. once the. sensing multiple touch. the entire hand. of fine-grained. to approach hides.

Bringin. Andrew. Cambridge, CB3. once the. sensing multiple touch. the entire hand. of fine-grained. to approach hides. Bringin ng Phyi to the Surfae Andrew D. Wilon 1, Shahram Izadi 2, Otmar Hillige 2, Armando Garia-Mendoza 2, David Kirk 2 1 Mirooft Reearh 2 Mirooft Reearh Cambridge One Mirooft Way 7 JJ Thomon Avenue Redmond,

More information

Distributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router

Distributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To

More information

SIMIT 7. Profinet IO Gateway. User Manual

SIMIT 7. Profinet IO Gateway. User Manual SIMIT 7 Profinet IO Gateway Uer Manual Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult are only non-binding uggetion

More information

Power Aware Location Aided Routing in Mobile Ad-hoc Networks

Power Aware Location Aided Routing in Mobile Ad-hoc Networks International Journal of Scientific and Reearch Publication, Volume, Iue 1, December 01 1 Power Aware Location Aided Routing in Mobile Ad-hoc Network Anamika Computer Science, Inderprataha Engineering

More information

Karen L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract

Karen L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract Mot Graph are Edge-Cordial Karen L. Collin Dept. of Mathematic Weleyan Univerity Middletown, CT 6457 and Mark Hovey Dept. of Mathematic MIT Cambridge, MA 239 Abtract We extend the definition of edge-cordial

More information

Contents. shortest paths. Notation. Shortest path problem. Applications. Algorithms and Networks 2010/2011. In the entire course:

Contents. shortest paths. Notation. Shortest path problem. Applications. Algorithms and Networks 2010/2011. In the entire course: Content Shortet path Algorithm and Network 21/211 The hortet path problem: Statement Verion Application Algorithm (for ingle ource p problem) Reminder: relaxation, Dijktra, Variant of Dijktra, Bellman-Ford,

More information

Using Bayesian Networks for Cleansing Trauma Data

Using Bayesian Networks for Cleansing Trauma Data Uing Bayeian Network for Cleaning Trauma Data Prahant J. Dohi pdohi@.ui.edu Dept. of Computer Siene Univ of Illinoi, Chiago, IL 60607 Lloyd G. Greenwald lgreenwa@.drexel.edu Dept. of Computer Siene Drexel

More information

Refining SIRAP with a Dedicated Resource Ceiling for Self-Blocking

Refining SIRAP with a Dedicated Resource Ceiling for Self-Blocking Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT

More information

A User-Attention Based Focus Detection Framework and Its Applications

A User-Attention Based Focus Detection Framework and Its Applications A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information

More information

Chapter 13 Non Sampling Errors

Chapter 13 Non Sampling Errors Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption

More information

A Multi-Head Clustering Algorithm in Vehicular Ad Hoc Networks

A Multi-Head Clustering Algorithm in Vehicular Ad Hoc Networks International Journal of Computer Theory and Engineering, Vol. 5, No. 2, April 213 A Multi-Head Clustering Algorithm in Vehiular Ad Ho Networks Shou-Chih Lo, Yi-Jen Lin, and Jhih-Siao Gao Abstrat Clustering

More information

Optimizing Large-Scale MIMO Cellular Downlink: Multiplexing, Diversity, or Interference Nulling?

Optimizing Large-Scale MIMO Cellular Downlink: Multiplexing, Diversity, or Interference Nulling? Optimizing Large-Sale MIMO Cellular Downlink: Multiplexing, Diversity, or Interferene Nulling? Kianoush Hosseini, Wei Yu, and Raviraj S. Adve The Edward S. Rogers Sr. Department of Eletrial and Computer

More information