International Journal of Foundations of Computer Science Vol. 23, No. 5 (2012) 1147–1172 c  World Scientiﬁc Publishing Company DOI: 10.1142/S0129054112500165 MINIMUM LOCAL DISK COVER SETS FOR BROADCASTING IN HETEROGENEOUS MULTIHOP WIRELESS NETWORKS GUANING CHEN Department of Information Management, Kainan University, Taoyuan 33857, Taiwan gchen@mail.knu.edu.tw CHIH-WEI YI Department of Computer Science, National Chiao Tung University, Hsinchu 30010, Taiwan yi@cs.nctu.edu.tw MIN-TE SUN Department of Computer Science and Information Engineering, National Central University Taoyuan 32001, Taiwan msun@csie.ncu.edu.tw FANG-CHU LIU Department of Computer Science, National Chiao Tung University Hsinchu 30010, Taiwan vict.cs94g@nctu.edu.tw WEI-CHI LAN Department of Computer Science and Information Engineering National Central University, Taoyuan 32001, Taiwan 100582015@cc.ncu.edu.tw Received 20 April 2010 Accepted 1 February 2012 Communicated by Sartaj Sahni The concept of forwarding sets is widely adopted in many broadcast protocols for wireless multihop networks to alleviate the broadcast storm problem. In these protocols, after receiving a broadcast mes- sage, each node that is requested to relay the message instructs a subset of its 1-hop neighbors, a.k.a. the forwarding set, to further relay it. In this paper, we propose to use the Minimum Local Disk Cover Set (MLDCS) as the forwarding set in heterogeneous multihop wireless networks, where nodes may have different transmission ranges. We show that the minimum local disk cover set of a node in hetero- geneous networks is equivalent to its skyline set, and then we propose a divide-and-conquer algorithm with the optimal time complexity to compute the skyline set locally and statelessly. Moreover, unlike other forwarding heuristics, the proposed algorithm requires only 1-hop neighbor information. This helps to reduce the forwarding set formation latency and thus will be more suitable for environments with a frequently changed network topology, such as vehicular ad hoc networks. Keywords: Minimum disc cover; optimal algorithms; applications in multihop networks. 1147 Int. J. Found. Comput. Sci. 2012.23:1147-1172. Downloaded from www.worldscientific.com by NATIONAL CHIAO TUNG UNIVERSITY on 04/28/14. For personal use only.