A Preemptive Distributed Address Assignment Mechanism for Wireless Sensor Networks

Dynamic address assignment is a desirable feature for deploying wireless sensor network. Typically, a distributed address assignment mechanism is accomplished by ZigBee alliance, whereas, sensors join a network is unpredictable, it may engender uneven node density, so it is possible that one node ex...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Miaoqi Fang, Jian Wan, Xianghua Xu
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Computer networks Computer science Distributed computing Grid computing Lighting control Protocols Routing Wireless communication Wireless sensor networks ZigBee
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	5
container_issue
container_start_page	1
container_title
container_volume
creator	Miaoqi Fang Jian Wan Xianghua Xu
description	Dynamic address assignment is a desirable feature for deploying wireless sensor network. Typically, a distributed address assignment mechanism is accomplished by ZigBee alliance, whereas, sensors join a network is unpredictable, it may engender uneven node density, so it is possible that one node exhausts its list of addresses while another node has addresses go unused. Therefore, a preemptive approach is needed for ZigBee addressing mechanism. This paper presents a preemptive distributed address assignment to provide a preemptive scheme for ZigBee addressing mechanism. In addition, we give an autorouting algorithm. Simulation results show that nodes can acquire an address even in high node density area, and the scheme increases the total number of nodes in a sensor network.
doi_str_mv	10.1109/WiCom.2008.827
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4678735</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4678735</ieee_id><sourcerecordid>4678735</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-886ce376953ff5eab62b4c5ce0b63cda46e36d25a499f4f8a3d819a19632d0f73</originalsourceid><addsrcrecordid>eNo1jMtOwzAURI2gEm3Jlg0b_0CCX_FjGRUKSOUhqFR2lRNfg6FJKjuA-HtaAbMZHenMIHRKSUEpMeerMOvbghGiC83UAZpQwYRglOjnQ5QZpf9ZqSM0ZlTS3EghR2iy3xhCpOLHKEvpjewiSq61GqPHCj9EgHY7hE_AFyENMdQfAzhcORchJVylFF66FroB30LzaruQWuz7iFchwmZvPEGXdnwHw1cf39MJGnm7SZD99RQt55fL2XW-uL-6mVWLPBgy5FrLBriSpuTel2BryWrRlA2QWvLGWSGBS8dKK4zxwmvLnabGUiM5c8QrPkVnv7cBANbbGFobv9dCKq14yX8Ay5VVTQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Preemptive Distributed Address Assignment Mechanism for Wireless Sensor Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Miaoqi Fang ; Jian Wan ; Xianghua Xu</creator><creatorcontrib>Miaoqi Fang ; Jian Wan ; Xianghua Xu</creatorcontrib><description>Dynamic address assignment is a desirable feature for deploying wireless sensor network. Typically, a distributed address assignment mechanism is accomplished by ZigBee alliance, whereas, sensors join a network is unpredictable, it may engender uneven node density, so it is possible that one node exhausts its list of addresses while another node has addresses go unused. Therefore, a preemptive approach is needed for ZigBee addressing mechanism. This paper presents a preemptive distributed address assignment to provide a preemptive scheme for ZigBee addressing mechanism. In addition, we give an autorouting algorithm. Simulation results show that nodes can acquire an address even in high node density area, and the scheme increases the total number of nodes in a sensor network.</description><identifier>ISSN: 2161-9646</identifier><identifier>ISBN: 9781424421077</identifier><identifier>ISBN: 1424421071</identifier><identifier>EISBN: 142442108X</identifier><identifier>EISBN: 9781424421084</identifier><identifier>DOI: 10.1109/WiCom.2008.827</identifier><identifier>LCCN: 2008900673</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer networks ; Computer science ; Distributed computing ; Grid computing ; Lighting control ; Protocols ; Routing ; Wireless communication ; Wireless sensor networks ; ZigBee</subject><ispartof>2008 4th International Conference on Wireless Communications, Networking and Mobile Computing, 2008, p.1-5</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/4678735$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4678735$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Miaoqi Fang</creatorcontrib><creatorcontrib>Jian Wan</creatorcontrib><creatorcontrib>Xianghua Xu</creatorcontrib><title>A Preemptive Distributed Address Assignment Mechanism for Wireless Sensor Networks</title><title>2008 4th International Conference on Wireless Communications, Networking and Mobile Computing</title><addtitle>WiCom</addtitle><description>Dynamic address assignment is a desirable feature for deploying wireless sensor network. Typically, a distributed address assignment mechanism is accomplished by ZigBee alliance, whereas, sensors join a network is unpredictable, it may engender uneven node density, so it is possible that one node exhausts its list of addresses while another node has addresses go unused. Therefore, a preemptive approach is needed for ZigBee addressing mechanism. This paper presents a preemptive distributed address assignment to provide a preemptive scheme for ZigBee addressing mechanism. In addition, we give an autorouting algorithm. Simulation results show that nodes can acquire an address even in high node density area, and the scheme increases the total number of nodes in a sensor network.</description><subject>Computer networks</subject><subject>Computer science</subject><subject>Distributed computing</subject><subject>Grid computing</subject><subject>Lighting control</subject><subject>Protocols</subject><subject>Routing</subject><subject>Wireless communication</subject><subject>Wireless sensor networks</subject><subject>ZigBee</subject><issn>2161-9646</issn><isbn>9781424421077</isbn><isbn>1424421071</isbn><isbn>142442108X</isbn><isbn>9781424421084</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1jMtOwzAURI2gEm3Jlg0b_0CCX_FjGRUKSOUhqFR2lRNfg6FJKjuA-HtaAbMZHenMIHRKSUEpMeerMOvbghGiC83UAZpQwYRglOjnQ5QZpf9ZqSM0ZlTS3EghR2iy3xhCpOLHKEvpjewiSq61GqPHCj9EgHY7hE_AFyENMdQfAzhcORchJVylFF66FroB30LzaruQWuz7iFchwmZvPEGXdnwHw1cf39MJGnm7SZD99RQt55fL2XW-uL-6mVWLPBgy5FrLBriSpuTel2BryWrRlA2QWvLGWSGBS8dKK4zxwmvLnabGUiM5c8QrPkVnv7cBANbbGFobv9dCKq14yX8Ay5VVTQ</recordid><startdate>200810</startdate><enddate>200810</enddate><creator>Miaoqi Fang</creator><creator>Jian Wan</creator><creator>Xianghua Xu</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200810</creationdate><title>A Preemptive Distributed Address Assignment Mechanism for Wireless Sensor Networks</title><author>Miaoqi Fang ; Jian Wan ; Xianghua Xu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-886ce376953ff5eab62b4c5ce0b63cda46e36d25a499f4f8a3d819a19632d0f73</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Computer networks</topic><topic>Computer science</topic><topic>Distributed computing</topic><topic>Grid computing</topic><topic>Lighting control</topic><topic>Protocols</topic><topic>Routing</topic><topic>Wireless communication</topic><topic>Wireless sensor networks</topic><topic>ZigBee</topic><toplevel>online_resources</toplevel><creatorcontrib>Miaoqi Fang</creatorcontrib><creatorcontrib>Jian Wan</creatorcontrib><creatorcontrib>Xianghua Xu</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>Miaoqi Fang</au><au>Jian Wan</au><au>Xianghua Xu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Preemptive Distributed Address Assignment Mechanism for Wireless Sensor Networks</atitle><btitle>2008 4th International Conference on Wireless Communications, Networking and Mobile Computing</btitle><stitle>WiCom</stitle><date>2008-10</date><risdate>2008</risdate><spage>1</spage><epage>5</epage><pages>1-5</pages><issn>2161-9646</issn><isbn>9781424421077</isbn><isbn>1424421071</isbn><eisbn>142442108X</eisbn><eisbn>9781424421084</eisbn><abstract>Dynamic address assignment is a desirable feature for deploying wireless sensor network. Typically, a distributed address assignment mechanism is accomplished by ZigBee alliance, whereas, sensors join a network is unpredictable, it may engender uneven node density, so it is possible that one node exhausts its list of addresses while another node has addresses go unused. Therefore, a preemptive approach is needed for ZigBee addressing mechanism. This paper presents a preemptive distributed address assignment to provide a preemptive scheme for ZigBee addressing mechanism. In addition, we give an autorouting algorithm. Simulation results show that nodes can acquire an address even in high node density area, and the scheme increases the total number of nodes in a sensor network.</abstract><pub>IEEE</pub><doi>10.1109/WiCom.2008.827</doi><tpages>5</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 2161-9646
ispartof	2008 4th International Conference on Wireless Communications, Networking and Mobile Computing, 2008, p.1-5
issn	2161-9646
language	eng
recordid	cdi_ieee_primary_4678735
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Computer networks Computer science Distributed computing Grid computing Lighting control Protocols Routing Wireless communication Wireless sensor networks ZigBee
title	A Preemptive Distributed Address Assignment Mechanism for Wireless Sensor Networks
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T17%3A26%3A52IST&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=A%20Preemptive%20Distributed%20Address%20Assignment%20Mechanism%20for%20Wireless%20Sensor%20Networks&rft.btitle=2008%204th%20International%20Conference%20on%20Wireless%20Communications,%20Networking%20and%20Mobile%20Computing&rft.au=Miaoqi%20Fang&rft.date=2008-10&rft.spage=1&rft.epage=5&rft.pages=1-5&rft.issn=2161-9646&rft.isbn=9781424421077&rft.isbn_list=1424421071&rft_id=info:doi/10.1109/WiCom.2008.827&rft_dat=%3Cieee_6IE%3E4678735%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=142442108X&rft.eisbn_list=9781424421084&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4678735&rfr_iscdi=true