Using Particle Swarm Optimization for Enhancing the Hierarchical Cell Relay Routing Protocol
|
|
- Ann Warner
- 5 years ago
- Views:
Transcription
1 2012 Thrd Internatonal Conference on Networkng and Computng Usng Partcle Swarm Optmzaton for Enhancng the Herarchcal Cell Relay Routng Protocol Hung-Y Ch Department of Electrcal Engneerng Natonal Sun Yat-Sen Unversty Kaohsung, Tawan Png-Cheng Chung Department of Electrcal Engneerng Natonal Sun Yat-Sen Unversty Kaohsung, Tawan student.nsysu.edu.tw Tsung-Chuan Huang Department of Electrcal Engneerng Natonal Sun Yat-Sen Unversty Kaohsung, Tawan Abstract In moble ad hoc networks (MANETs), the maxmum transmsson radus s generally used for transmsson. The advantage s that each moble node can communcate wth more moble nodes wthn the transmsson range and packets can reach the destnaton rapdly n fewer hops. However usng the maxmum transmsson radus wll nduce hgh power consumpton. We proposed the Herarchcal Cell Relay (HCR) scheme earler, whch s a herarchcal topology routng protocol for the MANETs. In order to enhance the performance of HCR, n ths paper we use the Partcle Swarm Optmzaton (PSO) algorthm to fnd a sutable transmsson radus for each node. The nodes do not use maxmum transmsson radus n order to prolong the network lfetme. In addton to comparng the enhanced HCR wth the orgnal HCR, we also compare t to another herarchcal topology routng protocol Adaptve Cell Relay (ACR). The comparson results show that usng PSO n HCR can reduce energy consumpton wthout sacrfcng the packet transmsson delay. Index Terms partcle swarm optmzaton (PSO), HCR scheme, moble ad hoc networks (MANETs), energy consumpton. I. INTRODUCTION In moble ad hoc networks (MANETs), the topology of routng protocols can be dvded nto two categores, flat and herarchcal. Generally, flat topology routng protocols are worse n regard to scalablty [3] [8]. Ths means that network performance wll descend rapdly as the network area or nodes ncrease. Relatvely, herarchcal topology routng protocols reduce the sze of routng tables, so they have better scalablty [2] [4] [11] [16]. In addton, t has been proven that routng protocols usng geographc locaton nformaton on MANETs are useful for scalablty and routng strategy [1] [6] [8]. The Herarchcal Cell Relay (HCR) [12] s a herarchcal topology routng protocol whch utlzes the Global Postonng System (GPS) to locate the moble node poston. In HCR, the entre network regon s dvded nto multple regular trangles of equal sze, called cells. The sde length of cell s equal to the node transmsson radus, as llustrated n Fg. 1. The man dea of HCR s to relay the route dscovery packets or data packets n selected cells whch s determned by the drecton from source node to the destnaton. By restrctng packet forwardng n certan cells, HCR can avod the consderable overhead resultng from complete floodng. In a general routng strategy, every node uses the maxmum Fg. 1. Network structure of HCR. radus to transmt packets. The advantage s that more nodes wll be n ts transmsson range and packets use fewer hops to arrve destnaton. The dsadvantage s that large transmsson raduses consume more energy. On the other hand, whle a shorter transmsson radus can reduce the energy consumpton, the hop counts of routng path wll ncrease, makng the packet delay tme longer. Partcle Swarm Optmzaton (PSO), ntroduced by Kennedy and Eberhart [7] n 1995, was nspred by the paradgm of brds flockng. It s a populaton-based and selfadaptve search optmzaton technque. In PSO, partcle represents a canddate soluton, and the entre canddate soluton set s called a swarm. Each partcle frst tres to return to ts own prevous best poston and also attempts to move to the best poston of all partcles. The whole acton of the swarm s rapd concentratng on probable regons of search space. Ths evolutonary computng method s useful n searchng for the soluton space for problems requrng defnte optmzaton targets [5] [9]. To enhance the performance of HCR, we am to fnd an approprate transmsson radus to reduce energy consumpton and not to ncrease the packet transmsson tme. PSO has been used to determne optmum solutons n varous domans, ncludng networkng [10] [17], and obtaned rather good results. In ths paper we utlze PSO to fnd the transmsson radus so as to strke the optmum balance between energy consumpton and transmsson delay n HCR /12 $ IEEE DOI /ICNC
2 The rest of ths paper s organzed as follows. Secton II ntroduces a number of related works. Secton III apples the PSO on the determnaton of optmum transmsson radus n HCR. Secton IV demonstrates the smulaton results. Fnally, secton V concludes the paper. II. RELATED WORK Many researches ndcated that geographc locaton nformaton can mprove the performance of routng n MANETs. Typcal routng protocols such as Dstance Routng Effect Algorthm for Moblty (DREAM) [1], Locaton-Aded Routng (LAR) [8], and Greedy Permeter Stateless Routng (GPSR) [6] are based on the locaton nformaton. Combnng herarchcal topology wth geographc locaton nformaton, the Multclass (MC) routng protocol [15] has been appled n heterogeneous MANETs. A routng area n MC s dvded nto equally szed square cells, and nodes n the network are classfed nto two types: backbone node (B-node) and general node (G-node). B-node has a wder transmsson range (power), hgher data rate and processng capablty, and s more relable and robust than G-node. The prmary prncple s that most routng traffc wthn an MC routng goes through B-nodes whch connect to each other n dfferent cells. However, n realstc MANETs, most nodes have the dentcal abltes, so the MC routng wll lack B-nodes to structure the network. The Adaptve Cell Relay (ACR) routng protocol [14] s another routng protocol combnng herarchcal topology wth geographc locaton nformaton. ACR has two routng strateges: one s the Cell Relay (CR) routng strategy appled n dense networks, and the other s the Large Cell (LC) routng strategy appled n sparse networks. ACR can adjust the routng strategy as global node densty changes. Both MC and ACR can send routng packets to neghborng cells only. Snce the dagonal s the half of transmsson radus, ther actual transmsson range s smaller than the maxmum transmsson range. In addton, these two routng protocols take only the maxmum transmsson range nto consderaton to transmt packets, so they wll consume more energy. Raza et al. researched the use of PSO to enhance CGSR n a wreless sensor network [10]. Each partcle represents the locaton of each sensor n a cluster and calculates total energy loss as ts ftness value. After a number of teratons, all sensors move to ther fnal locatons n the setup phase and the sensor whch has the global best value wll act as the cluster head. Whenever the ftness value of the global best value goes below any of the local best values, the swappng of servce wll take place. Jn et al. proposed PCPSO, an mproved PSO, for optmzng multple constraned Qualty of Servce (QoS) attrbutes on a multcast routng [17]. In ths research, the network s modeled as a weghted graph, and each partcle n the swarm represents a multcast tree. PCPSO uses four QoS attrbutes (delay, delay jtter, packet loss rate and cost) to construct the ftness functon. Each partcle n PCPSO s updated by a computed probablty, whch makes convergng to the optmum soluton faster than the orgnal PSO. Although PSO s appled to each doman, we dd not fnd any research usng PSO to fnd the optmum transmsson radus n MANETs. By rasng energy effcency, Feng et al. [13] tred to fnd the optmum transmsson radus n a rectangular wreless area. There was only one statc snk n the corner n that envronment. Nodes whch were near the snk used a small transmsson radus to reduce congeston and energy consumpton, and nodes whch were farther from the snk used large transmsson radus for transmttng farther. It s not smlar to our study because we do not consder only one statc destnaton node and we use a unform transmsson radus on all nodes. III. USING PSO TO FIND OPTIMUM TRANSMISSION RADIUS In the study, we utlze PSO to look for the most feasble transmsson radus for all nodes, and construct the HCR nto cell structure based on the transmsson radus. We use energy consumpton and tme delay to evaluate the effcency of HCR. The scheme s detaled as below. 1) Issue fomalzaton: PSO defnes N partcles n a swarm. Each partcle s located at D-dmensonal coordnates whch ndcates a D-parameter soluton of the problem wthn the D-dmensonal soluton space. In our study, the poston of partcle represents the radus of transmsson. We apply the transmsson radus gven by partcle on HCR, and all nodes use the fxed transmsson radus untl each smulaton fnsh. We use these partcles to fnd the optmum transmsson radus to make that HCR has mnmum power consumpton and end-to-end delay. Snce the transmsson radus of nodes s the unque parameter that we want to solve, the soluton space for our problem s onedmensonal. 2) Partcle swarm ntalzaton: The swarm sze N s set to 20 n ths study. Partcles n swarm are located at random postons n frst teraton. In our study, the range of each partcle s poston s between 0 and 250 whch represents the transmsson radus n meter. Each partcle has a correspondng velocty V whch s responsble to update the poston of partcle and ntalzed to 0. 3) Ftness functon desgn: Ftness functon s used to determne the ftness of the canddate soluton (partcle). In the study, we use total energy consumpton and total delay tme to establsh the ftness functon for determnng the ftness of transmsson radus represented by partcle. Suppose that there are m nodes and k data packets n a network envronment and the followng notatons are used. a) n : the -th node. b) pkt : the -th packet. c) E ntal ( n ) : the ntal energy of node n. d) E nt _ total : the total energy of nodes before smulaton. e) E reman ( n ) : the remanng energy of node n. f) E consum : the total energy consumed by all nodes durng smulaton. g) T arr ( pkt ) : the arrval tme of packet pkt. h) T dep ( pkt ) : the departure tme of packet pkt. 126
3 ) D total : the sum of end-to-end delay for each packet. Then, total energy and delay functon s E E D m nt _ total ntal n ) consum total = E = 1 m ( (1) [ E n ) E ( n )] = ( (2) = k 1 ntal reman [ T pkt ) T ( pkt )] = ( (3) = 1 arr and the ftness functon s dep a( Econsum / Ent _ total ) + b( Dtotal / smulaton _ tme) (4) Eq. (1) calculates the total energy of all nodes before smulaton. Eq. (2) calculates the total energy consumpton by all nodes. Eq. (3) calculates the total end-to-end delay by addng each packet delay. In the ftness functon of equaton (4), a and b are weght constants and smulaton_tme s the total tme of smulaton. By assumng the energy consumpton and end-to-end delay are of equal weght, we set both a and b to ) Optmum value calculaton: Partcle calculates the ftness value of ts poston by ftness functon, and uses the ftness value to determne whether the poston s optmum. Thus, we apply the transmsson radus gven by partcle s poston on HCR to calculate total energy consumpton and total end-to-end delay n equatons (2) and (3). After smulaton completed, we substtute total energy consumpton and end-to-end delay nto the ftness functon (equaton (4)), and then we can get the ftness value of each partcle s current poston. In our study, the partcle n better poston wll have a smaller ftness value, so the partcle located n the optmum poston wll have the mnmum ftness value. After obtanng the ftness value, we determne local optmum values and the global optmum value by the followng steps. a) Local optmum value: Local optmum s the mnmum ftness value of each partcle. Whenever a partcle gets a new ftness value, the partcle compares that value wth the local optmum. If the new ftness value s less than the local optmum, the local optmum wll be replaced by ths new value, and PSO denotes the -th partcle poston as Pbest. The ftness value calculated n the frst teraton wll be set as the local optmum. b) Global optmum value: After all partcles fnd ther local optmums, PSO wll use the smallest one as the global optmum. After the next teraton, f the global optmum n ths teraton s less than the global optmum n the prevous teraton, the global optmum wll be replaced by the new global optmum, and PSO wll mark the poston of that partcle as Gbest. Otherwse, the global optmum wll reman unchanged. 5) Partcle updatng: After determnng the optmum values, PSO wll update the velocty, and then update the partcle poston by the velocty. The new poston of the partcle wll be closer to the poston of the global optmum, and fnally the optmum transmsson radus for HCR s found. In PSO, both the poston of partcle and the velocty are ndcated by vectors. Let P be the poston vector of -th partcle and V be the velocty vector correspondng to P. The updatng method s as below: V [ Pbest P ] + c r [ Gbest P ] V c r (5) P P + V (6) In equaton (5), s the nerta weght for the velocty; c 1 and c 2 are weght constant. In ths paper, we concentrate on whether the optmum transmsson radus can be found by PSO, so we set the parameter the same as n orgnal PSO; namely both c 1 and c2 are equal to 2 and s equal to 1. r 1 and r 2 are random values between 0 and 1 whch keep partcles from fallng nto the local optmum space. The change of velocty wll be affected not only by the local optmum but also by the global optmum of each partcle and the last velocty. After gettng the new velocty, the partcle changes to the new poston by usng equaton (6). 6) Iteraton and termnaton: After partcles updatng ther poston, we obtan new transmsson raduses. By applyng these raduses on HCR, we calculate new energy consumptons and end-to-end delays and fnally get new ftness values. Local optmums and the global optmum wll be determned agan. Ths procedure forms an teraton. The teratons wll contnue untl the assgned teraton tme s reached or the teraton termnaton condtons are satsfed. In our study, we set the number of teraton to 10 and the termnaton condton s that the dfference between the last global optmum and the current global optmum s less than 1. Fnally, the ftness value of the global optmum s the best transmsson radus n meter. IV. SIMULATION In ths secton, we evaluate the proposed scheme by usng network smulator NS-2. Before usng PSO to fnd optmum transmsson radus of HCR, we observe the performance by usng some dfferent transmsson radus n envronment 1 as shown n Table I. Fg. 2 shows that energy consumpton gets larger when transmsson radus and flow amount ncreases. Fg. 3 shows that end-to-end delay gets larger when the transmsson radus decreases; ths s because short transmsson radus leads to more hop count. However, the endto-end delay also ncreases when the transmsson radus gets larger; ths s because large transmsson radus leads to more nterference between nodes. 127
4 TABLE I. THE SIMULATION ENVIRONMENT 1 Fg. 2. Transmsson radus vs. energy consumpton. Smulaton envronment 1 area 500 x 500 square meters nodes number 100 Smulaton tme 300 packet sze 64 bytes packet generaton rate 4 packets / second maxmum speed 10 meters/ second TABLE II. OPTIMUM TRANSMISSION RADIUS IN SIMULATION ENVIRONMENT 1 flows transmsson radus of PSO-HCR meters meters meters meters Fg. 3. Transmsson radus vs. end-to-end delay. Next we compare our protocol wth ACR. ACR s a routng protocol strategy whch also ncludes a herarchcal structure and cell relayng scheme smlar to HCR. We use HCR-PSO to denote our protocol. Tables I and III lst two smulaton envronments; each usng four flow amounts: 5, 10, 15 and 20 flows. Envronment 1 and envronment 2 are of equal densty, but envronment 2 has more nodes and wder area than envronment 1. We calculate the optmum transmsson radus by usng PSO n each envronment. The results are shown n Tables II and IV. In smulaton envronment 1 (see Fg. 4) we fnd that HCR- PSO consumes less energy than HCR. Ths s because HCR- PSO uses a shorter transmsson radus nstead of the maxmum transmsson radus to reduce energy consumpton. Due to usng maxmum transmsson radus n ACR and HCR, ther energy consumptons are hgher than HCR-PSO. Fg. 4. Flows vs. energy consumpton n envronment 1. area TABLE III. THE SIMULATION ENVIRONMENT 2 Smulaton envronment 2 nodes number 400 Smulaton tme 300 packet sze packet generaton rate maxmum speed 1000 x 1000 square meters 64 bytes 4 packets / second 10 meters/ second TABLE IV. OPTIMUM TRANSMISSION RADIUS IN SIMULATION ENVIRONMENT 2 flows transmsson radus of PSO-HCR meters meters meters meters The delay tme of HCR-PSO and HCR are only slghtly dfferent (see fg. 5). Ths confrms that HCR-PSO has the capablty of fndng best transmsson radus for save energy, wthout sacrfcng the average end-to-end delay. To confrm that HCR-PSO can also perform well n envronments whch have a larger network area and more nodes, we take smulaton n envronment 2, and do the same comparsons as n envronment 1. When the network area gets larger and nodes ncrease, the hop count of each path wll also ncrease, and routes wll break 128
5 large-scale envronment. Ths confrms that usng PSO can fnd the optmum transmsson radus to conserve total energy consumpton. Fg. 5. Flows vs. end-to-end delay n envronment 1. more often. Ths can nfer that there has an optmum transmsson radus n such envronments whch can save more energy and reduce the end-to-end delay. The smulaton results usng envronment 2 are shown n Fg. 6 and Fg. 7 whch verfy that HCR-PSO can conserve energy consumpton and not sacrfce the end-to-end delay. V. CONCLUSION In ths paper, we use PSO to fnd the optmum transmsson radus n HCR. It does not sacrfce the end-to-end delay but can save energy consumpton. Compared to usng maxmum transmsson radus n HCR and ACR, HCR-PSO consumes less energy not only n small-scale envronment but also n Fg. 6. Flows vs. energy consumpton n envronment 2. Fg. 7. Flows vs. end-to-end delay n envronment 2. REFERENCES [1] S. Basagn, I. Chlamtac, V. R. Syrotuk, and B. A. Woodward, "A dstance routng effect algorthm for moblty (DREAM)," 4th annual ACM/IEEE nternatonal conference on Moble computng and networkng, Dallas, Texas, Unted States, 1998, pp [2] G. Pe, M. Gerla, and T. W. Chen, "Fsheye state routng: a routng scheme for ad hoc wreless networks," IEEE Internatonal Conference on Communcatons, 2000, vol.1, pp [3] Z. J. Haas and M. R. Pearlman, "The performance of query control schemes for the zone routng protocol," IEEE/ACM Transactons on Networkng, 2001, vol. 9, pp [4] K. Xu, X. Hong, and M. Gerla, "An ad hoc network wth moble backbones," IEEE Internatonal Conference on Communcatons, 2002, vol.5, pp [5] K. P. Wang, L. Huang, C. G. Zhou, and W. Pang, "Partcle swarm optmzaton for travelng salesman problem," Internatonal conference on machne learnng and cybernetcs, 2003, Vol.3, pp [6] B. Karp and H. T. Kung, "GPSR: greedy permeter stateless routng for wreless networks," 6th annual nternatonal conference on Moble computng and networkng, Boston, Massachusetts, Unted States, 2000, pp [7] J. Kennedy and R. Eberhart, "Partcle swarm optmzaton," IEEE Internatonal Conference on Neural Networks, vol. 4, pp [8] Y.-B. Ko and N. H. Vadya, "Locaton-aded routng (LAR) n moble ad hoc networks," 4th annual ACM/IEEE nternatonal conference on Moble computng and networkng, 2000, vol. 6, pp [9] M. S. Norouzzadeh, M. R. Ahmadzadeh, and M. Palhang, Plowng PSO: A novel approach to effectvely ntalzng partcle swarm optmzaton, 3rd IEEE Internatonal Conference on Computer Scence and Informaton Technology, 2010, pp [10] H. Raza, P. Nandal, and S. Makker, "Selecton of cluster-head usng PSO n CGSR protocol," Internatonal Conference on Methods and Models n Computer Scence (ICM2CS), 2010, pp [11] T. C. Huang, C. K. Lao, and C. R. Dow, "Zone-based herarchcal routng n two-ter backbone ad hoc networks," 12th IEEE Internatonal Conference on Networks, 2004, vol.2, pp [12] T. C. Huang, H. Y. Ch, and S. K. Huang, "Herarchcal cell relay scheme wth GPS for moble ad hoc networks," 10th Internatonal Symposum on Pervasve Systems, Algorthms, and Networks, 2009, pp [13] W. Feng, H. Alshaer, and J. M. H. Elmrghan, "Energy effcency: Optmal transmsson range wth topology management n rectangular ad-hoc wreless networks," Internatonal Conference on Advanced Informaton Networkng and Applcatons, 2009, pp [14] X. Du and D. Wu, "Adaptve cell relay routng protocol for moble ad hoc networks," IEEE Transactons on Vehcular Technology, 2006, vol. 55, pp [15] X. Du, D. Wu, and W. Lu, Y. Fang, "Multclass routng and medum access control for heterogeneous moble ad hoc networks," IEEE Transactons on Vehcular Technology, 2006, vol. 55, pp [16] X. Xang, Z. Zhou, and X. Wang, "Robust and Scalable Geographc Multcast Protocol for Moble Ad-hoc Networks," IEEE Internatonal Conference on Computer Communcatons, 2007, pp [17] X. Jn, L. Ba, Y. J, and Y. Sun, "Probablty convergence based partcle swarm optmzaton for multple constraned QoS multcast routng," 4th Internatonal Conference on Semantcs, Knowledge and Grd, 2008, pp
Adaptive Energy and Location Aware Routing in Wireless Sensor Network
Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}
More informationA Load-balancing and Energy-aware Clustering Algorithm in Wireless Ad-hoc Networks
A Load-balancng and Energy-aware Clusterng Algorthm n Wreless Ad-hoc Networks Wang Jn, Shu Le, Jnsung Cho, Young-Koo Lee, Sungyoung Lee, Yonl Zhong Department of Computer Engneerng Kyung Hee Unversty,
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationLayer Based and Energy-Balanced Clustering Protocol for Wireless Sensor Network
Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com Layer Based and nergy-balanced Clusterng Protocol for Wreless Sensor Network 1 Yu HU, 2 Shu HAN 1 Measurng and Controllng Technology Insttute,
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationClustering Algorithm Combining CPSO with K-Means Chunqin Gu 1, a, Qian Tao 2, b
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) Clusterng Algorthm Combnng CPSO wth K-Means Chunqn Gu, a, Qan Tao, b Department of Informaton Scence, Zhongka
More informationA Low-Overhead Routing Protocol for Ad Hoc Networks with selfish nodes
A Low-Oerhead Routng Protocol for Ad Hoc Networks wth selfsh nodes Dongbn Wang 1, Xaofeng Wang 2, Xangzhan Yu 3, Kacheng Q 1, Zhbn Xa 1 1 School of Software Engneerng, Bejng Unersty of Posts and Telecommuncatons,100876,
More informationMobility Based Routing Protocol with MAC Collision Improvement in Vehicular Ad Hoc Networks
Moblty Based Routng Protocol wth MAC Collson Improvement n Vehcular Ad Hoc Networks Zhhao Dng, Pny Ren, Qnghe Du Shaanx Smart Networks and Ubqutous Access Rearch Center School of Electronc and Informaton
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationK-means Optimization Clustering Algorithm Based on Hybrid PSO/GA Optimization and CS validity index
Orgnal Artcle Prnt ISSN: 3-6379 Onlne ISSN: 3-595X DOI: 0.7354/jss/07/33 K-means Optmzaton Clusterng Algorthm Based on Hybrd PSO/GA Optmzaton and CS valdty ndex K Jahanbn *, F Rahmanan, H Rezae 3, Y Farhang
More informationThe Hybrid Mobile Wireless Sensor Networks for Data Gathering
The Hybrd Moble Wreless Sensor Networks for Data Gatherng Bao Ren Bejng Unv. of Posts & Telecommuncatons, Bejng 876, Chna +86--62287 renb@bupt.edu.cn Jan Ma Noka Research Center, Bejng 3, Chna +86--65392828-2883
More informationA Time-driven Data Placement Strategy for a Scientific Workflow Combining Edge Computing and Cloud Computing
> REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) < 1 A Tme-drven Data Placement Strategy for a Scentfc Workflow Combnng Edge Computng and Cloud Computng Bng Ln, Fangnng
More informationOPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET
OPTIMAL CONFIGURATION FOR NODE IN MIED CELLULAR AND MOBILE AD HOC NETWORK FOR INET Olusola Babalola D.E. Department of Electrcal and Computer Engneerng Morgan tate Unversty Dr. Rchard Dean Faculty Advsor
More informationIMPROVEMENT of MULTIPLE ROUTING BASED on FUZZY CLUSTERING and PSO ALGORITHM IN WSNS TO REDUCE ENERGY CONSUMPTION
IMPROVEMENT of MULTIPLE ROUTING BASED on FUZZY CLUSTERING and PSO ALGORITHM IN WSNS TO REDUCE ENERGY CONSUMPTION Gholamreza Farahan Department of Electrcal Engneerng and Informaton Technology, Iranan Research
More informationApplication of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling
, pp.40-45 http://dx.do.org/10.14257/astl.2017.143.08 Applcaton of Improved Fsh Swarm Algorthm n Cloud Computng Resource Schedulng Yu Lu, Fangtao Lu School of Informaton Engneerng, Chongqng Vocatonal Insttute
More informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
More informationChinese Word Segmentation based on the Improved Particle Swarm Optimization Neural Networks
Chnese Word Segmentaton based on the Improved Partcle Swarm Optmzaton Neural Networks Ja He Computatonal Intellgence Laboratory School of Computer Scence and Engneerng, UESTC Chengdu, Chna Department of
More informationCost-Effective Lifetime Prediction Based Routing Protocol for Wireless Network
Cost-Effectve Lfetme Predcton Based Routng Protocol for Wreless Network ABU MD. ZAFOR ALAM, MUHAMMAD ARIFUR RAHMAN, MOHAMMED ABUL HASAN 2,M. LUTFAR RAHMAN Faculty of Scence and IT, Daffodl Internatonal
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationEnergy Aware Swarm Optimization for Wireless Sensor Network. S. Thilagavathi 1, Dr. B. G. Geetha 2. India
Energy Aware Swarm Optmzaton for Wreless Sensor Network S. Thlagavath 1, Dr. B. G. Geetha 2 1. Research Scholar, Department of Informaton Technology, Insttute of Road and Transport Technology, Erode, Inda
More informationClassifier Swarms for Human Detection in Infrared Imagery
Classfer Swarms for Human Detecton n Infrared Imagery Yur Owechko, Swarup Medasan, and Narayan Srnvasa HRL Laboratores, LLC 3011 Malbu Canyon Road, Malbu, CA 90265 {owechko, smedasan, nsrnvasa}@hrl.com
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationRAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:
Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:
More informationPriority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks
Prorty-Based Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks Ja-Mng Lang, Jen-Jee Chen, You-Chun Wang, Yu-Chee Tseng, and Bao-Shuh P. Ln Department of Computer Scence Natonal Chao-Tung Unversty,
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More informationOptimizing SVR using Local Best PSO for Software Effort Estimation
Journal of Informaton Technology and Computer Scence Volume 1, Number 1, 2016, pp. 28 37 Journal Homepage: www.jtecs.ub.ac.d Optmzng SVR usng Local Best PSO for Software Effort Estmaton Dnda Novtasar 1,
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationRouting in Degree-constrained FSO Mesh Networks
Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng
More informationRecommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm
Recommended Items Ratng Predcton based on RBF Neural Network Optmzed by PSO Algorthm Chengfang Tan, Cayn Wang, Yuln L and Xx Q Abstract In order to mtgate the data sparsty and cold-start problems of recommendaton
More informationA Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks
A Sem-Dstrbuted oad Balancng Archtecture and Algorthm for Heterogeneous reless Networks Md. Golam Rabul Ala Choong Seon Hong * Kyung Hee Unversty, Korea rob@networkng.khu.ac.kr, cshong@khu.ac.kr Abstract
More informationReal-Time Guarantees. Traffic Characteristics. Flow Control
Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationCost-Effective Lifetime Prediction Based Routing Protocol for Mobile Ad Hoc Network
Cost-Effectve Lfetme Predcton Based Routng Protocol for Moble Ad Hoc Network ABU MD. ZAFOR ALAM, MUHAMMAD ARIFUR RAHMAN, M. LUTFAR RAHMAN 1 Faculty of Scence and Informaton Technology, Daffodl Internatonal
More informationComplexity Analysis of Problem-Dimension Using PSO
Proceedngs of the 7th WSEAS Internatonal Conference on Evolutonary Computng, Cavtat, Croata, June -4, 6 (pp45-5) Complexty Analyss of Problem-Dmenson Usng PSO BUTHAINAH S. AL-KAZEMI AND SAMI J. HABIB,
More informationDelay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks
Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network
More informationObstacle-Aware Routing Problem in. a Rectangular Mesh Network
Appled Mathematcal Scences, Vol. 9, 015, no. 14, 653-663 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/ams.015.411911 Obstacle-Aware Routng Problem n a Rectangular Mesh Network Norazah Adzhar Department
More informationDEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS
DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS Arun Avudanayagam Yuguang Fang Wenjng Lou Department of Electrcal and Computer Engneerng Unversty of Florda Ganesvlle, FL 3261
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More informationReliable and Efficient Routing Using Adaptive Genetic Algorithm in Packet Switched Networks
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 1, No 3, January 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 168 Relable and Effcent Routng Usng Adaptve Genetc Algorthm n Packet Swtched
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationAnalysis of Particle Swarm Optimization and Genetic Algorithm based on Task Scheduling in Cloud Computing Environment
Analyss of Partcle Swarm Optmzaton and Genetc Algorthm based on Tas Schedulng n Cloud Computng Envronment Frederc Nzanywayngoma School of Computer and Communcaton Engneerng Unversty of Scence and Technology
More informationA parallel implementation of particle swarm optimization using digital pheromones
Mechancal Engneerng Conference Presentatons, Papers, and Proceedngs Mechancal Engneerng 006 A parallel mplementaton of partcle swarm optmzaton usng dgtal pheromones Vjay Kalvarapu Iowa State Unversty,
More informationEstimation of Image Corruption Inverse Function and Image Restoration Using a PSObased
Internatonal Journal of Vdeo& Image Processng and Network Securty IJVIPNS-IJENS Vol:10 No:06 1 Estmaton of Image Corrupton Inverse Functon and Image Restoraton Usng a PSObased Algorthm M. Pourmahmood,
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationClassification Method in Integrated Information Network Using Vector Image Comparison
Sensors & Transducers 2014 by IFSA Publshng, S. L. http://www.sensorsportal.com Classfcaton Method n Integrated Informaton Network Usng Vector Image Comparson Zhou Yuan Guangdong Polytechnc Normal Unversty
More informationAn efficient iterative source routing algorithm
An effcent teratve source routng algorthm Gang Cheng Ye Tan Nrwan Ansar Advanced Networng Lab Department of Electrcal Computer Engneerng New Jersey Insttute of Technology Newar NJ 7 {gc yt Ansar}@ntedu
More informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More informationWireless Sensor Network Localization Research
Sensors & Transducers 014 by IFSA Publshng, S L http://wwwsensorsportalcom Wreless Sensor Network Localzaton Research Lang Xn School of Informaton Scence and Engneerng, Hunan Internatonal Economcs Unversty,
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationDesign of the Application-Level Protocol for Synchronized Multimedia Sessions
Desgn of the Applcaton-Level Protocol for Synchronzed Multmeda Sessons Chun-Chuan Yang Multmeda and Communcatons Laboratory Department of Computer Scence and Informaton Engneerng Natonal Ch Nan Unversty,
More informationA Clustering Algorithm Solution to the Collaborative Filtering
Internatonal Journal of Scence Vol.4 No.8 017 ISSN: 1813-4890 A Clusterng Algorthm Soluton to the Collaboratve Flterng Yongl Yang 1, a, Fe Xue, b, Yongquan Ca 1, c Zhenhu Nng 1, d,* Hafeng Lu 3, e 1 Faculty
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationPerformance Comparison of a QoS Aware Routing Protocol for Wireless Sensor Networks
Communcatons and Network, 2016, 8, 45-55 Publshed Onlne February 2016 n ScRes. http://www.scrp.org/journal/cn http://dx.do.org/10.4236/cn.2016.81006 Performance Comparson of a QoS Aware Routng Protocol
More informationELECTROMAGNETIC WAVE PROPAGATION MODELING USING THE ANT COLONY OPTIMIZATION ALGORITHM
Radoengneerng Electromagnetc Wave Propagaton Modelng usng the Ant Colony Optmzaton Algorthm 1 Vol. 11, No. 3, September 2002 P. PECHAČ ELECTROMAGNETIC WAVE PROPAGATION MODELING USING THE ANT COLONY OPTIMIZATION
More informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationCHAPTER 4 OPTIMIZATION TECHNIQUES
48 CHAPTER 4 OPTIMIZATION TECHNIQUES 4.1 INTRODUCTION Unfortunately no sngle optmzaton algorthm exsts that can be appled effcently to all types of problems. The method chosen for any partcular case wll
More informationResearch Article Energy Efficient Interest Forwarding in NDN-Based Wireless Sensor Networks
Moble Informaton Systems Volume 2016, Artcle ID 3127029, 15 pages http://dx.do.org/10.1155/2016/3127029 Research Artcle Energy Effcent Interest Forwardng n NDN-Based Wreless Sensor Networks Shua Gao, 1
More informationStudy of Data Stream Clustering Based on Bio-inspired Model
, pp.412-418 http://dx.do.org/10.14257/astl.2014.53.86 Study of Data Stream lusterng Based on Bo-nspred Model Yngme L, Mn L, Jngbo Shao, Gaoyang Wang ollege of omputer Scence and Informaton Engneerng,
More informationNetwork Intrusion Detection Based on PSO-SVM
TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationRepeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
More informationStraight Line Detection Based on Particle Swarm Optimization
Sensors & ransducers 013 b IFSA http://www.sensorsportal.com Straght Lne Detecton Based on Partcle Swarm Optmzaton Shengzhou XU, Jun IE College of computer scence, South-Central Unverst for Natonaltes,
More informationAn Improved Particle Swarm Optimization for Feature Selection
Journal of Bonc Engneerng 8 (20)?????? An Improved Partcle Swarm Optmzaton for Feature Selecton Yuannng Lu,2, Gang Wang,2, Hulng Chen,2, Hao Dong,2, Xaodong Zhu,2, Sujng Wang,2 Abstract. College of Computer
More informationTHE PATH PLANNING ALGORITHM AND SIMULATION FOR MOBILE ROBOT
Journal of Theoretcal and Appled Informaton Technology 30 th Aprl 013. Vol. 50 No.3 005-013 JATIT & LLS. All rghts reserved. ISSN: 199-8645 www.jatt.org E-ISSN: 1817-3195 THE PATH PLANNING ALGORITHM AND
More informationA Novel Deluge Swarm Algorithm for Optimization Problems
A Novel eluge Swarm Algorthm for Optmzaton Problems Anahta Samad,* - Mohammad Reza Meybod Scence and Research Branch, Islamc Azad Unversty, Qazvn, Iran Soft Computng Laboratory, Computer Engneerng and
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationIJCTA Nov-Dec 2016 Available
Dr K Santh et al, Internatonal Journal of Computer Technology & Applcatons,Vol 7(6),773-779 Optmzed Route Technque for DSR Routng Protocol n MANET Dr.K.Santh, Assocate Professor, Dept. of Computer Scence,
More information3. CR parameters and Multi-Objective Fitness Function
3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationEnergy efficient prediction clustering algorithm for multilevel heterogeneous wireless sensor networks
Abstract: nergy effcent predcton clusterng algorthm for multlevel heterogeneous wreless sensor networks Tang Lu a,b,c,* Jan Peng b,c Jn Yang d Chunl Wang e a College of Fundamental ducaton, Schuan Normal
More informationOPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM
Proceedng of the Frst Internatonal Conference on Modelng, Smulaton and Appled Optmzaton, Sharah, U.A.E. February -3, 005 OPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM Had Nobahar
More informationNeural Network Based Algorithm for Multi-Constrained Shortest Path Problem
Neural Network Based Algorthm for Mult-Constraned Shortest Path Problem Jyang Dong 1,2, Junyng Zhang 2, and Zhong Chen 1 1 Department of Physcs, Fujan Engneerng Research Center for Sold-State Lghtng, Xamen
More informationQuery Clustering Using a Hybrid Query Similarity Measure
Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan
More informationMobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks
MobleGrd: Capacty-aware Topology Control n Moble Ad Hoc Networks Jle Lu, Baochun L Department of Electrcal and Computer Engneerng Unversty of Toronto {jenne,bl}@eecg.toronto.edu Abstract Snce wreless moble
More informationA Distributed Three-hop Routing Protocol to Increase the Capacity of Hybrid Wireless 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. Ctaton nformaton: DOI.9/TMC.25.2388476, IEEE Transactons
More informationNetwork Coding as a Dynamical System
Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.
More informationMobile Adaptive Distributed Clustering Algorithm for Wireless Sensor Networks
Internatonal Journal of Computer Applcatons (975 8887) Volume No.7, Aprl Moble Adaptve Dstrbuted Clusterng Algorthm for Wreless Sensor Networks S.V.Mansekaran Department of Informaton Technology Anna Unversty
More informationA Finite Queue Model Analysis of PMRC-based Wireless Sensor Networks
A Fnte Queue Model Analyss of PMRC-based Wreless Sensor Networks Qaoqn L, Me Yang, Hongyan Wang, Yngtao Jang, Jazh Zeng College of Computer Scence and Technology, Unversty of Electronc Scence and Technology,
More informationBayesian Model for Mobility Prediction to Support Routing in Mobile Ad-Hoc Networks
Bayesan Model for Moblty Predcton to Support Routng n Moble Ad-Hoc Networks Tran The Son, Hoa Le Mnh, Graham Sexton, Nauman Aslam, Zabh Ghassemlooy Northumbra Communcatons Research Laboratory (NCRLab Faculty
More informationDistributed Grid based Robust Clustering Protocol for Mobile Sensor Networks
414 The Internatonal Arab Journal of Informaton Technology, Vol. 8, No. 4, October 011 Dstrbuted Grd based Robust Clusterng Protocol for Moble Sensor Networks Shahzad Al and Sajjad Madan Department of
More informationEfficient Backoff Algorithm in Wireless Multihop Ad Hoc Networks
1 Chen-Mn Wu, 2 Hu-Ka Su, 3 Wang-Has Yang *1,Correspondng Author Nanhua Unversty, cmwu@mal.nhu.edu.tw 2 Natonal Formosa Unversty, hksu@nfu.edu.tw 3 Hsupng Insttute of Technology, yangwh@mal.ht.edu.tw do:10.4156/jact.vol3.
More informationImperialist Competitive Algorithm with Variable Parameters to Determine the Global Minimum of Functions with Several Arguments
Fourth Internatonal Conference Modellng and Development of Intellgent Systems October 8 - November, 05 Lucan Blaga Unversty Sbu - Romana Imperalst Compettve Algorthm wth Varable Parameters to Determne
More information