Tree-Based Service Discovery in Mobile Ad Hoc Networks

Utilizing service oriented architectures to enhance seamless collaborations and information sharing among nodes in mobile ad hoc networks with limited communication capability is a challenging task. In this paper a novel tree-based service discovery mechanism, able to achieve high accuracy in the pr...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Liao Mingxue, He Jing, Zhu Rongfu, Wang Xianqing, He Xiaoxin
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Accuracy Ad hoc networks Bandwidth mobile ad hoc network Monitoring Peer to peer computing service discovery service matching Synchronization Wireless communication
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	211
container_issue
container_start_page	206
container_title
container_volume
creator	Liao Mingxue He Jing Zhu Rongfu Wang Xianqing He Xiaoxin
description	Utilizing service oriented architectures to enhance seamless collaborations and information sharing among nodes in mobile ad hoc networks with limited communication capability is a challenging task. In this paper a novel tree-based service discovery mechanism, able to achieve high accuracy in the process of service discovery, is proposed, which affords wireless communication overheads nearly linear with the number of property-changing services offered by the whole network. The mechanism is suitable and customized for typical mobile networks. As properties such as quality and capability of the aimed services are always changing rather than remaining invariable, a service matching process is also provided, where an efficient method is implemented for searching for a target service in a local service repository with given conditions and policies.
doi_str_mv	10.1109/APSCC.2010.82
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5708572</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5708572</ieee_id><sourcerecordid>5708572</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-962f7aac5b0b3b8407503eaa10e95884f53e853642dc2d954799245c8267de33</originalsourceid><addsrcrecordid>eNotjEtLAzEURgNSUOssXbnJH5ia101yl-P4qFAfMN2XTOYORKsjSan031vRb3M4HPgYu5RiIaXA6-a1a9uFEkf36oRV6Lw0yhjUaP2Mnf8W1M4KOGVVKW_iOFDOoT5jdp2J6ptQaOAd5X2KxG9TidOe8oGnT_409WlLvBn4cor8mXbfU34vF2w2hm2h6p9z1t3frdtlvXp5eGybVZ1Q7Gq0anQhROhFr3tvhAOhKQQpCMF7M4ImD9oaNUQ1IBiHqAxEr6wbSOs5u_p7TUS0-crpI-TDBpzw4JT-AUiGQ4w</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Tree-Based Service Discovery in Mobile Ad Hoc Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Liao Mingxue ; He Jing ; Zhu Rongfu ; Wang Xianqing ; He Xiaoxin</creator><creatorcontrib>Liao Mingxue ; He Jing ; Zhu Rongfu ; Wang Xianqing ; He Xiaoxin</creatorcontrib><description>Utilizing service oriented architectures to enhance seamless collaborations and information sharing among nodes in mobile ad hoc networks with limited communication capability is a challenging task. In this paper a novel tree-based service discovery mechanism, able to achieve high accuracy in the process of service discovery, is proposed, which affords wireless communication overheads nearly linear with the number of property-changing services offered by the whole network. The mechanism is suitable and customized for typical mobile networks. As properties such as quality and capability of the aimed services are always changing rather than remaining invariable, a service matching process is also provided, where an efficient method is implemented for searching for a target service in a local service repository with given conditions and policies.</description><identifier>ISBN: 9781424493968</identifier><identifier>ISBN: 142449396X</identifier><identifier>DOI: 10.1109/APSCC.2010.82</identifier><identifier>LCCN: 2010937605</identifier><language>eng</language><publisher>IEEE</publisher><subject>Accuracy ; Ad hoc networks ; Bandwidth ; mobile ad hoc network ; Monitoring ; Peer to peer computing ; service discovery ; service matching ; Synchronization ; Wireless communication</subject><ispartof>2010 IEEE Asia-Pacific Services Computing Conference, 2010, p.206-211</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5708572$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5708572$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Liao Mingxue</creatorcontrib><creatorcontrib>He Jing</creatorcontrib><creatorcontrib>Zhu Rongfu</creatorcontrib><creatorcontrib>Wang Xianqing</creatorcontrib><creatorcontrib>He Xiaoxin</creatorcontrib><title>Tree-Based Service Discovery in Mobile Ad Hoc Networks</title><title>2010 IEEE Asia-Pacific Services Computing Conference</title><addtitle>APSCC</addtitle><description>Utilizing service oriented architectures to enhance seamless collaborations and information sharing among nodes in mobile ad hoc networks with limited communication capability is a challenging task. In this paper a novel tree-based service discovery mechanism, able to achieve high accuracy in the process of service discovery, is proposed, which affords wireless communication overheads nearly linear with the number of property-changing services offered by the whole network. The mechanism is suitable and customized for typical mobile networks. As properties such as quality and capability of the aimed services are always changing rather than remaining invariable, a service matching process is also provided, where an efficient method is implemented for searching for a target service in a local service repository with given conditions and policies.</description><subject>Accuracy</subject><subject>Ad hoc networks</subject><subject>Bandwidth</subject><subject>mobile ad hoc network</subject><subject>Monitoring</subject><subject>Peer to peer computing</subject><subject>service discovery</subject><subject>service matching</subject><subject>Synchronization</subject><subject>Wireless communication</subject><isbn>9781424493968</isbn><isbn>142449396X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjEtLAzEURgNSUOssXbnJH5ia101yl-P4qFAfMN2XTOYORKsjSan031vRb3M4HPgYu5RiIaXA6-a1a9uFEkf36oRV6Lw0yhjUaP2Mnf8W1M4KOGVVKW_iOFDOoT5jdp2J6ptQaOAd5X2KxG9TidOe8oGnT_409WlLvBn4cor8mXbfU34vF2w2hm2h6p9z1t3frdtlvXp5eGybVZ1Q7Gq0anQhROhFr3tvhAOhKQQpCMF7M4ImD9oaNUQ1IBiHqAxEr6wbSOs5u_p7TUS0-crpI-TDBpzw4JT-AUiGQ4w</recordid><startdate>201012</startdate><enddate>201012</enddate><creator>Liao Mingxue</creator><creator>He Jing</creator><creator>Zhu Rongfu</creator><creator>Wang Xianqing</creator><creator>He Xiaoxin</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201012</creationdate><title>Tree-Based Service Discovery in Mobile Ad Hoc Networks</title><author>Liao Mingxue ; He Jing ; Zhu Rongfu ; Wang Xianqing ; He Xiaoxin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-962f7aac5b0b3b8407503eaa10e95884f53e853642dc2d954799245c8267de33</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Accuracy</topic><topic>Ad hoc networks</topic><topic>Bandwidth</topic><topic>mobile ad hoc network</topic><topic>Monitoring</topic><topic>Peer to peer computing</topic><topic>service discovery</topic><topic>service matching</topic><topic>Synchronization</topic><topic>Wireless communication</topic><toplevel>online_resources</toplevel><creatorcontrib>Liao Mingxue</creatorcontrib><creatorcontrib>He Jing</creatorcontrib><creatorcontrib>Zhu Rongfu</creatorcontrib><creatorcontrib>Wang Xianqing</creatorcontrib><creatorcontrib>He Xiaoxin</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Liao Mingxue</au><au>He Jing</au><au>Zhu Rongfu</au><au>Wang Xianqing</au><au>He Xiaoxin</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Tree-Based Service Discovery in Mobile Ad Hoc Networks</atitle><btitle>2010 IEEE Asia-Pacific Services Computing Conference</btitle><stitle>APSCC</stitle><date>2010-12</date><risdate>2010</risdate><spage>206</spage><epage>211</epage><pages>206-211</pages><isbn>9781424493968</isbn><isbn>142449396X</isbn><abstract>Utilizing service oriented architectures to enhance seamless collaborations and information sharing among nodes in mobile ad hoc networks with limited communication capability is a challenging task. In this paper a novel tree-based service discovery mechanism, able to achieve high accuracy in the process of service discovery, is proposed, which affords wireless communication overheads nearly linear with the number of property-changing services offered by the whole network. The mechanism is suitable and customized for typical mobile networks. As properties such as quality and capability of the aimed services are always changing rather than remaining invariable, a service matching process is also provided, where an efficient method is implemented for searching for a target service in a local service repository with given conditions and policies.</abstract><pub>IEEE</pub><doi>10.1109/APSCC.2010.82</doi><tpages>6</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISBN: 9781424493968
ispartof	2010 IEEE Asia-Pacific Services Computing Conference, 2010, p.206-211
issn
language	eng
recordid	cdi_ieee_primary_5708572
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Accuracy Ad hoc networks Bandwidth mobile ad hoc network Monitoring Peer to peer computing service discovery service matching Synchronization Wireless communication
title	Tree-Based Service Discovery in Mobile Ad Hoc Networks
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T17%3A00%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Tree-Based%20Service%20Discovery%20in%20Mobile%20Ad%20Hoc%20Networks&rft.btitle=2010%20IEEE%20Asia-Pacific%20Services%20Computing%20Conference&rft.au=Liao%20Mingxue&rft.date=2010-12&rft.spage=206&rft.epage=211&rft.pages=206-211&rft.isbn=9781424493968&rft.isbn_list=142449396X&rft_id=info:doi/10.1109/APSCC.2010.82&rft_dat=%3Cieee_6IE%3E5708572%3C/ieee_6IE%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_ieee_id=5708572&rfr_iscdi=true