Homogeneous 2-hop broadcast in 2D

被引:7
|
作者
Das, Gautam K. [2 ]
Das, Sandip [1 ]
Nandy, Subhas C. [1 ]
机构
[1] Indian Stat Inst, Kolkata 700108, India
[2] Univ New Brunswick, Fredericton, NB E3B 5A3, Canada
来源
关键词
Range assignment; Broadcast; Mobile communication; Algorithm; RANGE ASSIGNMENT; WIRELESS;
D O I
10.1016/j.comgeo.2009.06.005
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, two variations of the minimum cost homogeneous range assignment problem for 2-hop broadcast from a given source are considered. A set S = {s(0), s(1), ... ,s(n)) of radio stations are pre-placed in R-2, and a source station so (say) is marked. In our first problem. the objective is to find a real number r such that 2-hop homogeneous broadcast from so is possible with range r, and the total power consumption of the entire network is minimum. In the second problem, a real number r is given and the objective is to identify the smallest subset of S for which range r can be assigned to accomplish the 2-hop broadcast from so, provided such an assignment is possible. The first problem is solved in O(n(2.376) logn) time and O(n(2)) space. For the second problem, a 2-factor approximation algorithm is proposed that runs in O(n(2)) time and O(n) space. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:182 / 190
页数:9
相关论文
共 50 条
  • [1] Homogeneous 2-hops broadcast in 2D
    Das, Gautam K.
    Das, Sandip
    Nandy, Subhas C.
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 2, 2006, 3981 : 750 - 759
  • [2] HRB: A New MAC Level 2-hop Broadcast Protocol with Directional Receiving
    Tetsuro, Kuniyasu
    Tetsuya, Shigeyasu
    2016 10TH INTERNATIONAL CONFERENCE ON INNOVATIVE MOBILE AND INTERNET SERVICES IN UBIQUITOUS COMPUTING (IMIS), 2016, : 231 - 236
  • [3] On the Connectivity of 2-Hop Neighbor Graph
    Hou, Yun
    Qin, Jiahu
    Yu, Changbin
    2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 6092 - 6097
  • [4] Relative Localization with 2-Hop Neighborhood
    Mallery, Christopher J.
    Medidi, Sirisha
    Medidi, Muralidhar
    2008 IEEE INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS, MOBILE AND MULTIMEDIA NETWORKS, VOLS 1 AND 2, 2008, : 519 - +
  • [5] The 2-hop spanning tree problem
    Dahl, G
    OPERATIONS RESEARCH LETTERS, 1998, 23 (1-2) : 21 - 26
  • [6] 2-hop distributed MIMO communication system
    Dohler, M
    Gkelias, A
    Aghvami, H
    ELECTRONICS LETTERS, 2003, 39 (18) : 1350 - 1351
  • [7] Anonymous Networks: Randomization=2-Hop Coloring
    Emek, Yuval
    Pfister, Christoph
    Seidel, Jochen
    Wattenhofer, Roger
    PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14), 2014, : 96 - 105
  • [8] Fully dynamic 2-hop cover labeling
    D'Angelo G.
    D'Emidio M.
    Frigioni D.
    ACM Journal of Experimental Algorithmics, 2019, 24 (01):
  • [9] Integrated 2-hop communication for the HiperLAN/2 infrastructure mode
    Esseling, N
    Winkler, A
    IEEE VTC 53RD VEHICULAR TECHNOLOGY CONFERENCE, SPRING 2001, VOLS 1-4, PROCEEDINGS, 2001, : 2333 - 2337
  • [10] Economic model for 2-hop relaying cellular networks
    Negi, A
    Singh, S
    2005 WIRELESS TELECOMMUNICATIONS SYMPOSIUM, 2005, : 184 - 189