NWC: Node Weight Computation in MANETs

As mobile devices are getting more and more ubiquitous, the paradigm of wireless Mobile Ad hoc NETworks (MANETs) is gaining popularity. Especially distributed real-time applications are attractive for their users in this environment. To help manage these applications in MANETs, previously we develop...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Farkas, K., Hossmann, T., Plattner, B., Ruf, L.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1064
container_issue
container_start_page 1059
container_title
container_volume
creator Farkas, K.
Hossmann, T.
Plattner, B.
Ruf, L.
description As mobile devices are getting more and more ubiquitous, the paradigm of wireless Mobile Ad hoc NETworks (MANETs) is gaining popularity. Especially distributed real-time applications are attractive for their users in this environment. To help manage these applications in MANETs, previously we developed a distributed algorithm called PBS (priority based selection). PBS divides the ad hoc network into zones and selects and maintains a set of nodes, which act as zone servers, to manage these zones. The zone server selection applies node priority comparison, which reflects the node's capabilities to act as zone server. In this paper, we propose a mechanism called NWC (node weight computation) to be applied in the node priority comparison of PBS. NWC computes the node weight, on which the priority comparison is based, as the weighted linear combination of the node parameters. The parameter weights are extracted from the so-called service profile which reflects the characteristics and requirements of the given service. To create this profile we developed a procedure using factorial design via simulations and multi-objective optimization. Our NWC mechanism, applying the created service profile, assigns the highest priorities to the best suited nodes for a given service type and thus designates the most powerful nodes to be selected as zone servers by PBS. Moreover, the weight computation of NWC can be used by other clustering algorithms in MANETs, too.
doi_str_mv 10.1109/ICCCN.2007.4317958
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4317958</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4317958</ieee_id><sourcerecordid>4317958</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-406faa13cb94623283bced23508235281e548497f7b097d6b4c503e169f2f8b13</originalsourceid><addsrcrecordid>eNo1z7tOw0AUBNDLS8IE_wA0ruhs7t330kWrAJGCaYJCF_mxC4tIHMVOwd9jidDMFCMdaQBuCAsitPdz51xZMERdCE7aSnMCVySYEMQkvZ9CwhTXuRUczyC12vxvSOeQjILMGUp5CWnffyEiaSVGOIG7cuUesrJrfbby8eNzyFy32R2GaojdNovb7GVazpb9NVyE6rv36bEn8PY4W7rnfPH6NHfTRR5JyyEXqEJVEW9qKxTjzPC68S3jEs0YzJCXwgirg67R6lbVopHIPSkbWDA18Qnc_rnRe7_e7eOm2v-sj5f5L0zUQjo</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>NWC: Node Weight Computation in MANETs</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Farkas, K. ; Hossmann, T. ; Plattner, B. ; Ruf, L.</creator><creatorcontrib>Farkas, K. ; Hossmann, T. ; Plattner, B. ; Ruf, L.</creatorcontrib><description>As mobile devices are getting more and more ubiquitous, the paradigm of wireless Mobile Ad hoc NETworks (MANETs) is gaining popularity. Especially distributed real-time applications are attractive for their users in this environment. To help manage these applications in MANETs, previously we developed a distributed algorithm called PBS (priority based selection). PBS divides the ad hoc network into zones and selects and maintains a set of nodes, which act as zone servers, to manage these zones. The zone server selection applies node priority comparison, which reflects the node's capabilities to act as zone server. In this paper, we propose a mechanism called NWC (node weight computation) to be applied in the node priority comparison of PBS. NWC computes the node weight, on which the priority comparison is based, as the weighted linear combination of the node parameters. The parameter weights are extracted from the so-called service profile which reflects the characteristics and requirements of the given service. To create this profile we developed a procedure using factorial design via simulations and multi-objective optimization. Our NWC mechanism, applying the created service profile, assigns the highest priorities to the best suited nodes for a given service type and thus designates the most powerful nodes to be selected as zone servers by PBS. Moreover, the weight computation of NWC can be used by other clustering algorithms in MANETs, too.</description><identifier>ISSN: 1095-2055</identifier><identifier>ISBN: 9781424412501</identifier><identifier>ISBN: 1424412501</identifier><identifier>EISSN: 2637-9430</identifier><identifier>EISBN: 142441251X</identifier><identifier>EISBN: 9781424412518</identifier><identifier>DOI: 10.1109/ICCCN.2007.4317958</identifier><language>eng</language><publisher>IEEE</publisher><subject>Ad hoc networks ; Clustering algorithms ; Computational modeling ; Computer network management ; Computer networks ; Design optimization ; Distributed algorithms ; Mobile ad hoc networks ; Network servers ; Peer to peer computing</subject><ispartof>2007 16th International Conference on Computer Communications and Networks, 2007, p.1059-1064</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/4317958$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>310,311,781,785,790,791,2059,27930,54925</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4317958$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Farkas, K.</creatorcontrib><creatorcontrib>Hossmann, T.</creatorcontrib><creatorcontrib>Plattner, B.</creatorcontrib><creatorcontrib>Ruf, L.</creatorcontrib><title>NWC: Node Weight Computation in MANETs</title><title>2007 16th International Conference on Computer Communications and Networks</title><addtitle>ICCCN</addtitle><description>As mobile devices are getting more and more ubiquitous, the paradigm of wireless Mobile Ad hoc NETworks (MANETs) is gaining popularity. Especially distributed real-time applications are attractive for their users in this environment. To help manage these applications in MANETs, previously we developed a distributed algorithm called PBS (priority based selection). PBS divides the ad hoc network into zones and selects and maintains a set of nodes, which act as zone servers, to manage these zones. The zone server selection applies node priority comparison, which reflects the node's capabilities to act as zone server. In this paper, we propose a mechanism called NWC (node weight computation) to be applied in the node priority comparison of PBS. NWC computes the node weight, on which the priority comparison is based, as the weighted linear combination of the node parameters. The parameter weights are extracted from the so-called service profile which reflects the characteristics and requirements of the given service. To create this profile we developed a procedure using factorial design via simulations and multi-objective optimization. Our NWC mechanism, applying the created service profile, assigns the highest priorities to the best suited nodes for a given service type and thus designates the most powerful nodes to be selected as zone servers by PBS. Moreover, the weight computation of NWC can be used by other clustering algorithms in MANETs, too.</description><subject>Ad hoc networks</subject><subject>Clustering algorithms</subject><subject>Computational modeling</subject><subject>Computer network management</subject><subject>Computer networks</subject><subject>Design optimization</subject><subject>Distributed algorithms</subject><subject>Mobile ad hoc networks</subject><subject>Network servers</subject><subject>Peer to peer computing</subject><issn>1095-2055</issn><issn>2637-9430</issn><isbn>9781424412501</isbn><isbn>1424412501</isbn><isbn>142441251X</isbn><isbn>9781424412518</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1z7tOw0AUBNDLS8IE_wA0ruhs7t330kWrAJGCaYJCF_mxC4tIHMVOwd9jidDMFCMdaQBuCAsitPdz51xZMERdCE7aSnMCVySYEMQkvZ9CwhTXuRUczyC12vxvSOeQjILMGUp5CWnffyEiaSVGOIG7cuUesrJrfbby8eNzyFy32R2GaojdNovb7GVazpb9NVyE6rv36bEn8PY4W7rnfPH6NHfTRR5JyyEXqEJVEW9qKxTjzPC68S3jEs0YzJCXwgirg67R6lbVopHIPSkbWDA18Qnc_rnRe7_e7eOm2v-sj5f5L0zUQjo</recordid><startdate>200708</startdate><enddate>200708</enddate><creator>Farkas, K.</creator><creator>Hossmann, T.</creator><creator>Plattner, B.</creator><creator>Ruf, L.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200708</creationdate><title>NWC: Node Weight Computation in MANETs</title><author>Farkas, K. ; Hossmann, T. ; Plattner, B. ; Ruf, L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-406faa13cb94623283bced23508235281e548497f7b097d6b4c503e169f2f8b13</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Ad hoc networks</topic><topic>Clustering algorithms</topic><topic>Computational modeling</topic><topic>Computer network management</topic><topic>Computer networks</topic><topic>Design optimization</topic><topic>Distributed algorithms</topic><topic>Mobile ad hoc networks</topic><topic>Network servers</topic><topic>Peer to peer computing</topic><toplevel>online_resources</toplevel><creatorcontrib>Farkas, K.</creatorcontrib><creatorcontrib>Hossmann, T.</creatorcontrib><creatorcontrib>Plattner, B.</creatorcontrib><creatorcontrib>Ruf, L.</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>Farkas, K.</au><au>Hossmann, T.</au><au>Plattner, B.</au><au>Ruf, L.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>NWC: Node Weight Computation in MANETs</atitle><btitle>2007 16th International Conference on Computer Communications and Networks</btitle><stitle>ICCCN</stitle><date>2007-08</date><risdate>2007</risdate><spage>1059</spage><epage>1064</epage><pages>1059-1064</pages><issn>1095-2055</issn><eissn>2637-9430</eissn><isbn>9781424412501</isbn><isbn>1424412501</isbn><eisbn>142441251X</eisbn><eisbn>9781424412518</eisbn><abstract>As mobile devices are getting more and more ubiquitous, the paradigm of wireless Mobile Ad hoc NETworks (MANETs) is gaining popularity. Especially distributed real-time applications are attractive for their users in this environment. To help manage these applications in MANETs, previously we developed a distributed algorithm called PBS (priority based selection). PBS divides the ad hoc network into zones and selects and maintains a set of nodes, which act as zone servers, to manage these zones. The zone server selection applies node priority comparison, which reflects the node's capabilities to act as zone server. In this paper, we propose a mechanism called NWC (node weight computation) to be applied in the node priority comparison of PBS. NWC computes the node weight, on which the priority comparison is based, as the weighted linear combination of the node parameters. The parameter weights are extracted from the so-called service profile which reflects the characteristics and requirements of the given service. To create this profile we developed a procedure using factorial design via simulations and multi-objective optimization. Our NWC mechanism, applying the created service profile, assigns the highest priorities to the best suited nodes for a given service type and thus designates the most powerful nodes to be selected as zone servers by PBS. Moreover, the weight computation of NWC can be used by other clustering algorithms in MANETs, too.</abstract><pub>IEEE</pub><doi>10.1109/ICCCN.2007.4317958</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1095-2055
ispartof 2007 16th International Conference on Computer Communications and Networks, 2007, p.1059-1064
issn 1095-2055
2637-9430
language eng
recordid cdi_ieee_primary_4317958
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Ad hoc networks
Clustering algorithms
Computational modeling
Computer network management
Computer networks
Design optimization
Distributed algorithms
Mobile ad hoc networks
Network servers
Peer to peer computing
title NWC: Node Weight Computation in MANETs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-12T00%3A08%3A48IST&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=NWC:%20Node%20Weight%20Computation%20in%20MANETs&rft.btitle=2007%2016th%20International%20Conference%20on%20Computer%20Communications%20and%20Networks&rft.au=Farkas,%20K.&rft.date=2007-08&rft.spage=1059&rft.epage=1064&rft.pages=1059-1064&rft.issn=1095-2055&rft.eissn=2637-9430&rft.isbn=9781424412501&rft.isbn_list=1424412501&rft_id=info:doi/10.1109/ICCCN.2007.4317958&rft_dat=%3Cieee_6IE%3E4317958%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=142441251X&rft.eisbn_list=9781424412518&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4317958&rfr_iscdi=true