SIMULATED ANNEALING BASED POLYNOMIAL TIME QOS ROUTING ALGORITHM FOR MANETS

SIMULATED ANNEALING BASED POLYNOMIAL TIME QOS ROUTING ALGORITHM FOR MANETS

Multi-constrained Quality-of-Service （QoS） routing is a big challenge for Mobile Ad hoc Networks （MANETs） where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing （SA_RA） is proposed. This algorithm first uses an energy function to translate...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of electronics (China) 2006-09, Vol.23 (5), p.691-697
Hauptverfasser: Liu, Lianggui, Feng, Guangzeng
Format: Artikel
Sprache:eng
Schlagworte:
多项式时间问题
模拟退火
理论分析
能量函数
非确定多项式时间完全问题
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 697
container_issue 5
container_start_page 691
container_title Journal of electronics (China)
container_volume 23
creator Liu, Lianggui
Feng, Guangzeng
description Multi-constrained Quality-of-Service （QoS） routing is a big challenge for Mobile Ad hoc Networks （MANETs） where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing （SA_RA） is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The paper outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing （QoSR） in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the （approximate） optimal configuration within a period of polynomial time.
doi_str_mv 10.1007/s11767-005-0086-x
format Article
fullrecord <record><control><sourceid>wanfang_jour_cross</sourceid><recordid>TN_cdi_wanfang_journals_dzkxxk_e200605010</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>23328852</cqvip_id><wanfj_id>dzkxxk_e200605010</wanfj_id><sourcerecordid>dzkxxk_e200605010</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1510-b5b9d2cd8443045fd421e116a9364744c58d84cb64e0f9de8a5a5d64f6b3bfeb3</originalsourceid><addsrcrecordid>eNotkE1Pg0AQhjdGE2v1B3gj3jygs5_AcVXaYvjQQg-eNgsstR9ShRjRX-827WEymcwz8yYPQtcY7jCAd99j7AnPBeC2fOEOJ2iEg4C6IDA_RSMg2HMDn5BzdNH3a8tRn8MIPedRsohlET45Mk1DGUfp1HmQuZ1fsvgtzZJIxk4RJaHzmuXOPFsUe0LG02weFbPEmWRzJ5FpWOSX6KzR295cHfsYLSZh8Thz42waPcrYrTDH4Ja8DGpS1T5jFBhvakawwVjogArmMVZx3-6qUjADTVAbX3PNa8EaUdKyMSUdo9vD3x_dNrpdqvXuu2ttoqr_NsOwUYYACOCAwbL4wFbdru8706jPbvWhu1-FQe3FqYM4ZYWovTg12Jub4837rl1-rWxCqatNs9oaRSglvs8J_Qc0QGVt</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>SIMULATED ANNEALING BASED POLYNOMIAL TIME QOS ROUTING ALGORITHM FOR MANETS</title><source>Alma/SFX Local Collection</source><creator>Liu, Lianggui ; Feng, Guangzeng</creator><creatorcontrib>Liu, Lianggui ; Feng, Guangzeng</creatorcontrib><description>Multi-constrained Quality-of-Service （QoS） routing is a big challenge for Mobile Ad hoc Networks （MANETs） where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing （SA_RA） is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The paper outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing （QoSR） in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the （approximate） optimal configuration within a period of polynomial time.</description><identifier>ISSN: 0217-9822</identifier><identifier>EISSN: 1993-0615</identifier><identifier>DOI: 10.1007/s11767-005-0086-x</identifier><language>eng</language><publisher>College of Communications and Information Engineering, Nanjing University of Posts &amp; Telecommunications,Nanjing 210003, China</publisher><subject>多项式时间问题 ; 模拟退火 ; 理论分析 ; 能量函数 ; 非确定多项式时间完全问题</subject><ispartof>Journal of electronics (China), 2006-09, Vol.23 (5), p.691-697</ispartof><rights>Copyright © Wanfang Data Co. Ltd. All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1510-b5b9d2cd8443045fd421e116a9364744c58d84cb64e0f9de8a5a5d64f6b3bfeb3</citedby><cites>FETCH-LOGICAL-c1510-b5b9d2cd8443045fd421e116a9364744c58d84cb64e0f9de8a5a5d64f6b3bfeb3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/85266X/85266X.jpg</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Liu, Lianggui</creatorcontrib><creatorcontrib>Feng, Guangzeng</creatorcontrib><title>SIMULATED ANNEALING BASED POLYNOMIAL TIME QOS ROUTING ALGORITHM FOR MANETS</title><title>Journal of electronics (China)</title><addtitle>Journal of Electronics</addtitle><description>Multi-constrained Quality-of-Service （QoS） routing is a big challenge for Mobile Ad hoc Networks （MANETs） where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing （SA_RA） is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The paper outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing （QoSR） in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the （approximate） optimal configuration within a period of polynomial time.</description><subject>多项式时间问题</subject><subject>模拟退火</subject><subject>理论分析</subject><subject>能量函数</subject><subject>非确定多项式时间完全问题</subject><issn>0217-9822</issn><issn>1993-0615</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNotkE1Pg0AQhjdGE2v1B3gj3jygs5_AcVXaYvjQQg-eNgsstR9ShRjRX-827WEymcwz8yYPQtcY7jCAd99j7AnPBeC2fOEOJ2iEg4C6IDA_RSMg2HMDn5BzdNH3a8tRn8MIPedRsohlET45Mk1DGUfp1HmQuZ1fsvgtzZJIxk4RJaHzmuXOPFsUe0LG02weFbPEmWRzJ5FpWOSX6KzR295cHfsYLSZh8Thz42waPcrYrTDH4Ja8DGpS1T5jFBhvakawwVjogArmMVZx3-6qUjADTVAbX3PNa8EaUdKyMSUdo9vD3x_dNrpdqvXuu2ttoqr_NsOwUYYACOCAwbL4wFbdru8706jPbvWhu1-FQe3FqYM4ZYWovTg12Jub4837rl1-rWxCqatNs9oaRSglvs8J_Qc0QGVt</recordid><startdate>200609</startdate><enddate>200609</enddate><creator>Liu, Lianggui</creator><creator>Feng, Guangzeng</creator><general>College of Communications and Information Engineering, Nanjing University of Posts &amp; Telecommunications,Nanjing 210003, China</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>2B.</scope><scope>4A8</scope><scope>92I</scope><scope>93N</scope><scope>PSX</scope><scope>TCJ</scope></search><sort><creationdate>200609</creationdate><title>SIMULATED ANNEALING BASED POLYNOMIAL TIME QOS ROUTING ALGORITHM FOR MANETS</title><author>Liu, Lianggui ; Feng, Guangzeng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1510-b5b9d2cd8443045fd421e116a9364744c58d84cb64e0f9de8a5a5d64f6b3bfeb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>多项式时间问题</topic><topic>模拟退火</topic><topic>理论分析</topic><topic>能量函数</topic><topic>非确定多项式时间完全问题</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liu, Lianggui</creatorcontrib><creatorcontrib>Feng, Guangzeng</creatorcontrib><collection>维普_期刊</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>维普中文期刊数据库</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>Wanfang Data Journals - Hong Kong</collection><collection>WANFANG Data Centre</collection><collection>Wanfang Data Journals</collection><collection>万方数据期刊 - 香港版</collection><collection>China Online Journals (COJ)</collection><collection>China Online Journals (COJ)</collection><jtitle>Journal of electronics (China)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liu, Lianggui</au><au>Feng, Guangzeng</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>SIMULATED ANNEALING BASED POLYNOMIAL TIME QOS ROUTING ALGORITHM FOR MANETS</atitle><jtitle>Journal of electronics (China)</jtitle><addtitle>Journal of Electronics</addtitle><date>2006-09</date><risdate>2006</risdate><volume>23</volume><issue>5</issue><spage>691</spage><epage>697</epage><pages>691-697</pages><issn>0217-9822</issn><eissn>1993-0615</eissn><abstract>Multi-constrained Quality-of-Service （QoS） routing is a big challenge for Mobile Ad hoc Networks （MANETs） where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing （SA_RA） is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The paper outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing （QoSR） in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the （approximate） optimal configuration within a period of polynomial time.</abstract><pub>College of Communications and Information Engineering, Nanjing University of Posts &amp; Telecommunications,Nanjing 210003, China</pub><doi>10.1007/s11767-005-0086-x</doi><tpages>7</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0217-9822
ispartof Journal of electronics (China), 2006-09, Vol.23 (5), p.691-697
issn 0217-9822
1993-0615
language eng
recordid cdi_wanfang_journals_dzkxxk_e200605010
source Alma/SFX Local Collection
subjects 多项式时间问题
模拟退火
理论分析
能量函数
非确定多项式时间完全问题
title SIMULATED ANNEALING BASED POLYNOMIAL TIME QOS ROUTING ALGORITHM FOR MANETS
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T18%3A34%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wanfang_jour_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=SIMULATED%20ANNEALING%20BASED%20POLYNOMIAL%20TIME%20QOS%20ROUTING%20ALGORITHM%20FOR%20MANETS&rft.jtitle=Journal%20of%20electronics%20(China)&rft.au=Liu,%20Lianggui&rft.date=2006-09&rft.volume=23&rft.issue=5&rft.spage=691&rft.epage=697&rft.pages=691-697&rft.issn=0217-9822&rft.eissn=1993-0615&rft_id=info:doi/10.1007/s11767-005-0086-x&rft_dat=%3Cwanfang_jour_cross%3Edzkxxk_e200605010%3C/wanfang_jour_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_cqvip_id=23328852&rft_wanfj_id=dzkxxk_e200605010&rfr_iscdi=true