A Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET)
|
|
- Sydney Jackson
- 5 years ago
- Views:
Transcription
1 A Novel Optmzaton of the Dstance Source Routng (DSR) Protocol for the Moble Ad Hoc Networs (MANET) Syed S. Rzv 1, Majd A. Jafr, and Khaled Ellethy Computer Scence and Engneerng Department Unversty of Brdgeport Brdgeport, CT {srzv, majdals, Aasa Rasat Department of Computer Scence Insttute of Busness Management Karach, Pastan Abstract- Ths paper presents a new scheme for the Dstance Source Routng (DSR) protocol whch shows the mprovement over the two major metrcs of the DSR protocol: Route Dscovery and Route Mantenance. In addton, we present a mathematcal model that ncludes probablty densty functon for these two observed metrcs. Our smulaton results demonstrate a sgnfcant mprovement n the route dscovery, transmsson tme, and the overall networ utlzaton. As an nterestng sde result, our analyss also shows that the proposed model can be used to effectvely reduce the pacet losses. Keywords- DS-CDMA, bt error rate, data throughput, multuser communcatons I. INTRODUCTION The Dynamc Source Routng (DSR) protocol s dealt under On-Demand Routng (ODR) protocol whch s just an exact opposte to the Table-Drven Routng (TDR) [2, 3]. Generally, there are two man phases use n the DSR protocol. One s the Route Dscovery (RD) phase whch dscovers all the possble paths for the pacets to be transferred from a partcular source to a destnaton. It s essental to properly mantan the RD phase snce mantanng a separate table for storng routng detals nvolves cost ssues. The second phase of the DSP protocol s the Route Mantenance (RM) phase whch fxes all the possble paths from one partcular source to a destnaton [5]. In DSR, the pacets are transmtted only one tme for each node. If the node does not receve the pacet, the prevous node s responsble to mae attempts n order to transmt the pacet. On the other hand, f the destnaton node receves the pacet successfully, an acnowledgment s transmtted bac to the source node for the receved pacet. Snce the use of the DSR protocol does not requre the mantenance of a cache table, t allows us to avod unnecessary updatng wors whch results space and tme savng advantages. In the exstng DSR scheme, the malfunctonng of one or more lns along a certan route requres the retransmsson of all pacets bac to the orgnatng source node. Ths unnecessary amount of retransmsson results a sgnfcant transmsson overhead that can severely degrade the overall networ performance by ncreasng the average tme delay. In order to mnmze the transmsson overhead and maxmze the networ throughput, we present an alternatve scheme that can be used to optmze the performance of DSR protocol. Specfcally, our proposed scheme suggests mprovement n the RD and the RM metrcs of the DSR protocol. Based on the proposed optmzaton, we derve a mathematcal model whch proves the correctness of the proposed scheme. II. PROPOSED OPTIMIZATION FOR THE DSR PROTOCOL Our man goal s to mantan the orgnal underlyng archtecture of the DSR protocol. Therefore, we consder the DSR scheme as a blac box. The DSR protocol fals to mantan route consstency n the presence of broen lns. When one of the lns goes down, the DSR protocol locates an alternate route and transmts bac the pacet to the source node where the pacet was orgnated. On contrary to the actual scheme of the DSR protocol, our proposed scheme uses a reserve drecton search method. In our proposed scheme, the pacets would be transmtted to the mmedate pror node where the actual error was occurred. The proposed scheme then fnds one or more alternatve routes from the current locaton to the destnaton. Ths mples that the whole searchng procedure of the proposed scheme wll 1 Contact author: srzv@brdgeport.edu,
2 Fg.1. Fndng the alternate path n DSR protocol accordng to the proposed scheme be done n the opposte drecton startng from the destnaton node. Our smulaton results demonstrate that the proposed scheme consderably ncreases the chance of fndng a vald route for salvage pacets that are typcally stored n the send buffer. For nstance, consder an example for locatng a route based on the reverse drecton search scheme as shown n Fg. 1. It can be observed that the route fnds by the RD procedure from node A (source node) to L would be: A D E I L. Durng transmsson of the pacets, t s detected at run tme that the shortest ln between node E and I goes down. Consequently, the proposed scheme mmedately starts searchng the best avalable alternate routes. In order to reach the destnaton node, the proposed scheme locates the neghborng nodes (.e., node B, D, and H from node E). Ths process of fndng the alternate route from the locaton of error results an optmal alternate route: A D E I H L. Ths mples that our proposed scheme nether send any feedbac to the destnaton node A nor t ntates the route dscovery from the source pont. Therefore, repeatng ths search n the reverse drecton from the current locaton of error to the neghborng nodes results a sgnfcant ncrease n the chance of fndng a vald optmzed route. A. Proposed Reverse Drecton Search Scheme In order to formulate the proposed scheme, we present a model that shows smple steps that need to be mplemented for fndng a vald and optmze route n the presence of ln falures. The model s presented n Fg. 2. The model s typcally dvded nto two parts. The upper part of the model represents the RD procedure where as the lower part represents the RM procedure. The RD procedure s based on an exhaustve search of an nternal cache. Durng the transmsson of a pacet, f one of the lns goes down, the proposed scheme mentons that the pacet wll be Fg. 2. Flow chart showng proposed model of DSR algorthm mmedately forwarded to the next avalable node and starts transmttng from the new locaton. Unle the DSR protocol, the proposed scheme mnmzes the transmsson overhead by avodng the unnecessary transmsson of data to the source node n the presence of a faulty ln. In other words, the proposed scheme does not provde any feedbac to the source node that leads to a sgnfcant mprovement n the networ throughput. Snce the RD can be done on the current node, we do not need to focus on the source node. Ths mples that the proposed scheme suggests the best
3 delvery of the pacets even n the presence of ln falure. In addton, the repetton of the pacets due to the floodng wll be cut down. In the proposed model, we manly focus on the RD and the RM. Durng the RD process, f the entres are found n the nternal cache of the next node, the proposed scheme determnes the optmal path that wll be used to forward all the pacets to the next node. At that current node locaton, the same procedure for searchng the optmal path wll be repeated over the passage of tme n order to fnd the best path towards the destnaton. An empty entry n the nternal cache represents that there s no vald route exst for a partcular destnaton. In such a scenaro, the proposed scheme wll looup nto the next neghbor s cache and determne the best avalable route for the desred destnaton. Once the optmal route s dscovered, the pacet can then be transmtted. In the RM process, whenever there s a ln falure along the path, the pacet would not go further at the pont of error and there s no need to send any feedbac to the orgnal source node. Instead, the proposed scheme determnes and performs the RM process on the best avalable alternate path. B. Mathematcal Model We derve our mathematcal model based on the proposed reverse drecton scheme. In our mathematcal model, we show that the transmsson of pacets va an alternate route s more effcent as compared to transmttng pacets from the source node usng a prmary route. Ths s especally true n the presence of error. All system varables, along wth ther defnton, are lsted n Table I. The accuracy of the proposed scheme s essentally dependent on how effcently we can dscover the alternate routes n the presence of faulty lns. In general, the accuracy s partally related to a certan nterval by whch we perform the RD procedure for a specfc type of networ traffc such as a stream of pacets. In partcular, we frst need to derve an expresson for a random varable, x, that can be used to characterze the behavor of RD process wth respect to tme. Therefore, n order to mplement the proposed scheme, one must measure the frequency of route dscoveres. In order to determne the nterval between the route dscoveres, the followng mathematcal expresson can be derved for a random varable, x: + xf ( x ) dx (1) It should be noted that equaton (1) s based on the PDF whch s used to fnd the frequency of route dscovery for a partcular par of source and destnaton. Fgure 4 represents the proposed scheme wth the prmary and the secondary paths along wth ther correspondng lns. It can be seen n Fg. 3 that the node P represents the prmary route whereas the node S represents the secondary Parameters P S X P X S X R T E o f T(t) Z P S TABLE I SYSTEM PARAMETERS AND DEFINITIONS Descrpton Ths represents the th ln n a prmary path. Ths represents the th ln n a secondary path. Lfe tme of the th prmary route. Lfe tme of the th secondary route. Mnmum lfe tme for the collecton of all values n the prmary path lns Intervals for route dscovery An event that shows any of the gven ln fals Frequency of route dscovery Maxmum lfe tme among all avalable values. Represents the faulty prmary ln due to an event E Represents the faulty secondary ln due to an event E route. If an error occurs n the prmary route, the proposed scheme wll mmedately dscover an alternate route S 1 rather than gong bac to the source node A. In other words, n the presence of faulty lns, the proposed scheme searches the nternal cache and determnes the alternatve route S 1 whch s typcally stored n the local cache. For ths partcular scenaro, the success of the proposed scheme s heavly dependent on the rate at whch one may need to execute the RD procedure. In addton, the success of the proposed scheme s not only dependent on the rate at whch the RD procedure wll be performed but also dependent on the accuracy and the effcency by whch the alternate routes wll be determned. In order to fnd the frequency of an alternatve RD, we assume that an event E mght occur at a dscrete pont n tme n the networ whch causes an error n one of the two types of routes (.e., the prmary P and the secondary S routes). Thus the transmsson of an event can be mathematcally descrbed as: E = PS + ( P( P + S ) S ) + ( P( P( P + S ) S ) S +... (2) Fg. 3: Proposed scheme wth prmary and secondary path and ther lns
4 where P represents the faulty prmary-ln where as represents the faulty secondary-ln whch caused due to the occurrence of an event E at dscrete pont n tme wthn a networ. Equaton (2) represents a generc equaton that shows how the occurrence of an event n the networ may cause an error n the alternate routes. Equaton (2) can be further extended for the maxmum K number of forwardng lns wthn the avalable prmary paths. It should be noted that the occurrence of an event E s representng a cause of malfunctonng n the currently used vald route. Tang these factors nto account, one may wrte the followng mathematcal expresson: E = P S + P S S + P S S S P S S 1 S1 where P and S n (3) represent the faulty prmary and secondary lns, respectvely. Both of these faulty lns are caused due to the occurrence of an event E at a dscrete pont n tme wthn a networ. It should be noted that we only consder the values of the most forwardng lns that one may fnd wthn the prmary path lns from the generc equaton (2). One of our observatons about the two phases of the proposed scheme s the lfe tme of the prmary path whch we use to transmt the pacets to the desred destnaton n the presence of the faulty lns. In other words, n order to effectvely mplement the proposed scheme, we must determne the mnmum value of the lfe tme for prmary path lns. Ths calculaton s essental, snce the raton of determnng the accurate vald prmary lns s crtcally dependent on the nowledge of accurate values of lfetme. The mnmum lfe tme of prmary path lns s smply chosen from one of the prmary lns that has a smallest value for the lfe tme. In other words, f one of the th prmary routes has the smallest lfe tme value, ths wll be chosen as a mnmum lfe tme value for the prmary path lns. Ths hypothess can be changed nto a smple expresson: R p1 p2 p S (3) X = Mn X, X,..., X (4) where X R n (4) represents the mnmum lfe tme value for the collecton of all values n the prmary path lns. The rght hand sde expresson of (4) represents the lfe tme of each ndvdual prmary route startng from X p1 to X p. These values are consdered as a lfe tme of the sub lns n the prmary path. Smlar to (4), we can further extend our mathematcal model for computng the nterval of tme for the RD procedure: T = Max X, X,..., X (5) s1 s2 sn where T represents the ntervals of tme for the RD and X S represents the lfe tme of the th secondary route. Equaton (5) gves an estmate of the tme to be taen by the proposed scheme for the RD procedure. Ths value s evaluated from the maxmum values of the collected tme n the sub lns of the secondary path. The rght hand sde expresson of (5) represents the lfe tme of each ndvdual secondary route startng from X s1 to X sn. For the sae of the smulaton and the performance evaluaton, we assume that the value of T wll be measured n mllsecond. Combnng (4) wth (5), we can compute the value of the alternatve route dscovery as follows: T = Mn Max( X. X ), Max( X. X. X ) p1 s1 p2 s2 s1... Max( X, X, X,... X ) p s s 1 s1 Equaton (6) gves the value of the alternatve RD. Ths can be consdered as the optmum value whch s determned from all the avalable maxmum values for both the prmary and the secondary lns. Usng (6), we can compute the values for the RD metrcs whch s one of the subparts of the proposed scheme. Z = M a x X, X, X 1,..., X 1 (7) p s s s where Z represents the maxmum lfe tme among all avalable values for both prmary and the secondary paths. Recall (1), we can now derve an expresson for the frequency of RD usng equatons (2) to (6). N N λ t λ t f T ( t ) = λ e (1 e ) = 1 = 1 (6) (8) where the rght hand sde of (8) represents the frequency of RD. Equaton (7) also has a sgnfcant mpact on the RD for the alternate path. Implementng the results of (7) on (8), we can derve a new expresson for the frequency of the RD whch tae nto account the maxmum lfe tme among all avalable values for both prmary and the secondary paths. In addton, ths mplementaton descrbes the PDF n Z wth respect to the RD metrcs.
5 f Z ( t) = λ ( ) ( λ ( ) ) 1 j e j t λ j= 1 = 1, j ( ) (1 e t) (9) where λ = = and for 1/l ( ) j / l for j 1, 2... j=+1. Equaton (9) descrbes the summaton of all the possble routes whch can lead us to the desred destnaton. Equaton (9) can be further extended for the followng gven expressons: T = Mn Max( X. X ), Max( X. X. X ) p1 s1 p2 s2 s1... Max( X, X, X,... X ) p s s 1 s1 Z = Max( X, X, X... X ) p s s 1 s1 T = Mn( Z1, Z2, Z3... Z ) Based on the above three expressons, we can approxmate the PDF of T for the frequency of RD as follows: f ( t) = lm p[ t T t + dt]/ dt (10) T dt 0 Equaton (10) gves the value for the frequency of the RD n terms of a PDF functon. Relatng (8) and (9) wth (10), we can derve the followng mathematcal expresson f ( t) = f ( t) p[ z > z ] T Z j = 1 j= 1, j 1 f ( t) = f ( t) (1 Fz ( t)) T Z = 1 j= 1, j 1 (11) where, F z(t) n (11) was ntroduced from (7) to mae Z as a functon of PDF. Equaton (11) shows that we derved the expected expresson whch can be used to compute the nterval between the rout dscoveres. In other words, one could use (11) to determne the frequency of the alternate RD process. The same frequency value can be used to measure the effcency of the networ. In addton, the fnal results show that the use of the proposed reverse drecton scheme wth the derved mathematcal model can effectvely mnmze the transmsson delay especally n the presence of collsons (lns error) or faulty lns due to the malfunctonng. Fg.4. Number of nodes versus RD III. SIMULATION RESULTS We smulate our model based on the predcted data from the exstng DSR model suggested n [1, 4]. For the sae of smulaton and the performance evaluaton, we consder two major metrcs for RD and RM. These metrcs are consdered for the evaluaton of the effcency of a networ. For the sae of the frst smulaton (see Fg. 4), we characterze the behavor of the RD phase of the proposed scheme wth respect to the number of nodes present n the networ. The purpose of ths experment s to show the performance of the RD phase for dscoverng the alternate prmary and the secondary path. Durng the smulaton, we consder that as the number of nodes ncreases n the networ, the more pacets wll be accumulated n the networ that could affect the performance of the RD phase. It can be clearly evdent n Fg. 4 that the RD phase of the proposed scheme performs better for the prmary paths dscoveres than for the secondary path. When we have small Fg. 5. Pacet loss n fractons versus number of nodes
6 expermentally verfed that both the RD and the RM metrcs perform well wth the proposed scheme than the exstng nfrastructure of the DSR protocol. Our performance evaluaton s also well supported by the smulaton results presented n ths paper. REFERENCES Fg. 6. Tme delay versus number of nodes number of nodes, t can be seen n Fg. 4 that the performance of the RD phase for both prmary and secondary path dscoveres s overlappng. However, as networ grows n terms of the number of nodes, the performance dfferences between the prmary and the secondary path s obvous. Fg. 5 shows the pacet losses (n the fracton value) wth respect to the number of nodes durng the transmsson usng both prmary and the secondary paths. In addton, Fg. 6 represents a comparson between the tme delay (represents n seconds) and the number of nodes. It can be seen n Fg. 6 that the tme requred to dscover the prmary paths usng the RD phase s very low as compared to the tme requred to dscover the secondary paths. Based on the smulaton results of Fg. 6, we can observe that the tme delay for prmary paths s not only small but also lnear wth respect to the number of nodes. In other words, when we ncrease the number of nodes n the networ, more pacets wll be accumulated that mae a lnear ncrease n the tme delay for dscoverng the secondary paths whch s not really desrable as far as the optmum performance of the DSR protocol s concerned. [1] P. Papadmtratos and Z. Haas, Secure Routng for Moble Ad hoc Networs, In Proceedngs of the SCS Communcaton Networs and Dstrbuted Systems Modelng and Smulaton Conference (CNDS 2002), San Antono, TX, January 27-31, [2] J. Raju and J. Garca-Luna-Aceves, A comparson of on demand and table drven routng for ad-hoc wreless networs, In Proc. IEEE Internatonal Conference on Communcatons (ICC 2000), June Volume 3, Issue 2000, pp , [3] J. Raju and J. Garca-Luna-Aceves, Effcent On-Demand Routng Usng Source-Tracng n Wreless Networs, In Proc IEEE Global Telecommuncatons (GLOBECOM 2000), Vol. 1, Issue 2000, pp , November [4] B. Johnson, A. Maltz, and Y. Chun, "The Dynamc Source Routng Protocol for Moble Ad Hoc Networs. (DSR)," IETF INTERNET DRAFT, 24 February [5] V. Par and M. Corson, "A Hghly Adaptve Dstrbuted Routng Algorthm for Moble Wreless Networs," Sxteenth Annual Jont Conference of the IEEE Computer and Communcatons Socetes. Drvng the Informaton Revoluton (INFOCOM '97), pp.1405, IV. CONCLUSION In ths paper, we presented a new scheme that mproves the retransmsson mechansm for the exstng DSR protocol. In order to support our hypothess, we provded a complete mathematcal model that shows the formulaton of the proposed scheme. In partcular, we nvestgated the RD and the RM phases wth respect to the proposed reverse drecton scheme. We also showed that how effectve the proposed scheme would be when we mplement t wth the reverse drecton search for dscoverng the prmary paths. Our analyss also suggested that the dscovery of alternate prmary paths from the current source of error sgnfcantly mproves the networ performance n terms of RD process, tme delay, and the pacet losses. Moreover, we have
Procedia Computer Science
Proceda Computer Scence 3 (211) 714 72 Proceda Computer Scence (21) Proceda Computer Scence www.elsever.com/locate/proceda www.elsever.com/locate/proceda WCIT-21 Performance evaluaton of data delvery approaches
More informationCalculation of the received voltage due to the radiation from multiple co-frequency sources
Rec. ITU-R SM.1271-0 1 RECOMMENDATION ITU-R SM.1271-0 * EFFICIENT SPECTRUM UTILIZATION USING PROBABILISTIC METHODS Rec. ITU-R SM.1271 (1997) The ITU Radocommuncaton Assembly, consderng a) that communcatons
More informationA Predictive QoS Control Strategy for Wireless Sensor Networks
The 1st Worshop on Resource Provsonng and Management n Sensor Networs (RPMSN '5) n conjuncton wth the 2nd IEEE MASS, Washngton, DC, Nov. 25 A Predctve QoS Control Strategy for Wreless Sensor Networs Byu
More informationComparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate
Comparatve Analyss of Reuse and 3 n ular Network Based On IR Dstrbuton and Rate Chandra Thapa M.Tech. II, DEC V College of Engneerng & Technology R.V.. Nagar, Chttoor-5727, A.P. Inda Emal: chandra2thapa@gmal.com
More informationHigh Speed, Low Power And Area Efficient Carry-Select Adder
Internatonal Journal of Scence, Engneerng and Technology Research (IJSETR), Volume 5, Issue 3, March 2016 Hgh Speed, Low Power And Area Effcent Carry-Select Adder Nelant Harsh M.tech.VLSI Desgn Electroncs
More informationDynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University
Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout
More informationMTBF PREDICTION REPORT
MTBF PREDICTION REPORT PRODUCT NAME: BLE112-A-V2 Issued date: 01-23-2015 Rev:1.0 Copyrght@2015 Bluegga Technologes. All rghts reserved. 1 MTBF PREDICTION REPORT... 1 PRODUCT NAME: BLE112-A-V2... 1 1.0
More informationResource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks
Resource Allocaton Optmzaton for Devce-to- Devce Communcaton Underlayng Cellular Networks Bn Wang, L Chen, Xaohang Chen, Xn Zhang, and Dacheng Yang Wreless Theores and Technologes (WT&T) Bejng Unversty
More informationIEE Electronics Letters, vol 34, no 17, August 1998, pp ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES
IEE Electroncs Letters, vol 34, no 17, August 1998, pp. 1622-1624. ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES A. Chatzgeorgou, S. Nkolads 1 and I. Tsoukalas Computer Scence Department, 1 Department
More informationKalman Filter based Dead Reckoning Algorithm for Minimizing Network Traffic between Mobile Nodes in Wireless GRID
Kalman Flter based Dead Reconng Algorthm for Mnmzng Networ Traffc between Moble Nodes n Wreless GRID Seong-Whan Km and K-Hong Ko Department of Computer Scence, Unv. of Seoul, Jeon-Nong-Dong, Seoul, Korea
More information熊本大学学術リポジトリ. Kumamoto University Repositor
熊本大学学術リポジトリ Kumamoto Unversty Repostor Ttle Wreless LAN Based Indoor Poston and Its Smulaton Author(s) Ktasuka, Teruak; Nakansh, Tsune CtatonIEEE Pacfc RIM Conference on Comm Computers, and Sgnal Processng
More informationTo: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel
To: Professor Avtable Date: February 4, 3 From: Mechancal Student Subject:.3 Experment # Numercal Methods Usng Excel Introducton Mcrosoft Excel s a spreadsheet program that can be used for data analyss,
More informationThe Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks
Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. The Impact of Spectrum Sensng Frequency and Pacet- Loadng
More informationUtility-based Routing
Utlty-based Routng Je Wu Dept. of Computer and Informaton Scences Temple Unversty Roadmap Introducton Why Another Routng Scheme Utlty-Based Routng Implementatons Extensons Some Fnal Thoughts 2 . Introducton
More informationA Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results
AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of
More informationA New Type of Weighted DV-Hop Algorithm Based on Correction Factor in WSNs
Journal of Communcatons Vol. 9, No. 9, September 2014 A New Type of Weghted DV-Hop Algorthm Based on Correcton Factor n WSNs Yng Wang, Zhy Fang, and Ln Chen Department of Computer scence and technology,
More informationA Fuzzy-based Routing Strategy for Multihop Cognitive Radio Networks
74 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 3, No., Aprl 0 A Fuzzy-based Routng Strategy for Multhop Cogntve Rado Networks Al El Masr, Naceur Malouch and Hcham
More informationPrevention of Sequential Message Loss in CAN Systems
Preventon of Sequental Message Loss n CAN Systems Shengbng Jang Electrcal & Controls Integraton Lab GM R&D Center, MC: 480-106-390 30500 Mound Road, Warren, MI 48090 shengbng.jang@gm.com Ratnesh Kumar
More informationOn the Feasibility of Receive Collaboration in Wireless Sensor Networks
On the Feasblty of Receve Collaboraton n Wreless Sensor Networs B. Bantaleb, S. Sgg and M. Begl Computer Scence Department Insttute of Operatng System and Computer Networs (IBR) Braunschweg, Germany {behnam,
More informationA MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION
A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION Vncent A. Nguyen Peng-Jun Wan Ophr Freder Computer Scence Department Illnos Insttute of Technology Chcago, Illnos vnguyen@t.edu,
More informationAn Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks
An Energy Effcent Herarchcal Clusterng Algorthm for Wreless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette, IN, USA {seema,
More informationTopology Control for C-RAN Architecture Based on Complex Network
Topology Control for C-RAN Archtecture Based on Complex Network Zhanun Lu, Yung He, Yunpeng L, Zhaoy L, Ka Dng Chongqng key laboratory of moble communcatons technology Chongqng unversty of post and telecommuncaton
More informationantenna antenna (4.139)
.6.6 The Lmts of Usable Input Levels for LNAs The sgnal voltage level delvered to the nput of an LNA from the antenna may vary n a very wde nterval, from very weak sgnals comparable to the nose level,
More informationAdaptive Modulation for Multiple Antenna Channels
Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,
More informationOptimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation
T. Kerdchuen and W. Ongsakul / GMSARN Internatonal Journal (09) - Optmal Placement of and by Hybrd Genetc Algorthm and Smulated Annealng for Multarea Power System State Estmaton Thawatch Kerdchuen and
More informationHigh Speed ADC Sampling Transients
Hgh Speed ADC Samplng Transents Doug Stuetzle Hgh speed analog to dgtal converters (ADCs) are, at the analog sgnal nterface, track and hold devces. As such, they nclude samplng capactors and samplng swtches.
More informationEnhancing Throughput in Wireless Multi-Hop Network with Multiple Packet Reception
Enhancng Throughput n Wreless Mult-Hop Network wth Multple Packet Recepton Ja-lang Lu, Paulne Vandenhove, We Shu, Mn-You Wu Dept. of Computer Scence & Engneerng, Shangha JaoTong Unversty, Shangha, Chna
More informationSpace Time Equalization-space time codes System Model for STCM
Space Tme Eualzaton-space tme codes System Model for STCM The system under consderaton conssts of ST encoder, fadng channel model wth AWGN, two transmt antennas, one receve antenna, Vterb eualzer wth deal
More informationParameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation
1 Parameter Free Iteratve Decodng Metrcs for Non-Coherent Orthogonal Modulaton Albert Gullén Fàbregas and Alex Grant Abstract We study decoder metrcs suted for teratve decodng of non-coherently detected
More informationJoint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding
Communcatons and Network, 2013, 5, 312-318 http://dx.do.org/10.4236/cn.2013.53b2058 Publshed Onlne September 2013 (http://www.scrp.org/journal/cn) Jont Power Control and Schedulng for Two-Cell Energy Effcent
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 12, DECEMBER
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 3, NO. 2, DECEMBER 204 695 On Spatal Capacty of Wreless Ad Hoc Networks wth Threshold Based Schedulng Yue Lng Che, Student Member, IEEE, Ru Zhang, Member,
More informationNOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION
NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona
More informationAd hoc Service Grid A Self-Organizing Infrastructure for Mobile Commerce
Ad hoc Servce Grd A Self-Organzng Infrastructure for Moble Commerce Klaus Herrmann, Kurt Gehs, Gero Mühl Berln Unversty of Technology Emal: klaus.herrmann@acm.org Web: http://www.vs.tu-berln.de/herrmann/
More informationAdaptive Distributed Topology Control for Wireless Ad-Hoc Sensor Networks
Adaptve Dstrbuted Topology Control for Wreless Ad-Hoc Sensor Networks Ka-Tng Chu, Chh-Yu Wen, Yen-Cheh Ouyang, and Wllam A. Sethares Abstract Ths paper presents a decentralzed clusterng and gateway selecton
More informationPriority based Dynamic Multiple Robot Path Planning
2nd Internatonal Conference on Autonomous obots and Agents Prorty based Dynamc Multple obot Path Plannng Abstract Taxong Zheng Department of Automaton Chongqng Unversty of Post and Telecommuncaton, Chna
More informationA study of turbo codes for multilevel modulations in Gaussian and mobile channels
A study of turbo codes for multlevel modulatons n Gaussan and moble channels Lamne Sylla and Paul Forter (sylla, forter)@gel.ulaval.ca Department of Electrcal and Computer Engneerng Laval Unversty, Ste-Foy,
More informationDistributed Channel Allocation Algorithm with Power Control
Dstrbuted Channel Allocaton Algorthm wth Power Control Shaoj N Helsnk Unversty of Technology, Insttute of Rado Communcatons, Communcatons Laboratory, Otakaar 5, 0150 Espoo, Fnland. E-mal: n@tltu.hut.f
More informationOpportunistic Beamforming for Finite Horizon Multicast
Opportunstc Beamformng for Fnte Horzon Multcast Gek Hong Sm, Joerg Wdmer, and Balaj Rengarajan allyson.sm@mdea.org, joerg.wdmer@mdea.org, and balaj.rengarajan@gmal.com Insttute IMDEA Networks, Madrd, Span
More informationOptimal Local Topology Knowledge for Energy Efficient Geographical Routing in Sensor Networks
Optmal Local Topology Knowledge for Energy Effcent Geographcal Routng n Sensor Networks Tommaso Meloda, Daro Pompl, Ian F. Akyldz Broadband and Wreless Networkng Laboratory School of Electrcal and Computer
More informationPerformance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme
Performance Analyss of Mult User MIMO System wth Block-Dagonalzaton Precodng Scheme Yoon Hyun m and Jn Young m, wanwoon Unversty, Department of Electroncs Convergence Engneerng, Wolgye-Dong, Nowon-Gu,
More informationAd hoc Service Grid A Self-Organizing Infrastructure for Mobile Commerce
Ad hoc Servce Grd A Self-Organzng Infrastructure for Moble Commerce Klaus Herrmann Berln Unversty of Technology Emal: klaus.herrmann@acm.org Web: http://www.vs.tu-berln.de/herrmann/ PTB-Semnar, 3./4. November
More informationMedium Access Control for Multi-Channel Parallel Transmission in Cognitive Radio Networks
Medum ccess Control for Mult-Channel Parallel Transmsson n Cogntve Rado Networs Tao Shu, Shuguang Cu, and Marwan Krunz Department of Electrcal and Computer Engneerng Unversty of rzona Tucson, Z 85721 {tshu,
More informationPRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht
68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly
More informationWalsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter
Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957
More informationAn Adaptive Over-current Protection Scheme for MV Distribution Networks Including DG
An Adaptve Over-current Protecton Scheme for MV Dstrbuton Networks Includng DG S.A.M. Javadan Islamc Azad Unversty s.a.m.javadan@gmal.com M.-R. Haghfam Tarbat Modares Unversty haghfam@modares.ac.r P. Barazandeh
More informationEnergy Conservation for Ad Hoc On-Demand Distance Vector Multipath Routing Protocol
Energy Conservaton for Ad Hoc On-Demand Dstance Vector Multpath Routng Protocol Omar Smal, Zoulha Meaa, Belhadr Messabh, Rachda Me, Bernard Cousn To cte ths verson: Omar Smal, Zoulha Meaa, Belhadr Messabh,
More informationApplication of Intelligent Voltage Control System to Korean Power Systems
Applcaton of Intellgent Voltage Control System to Korean Power Systems WonKun Yu a,1 and HeungJae Lee b, *,2 a Department of Power System, Seol Unversty, South Korea. b Department of Power System, Kwangwoon
More informationPower Allocation in Wireless Relay Networks: A Geometric Programming-Based Approach
ower Allocaton n Wreless Relay Networks: A Geometrc rogrammng-based Approach Khoa T. han, Tho Le-Ngoc, Sergy A. Vorobyov, and Chntha Telambura Department of Electrcal and Computer Engneerng, Unversty of
More information@IJMTER-2015, All rights Reserved 383
SIL of a Safety Fuzzy Logc Controller 1oo usng Fault Tree Analyss (FAT and realablty Block agram (RB r.-ing Mohammed Bsss 1, Fatma Ezzahra Nadr, Prof. Amam Benassa 3 1,,3 Faculty of Scence and Technology,
More informationOn High Spatial Reuse Broadcast Scheduling in STDMA Wireless Ad Hoc Networks
On Hgh Spatal Reuse Broadcast Schedulng n STDMA Wreless Ad Hoc Networks Ashutosh Deepak Gore and Abhay Karandkar Informaton Networks Laboratory Department of Electrcal Engneerng Indan Insttute of Technology
More informationDynamic Lightpath Protection in WDM Mesh Networks under Wavelength Continuity Constraint
Dynamc Lghtpath Protecton n WDM Mesh etworks under Wavelength Contnuty Constrant Shengl Yuan* and Jason P. Jue *Department of Computer and Mathematcal Scences, Unversty of Houston Downtown One Man Street,
More informationAn Energy-aware Awakening Routing Algorithm in Heterogeneous Sensor Networks
An Energy-aware Awakenng Routng Algorthm n Heterogeneous Sensor Networks TAO Dan 1, CHEN Houjn 1, SUN Yan 2, CEN Ygang 3 1. School of Electronc and Informaton Engneerng, Bejng Jaotong Unversty, Bejng,
More informationDistributed Adaptive Channel Allocation in Multi-Radio Wireless Sensor Networks
Journal of Communcatons Vol., No., November 26 Dstrbuted Adaptve Channel Allocaton n Mult-Rado Wreless Sensor Networks We Peng, Dongyan Chen, Wenhu Sun, and Guqng Zhang2,3 School of Control Scence and
More informationLifetime-Oriented Optimal Relay Deployment for Three-tier Wireless Sensor Networks
Sensors & Transducers by IFSA http://www.sensorsportal.com Lfetme-Orented Optmal Relay Deployment for Three-ter Wreless Sensor Networs Bn Zeng, Lu Yao and Ru Wang Department of Management, Naval Unversty
More informationJoint Adaptive Modulation and Power Allocation in Cognitive Radio Networks
I. J. Communcatons, etwork and System Scences, 8, 3, 7-83 Publshed Onlne August 8 n ScRes (http://www.scrp.org/journal/jcns/). Jont Adaptve Modulaton and Power Allocaton n Cogntve Rado etworks Dong LI,
More informationSelective Sensing and Transmission for Multi-Channel Cognitive Radio Networks
IEEE INFOCOM 2 Workshop On Cogntve & Cooperatve Networks Selectve Sensng and Transmsson for Mult-Channel Cogntve Rado Networks You Xu, Yunzhou L, Yfe Zhao, Hongxng Zou and Athanasos V. Vaslakos Insttute
More informationTHE GENERATION OF 400 MW RF PULSES AT X-BAND USING RESONANT DELAY LINES *
SLAC PUB 874 3/1999 THE GENERATION OF 4 MW RF PULSES AT X-BAND USING RESONANT DELAY LINES * Sam G. Tantaw, Arnold E. Vleks, and Rod J. Loewen Stanford Lnear Accelerator Center, Stanford Unversty P.O. Box
More informationDistributed Uplink Scheduling in EV-DO Rev. A Networks
Dstrbuted Uplnk Schedulng n EV-DO ev. A Networks Ashwn Srdharan (Sprnt Nextel) amesh Subbaraman, och Guérn (ESE, Unversty of Pennsylvana) Overvew of Problem Most modern wreless systems Delver hgh performance
More informationJoint Channel Assignment and Opportunistic Routing for Maximizing Throughput in Cognitive Radio Networks
Jont Channel Assgnment and Opportunstc Routng for Maxmzng Throughput n Cogntve Rado Networs Yang Qn*, Xaoxong Zhong*, Yuanyuan Yang +,Yanln L* and L L* *Key Laboratory of Networ Orented Intellgent Computaton,
More informationA NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems
0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of
More informationASFALT: Ā S imple F āult-tolerant Signature-based L ocalization T echnique for Emergency Sensor Networks
ASFALT: Ā S mple F āult-tolerant Sgnature-based L ocalzaton T echnque for Emergency Sensor Networks Murtuza Jadlwala, Shambhu Upadhyaya and Mank Taneja State Unversty of New York at Buffalo Department
More informationThroughput Maximization by Adaptive Threshold Adjustment for AMC Systems
APSIPA ASC 2011 X an Throughput Maxmzaton by Adaptve Threshold Adjustment for AMC Systems We-Shun Lao and Hsuan-Jung Su Graduate Insttute of Communcaton Engneerng Department of Electrcal Engneerng Natonal
More informationRESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING
RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING Vaslos A. Srs Insttute of Computer Scence (ICS), FORTH and Department of Computer Scence, Unversty of Crete P.O. Box 385, GR 7 Heraklon, Crete,
More informationAdaptive Phase Synchronisation Algorithm for Collaborative Beamforming in Wireless Sensor Networks
213 7th Asa Modellng Symposum Adaptve Phase Synchronsaton Algorthm for Collaboratve Beamformng n Wreless Sensor Networks Chen How Wong, Zhan We Sew, Renee Ka Yn Chn, Aroland Krng, Kenneth Tze Kn Teo Modellng,
More informationNATIONAL RADIO ASTRONOMY OBSERVATORY Green Bank, West Virginia SPECTRAL PROCESSOR MEMO NO. 25. MEMORANDUM February 13, 1985
NATONAL RADO ASTRONOMY OBSERVATORY Green Bank, West Vrgna SPECTRAL PROCESSOR MEMO NO. 25 MEMORANDUM February 13, 1985 To: Spectral Processor Group From: R. Fsher Subj: Some Experments wth an nteger FFT
More information>>> SOLUTIONS <<< 5 pts each sub-problem. 3 pts for correct formulas and set-up for each sub-problem.
Comprehensve Fnal Exam for Computer Networks (CNT 65) Fall >>> SOLUTIONS
More informationChannel Alternation and Rotation in Narrow Beam Trisector Cellular Systems
Channel Alternaton and Rotaton n Narrow Beam Trsector Cellular Systems Vncent A. Nguyen, Peng-Jun Wan, Ophr Freder Illnos Insttute of Technology-Communcaton Laboratory Research Computer Scence Department-Chcago,
More informationJOURNAL OF SELECTED AREAS IN COMMUNICATIONS 1
JOURNAL OF SELECTED AREAS IN COMMUNICATIONS On the Interdependence of Dstrbuted Topology Control and Geographcal Routng n Ad Hoc and Sensor Networks Tommaso Meloda, Student Member, IEEE, Daro Pompl, Student
More informationDefine Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.
Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)
More informationSpectrum Sharing For Delay-Sensitive Applications With Continuing QoS Guarantees
Spectrum Sharng For Delay-Senstve Applcatons Wth Contnung QoS Guarantees Yuanzhang Xao, Kartk Ahuja, and Mhaela van der Schaar Department of Electrcal Engneerng, UCLA Emals: yxao@seas.ucla.edu, ahujak@ucla.edu,
More informationPerformance Evaluation of QoS Parameters in Dynamic Spectrum Sharing for Heterogeneous Wireless Communication Networks
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 1, No 2, January 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 81 Performance Evaluaton of QoS Parameters n Dynamc Spectrum Sharng for Heterogeneous
More informationEfficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques
The th Worshop on Combnatoral Mathematcs and Computaton Theory Effcent Large Integers Arthmetc by Adoptng Squarng and Complement Recodng Technques Cha-Long Wu*, Der-Chyuan Lou, and Te-Jen Chang *Department
More informationResource Control for Elastic Traffic in CDMA Networks
Resource Control for Elastc Traffc n CDMA Networks Vaslos A. Srs Insttute of Computer Scence, FORTH Crete, Greece vsrs@cs.forth.gr ACM MobCom 2002 Sep. 23-28, 2002, Atlanta, U.S.A. Funded n part by BTexact
More informationTwo-Phase Cooperative Broadcasting Based on Batched Network Code
Two-Phase Cooperatve Broadcastng Based on Batched Network Code Xaol Xu, Praveen Kumar M. Gandh, Yong Lang Guan, and Peter Han Joo Chong 1 arxv:1504.04464v1 [cs.it] 17 Apr 2015 Abstract In ths paper, we
More informationNetwork Reconfiguration in Distribution Systems Using a Modified TS Algorithm
Network Reconfguraton n Dstrbuton Systems Usng a Modfed TS Algorthm ZHANG DONG,FU ZHENGCAI,ZHANG LIUCHUN,SONG ZHENGQIANG School of Electroncs, Informaton and Electrcal Engneerng Shangha Jaotong Unversty
More informationResearch of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b
2nd Internatonal Conference on Computer Engneerng, Informaton Scence & Applcaton Technology (ICCIA 207) Research of Dspatchng Method n Elevator Group Control System Based on Fuzzy Neural Network Yufeng
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationEENCR: An Energy-efficient Network Coding based Routing Protocol. May 8, 2014
EENCR: An Energy-effcent Networ Codng based Routng Protocol May 8, 2014 1 1 Prelmnary Ahlswede et al. [2] frst proposed the networ codng technque. The authors showed that the use of networ codng can effectvely
More informationTraffic balancing over licensed and unlicensed bands in heterogeneous networks
Correspondence letter Traffc balancng over lcensed and unlcensed bands n heterogeneous networks LI Zhen, CUI Qme, CUI Zhyan, ZHENG We Natonal Engneerng Laboratory for Moble Network Securty, Bejng Unversty
More informationCooperative perimeter surveillance with a team of mobile robots under communication constraints
213 IEEE/RSJ Internatonal Conference on Intellgent Robots and Systems (IROS) November 3-7, 213. Toyo, Japan Cooperatve permeter survellance wth a team of moble robots under communcaton constrants J.J.
More informationANNUAL OF NAVIGATION 11/2006
ANNUAL OF NAVIGATION 11/2006 TOMASZ PRACZYK Naval Unversty of Gdyna A FEEDFORWARD LINEAR NEURAL NETWORK WITH HEBBA SELFORGANIZATION IN RADAR IMAGE COMPRESSION ABSTRACT The artcle presents the applcaton
More informationAn Analytical Method for Centroid Computing and Its Application in Wireless Localization
An Analytcal Method for Centrod Computng and Its Applcaton n Wreless Localzaton Xue Jun L School of Engneerng Auckland Unversty of Technology, New Zealand Emal: xuejun.l@aut.ac.nz Abstract Ths paper presents
More informationPower Minimization Under Constant Throughput Constraint in Wireless Networks with Beamforming
Power Mnmzaton Under Constant Throughput Constrant n Wreless etworks wth Beamformng Zhu Han and K.J. Ray Lu, Electrcal and Computer Engneer Department, Unversty of Maryland, College Park. Abstract In mult-access
More information1 GSW Multipath Channel Models
In the general case, the moble rado channel s pretty unpleasant: there are a lot of echoes dstortng the receved sgnal, and the mpulse response keeps changng. Fortunately, there are some smplfyng assumptons
More informationResource Allocation for Throughput Enhancement in Cellular Shared Relay Networks
Resource Allocaton for Throughput Enhancement n Cellular Shared Relay Networs Mohamed Fadel, Ahmed Hndy, Amr El-Key, Mohammed Nafe, O. Ozan Koyluoglu, Antona M. Tulno Wreless Intellgent Networs Center
More informationEvaluating Different One to Many Packet Delivery Schemes for UMTS
Evaluatng Dfferent One to Many Packet Delvery Schemes for UMTS Antonos Alexou, Dmtros Antonells, Chrstos Bouras Research Academc Computer Technology Insttute, Greece and Computer Engneerng and Informatcs
More informationA Simple Satellite Exclusion Algorithm for Advanced RAIM
A Smple Satellte Excluson Algorthm for Advanced RAIM Juan Blanch, Todd Walter, Per Enge Stanford Unversty ABSTRACT Advanced Recever Autonomous Integrty Montorng s a concept that extends RAIM to mult-constellaton
More informationReview: Our Approach 2. CSC310 Information Theory
CSC30 Informaton Theory Sam Rowes Lecture 3: Provng the Kraft-McMllan Inequaltes September 8, 6 Revew: Our Approach The study of both compresson and transmsson requres that we abstract data and messages
More informationOptimal Sizing and Allocation of Residential Photovoltaic Panels in a Distribution Network for Ancillary Services Application
Optmal Szng and Allocaton of Resdental Photovoltac Panels n a Dstrbuton Networ for Ancllary Servces Applcaton Reza Ahmad Kordhel, Student Member, IEEE, S. Al Pourmousav, Student Member, IEEE, Jayarshnan
More informationApproximating User Distributions in WCDMA Networks Using 2-D Gaussian
CCCT 05: INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS, AND CONTROL TECHNOLOGIES 1 Approxmatng User Dstrbutons n CDMA Networks Usng 2-D Gaussan Son NGUYEN and Robert AKL Department of Computer
More informationA Simple and Reliable Method for the Evaluation of the Exposed Field Near the GSM Antenna
(IJACSA) Internatonal Journal of Advanced Computer Scence and Applcatons, A Smple and Relable Method for the Evaluaton of the Exposed Feld Near the GSM Antenna Algent Lala,Bexhet Kamo, Vlad Kolc, Shkelzen
More informationFigure.1. Basic model of an impedance source converter JCHPS Special Issue 12: August Page 13
A Hgh Gan DC - DC Converter wth Soft Swtchng and Power actor Correcton for Renewable Energy Applcaton T. Selvakumaran* and. Svachdambaranathan Department of EEE, Sathyabama Unversty, Chenna, Inda. *Correspondng
More informationEnergy Efficient Adaptive Modulation in Wireless Cognitive Radio Ad Hoc Networks
Energy Effcent Adaptve Modulaton n Wreless Cogntve Rado Ad Hoc Networks Song Gao, Ljun Qan*, Dhadesugoor. R. Vaman ARO/ARL Center for Battlefeld Communcatons Research Prare Vew A&M Unversty, Texas A&M
More informationA MODIFIED DIFFERENTIAL EVOLUTION ALGORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS
A MODIFIED DIFFERENTIAL EVOLUTION ALORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS Kaml Dmller Department of Electrcal-Electroncs Engneerng rne Amercan Unversty North Cyprus, Mersn TURKEY kdmller@gau.edu.tr
More informationDistributed Fault Detection of Wireless Sensor Networks
Dstrbuted Fault Detecton of Wreless Sensor Networs Jnran Chen, Shubha Kher, and Arun Soman Dependable Computng and Networng Lab Iowa State Unversty Ames, Iowa 50010 {jrchen, shubha, arun}@astate.edu ABSTRACT
More informationMooring Cost Sensitivity Study Based on Cost-Optimum Mooring Design
Proceedngs of Conference 8 Korean Socety of Ocean Engneers May 9-3, Cheju, Korea Moorng Cost Senstvty Study Based on Cost-Optmum Moorng Desgn SAM SANGSOO RYU, CASPAR HEYL AND ARUN DUGGAL Research & Development,
More informationA Novel DSA-Driven MAC Protocol for Cognitive Radio Networks
Wreless Sensor Networ, 29, 2, 6-2 do:.4236/wsn.29.2 7 Publshed Onlne July 29 (http://www.scrp.org/journal/wsn/). A Novel DSA-Drven MAC Protocol for Cogntve Rado Networs Hua SONG, Xaola LIN School of Informaton
More informationPlanning of Relay Station Locations in IEEE (WiMAX) Networks
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the WCNC 010 proceedngs. Plannng of Relay Staton Locatons n IEEE 0.16 (WMAX) Networks
More informationDigital Transmission
Dgtal Transmsson Most modern communcaton systems are dgtal, meanng that the transmtted normaton sgnal carres bts and symbols rather than an analog sgnal. The eect o C/N rato ncrease or decrease on dgtal
More informationMethods for Preventing Voltage Collapse
Methods for Preventng Voltage Collapse Cláuda Res 1, Antóno Andrade 2, and F. P. Macel Barbosa 3 1 Telecommuncatons Insttute of Avero Unversty, Unversty Campus of Avero, Portugal cres@av.t.pt 2 Insttute
More information