File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
 Publisher Website: 10.1007/9783642311048_10
 Scopus: eid_2s2.084864050802
 Find via
Supplementary

Citations:
 Scopus: 0
 Appears in Collections:
Conference Paper: Distributed multiplemessage broadcast in wireless adhoc networks under the SINR model
Title  Distributed multiplemessage broadcast in wireless adhoc networks under the SINR model 

Authors  
Keywords  Arbitrary number Broadcast algorithm Broadcast protocols Collision detection High probability 
Issue Date  2012 
Publisher  Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ 
Citation  The 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012), Reykjavik, Iceland, 30 June2 July 2012.In Lecture Notes in Computer Science, 2012, v. 7355, p. 111122 How to Cite? 
Abstract  In a multiplemessage broadcast, an arbitrary number of messages originate at arbitrary nodes in the network at arbitrary times. The problem is to disseminate all these messages to the whole network. This paper gives the first randomized distributed multiplemessage broadcast algorithm with worstcase performance guarantee in wireless adhoc networks employing the SINR interference model which takes interferences from all the nodes in the network into account. The network model used in this paper also considers the harsh characteristics of wireless adhoc networks: there is no prior structure, and nodes cannot perform collision detection and have little knowledge of the network topology. Under all these restrictions, our proposed randomized distributed multiplemessage broadcast protocol can deliver any message m to all nodes in the network in O(D + k + log 2 n) timeslots with high probability, where D is the network diameter, k is the number of messages whose broadcasts overlap with m, and n is the number of nodes in the network. We also study the lower bound for randomized distributed multiplemessage broadcast protocols. In particular, we prove that any uniform randomized algorithm needs Ω(D + k + log 2n/log log log n) timeslots to deliver k messages initially stored at k nodes to all nodes in the network. © 2012 SpringerVerlag. 
Description  LNCS v. 7355 has title: Structural information and communication complexity: 19th International Colloquium, SIROCCO 2012 ... Proceedings 
Persistent Identifier  http://hdl.handle.net/10722/169307 
ISBN  
ISSN  2014 SCImago Journal Rankings: 0.339 
DC Field  Value  Language 

dc.contributor.author  Yu, D  en_US 
dc.contributor.author  Hua, Q  en_US 
dc.contributor.author  Wang, Y  en_US 
dc.contributor.author  Tan, H  en_US 
dc.contributor.author  Lau, FCM  en_US 
dc.date.accessioned  20121018T08:49:48Z   
dc.date.available  20121018T08:49:48Z   
dc.date.issued  2012  en_US 
dc.identifier.citation  The 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012), Reykjavik, Iceland, 30 June2 July 2012.In Lecture Notes in Computer Science, 2012, v. 7355, p. 111122  en_US 
dc.identifier.isbn  9783642311031   
dc.identifier.issn  03029743   
dc.identifier.uri  http://hdl.handle.net/10722/169307   
dc.description  LNCS v. 7355 has title: Structural information and communication complexity: 19th International Colloquium, SIROCCO 2012 ... Proceedings   
dc.description.abstract  In a multiplemessage broadcast, an arbitrary number of messages originate at arbitrary nodes in the network at arbitrary times. The problem is to disseminate all these messages to the whole network. This paper gives the first randomized distributed multiplemessage broadcast algorithm with worstcase performance guarantee in wireless adhoc networks employing the SINR interference model which takes interferences from all the nodes in the network into account. The network model used in this paper also considers the harsh characteristics of wireless adhoc networks: there is no prior structure, and nodes cannot perform collision detection and have little knowledge of the network topology. Under all these restrictions, our proposed randomized distributed multiplemessage broadcast protocol can deliver any message m to all nodes in the network in O(D + k + log 2 n) timeslots with high probability, where D is the network diameter, k is the number of messages whose broadcasts overlap with m, and n is the number of nodes in the network. We also study the lower bound for randomized distributed multiplemessage broadcast protocols. In particular, we prove that any uniform randomized algorithm needs Ω(D + k + log 2n/log log log n) timeslots to deliver k messages initially stored at k nodes to all nodes in the network. © 2012 SpringerVerlag.   
dc.language  eng  en_US 
dc.publisher  Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/   
dc.relation.ispartof  Lecture Notes in Computer Science  en_US 
dc.rights  The original publication is available at www.springerlink.com   
dc.subject  Arbitrary number   
dc.subject  Broadcast algorithm   
dc.subject  Broadcast protocols   
dc.subject  Collision detection   
dc.subject  High probability   
dc.title  Distributed multiplemessage broadcast in wireless adhoc networks under the SINR model  en_US 
dc.type  Conference_Paper  en_US 
dc.identifier.email  Yu, D: dxyu@hku.hk  en_US 
dc.identifier.email  Hua, Q: huaqs@hku.hk  en_US 
dc.identifier.email  Wang, Y: amywang@hku.hk   
dc.identifier.email  Tan, H: hstan@HKUSUA.hku.hk   
dc.identifier.email  Lau, FCM: fcmlau@cs.hku.hk   
dc.identifier.authority  Lau, FCM=rp00221  en_US 
dc.identifier.doi  10.1007/9783642311048_10   
dc.identifier.scopus  eid_2s2.084864050802   
dc.identifier.hkuros  211538  en_US 
dc.identifier.volume  7355   
dc.identifier.spage  111  en_US 
dc.identifier.epage  122  en_US 
dc.publisher.place  Germany   
dc.description.other  The 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012), Reykjavik, Iceland, 30 June2 July 2012.In Lecture Notes in Computer Science, 2012, v. 7355, p. 111122   