Loading…
Localized Minimum-Energy Broadcasting for Wireless Multihop Networks with Directional Antennas
We propose several localized algorithms to achieve energy-efficient broadcasting in wireless multihop networks using directional antennas. Each node needs to know only geographic position of itself and its neighbors. Our first protocol is called DRBOP and it follows the one-to-one communication mode...
Saved in:
Published in: | IEEE transactions on computers 2009-01, Vol.58 (1), p.120-131 |
---|---|
Main Authors: | , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c375t-40d915de3ececd01af080efaaaa07e15d2ee27ce8a58f601f4438840dc9891d3 |
---|---|
cites | cdi_FETCH-LOGICAL-c375t-40d915de3ececd01af080efaaaa07e15d2ee27ce8a58f601f4438840dc9891d3 |
container_end_page | 131 |
container_issue | 1 |
container_start_page | 120 |
container_title | IEEE transactions on computers |
container_volume | 58 |
creator | Iguchi-Cartigny, J. Ruiz, P.M. Simplot-Ryl, D. Stojmenovic, I. Yago, C.M. |
description | We propose several localized algorithms to achieve energy-efficient broadcasting in wireless multihop networks using directional antennas. Each node needs to know only geographic position of itself and its neighbors. Our first protocol is called DRBOP and it follows the one-to-one communication model to reach to all nodes in the relative neighborhood graph (RNG). Each node that receives a message for the first time from one of its RNG neighbors will rebroadcast it to each of its remaining RNG neighbors separately. The transmission power is adjusted for each transmission to the minimal necessary for reaching the particular neighbor. Next, we describe DLBOP, where RNG is replaced by the localized minimum spanning tree (LMST) graph which is a localized topology resembling the minimum spanning tree. We then observe that, for very dense networks, it is more energy-efficient to reach more than one neighbor at a time. A one-to-many protocol efficient for dense networks is proposed. We then describe an efficient localized protocol which adaptively switches (without any threshold) between one-to-one and one-to-many communication models and is efficient for both sparse and dense networks. Our simulation results show that for different energy models, the adaptive protocol is able to achieve a competitive performance to globalized algorithms while having a fully localized operation. |
doi_str_mv | 10.1109/TC.2008.125 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_903621298</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4585365</ieee_id><sourcerecordid>34439514</sourcerecordid><originalsourceid>FETCH-LOGICAL-c375t-40d915de3ececd01af080efaaaa07e15d2ee27ce8a58f601f4438840dc9891d3</originalsourceid><addsrcrecordid>eNqF0T1PwzAQBmALgUT5mBhZLAYYUMrZjhN7hPIpFVgqsRFZzgUMaVzsRKj8eoyKGBjgFg_3-HS6l5A9BmPGQJ_MJmMOoMaMyzUyYlKWmdayWCcjAKYyLXLYJFsxvgBAwUGPyOPUW9O6D6zprevcfJhnFx2GpyU9C97U1sTedU-08YE-uIAtxkhvh7Z3z35B77B_9-E10nfXP9Pz1Le9851p6WnXY9eZuEM2GtNG3P1-t8ns8mI2uc6m91c3k9NpZkUp-yyHWjNZo0CLtgZmGlCAjUkFJaYOR-SlRWWkagpgTZ4LpdIvq5VmtdgmR6uxi-DfBox9NXfRYtuaDv0QKw2i4Ixr9a9UhVY5Z5InefinFGkHLVme4MEv-OKHkK6Qpski3VyrMqHjFbLBxxiwqRbBzU1YVgyqr-yq2aT6yq5K2SW9v9IOEX9kLpUUhRSfF_OVLA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>856934987</pqid></control><display><type>article</type><title>Localized Minimum-Energy Broadcasting for Wireless Multihop Networks with Directional Antennas</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Iguchi-Cartigny, J. ; Ruiz, P.M. ; Simplot-Ryl, D. ; Stojmenovic, I. ; Yago, C.M.</creator><creatorcontrib>Iguchi-Cartigny, J. ; Ruiz, P.M. ; Simplot-Ryl, D. ; Stojmenovic, I. ; Yago, C.M.</creatorcontrib><description>We propose several localized algorithms to achieve energy-efficient broadcasting in wireless multihop networks using directional antennas. Each node needs to know only geographic position of itself and its neighbors. Our first protocol is called DRBOP and it follows the one-to-one communication model to reach to all nodes in the relative neighborhood graph (RNG). Each node that receives a message for the first time from one of its RNG neighbors will rebroadcast it to each of its remaining RNG neighbors separately. The transmission power is adjusted for each transmission to the minimal necessary for reaching the particular neighbor. Next, we describe DLBOP, where RNG is replaced by the localized minimum spanning tree (LMST) graph which is a localized topology resembling the minimum spanning tree. We then observe that, for very dense networks, it is more energy-efficient to reach more than one neighbor at a time. A one-to-many protocol efficient for dense networks is proposed. We then describe an efficient localized protocol which adaptively switches (without any threshold) between one-to-one and one-to-many communication models and is efficient for both sparse and dense networks. Our simulation results show that for different energy models, the adaptive protocol is able to achieve a competitive performance to globalized algorithms while having a fully localized operation.</description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/TC.2008.125</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Ad hoc networks ; Algorithm/protocol design and analysis ; Algorithms ; Broadcasting ; Computer simulation ; Directional antennas ; Directive antennas ; Distance measurement ; Energy consumption ; Graphs ; Mathematical models ; Network topology ; Networks ; Protocols ; Routing protocols ; Studies ; Switching theory ; Wireless</subject><ispartof>IEEE transactions on computers, 2009-01, Vol.58 (1), p.120-131</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2009</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c375t-40d915de3ececd01af080efaaaa07e15d2ee27ce8a58f601f4438840dc9891d3</citedby><cites>FETCH-LOGICAL-c375t-40d915de3ececd01af080efaaaa07e15d2ee27ce8a58f601f4438840dc9891d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4585365$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27922,27923,54794</link.rule.ids></links><search><creatorcontrib>Iguchi-Cartigny, J.</creatorcontrib><creatorcontrib>Ruiz, P.M.</creatorcontrib><creatorcontrib>Simplot-Ryl, D.</creatorcontrib><creatorcontrib>Stojmenovic, I.</creatorcontrib><creatorcontrib>Yago, C.M.</creatorcontrib><title>Localized Minimum-Energy Broadcasting for Wireless Multihop Networks with Directional Antennas</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>We propose several localized algorithms to achieve energy-efficient broadcasting in wireless multihop networks using directional antennas. Each node needs to know only geographic position of itself and its neighbors. Our first protocol is called DRBOP and it follows the one-to-one communication model to reach to all nodes in the relative neighborhood graph (RNG). Each node that receives a message for the first time from one of its RNG neighbors will rebroadcast it to each of its remaining RNG neighbors separately. The transmission power is adjusted for each transmission to the minimal necessary for reaching the particular neighbor. Next, we describe DLBOP, where RNG is replaced by the localized minimum spanning tree (LMST) graph which is a localized topology resembling the minimum spanning tree. We then observe that, for very dense networks, it is more energy-efficient to reach more than one neighbor at a time. A one-to-many protocol efficient for dense networks is proposed. We then describe an efficient localized protocol which adaptively switches (without any threshold) between one-to-one and one-to-many communication models and is efficient for both sparse and dense networks. Our simulation results show that for different energy models, the adaptive protocol is able to achieve a competitive performance to globalized algorithms while having a fully localized operation.</description><subject>Ad hoc networks</subject><subject>Algorithm/protocol design and analysis</subject><subject>Algorithms</subject><subject>Broadcasting</subject><subject>Computer simulation</subject><subject>Directional antennas</subject><subject>Directive antennas</subject><subject>Distance measurement</subject><subject>Energy consumption</subject><subject>Graphs</subject><subject>Mathematical models</subject><subject>Network topology</subject><subject>Networks</subject><subject>Protocols</subject><subject>Routing protocols</subject><subject>Studies</subject><subject>Switching theory</subject><subject>Wireless</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><recordid>eNqF0T1PwzAQBmALgUT5mBhZLAYYUMrZjhN7hPIpFVgqsRFZzgUMaVzsRKj8eoyKGBjgFg_3-HS6l5A9BmPGQJ_MJmMOoMaMyzUyYlKWmdayWCcjAKYyLXLYJFsxvgBAwUGPyOPUW9O6D6zprevcfJhnFx2GpyU9C97U1sTedU-08YE-uIAtxkhvh7Z3z35B77B_9-E10nfXP9Pz1Le9851p6WnXY9eZuEM2GtNG3P1-t8ns8mI2uc6m91c3k9NpZkUp-yyHWjNZo0CLtgZmGlCAjUkFJaYOR-SlRWWkagpgTZ4LpdIvq5VmtdgmR6uxi-DfBox9NXfRYtuaDv0QKw2i4Ixr9a9UhVY5Z5InefinFGkHLVme4MEv-OKHkK6Qpski3VyrMqHjFbLBxxiwqRbBzU1YVgyqr-yq2aT6yq5K2SW9v9IOEX9kLpUUhRSfF_OVLA</recordid><startdate>200901</startdate><enddate>200901</enddate><creator>Iguchi-Cartigny, J.</creator><creator>Ruiz, P.M.</creator><creator>Simplot-Ryl, D.</creator><creator>Stojmenovic, I.</creator><creator>Yago, C.M.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>200901</creationdate><title>Localized Minimum-Energy Broadcasting for Wireless Multihop Networks with Directional Antennas</title><author>Iguchi-Cartigny, J. ; Ruiz, P.M. ; Simplot-Ryl, D. ; Stojmenovic, I. ; Yago, C.M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c375t-40d915de3ececd01af080efaaaa07e15d2ee27ce8a58f601f4438840dc9891d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Ad hoc networks</topic><topic>Algorithm/protocol design and analysis</topic><topic>Algorithms</topic><topic>Broadcasting</topic><topic>Computer simulation</topic><topic>Directional antennas</topic><topic>Directive antennas</topic><topic>Distance measurement</topic><topic>Energy consumption</topic><topic>Graphs</topic><topic>Mathematical models</topic><topic>Network topology</topic><topic>Networks</topic><topic>Protocols</topic><topic>Routing protocols</topic><topic>Studies</topic><topic>Switching theory</topic><topic>Wireless</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Iguchi-Cartigny, J.</creatorcontrib><creatorcontrib>Ruiz, P.M.</creatorcontrib><creatorcontrib>Simplot-Ryl, D.</creatorcontrib><creatorcontrib>Stojmenovic, I.</creatorcontrib><creatorcontrib>Yago, C.M.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Xplore</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</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>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Iguchi-Cartigny, J.</au><au>Ruiz, P.M.</au><au>Simplot-Ryl, D.</au><au>Stojmenovic, I.</au><au>Yago, C.M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Localized Minimum-Energy Broadcasting for Wireless Multihop Networks with Directional Antennas</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>2009-01</date><risdate>2009</risdate><volume>58</volume><issue>1</issue><spage>120</spage><epage>131</epage><pages>120-131</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>We propose several localized algorithms to achieve energy-efficient broadcasting in wireless multihop networks using directional antennas. Each node needs to know only geographic position of itself and its neighbors. Our first protocol is called DRBOP and it follows the one-to-one communication model to reach to all nodes in the relative neighborhood graph (RNG). Each node that receives a message for the first time from one of its RNG neighbors will rebroadcast it to each of its remaining RNG neighbors separately. The transmission power is adjusted for each transmission to the minimal necessary for reaching the particular neighbor. Next, we describe DLBOP, where RNG is replaced by the localized minimum spanning tree (LMST) graph which is a localized topology resembling the minimum spanning tree. We then observe that, for very dense networks, it is more energy-efficient to reach more than one neighbor at a time. A one-to-many protocol efficient for dense networks is proposed. We then describe an efficient localized protocol which adaptively switches (without any threshold) between one-to-one and one-to-many communication models and is efficient for both sparse and dense networks. Our simulation results show that for different energy models, the adaptive protocol is able to achieve a competitive performance to globalized algorithms while having a fully localized operation.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TC.2008.125</doi><tpages>12</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0018-9340 |
ispartof | IEEE transactions on computers, 2009-01, Vol.58 (1), p.120-131 |
issn | 0018-9340 1557-9956 |
language | eng |
recordid | cdi_proquest_miscellaneous_903621298 |
source | IEEE Electronic Library (IEL) Journals |
subjects | Ad hoc networks Algorithm/protocol design and analysis Algorithms Broadcasting Computer simulation Directional antennas Directive antennas Distance measurement Energy consumption Graphs Mathematical models Network topology Networks Protocols Routing protocols Studies Switching theory Wireless |
title | Localized Minimum-Energy Broadcasting for Wireless Multihop Networks with Directional Antennas |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T10%3A20%3A59IST&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=Localized%20Minimum-Energy%20Broadcasting%20for%20Wireless%20Multihop%20Networks%20with%20Directional%20Antennas&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Iguchi-Cartigny,%20J.&rft.date=2009-01&rft.volume=58&rft.issue=1&rft.spage=120&rft.epage=131&rft.pages=120-131&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/TC.2008.125&rft_dat=%3Cproquest_cross%3E34439514%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c375t-40d915de3ececd01af080efaaaa07e15d2ee27ce8a58f601f4438840dc9891d3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=856934987&rft_id=info:pmid/&rft_ieee_id=4585365&rfr_iscdi=true |