CSN: a network protocol for serving dynamic queries in large-scale wireless sensor networks

A fundamental problem that confronts future applications of sensor networks is how to locate efficiently the sensor node that stores a particular data item. Distributed hash table (DHT) based Internet peer-to-peer (P2P) protocols provide near-optimum data lookup times for queries made on networks of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ali, M., Uzmi, Z.A.
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 174
container_issue
container_start_page 165
container_title
container_volume
creator Ali, M.
Uzmi, Z.A.
description A fundamental problem that confronts future applications of sensor networks is how to locate efficiently the sensor node that stores a particular data item. Distributed hash table (DHT) based Internet peer-to-peer (P2P) protocols provide near-optimum data lookup times for queries made on networks of distributed nodes. A generic mapping of these protocols to sensor networks is, however, perceived as difficult (Ratnasamy, S. et al., Mobile Networks and Applications, - MONET 2003). We present a novel DHT based network protocol for sensor networks - chord for sensor networks (CSN) - for which bounded times for data lookup, in the order of O(logN) messages, can be achieved in an energy efficient manner. CSN makes the system lifetime of the sensor network proportional to its effective use. Furthermore, CSN scales well to large-scale sensor networks when the information about other nodes logarithmically increases with an increase in the number of sensor nodes.
doi_str_mv 10.1109/DNSR.2004.1344725
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1344725</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1344725</ieee_id><sourcerecordid>1344725</sourcerecordid><originalsourceid>FETCH-LOGICAL-i173t-4eb92d23c75805f4fad0c72d85b466e80b01560a9ac6a9059e8b81d83ff80ea43</originalsourceid><addsrcrecordid>eNotj81Kw0AUhQdEUGsfQNzMCyTeyfy7k6hVKBWsrlyUyeSmjKZJnYmWvr0BczZnc74PDiFXDHLGwN7cr9aveQEgcsaF0IU8IReglZUFWAVnZJ7SJ4zhlhumz8lHuV7dUkc7HA59_KL72A-971va9JEmjL-h29L62Lld8PT7B2PARENHWxe3mCXvWqSHELHFlMZ9l0ZscqVLctq4NuF86hl5f3x4K5-y5cviubxbZoFpPmQCK1vUBfdaGpCNaFwNXhe1kZVQCg1UwKQCZ51XzoK0aCrDasObxgA6wWfk-t8bEHGzj2Hn4nEz_ed_ekZR9Q</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>CSN: a network protocol for serving dynamic queries in large-scale wireless sensor networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Ali, M. ; Uzmi, Z.A.</creator><creatorcontrib>Ali, M. ; Uzmi, Z.A.</creatorcontrib><description>A fundamental problem that confronts future applications of sensor networks is how to locate efficiently the sensor node that stores a particular data item. Distributed hash table (DHT) based Internet peer-to-peer (P2P) protocols provide near-optimum data lookup times for queries made on networks of distributed nodes. A generic mapping of these protocols to sensor networks is, however, perceived as difficult (Ratnasamy, S. et al., Mobile Networks and Applications, - MONET 2003). We present a novel DHT based network protocol for sensor networks - chord for sensor networks (CSN) - for which bounded times for data lookup, in the order of O(logN) messages, can be achieved in an energy efficient manner. CSN makes the system lifetime of the sensor network proportional to its effective use. Furthermore, CSN scales well to large-scale sensor networks when the information about other nodes logarithmically increases with an increase in the number of sensor nodes.</description><identifier>ISBN: 0769520960</identifier><identifier>ISBN: 9780769520964</identifier><identifier>DOI: 10.1109/DNSR.2004.1344725</identifier><language>eng</language><publisher>IEEE</publisher><subject>Biosensors ; Intelligent networks ; IP networks ; Large-scale systems ; Peer to peer computing ; Routing protocols ; Sensor phenomena and characterization ; Tin ; Wireless application protocol ; Wireless sensor networks</subject><ispartof>Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004, 2004, p.165-174</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/1344725$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1344725$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ali, M.</creatorcontrib><creatorcontrib>Uzmi, Z.A.</creatorcontrib><title>CSN: a network protocol for serving dynamic queries in large-scale wireless sensor networks</title><title>Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004</title><addtitle>CNSR</addtitle><description>A fundamental problem that confronts future applications of sensor networks is how to locate efficiently the sensor node that stores a particular data item. Distributed hash table (DHT) based Internet peer-to-peer (P2P) protocols provide near-optimum data lookup times for queries made on networks of distributed nodes. A generic mapping of these protocols to sensor networks is, however, perceived as difficult (Ratnasamy, S. et al., Mobile Networks and Applications, - MONET 2003). We present a novel DHT based network protocol for sensor networks - chord for sensor networks (CSN) - for which bounded times for data lookup, in the order of O(logN) messages, can be achieved in an energy efficient manner. CSN makes the system lifetime of the sensor network proportional to its effective use. Furthermore, CSN scales well to large-scale sensor networks when the information about other nodes logarithmically increases with an increase in the number of sensor nodes.</description><subject>Biosensors</subject><subject>Intelligent networks</subject><subject>IP networks</subject><subject>Large-scale systems</subject><subject>Peer to peer computing</subject><subject>Routing protocols</subject><subject>Sensor phenomena and characterization</subject><subject>Tin</subject><subject>Wireless application protocol</subject><subject>Wireless sensor networks</subject><isbn>0769520960</isbn><isbn>9780769520964</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj81Kw0AUhQdEUGsfQNzMCyTeyfy7k6hVKBWsrlyUyeSmjKZJnYmWvr0BczZnc74PDiFXDHLGwN7cr9aveQEgcsaF0IU8IReglZUFWAVnZJ7SJ4zhlhumz8lHuV7dUkc7HA59_KL72A-971va9JEmjL-h29L62Lld8PT7B2PARENHWxe3mCXvWqSHELHFlMZ9l0ZscqVLctq4NuF86hl5f3x4K5-y5cviubxbZoFpPmQCK1vUBfdaGpCNaFwNXhe1kZVQCg1UwKQCZ51XzoK0aCrDasObxgA6wWfk-t8bEHGzj2Hn4nEz_ed_ekZR9Q</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Ali, M.</creator><creator>Uzmi, Z.A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2004</creationdate><title>CSN: a network protocol for serving dynamic queries in large-scale wireless sensor networks</title><author>Ali, M. ; Uzmi, Z.A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i173t-4eb92d23c75805f4fad0c72d85b466e80b01560a9ac6a9059e8b81d83ff80ea43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Biosensors</topic><topic>Intelligent networks</topic><topic>IP networks</topic><topic>Large-scale systems</topic><topic>Peer to peer computing</topic><topic>Routing protocols</topic><topic>Sensor phenomena and characterization</topic><topic>Tin</topic><topic>Wireless application protocol</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Ali, M.</creatorcontrib><creatorcontrib>Uzmi, Z.A.</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>Ali, M.</au><au>Uzmi, Z.A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>CSN: a network protocol for serving dynamic queries in large-scale wireless sensor networks</atitle><btitle>Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004</btitle><stitle>CNSR</stitle><date>2004</date><risdate>2004</risdate><spage>165</spage><epage>174</epage><pages>165-174</pages><isbn>0769520960</isbn><isbn>9780769520964</isbn><abstract>A fundamental problem that confronts future applications of sensor networks is how to locate efficiently the sensor node that stores a particular data item. Distributed hash table (DHT) based Internet peer-to-peer (P2P) protocols provide near-optimum data lookup times for queries made on networks of distributed nodes. A generic mapping of these protocols to sensor networks is, however, perceived as difficult (Ratnasamy, S. et al., Mobile Networks and Applications, - MONET 2003). We present a novel DHT based network protocol for sensor networks - chord for sensor networks (CSN) - for which bounded times for data lookup, in the order of O(logN) messages, can be achieved in an energy efficient manner. CSN makes the system lifetime of the sensor network proportional to its effective use. Furthermore, CSN scales well to large-scale sensor networks when the information about other nodes logarithmically increases with an increase in the number of sensor nodes.</abstract><pub>IEEE</pub><doi>10.1109/DNSR.2004.1344725</doi><tpages>10</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0769520960
ispartof Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004, 2004, p.165-174
issn
language eng
recordid cdi_ieee_primary_1344725
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Biosensors
Intelligent networks
IP networks
Large-scale systems
Peer to peer computing
Routing protocols
Sensor phenomena and characterization
Tin
Wireless application protocol
Wireless sensor networks
title CSN: a network protocol for serving dynamic queries in large-scale 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-01-01T20%3A29%3A33IST&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=CSN:%20a%20network%20protocol%20for%20serving%20dynamic%20queries%20in%20large-scale%20wireless%20sensor%20networks&rft.btitle=Proceedings.%20Second%20Annual%20Conference%20on%20Communication%20Networks%20and%20Services%20Research,%202004&rft.au=Ali,%20M.&rft.date=2004&rft.spage=165&rft.epage=174&rft.pages=165-174&rft.isbn=0769520960&rft.isbn_list=9780769520964&rft_id=info:doi/10.1109/DNSR.2004.1344725&rft_dat=%3Cieee_6IE%3E1344725%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=1344725&rfr_iscdi=true