File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
 Publisher Website: 10.1016/j.adhoc.2010.12.001
 Scopus: eid_2s2.084877576918
 Find via
Supplementary

Citations:
 Scopus: 0
 Appears in Collections:
Article: Efficient broadcasting in multihop wireless networks with a realistic physical layer
Title  Efficient broadcasting in multihop wireless networks with a realistic physical layer 

Authors  
Keywords  Energyefficiency wireless NPhardness Multihop wireless network Unreliable network Broadcasting efficiency Minimum retransmission broadcast problem 
Issue Date  2013 
Citation  Ad Hoc Networks, 2013, v. 11, n. 4, p. 13051318 How to Cite? 
Abstract  Almost all existing broadcasting algorithms assume an ideal physical layer, in which a successful transmission is guaranteed if the distance between communicating nodes is less than a certain threshold, e.g., a transmission range. However, wireless communication links normally suffer from the characteristics of realistic physical layer, which significantly reduce the reliability of broadcasting among the nodes. This work addresses the minimal broadcasting problem in multihop wireless networks with a realistic physical layer. Given a probability p*, the problem is to design a distributed broadcasting algorithm such that each node in the network receives the broadcasting packet with probability no less than p* and the number of retransmissions is minimized. We show that this problem is NPhard and propose a distributed greedy algorithm which maximizes the gain cost ratio at each node. We prove that the proposed algorithm guarantees that each node receives the broadcasting packet with probability no less than p*, and analyze upper bound on the number of total retransmissions in the network. Simulation results show that our algorithm can provide near 100% coverage to the wireless network with a realistic physical layer, and reduce the number of retransmissions compared with modified traditional flooding schemes kFlooding (pure flooding with multiple times) and ACKFlooding (pure flooding with acknowledgement). We believe our algorithmic solution is efficient and practical for general existing multihop wireless networks. © 2011 Elsevier B.V. All rights reserved. 
Persistent Identifier  http://hdl.handle.net/10722/230929 
ISSN  2015 Impact Factor: 1.66 2015 SCImago Journal Rankings: 0.967 
DC Field  Value  Language 

dc.contributor.author  Wong, Gary K W   
dc.contributor.author  Liu, Hai   
dc.contributor.author  Chu, Xiaowen   
dc.contributor.author  Leung, Yiu Wing   
dc.contributor.author  Xie, Chun   
dc.date.accessioned  20160901T06:07:10Z   
dc.date.available  20160901T06:07:10Z   
dc.date.issued  2013   
dc.identifier.citation  Ad Hoc Networks, 2013, v. 11, n. 4, p. 13051318   
dc.identifier.issn  15708705   
dc.identifier.uri  http://hdl.handle.net/10722/230929   
dc.description.abstract  Almost all existing broadcasting algorithms assume an ideal physical layer, in which a successful transmission is guaranteed if the distance between communicating nodes is less than a certain threshold, e.g., a transmission range. However, wireless communication links normally suffer from the characteristics of realistic physical layer, which significantly reduce the reliability of broadcasting among the nodes. This work addresses the minimal broadcasting problem in multihop wireless networks with a realistic physical layer. Given a probability p*, the problem is to design a distributed broadcasting algorithm such that each node in the network receives the broadcasting packet with probability no less than p* and the number of retransmissions is minimized. We show that this problem is NPhard and propose a distributed greedy algorithm which maximizes the gain cost ratio at each node. We prove that the proposed algorithm guarantees that each node receives the broadcasting packet with probability no less than p*, and analyze upper bound on the number of total retransmissions in the network. Simulation results show that our algorithm can provide near 100% coverage to the wireless network with a realistic physical layer, and reduce the number of retransmissions compared with modified traditional flooding schemes kFlooding (pure flooding with multiple times) and ACKFlooding (pure flooding with acknowledgement). We believe our algorithmic solution is efficient and practical for general existing multihop wireless networks. © 2011 Elsevier B.V. All rights reserved.   
dc.language  eng   
dc.relation.ispartof  Ad Hoc Networks   
dc.subject  Energyefficiency wireless   
dc.subject  NPhardness   
dc.subject  Multihop wireless network   
dc.subject  Unreliable network   
dc.subject  Broadcasting efficiency   
dc.subject  Minimum retransmission broadcast problem   
dc.title  Efficient broadcasting in multihop wireless networks with a realistic physical layer   
dc.type  Article   
dc.description.nature  Link_to_subscribed_fulltext   
dc.identifier.doi  10.1016/j.adhoc.2010.12.001   
dc.identifier.scopus  eid_2s2.084877576918   
dc.identifier.volume  11   
dc.identifier.issue  4   
dc.identifier.spage  1305   
dc.identifier.epage  1318   