New metrics for dominating set based energy efficient activity scheduling in ad hoc networks

In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends the same message to all the network. Routing problem deals with finding a route between a source and a destination. In the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Shaikh, J.A., Solano, J., Stojmenovic, I., Jie Wu
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 735
container_issue
container_start_page 726
container_title
container_volume
creator Shaikh, J.A.
Solano, J.
Stojmenovic, I.
Jie Wu
description In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends the same message to all the network. Routing problem deals with finding a route between a source and a destination. In the activity-scheduling problem, each node decides between active or passive state. We present a scheme whose goal is to prolong network life while preserving connectivity. Each node is either active or has an active neighbor node. Routing and broadcasting are restricted to active nodes that create such dominating set. Activity status is periodically updated during a short transition period. The main contribution of this article is to propose new metrics for previously studied source-independent localized dominating sets, based on combinations of node degrees and remaining energy levels, for deciding activity status.
doi_str_mv 10.1109/LCN.2003.1243206
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1243206</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1243206</ieee_id><sourcerecordid>1243206</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-4afab255c5c9dfc48b4ab1c8887831fc1d577a83fb58e14a9ed7237f95ac588a3</originalsourceid><addsrcrecordid>eNotkM1KAzEYRQMqWGr3gpu8wNT8NslSBn8KQ93oTijfJF_aaGdGJtEyb69i7-ZsDmdxCbnmbMk5c7dNvVkKxuSSCyUFW52RhTOWmZXTgkljzsmMGSUqLpm8JIuc39nvnOJKixl52-CRdljG5DONw0jD0KUeSup3NGOhLWQMFHscdxPFGJNP2BcKvqTvVCaa_R7D1-FPTz2FQPeDpz2W4zB-5CtyEeGQcXHinLw-3L_UT1Xz_Liu75oqcaNLpSBCK7T22rsQvbKtgpZ7a62xkkfPgzYGrIyttsgVOAxGSBOdBq-tBTknN__dhIjbzzF1ME7b0x_yB508VQA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>New metrics for dominating set based energy efficient activity scheduling in ad hoc networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Shaikh, J.A. ; Solano, J. ; Stojmenovic, I. ; Jie Wu</creator><creatorcontrib>Shaikh, J.A. ; Solano, J. ; Stojmenovic, I. ; Jie Wu</creatorcontrib><description>In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends the same message to all the network. Routing problem deals with finding a route between a source and a destination. In the activity-scheduling problem, each node decides between active or passive state. We present a scheme whose goal is to prolong network life while preserving connectivity. Each node is either active or has an active neighbor node. Routing and broadcasting are restricted to active nodes that create such dominating set. Activity status is periodically updated during a short transition period. The main contribution of this article is to propose new metrics for previously studied source-independent localized dominating sets, based on combinations of node degrees and remaining energy levels, for deciding activity status.</description><identifier>ISSN: 0742-1303</identifier><identifier>ISBN: 9780769520377</identifier><identifier>ISBN: 0769520375</identifier><identifier>DOI: 10.1109/LCN.2003.1243206</identifier><language>eng</language><publisher>IEEE</publisher><subject>Ad hoc networks ; Broadcasting ; Costs ; Energy consumption ; Energy efficiency ; Intelligent networks ; Network topology ; Routing ; Wireless networks ; Wireless sensor networks</subject><ispartof>28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings, 2003, p.726-735</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/1243206$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,4036,4037,27906,54901</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1243206$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Shaikh, J.A.</creatorcontrib><creatorcontrib>Solano, J.</creatorcontrib><creatorcontrib>Stojmenovic, I.</creatorcontrib><creatorcontrib>Jie Wu</creatorcontrib><title>New metrics for dominating set based energy efficient activity scheduling in ad hoc networks</title><title>28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings</title><addtitle>LCN</addtitle><description>In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends the same message to all the network. Routing problem deals with finding a route between a source and a destination. In the activity-scheduling problem, each node decides between active or passive state. We present a scheme whose goal is to prolong network life while preserving connectivity. Each node is either active or has an active neighbor node. Routing and broadcasting are restricted to active nodes that create such dominating set. Activity status is periodically updated during a short transition period. The main contribution of this article is to propose new metrics for previously studied source-independent localized dominating sets, based on combinations of node degrees and remaining energy levels, for deciding activity status.</description><subject>Ad hoc networks</subject><subject>Broadcasting</subject><subject>Costs</subject><subject>Energy consumption</subject><subject>Energy efficiency</subject><subject>Intelligent networks</subject><subject>Network topology</subject><subject>Routing</subject><subject>Wireless networks</subject><subject>Wireless sensor networks</subject><issn>0742-1303</issn><isbn>9780769520377</isbn><isbn>0769520375</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2003</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotkM1KAzEYRQMqWGr3gpu8wNT8NslSBn8KQ93oTijfJF_aaGdGJtEyb69i7-ZsDmdxCbnmbMk5c7dNvVkKxuSSCyUFW52RhTOWmZXTgkljzsmMGSUqLpm8JIuc39nvnOJKixl52-CRdljG5DONw0jD0KUeSup3NGOhLWQMFHscdxPFGJNP2BcKvqTvVCaa_R7D1-FPTz2FQPeDpz2W4zB-5CtyEeGQcXHinLw-3L_UT1Xz_Liu75oqcaNLpSBCK7T22rsQvbKtgpZ7a62xkkfPgzYGrIyttsgVOAxGSBOdBq-tBTknN__dhIjbzzF1ME7b0x_yB508VQA</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>Shaikh, J.A.</creator><creator>Solano, J.</creator><creator>Stojmenovic, I.</creator><creator>Jie Wu</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2003</creationdate><title>New metrics for dominating set based energy efficient activity scheduling in ad hoc networks</title><author>Shaikh, J.A. ; Solano, J. ; Stojmenovic, I. ; Jie Wu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-4afab255c5c9dfc48b4ab1c8887831fc1d577a83fb58e14a9ed7237f95ac588a3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Ad hoc networks</topic><topic>Broadcasting</topic><topic>Costs</topic><topic>Energy consumption</topic><topic>Energy efficiency</topic><topic>Intelligent networks</topic><topic>Network topology</topic><topic>Routing</topic><topic>Wireless networks</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Shaikh, J.A.</creatorcontrib><creatorcontrib>Solano, J.</creatorcontrib><creatorcontrib>Stojmenovic, I.</creatorcontrib><creatorcontrib>Jie Wu</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>Shaikh, J.A.</au><au>Solano, J.</au><au>Stojmenovic, I.</au><au>Jie Wu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>New metrics for dominating set based energy efficient activity scheduling in ad hoc networks</atitle><btitle>28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings</btitle><stitle>LCN</stitle><date>2003</date><risdate>2003</risdate><spage>726</spage><epage>735</epage><pages>726-735</pages><issn>0742-1303</issn><isbn>9780769520377</isbn><isbn>0769520375</isbn><abstract>In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends the same message to all the network. Routing problem deals with finding a route between a source and a destination. In the activity-scheduling problem, each node decides between active or passive state. We present a scheme whose goal is to prolong network life while preserving connectivity. Each node is either active or has an active neighbor node. Routing and broadcasting are restricted to active nodes that create such dominating set. Activity status is periodically updated during a short transition period. The main contribution of this article is to propose new metrics for previously studied source-independent localized dominating sets, based on combinations of node degrees and remaining energy levels, for deciding activity status.</abstract><pub>IEEE</pub><doi>10.1109/LCN.2003.1243206</doi><tpages>10</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0742-1303
ispartof 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings, 2003, p.726-735
issn 0742-1303
language eng
recordid cdi_ieee_primary_1243206
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Ad hoc networks
Broadcasting
Costs
Energy consumption
Energy efficiency
Intelligent networks
Network topology
Routing
Wireless networks
Wireless sensor networks
title New metrics for dominating set based energy efficient activity scheduling in 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-19T03%3A09%3A05IST&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=New%20metrics%20for%20dominating%20set%20based%20energy%20efficient%20activity%20scheduling%20in%20ad%20hoc%20networks&rft.btitle=28th%20Annual%20IEEE%20International%20Conference%20on%20Local%20Computer%20Networks,%202003.%20LCN%20'03.%20Proceedings&rft.au=Shaikh,%20J.A.&rft.date=2003&rft.spage=726&rft.epage=735&rft.pages=726-735&rft.issn=0742-1303&rft.isbn=9780769520377&rft.isbn_list=0769520375&rft_id=info:doi/10.1109/LCN.2003.1243206&rft_dat=%3Cieee_6IE%3E1243206%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=1243206&rfr_iscdi=true