File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Efficient broadcasting in multi-hop wireless networks with a realistic physical layer

TitleEfficient broadcasting in multi-hop wireless networks with a realistic physical layer
Authors
KeywordsEnergy-efficiency wireless
NP-hardness
Multi-hop wireless network
Unreliable network
Broadcasting efficiency
Minimum retransmission broadcast problem
Issue Date2013
Citation
Ad Hoc Networks, 2013, v. 11, n. 4, p. 1305-1318 How to Cite?
AbstractAlmost 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 multi-hop 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 NP-hard 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 k-Flooding (pure flooding with multiple times) and ACK-Flooding (pure flooding with acknowledgement). We believe our algorithmic solution is efficient and practical for general existing multi-hop wireless networks. © 2011 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/230929
ISSN
2015 Impact Factor: 1.66
2015 SCImago Journal Rankings: 0.967

 

DC FieldValueLanguage
dc.contributor.authorWong, Gary K W-
dc.contributor.authorLiu, Hai-
dc.contributor.authorChu, Xiaowen-
dc.contributor.authorLeung, Yiu Wing-
dc.contributor.authorXie, Chun-
dc.date.accessioned2016-09-01T06:07:10Z-
dc.date.available2016-09-01T06:07:10Z-
dc.date.issued2013-
dc.identifier.citationAd Hoc Networks, 2013, v. 11, n. 4, p. 1305-1318-
dc.identifier.issn1570-8705-
dc.identifier.urihttp://hdl.handle.net/10722/230929-
dc.description.abstractAlmost 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 multi-hop 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 NP-hard 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 k-Flooding (pure flooding with multiple times) and ACK-Flooding (pure flooding with acknowledgement). We believe our algorithmic solution is efficient and practical for general existing multi-hop wireless networks. © 2011 Elsevier B.V. All rights reserved.-
dc.languageeng-
dc.relation.ispartofAd Hoc Networks-
dc.subjectEnergy-efficiency wireless-
dc.subjectNP-hardness-
dc.subjectMulti-hop wireless network-
dc.subjectUnreliable network-
dc.subjectBroadcasting efficiency-
dc.subjectMinimum retransmission broadcast problem-
dc.titleEfficient broadcasting in multi-hop wireless networks with a realistic physical layer-
dc.typeArticle-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.adhoc.2010.12.001-
dc.identifier.scopuseid_2-s2.0-84877576918-
dc.identifier.volume11-
dc.identifier.issue4-
dc.identifier.spage1305-
dc.identifier.epage1318-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats