New algorithm for minimum multicast time problem in wireless sensor networks

被引：0

作者：

Zhu, Jianming ^{[1
]}

Shang, Weiping ^{[1
]}

Hu, Xiaodong ^{[1
]}

机构：

[1] Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China

来源：

2007 IEEE WIRELESS COMMUNICATIONS & NETWORKING CONFERENCE, VOLS 1-9 | 2007年

关键词：

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Given a wired network of processors, and a source node that needs to broadcast a message to all other processors in the network, the minimum broadcast time problem is to find a scheme that accomplishes the broadcast in a minimum number of time rounds under the constraint that at each time round, no processor can forward the received message to more than one of its neighbors in the network. This NP-hard problem has been extensively studied in literatures. In this paper we focus on a variant of the minimum broadcast time problem: the minimum multicast time problem in wireless sensor networks under collision-free data transmission model. The goal of the problem is to multicast a message from the source node to a set of destination nodes in a minimum number of time rounds. This problem remains NP-hard even in the Euclidean plane and the current best approximation algorithm has performance ratio of 41. In this paper we propose a new algorithm that has performance ratio of 15.

引用

页码：3532 / 3537

页数：6

共 50 条

[31] An autonomous multicast-tree creation algorithm for wireless sensor networks
Onodera, Katsumi
Miyazaki, Toshiaki
PROCEEDINGS OF FUTURE GENERATION COMMUNICATION AND NETWORKING, MAIN CONFERENCE PAPERS, VOL 1, 2007, : 267 - 272
[32] A novel minimum delay maximum flow multicast algorithm to construct a multicast tree in wireless mesh networks
Kumar, Neeraj
Chilamkurti, Naveen
Lee, Jong-Hyouk
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2012, 63 (02) : 481 - 491
[33] Multicast Routing in Wireless Sensor Networks
Simek, M.
Komosny, D.
Burget, R.
Silva, J. S.
31ST INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING TSP 2008, 2008, : 94 - 98
[34] A new algorithm for the minimum connected dominant set problem on Ad Hoc wireless networks
Butenko, S
Oliveira, CAS
Pardalos, PM
CCCT 2003, VOL 5, PROCEEDINGS: COMPUTER, COMMUNICATION AND CONTROL TECHNOLOGIES: II, 2003, : 39 - 44
[35] Approximation Algorithms for Minimum Energy Multicast Routing with Reception Cost in Wireless Sensor Networks
Li, Deying
Liu, Zewen
Hong, Yi
Chen, Wenping
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011, 6831 : 179 - +
[36] Combined Cooperative Communication and Multicast for Minimum Power Cost in Coded Wireless Sensor Networks
Shi, Liqi
Egbogah, Emeka E.
Fapojuwo, Abraham O.
2011 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2011, : 755 - 760
[37] Multicast Scaling in Heterogeneous Wireless Sensor Networks for Security and Time Efficiency
Vankdothu, Ramdas
Hameed, Mohd Abdul
Fatima, Husnah
Subbarao, Akkala
WIRELESS PERSONAL COMMUNICATIONS, 2025,
[38] An algorithm for sensing coverage problem in wireless sensor networks
Quang, Vinh Tran
Miyoshi, Takumi
2008 IEEE SARNOFF SYMPOSIUM, 2008, : 82 - 86
[39] Tree Node Switching Algorithm for Minimum Energy Cost Aggregation Tree Problem in Wireless Sensor Networks
Matsuura, Hiroshi
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2020, E103D (11) : 2250 - 2261
[40] A New Fuzzy Algorithm for Delay Constrained Minimum Energy Transmission of Sensor Array Data in Wireless Sensor Networks
Verma, Madhushi
Shukla, K. K.
PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON ROBOTICS AND ARTIFICIAL INTELLIGENCE, ICRAI 2019, 2019, : 87 - 93

← 1 2 3 4 5 →