Multiconstrained QoS multipath routing in wireless sensor networks
Sensor nodes are densely deployed to accomplish various applications because of the inexpensive cost and small size. Depending on different applications, the traffic in the wireless sensor networks may be mixed with time-sensitive packets and reliability-demanding packets. Therefore, QoS routing is...
Gespeichert in:
| Veröffentlicht in: | Wireless networks 2008-08, Vol.14 (4), p.465-478 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 478 |
|---|---|
| container_issue | 4 |
| container_start_page | 465 |
| container_title | Wireless networks |
| container_volume | 14 |
| creator | Huang, Xiaoxia Fang, Yuguang |
| description | Sensor nodes are densely deployed to accomplish various applications because of the inexpensive cost and small size. Depending on different applications, the traffic in the wireless sensor networks may be mixed with time-sensitive packets and reliability-demanding packets. Therefore, QoS routing is an important issue in wireless sensor networks. Our goal is to provide soft-QoS to different packets as path information is not readily available in wireless networks. In this paper, we utilize the multiple paths between the source and sink pairs for QoS provisioning. Unlike E2E QoS schemes, soft-QoS mapped into links on a path is provided based on local link state information. By the estimation and approximation of path quality, traditional NP-complete QoS problem can be transformed to a modest problem. The idea is to formulate the optimization problem as a probabilistic programming, then based on some approximation technique, we convert it into a deterministic linear programming, which is much easier and convenient to solve. More importantly, the resulting solution is also one to the original probabilistic programming. Simulation results demonstrate the effectiveness of our approach. |
| doi_str_mv | 10.1007/s11276-006-0731-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_743289528</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>743289528</sourcerecordid><originalsourceid>FETCH-LOGICAL-c413t-52547cde69288e76afbe103b9dffb76105d7eec9157a8568e53825359f19d7253</originalsourceid><addsrcrecordid>eNp1kFtLw0AQhRdRsFZ_gG_BF5-ie8neHrV4g4qI-rykyaSmprt1J6H4790SQRB8GGaY-c5hOIScMnrBKNWXyBjXKqc0lRYst3tkwqTmuWFW7aeZcp6uwhySI8QVpdQIayfk-nHo-rYKHvtYth7q7Dm8ZOvdclP271kMQ9_6Zdb6bNtG6AAxQ_AYYuah34b4gcfkoCk7hJOfPiVvtzevs_t8_nT3MLua51XBRJ9LLgtd1aAsNwa0KpsFMCoWtm6ahVaMyloDVDZ9XRqpDEhhuBTSNszWOk1Tcj76bmL4HAB7t26xgq4rPYQBnS4EN1Zyk8izP-QqDNGn5xxnouBSMZEgNkJVDIgRGreJ7bqMX45Rt8vUjZm6lKnbZeps0vBRg4n1S4i_xv-LvgGBi3kG</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>213425613</pqid></control><display><type>article</type><title>Multiconstrained QoS multipath routing in wireless sensor networks</title><source>SpringerLink Journals</source><creator>Huang, Xiaoxia ; Fang, Yuguang</creator><creatorcontrib>Huang, Xiaoxia ; Fang, Yuguang</creatorcontrib><description>Sensor nodes are densely deployed to accomplish various applications because of the inexpensive cost and small size. Depending on different applications, the traffic in the wireless sensor networks may be mixed with time-sensitive packets and reliability-demanding packets. Therefore, QoS routing is an important issue in wireless sensor networks. Our goal is to provide soft-QoS to different packets as path information is not readily available in wireless networks. In this paper, we utilize the multiple paths between the source and sink pairs for QoS provisioning. Unlike E2E QoS schemes, soft-QoS mapped into links on a path is provided based on local link state information. By the estimation and approximation of path quality, traditional NP-complete QoS problem can be transformed to a modest problem. The idea is to formulate the optimization problem as a probabilistic programming, then based on some approximation technique, we convert it into a deterministic linear programming, which is much easier and convenient to solve. More importantly, the resulting solution is also one to the original probabilistic programming. Simulation results demonstrate the effectiveness of our approach.</description><identifier>ISSN: 1022-0038</identifier><identifier>EISSN: 1572-8196</identifier><identifier>DOI: 10.1007/s11276-006-0731-9</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Algorithms ; Approximation ; Communications Engineering ; Computer Communication Networks ; Electrical Engineering ; Engineering ; Heuristic ; IT in Business ; Linear programming ; Networks ; Optimization ; Quality of service ; Routing ; Sensors ; Simulation ; Studies ; Wireless networks</subject><ispartof>Wireless networks, 2008-08, Vol.14 (4), p.465-478</ispartof><rights>Springer Science + Business Media, LLC 2007</rights><rights>Springer Science+Business Media, LLC 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c413t-52547cde69288e76afbe103b9dffb76105d7eec9157a8568e53825359f19d7253</citedby><cites>FETCH-LOGICAL-c413t-52547cde69288e76afbe103b9dffb76105d7eec9157a8568e53825359f19d7253</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11276-006-0731-9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11276-006-0731-9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Huang, Xiaoxia</creatorcontrib><creatorcontrib>Fang, Yuguang</creatorcontrib><title>Multiconstrained QoS multipath routing in wireless sensor networks</title><title>Wireless networks</title><addtitle>Wireless Netw</addtitle><description>Sensor nodes are densely deployed to accomplish various applications because of the inexpensive cost and small size. Depending on different applications, the traffic in the wireless sensor networks may be mixed with time-sensitive packets and reliability-demanding packets. Therefore, QoS routing is an important issue in wireless sensor networks. Our goal is to provide soft-QoS to different packets as path information is not readily available in wireless networks. In this paper, we utilize the multiple paths between the source and sink pairs for QoS provisioning. Unlike E2E QoS schemes, soft-QoS mapped into links on a path is provided based on local link state information. By the estimation and approximation of path quality, traditional NP-complete QoS problem can be transformed to a modest problem. The idea is to formulate the optimization problem as a probabilistic programming, then based on some approximation technique, we convert it into a deterministic linear programming, which is much easier and convenient to solve. More importantly, the resulting solution is also one to the original probabilistic programming. Simulation results demonstrate the effectiveness of our approach.</description><subject>Algorithms</subject><subject>Approximation</subject><subject>Communications Engineering</subject><subject>Computer Communication Networks</subject><subject>Electrical Engineering</subject><subject>Engineering</subject><subject>Heuristic</subject><subject>IT in Business</subject><subject>Linear programming</subject><subject>Networks</subject><subject>Optimization</subject><subject>Quality of service</subject><subject>Routing</subject><subject>Sensors</subject><subject>Simulation</subject><subject>Studies</subject><subject>Wireless networks</subject><issn>1022-0038</issn><issn>1572-8196</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp1kFtLw0AQhRdRsFZ_gG_BF5-ie8neHrV4g4qI-rykyaSmprt1J6H4790SQRB8GGaY-c5hOIScMnrBKNWXyBjXKqc0lRYst3tkwqTmuWFW7aeZcp6uwhySI8QVpdQIayfk-nHo-rYKHvtYth7q7Dm8ZOvdclP271kMQ9_6Zdb6bNtG6AAxQ_AYYuah34b4gcfkoCk7hJOfPiVvtzevs_t8_nT3MLua51XBRJ9LLgtd1aAsNwa0KpsFMCoWtm6ahVaMyloDVDZ9XRqpDEhhuBTSNszWOk1Tcj76bmL4HAB7t26xgq4rPYQBnS4EN1Zyk8izP-QqDNGn5xxnouBSMZEgNkJVDIgRGreJ7bqMX45Rt8vUjZm6lKnbZeps0vBRg4n1S4i_xv-LvgGBi3kG</recordid><startdate>20080801</startdate><enddate>20080801</enddate><creator>Huang, Xiaoxia</creator><creator>Fang, Yuguang</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7SP</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M2P</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20080801</creationdate><title>Multiconstrained QoS multipath routing in wireless sensor networks</title><author>Huang, Xiaoxia ; Fang, Yuguang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c413t-52547cde69288e76afbe103b9dffb76105d7eec9157a8568e53825359f19d7253</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithms</topic><topic>Approximation</topic><topic>Communications Engineering</topic><topic>Computer Communication Networks</topic><topic>Electrical Engineering</topic><topic>Engineering</topic><topic>Heuristic</topic><topic>IT in Business</topic><topic>Linear programming</topic><topic>Networks</topic><topic>Optimization</topic><topic>Quality of service</topic><topic>Routing</topic><topic>Sensors</topic><topic>Simulation</topic><topic>Studies</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Huang, Xiaoxia</creatorcontrib><creatorcontrib>Fang, Yuguang</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>Wireless networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Huang, Xiaoxia</au><au>Fang, Yuguang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multiconstrained QoS multipath routing in wireless sensor networks</atitle><jtitle>Wireless networks</jtitle><stitle>Wireless Netw</stitle><date>2008-08-01</date><risdate>2008</risdate><volume>14</volume><issue>4</issue><spage>465</spage><epage>478</epage><pages>465-478</pages><issn>1022-0038</issn><eissn>1572-8196</eissn><abstract>Sensor nodes are densely deployed to accomplish various applications because of the inexpensive cost and small size. Depending on different applications, the traffic in the wireless sensor networks may be mixed with time-sensitive packets and reliability-demanding packets. Therefore, QoS routing is an important issue in wireless sensor networks. Our goal is to provide soft-QoS to different packets as path information is not readily available in wireless networks. In this paper, we utilize the multiple paths between the source and sink pairs for QoS provisioning. Unlike E2E QoS schemes, soft-QoS mapped into links on a path is provided based on local link state information. By the estimation and approximation of path quality, traditional NP-complete QoS problem can be transformed to a modest problem. The idea is to formulate the optimization problem as a probabilistic programming, then based on some approximation technique, we convert it into a deterministic linear programming, which is much easier and convenient to solve. More importantly, the resulting solution is also one to the original probabilistic programming. Simulation results demonstrate the effectiveness of our approach.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s11276-006-0731-9</doi><tpages>14</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1022-0038 |
| ispartof | Wireless networks, 2008-08, Vol.14 (4), p.465-478 |
| issn | 1022-0038 1572-8196 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_743289528 |
| source | SpringerLink Journals |
| subjects | Algorithms Approximation Communications Engineering Computer Communication Networks Electrical Engineering Engineering Heuristic IT in Business Linear programming Networks Optimization Quality of service Routing Sensors Simulation Studies Wireless networks |
| title | Multiconstrained QoS multipath routing in wireless sensor networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T02%3A46%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multiconstrained%20QoS%20multipath%20routing%20in%20wireless%20sensor%20networks&rft.jtitle=Wireless%20networks&rft.au=Huang,%20Xiaoxia&rft.date=2008-08-01&rft.volume=14&rft.issue=4&rft.spage=465&rft.epage=478&rft.pages=465-478&rft.issn=1022-0038&rft.eissn=1572-8196&rft_id=info:doi/10.1007/s11276-006-0731-9&rft_dat=%3Cproquest_cross%3E743289528%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=213425613&rft_id=info:pmid/&rfr_iscdi=true |