Loading…

A protocol for construction of broadcast transmission schedules in mobile ad hoc networks

In a mobile ad hoc network using broadcast transmission scheduling, a terminal that is ready to join the network must first determine the current state of the transmission-scheduling protocol. In order to transmit and receive packets without interference, the new terminal needs to notify other termi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications 2007-01, Vol.6 (1), p.74-78
Main Authors: Wolf, B.J., Hammond, J.L., Noneaker, D.L., Russell, H.B.
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-c348t-6be1015e1f4a2178a5348caf3368c80f11070c5e3c3a96c7645433720839d7a73
cites cdi_FETCH-LOGICAL-c348t-6be1015e1f4a2178a5348caf3368c80f11070c5e3c3a96c7645433720839d7a73
container_end_page 78
container_issue 1
container_start_page 74
container_title IEEE transactions on wireless communications
container_volume 6
creator Wolf, B.J.
Hammond, J.L.
Noneaker, D.L.
Russell, H.B.
description In a mobile ad hoc network using broadcast transmission scheduling, a terminal that is ready to join the network must first determine the current state of the transmission-scheduling protocol. In order to transmit and receive packets without interference, the new terminal needs to notify other terminals of its presence and exchange information with them so that it can form a collision-free broadcast transmission schedule. A new distributed protocol is described that allows a new terminal to acquire sufficient information about the terminals in its local neighborhood so that it can efficiently integrate itself into the existing transmission schedule. The protocol is also designed to enable a group of terminals to form a new transmission schedule if one does not already exist. We show that a large group of terminals can quickly form a new and efficient collision-free transmission schedule
doi_str_mv 10.1109/TWC.2007.05210
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_4114256</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4114256</ieee_id><sourcerecordid>880673934</sourcerecordid><originalsourceid>FETCH-LOGICAL-c348t-6be1015e1f4a2178a5348caf3368c80f11070c5e3c3a96c7645433720839d7a73</originalsourceid><addsrcrecordid>eNpdkM1LxDAQxYsouK5evXgJgnhqTZrPHmXxCxa8rIinkE1Ttmu3WTMp4n9v6i4KnmaY95vHzMuyc4ILQnB1s3idFSXGssC8JPggmxDOVV6WTB2OPRU5KaU4zk4A1hgTKTifZG-3aBt89NZ3qPEBWd9DDIONre-Rb9AyeFNbAxHFYHrYtACjAnbl6qFzgNoebfyy7RwyNVp5i3oXP314h9PsqDEduLN9nWYv93eL2WM-f354mt3Oc0uZirlYOoIJd6RhpiRSGZ7G1jSUCmUVbtJrElvuqKWmElYKxhmlssSKVrU0kk6z651v-uNjcBB1OtK6rjO98wNopbCQtKIskZf_yLUfQp-O0yrZKkoxT1Cxg2zwAME1ehvajQlfmmA95qxTznrMWf_knBau9q4GrOmaFJNt4W9LMVZyXCXuYse1zrlfmRGSZEG_ARTmhPQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>864583305</pqid></control><display><type>article</type><title>A protocol for construction of broadcast transmission schedules in mobile ad hoc networks</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Wolf, B.J. ; Hammond, J.L. ; Noneaker, D.L. ; Russell, H.B.</creator><creatorcontrib>Wolf, B.J. ; Hammond, J.L. ; Noneaker, D.L. ; Russell, H.B.</creatorcontrib><description>In a mobile ad hoc network using broadcast transmission scheduling, a terminal that is ready to join the network must first determine the current state of the transmission-scheduling protocol. In order to transmit and receive packets without interference, the new terminal needs to notify other terminals of its presence and exchange information with them so that it can form a collision-free broadcast transmission schedule. A new distributed protocol is described that allows a new terminal to acquire sufficient information about the terminals in its local neighborhood so that it can efficiently integrate itself into the existing transmission schedule. The protocol is also designed to enable a group of terminals to form a new transmission schedule if one does not already exist. We show that a large group of terminals can quickly form a new and efficient collision-free transmission schedule</description><identifier>ISSN: 1536-1276</identifier><identifier>EISSN: 1558-2248</identifier><identifier>DOI: 10.1109/TWC.2007.05210</identifier><identifier>CODEN: ITWCAX</identifier><language>eng</language><publisher>Piscataway, NJ: IEEE</publisher><subject>Access methods and protocols, osi model ; Ad hoc networks ; Adaptive scheduling ; Applied sciences ; Broadcasting ; Construction ; Distributed algorithms ; Equipments and installations ; Exact sciences and technology ; Interference ; Life members ; Mobile ad hoc networks ; Mobile radiocommunication systems ; Network topology ; Networks ; Protocols ; Radiocommunications ; Research initiatives ; Schedules ; Scheduling ; Switching and signalling ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teleprocessing networks. Isdn ; Terminals ; Wireless communication</subject><ispartof>IEEE transactions on wireless communications, 2007-01, Vol.6 (1), p.74-78</ispartof><rights>2007 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c348t-6be1015e1f4a2178a5348caf3368c80f11070c5e3c3a96c7645433720839d7a73</citedby><cites>FETCH-LOGICAL-c348t-6be1015e1f4a2178a5348caf3368c80f11070c5e3c3a96c7645433720839d7a73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4114256$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,4022,27922,27923,27924,54795</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=18442509$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Wolf, B.J.</creatorcontrib><creatorcontrib>Hammond, J.L.</creatorcontrib><creatorcontrib>Noneaker, D.L.</creatorcontrib><creatorcontrib>Russell, H.B.</creatorcontrib><title>A protocol for construction of broadcast transmission schedules in mobile ad hoc networks</title><title>IEEE transactions on wireless communications</title><addtitle>TWC</addtitle><description>In a mobile ad hoc network using broadcast transmission scheduling, a terminal that is ready to join the network must first determine the current state of the transmission-scheduling protocol. In order to transmit and receive packets without interference, the new terminal needs to notify other terminals of its presence and exchange information with them so that it can form a collision-free broadcast transmission schedule. A new distributed protocol is described that allows a new terminal to acquire sufficient information about the terminals in its local neighborhood so that it can efficiently integrate itself into the existing transmission schedule. The protocol is also designed to enable a group of terminals to form a new transmission schedule if one does not already exist. We show that a large group of terminals can quickly form a new and efficient collision-free transmission schedule</description><subject>Access methods and protocols, osi model</subject><subject>Ad hoc networks</subject><subject>Adaptive scheduling</subject><subject>Applied sciences</subject><subject>Broadcasting</subject><subject>Construction</subject><subject>Distributed algorithms</subject><subject>Equipments and installations</subject><subject>Exact sciences and technology</subject><subject>Interference</subject><subject>Life members</subject><subject>Mobile ad hoc networks</subject><subject>Mobile radiocommunication systems</subject><subject>Network topology</subject><subject>Networks</subject><subject>Protocols</subject><subject>Radiocommunications</subject><subject>Research initiatives</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Switching and signalling</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teleprocessing networks. Isdn</subject><subject>Terminals</subject><subject>Wireless communication</subject><issn>1536-1276</issn><issn>1558-2248</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNpdkM1LxDAQxYsouK5evXgJgnhqTZrPHmXxCxa8rIinkE1Ttmu3WTMp4n9v6i4KnmaY95vHzMuyc4ILQnB1s3idFSXGssC8JPggmxDOVV6WTB2OPRU5KaU4zk4A1hgTKTifZG-3aBt89NZ3qPEBWd9DDIONre-Rb9AyeFNbAxHFYHrYtACjAnbl6qFzgNoebfyy7RwyNVp5i3oXP314h9PsqDEduLN9nWYv93eL2WM-f354mt3Oc0uZirlYOoIJd6RhpiRSGZ7G1jSUCmUVbtJrElvuqKWmElYKxhmlssSKVrU0kk6z651v-uNjcBB1OtK6rjO98wNopbCQtKIskZf_yLUfQp-O0yrZKkoxT1Cxg2zwAME1ehvajQlfmmA95qxTznrMWf_knBau9q4GrOmaFJNt4W9LMVZyXCXuYse1zrlfmRGSZEG_ARTmhPQ</recordid><startdate>200701</startdate><enddate>200701</enddate><creator>Wolf, B.J.</creator><creator>Hammond, J.L.</creator><creator>Noneaker, D.L.</creator><creator>Russell, H.B.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</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>200701</creationdate><title>A protocol for construction of broadcast transmission schedules in mobile ad hoc networks</title><author>Wolf, B.J. ; Hammond, J.L. ; Noneaker, D.L. ; Russell, H.B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c348t-6be1015e1f4a2178a5348caf3368c80f11070c5e3c3a96c7645433720839d7a73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Access methods and protocols, osi model</topic><topic>Ad hoc networks</topic><topic>Adaptive scheduling</topic><topic>Applied sciences</topic><topic>Broadcasting</topic><topic>Construction</topic><topic>Distributed algorithms</topic><topic>Equipments and installations</topic><topic>Exact sciences and technology</topic><topic>Interference</topic><topic>Life members</topic><topic>Mobile ad hoc networks</topic><topic>Mobile radiocommunication systems</topic><topic>Network topology</topic><topic>Networks</topic><topic>Protocols</topic><topic>Radiocommunications</topic><topic>Research initiatives</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Switching and signalling</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teleprocessing networks. Isdn</topic><topic>Terminals</topic><topic>Wireless communication</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wolf, B.J.</creatorcontrib><creatorcontrib>Hammond, J.L.</creatorcontrib><creatorcontrib>Noneaker, D.L.</creatorcontrib><creatorcontrib>Russell, H.B.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; 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 &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on wireless communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wolf, B.J.</au><au>Hammond, J.L.</au><au>Noneaker, D.L.</au><au>Russell, H.B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A protocol for construction of broadcast transmission schedules in mobile ad hoc networks</atitle><jtitle>IEEE transactions on wireless communications</jtitle><stitle>TWC</stitle><date>2007-01</date><risdate>2007</risdate><volume>6</volume><issue>1</issue><spage>74</spage><epage>78</epage><pages>74-78</pages><issn>1536-1276</issn><eissn>1558-2248</eissn><coden>ITWCAX</coden><abstract>In a mobile ad hoc network using broadcast transmission scheduling, a terminal that is ready to join the network must first determine the current state of the transmission-scheduling protocol. In order to transmit and receive packets without interference, the new terminal needs to notify other terminals of its presence and exchange information with them so that it can form a collision-free broadcast transmission schedule. A new distributed protocol is described that allows a new terminal to acquire sufficient information about the terminals in its local neighborhood so that it can efficiently integrate itself into the existing transmission schedule. The protocol is also designed to enable a group of terminals to form a new transmission schedule if one does not already exist. We show that a large group of terminals can quickly form a new and efficient collision-free transmission schedule</abstract><cop>Piscataway, NJ</cop><pub>IEEE</pub><doi>10.1109/TWC.2007.05210</doi><tpages>5</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1536-1276
ispartof IEEE transactions on wireless communications, 2007-01, Vol.6 (1), p.74-78
issn 1536-1276
1558-2248
language eng
recordid cdi_ieee_primary_4114256
source IEEE Electronic Library (IEL) Journals
subjects Access methods and protocols, osi model
Ad hoc networks
Adaptive scheduling
Applied sciences
Broadcasting
Construction
Distributed algorithms
Equipments and installations
Exact sciences and technology
Interference
Life members
Mobile ad hoc networks
Mobile radiocommunication systems
Network topology
Networks
Protocols
Radiocommunications
Research initiatives
Schedules
Scheduling
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Terminals
Wireless communication
title A protocol for construction of broadcast transmission schedules in mobile ad hoc networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T00%3A50%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20protocol%20for%20construction%20of%20broadcast%20transmission%20schedules%20in%20mobile%20ad%20hoc%20networks&rft.jtitle=IEEE%20transactions%20on%20wireless%20communications&rft.au=Wolf,%20B.J.&rft.date=2007-01&rft.volume=6&rft.issue=1&rft.spage=74&rft.epage=78&rft.pages=74-78&rft.issn=1536-1276&rft.eissn=1558-2248&rft.coden=ITWCAX&rft_id=info:doi/10.1109/TWC.2007.05210&rft_dat=%3Cproquest_ieee_%3E880673934%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c348t-6be1015e1f4a2178a5348caf3368c80f11070c5e3c3a96c7645433720839d7a73%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=864583305&rft_id=info:pmid/&rft_ieee_id=4114256&rfr_iscdi=true