On ?-Alert Problem

In this paper we introduce and analyse the λ-Alert problem: in a single hop radio network a subset of stations is activated. The aim of the protocol is to decide if the number of activated stations is greater or equal to λ. This problem is similar to the k-Selection problem. It can also be seen as a...

Full description

Saved in:
Bibliographic Details
Main Authors: Klonowski, M., Pajak, D.
Format: Conference Proceeding
Language:English
Subjects:
ad hoc network
Alert
Algorithm design and analysis
Broadcasting
Complexity theory
k-Selection problem
Nickel
Protocols
Sensors
Vectors
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 1067
container_issue
container_start_page 1057
container_title
container_volume
creator Klonowski, M.
Pajak, D.
description In this paper we introduce and analyse the λ-Alert problem: in a single hop radio network a subset of stations is activated. The aim of the protocol is to decide if the number of activated stations is greater or equal to λ. This problem is similar to the k-Selection problem. It can also be seen as an extension of the standard Alert problem. In our paper we consider the λ-Alert problem in various settings. We describe characteristics of oblivious and adaptive deterministic algorithms for the model with and without collision detection. We also show some results for randomized algorithms. In particular, we present a very efficient Las Vegastype algorithm which is immune to an adversary.
doi_str_mv 10.1109/IPDPS.2012.98
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6267911</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6267911</ieee_id><sourcerecordid>6267911</sourcerecordid><originalsourceid>FETCH-LOGICAL-i598-e7503b74a8b7fddef7b5259b6eeac24f0f8043df0b90d9496ca000f52a5c78623</originalsourceid><addsrcrecordid>eNotzD1LA0EQgOEVI5jENIKVTf7AXmY_ZmenkpD4EQjkwPRh924WTi4qdzb-ewWt3qd6lbozUBkDvNrV2_q1smBsxfFCLZgiUGD0gZAv1cz8wgETuomaGnSgLRBeq9k4vgFYcJ6n6vbwvnzQ616Gr2U9fORezjfqqqR-lMV_5-r49HjcvOj94Xm3We91hxy1EILL5FPMVNpWCmW0yDmIpMb6AiWCd22BzNCy59AkAChoEzYUg3Vzdf-37UTk9Dl05zR8n4INxMa4H3pIOOQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On ?-Alert Problem</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Klonowski, M. ; Pajak, D.</creator><creatorcontrib>Klonowski, M. ; Pajak, D.</creatorcontrib><description>In this paper we introduce and analyse the λ-Alert problem: in a single hop radio network a subset of stations is activated. The aim of the protocol is to decide if the number of activated stations is greater or equal to λ. This problem is similar to the k-Selection problem. It can also be seen as an extension of the standard Alert problem. In our paper we consider the λ-Alert problem in various settings. We describe characteristics of oblivious and adaptive deterministic algorithms for the model with and without collision detection. We also show some results for randomized algorithms. In particular, we present a very efficient Las Vegastype algorithm which is immune to an adversary.</description><identifier>ISSN: 1530-2075</identifier><identifier>ISBN: 1467309753</identifier><identifier>ISBN: 9781467309752</identifier><identifier>EISBN: 9780769546759</identifier><identifier>EISBN: 0769546757</identifier><identifier>DOI: 10.1109/IPDPS.2012.98</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>ad hoc network ; Alert ; Algorithm design and analysis ; Broadcasting ; Complexity theory ; k-Selection problem ; Nickel ; Protocols ; Sensors ; Vectors</subject><ispartof>2012 IEEE 26th International Parallel and Distributed Processing Symposium, 2012, p.1057-1067</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6267911$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54530,54895,54907</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6267911$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Klonowski, M.</creatorcontrib><creatorcontrib>Pajak, D.</creatorcontrib><title>On ?-Alert Problem</title><title>2012 IEEE 26th International Parallel and Distributed Processing Symposium</title><addtitle>ipdps</addtitle><description>In this paper we introduce and analyse the λ-Alert problem: in a single hop radio network a subset of stations is activated. The aim of the protocol is to decide if the number of activated stations is greater or equal to λ. This problem is similar to the k-Selection problem. It can also be seen as an extension of the standard Alert problem. In our paper we consider the λ-Alert problem in various settings. We describe characteristics of oblivious and adaptive deterministic algorithms for the model with and without collision detection. We also show some results for randomized algorithms. In particular, we present a very efficient Las Vegastype algorithm which is immune to an adversary.</description><subject>ad hoc network</subject><subject>Alert</subject><subject>Algorithm design and analysis</subject><subject>Broadcasting</subject><subject>Complexity theory</subject><subject>k-Selection problem</subject><subject>Nickel</subject><subject>Protocols</subject><subject>Sensors</subject><subject>Vectors</subject><issn>1530-2075</issn><isbn>1467309753</isbn><isbn>9781467309752</isbn><isbn>9780769546759</isbn><isbn>0769546757</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotzD1LA0EQgOEVI5jENIKVTf7AXmY_ZmenkpD4EQjkwPRh924WTi4qdzb-ewWt3qd6lbozUBkDvNrV2_q1smBsxfFCLZgiUGD0gZAv1cz8wgETuomaGnSgLRBeq9k4vgFYcJ6n6vbwvnzQ616Gr2U9fORezjfqqqR-lMV_5-r49HjcvOj94Xm3We91hxy1EILL5FPMVNpWCmW0yDmIpMb6AiWCd22BzNCy59AkAChoEzYUg3Vzdf-37UTk9Dl05zR8n4INxMa4H3pIOOQ</recordid><startdate>201205</startdate><enddate>201205</enddate><creator>Klonowski, M.</creator><creator>Pajak, D.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201205</creationdate><title>On ?-Alert Problem</title><author>Klonowski, M. ; Pajak, D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i598-e7503b74a8b7fddef7b5259b6eeac24f0f8043df0b90d9496ca000f52a5c78623</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>ad hoc network</topic><topic>Alert</topic><topic>Algorithm design and analysis</topic><topic>Broadcasting</topic><topic>Complexity theory</topic><topic>k-Selection problem</topic><topic>Nickel</topic><topic>Protocols</topic><topic>Sensors</topic><topic>Vectors</topic><toplevel>online_resources</toplevel><creatorcontrib>Klonowski, M.</creatorcontrib><creatorcontrib>Pajak, D.</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 Xplore</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>Klonowski, M.</au><au>Pajak, D.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On ?-Alert Problem</atitle><btitle>2012 IEEE 26th International Parallel and Distributed Processing Symposium</btitle><stitle>ipdps</stitle><date>2012-05</date><risdate>2012</risdate><spage>1057</spage><epage>1067</epage><pages>1057-1067</pages><issn>1530-2075</issn><isbn>1467309753</isbn><isbn>9781467309752</isbn><eisbn>9780769546759</eisbn><eisbn>0769546757</eisbn><coden>IEEPAD</coden><abstract>In this paper we introduce and analyse the λ-Alert problem: in a single hop radio network a subset of stations is activated. The aim of the protocol is to decide if the number of activated stations is greater or equal to λ. This problem is similar to the k-Selection problem. It can also be seen as an extension of the standard Alert problem. In our paper we consider the λ-Alert problem in various settings. We describe characteristics of oblivious and adaptive deterministic algorithms for the model with and without collision detection. We also show some results for randomized algorithms. In particular, we present a very efficient Las Vegastype algorithm which is immune to an adversary.</abstract><pub>IEEE</pub><doi>10.1109/IPDPS.2012.98</doi><tpages>11</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1530-2075
ispartof 2012 IEEE 26th International Parallel and Distributed Processing Symposium, 2012, p.1057-1067
issn 1530-2075
language eng
recordid cdi_ieee_primary_6267911
source IEEE Electronic Library (IEL) Conference Proceedings
subjects ad hoc network
Alert
Algorithm design and analysis
Broadcasting
Complexity theory
k-Selection problem
Nickel
Protocols
Sensors
Vectors
title On ?-Alert Problem
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T22%3A49%3A43IST&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=On%20?-Alert%20Problem&rft.btitle=2012%20IEEE%2026th%20International%20Parallel%20and%20Distributed%20Processing%20Symposium&rft.au=Klonowski,%20M.&rft.date=2012-05&rft.spage=1057&rft.epage=1067&rft.pages=1057-1067&rft.issn=1530-2075&rft.isbn=1467309753&rft.isbn_list=9781467309752&rft.coden=IEEPAD&rft_id=info:doi/10.1109/IPDPS.2012.98&rft.eisbn=9780769546759&rft.eisbn_list=0769546757&rft_dat=%3Cieee_6IE%3E6267911%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i598-e7503b74a8b7fddef7b5259b6eeac24f0f8043df0b90d9496ca000f52a5c78623%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6267911&rfr_iscdi=true