NICD: A novel indexless wireless on-demand data broadcast algorithm

被引:0
|
作者
Ramanaiah, OBV [1 ]
Mohanty, H [1 ]
机构
[1] Univ Hyderabad, Dept CIS, Hyderabad 500134, Andhra Pradesh, India
关键词
D O I
10.1109/ITCC.2004.1286742
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Data dissemination by broadcast is the most costeffective and scalable solution for the asymmetric mobile environment. Usually, data objects in periodic broadcast schedule are interleaved with index information to help mobile hosts (MHs) minimize their channel tuning time. On the contrary, presence of index information increases broadcast cycle length and hence the mean response time of MHs. There are many scheduling algorithms in literature which optimize either mean response time or tuning time or both (at least for suboptimal solution). We propose a novel on-demand broadcast algorithm, named (RCE) (Normalized Inter Cluster Distance), which eliminates the need for indexing the broadcast schedule by enabling MHs compute the required index information themselves. Rural Health Care (RHC) system is just one application of the proposed algorithm. Simulation-based experiments are carried out with synthetic data, and it is observed that it effectively eliminates the need for indexing at the computational overhead of O(N-2), where N is the number of clusters present in the collected information; and this is insignificant when compared against communication overhead due to the presence of index.
引用
收藏
页码:730 / 734
页数:5
相关论文
共 50 条
  • [41] Towards efficient and scalable implementation for coding-based on-demand data broadcast
    Ali, G. G. Md. Nawaz
    Liu, Kai
    Lee, Victor C. S.
    Chong, Peter H. J.
    Guan, Yong Liang
    Chen, Jun
    COMPUTER NETWORKS, 2019, 154 : 88 - 104
  • [42] Scheduling time-critical requests for multiple data objects in on-demand broadcast
    Lee, Victor C. S.
    Liu, Kai
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2010, 22 (15): : 2124 - 2143
  • [43] Simulation studies on scheduling requests for multiple data items in on-demand broadcast environments
    Liu, Kai
    Lee, Victor C. S.
    PERFORMANCE EVALUATION, 2009, 66 (07) : 368 - 379
  • [44] Scaling of On-Demand Broadcast Scheduling in Stressed Networks
    Zhou, Jiazhen
    Fox, Jennifer R.
    Hu, Rose Qingyang
    Qian, Yi
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2016, 64 (08) : 3419 - 3429
  • [45] An Efficient Multicast Strategy for On-Demand Data Dissemination in Wireless Networks
    Wang, Shujuan
    Liang, Mangui
    JOURNAL OF INTERNET TECHNOLOGY, 2014, 15 (04): : 557 - 564
  • [46] On-demand Geographic Forwarding for data delivery in wireless sensor networks
    Chen, Dazhi
    Varshney, Pramod K.
    COMPUTER COMMUNICATIONS, 2007, 30 (14-15) : 2954 - 2967
  • [47] On-demand bounded broadcast scheduling with tight deadlines
    Poon, Chung Keung
    Zheng, Feifeng
    Xu, Yinfeng
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (02) : 251 - 262
  • [48] Scheduling Data Broadcast: An Efficient Cut-Off Point Between Periodic and On-Demand Data
    Kim, Sunho
    Kang, Sang H.
    IEEE COMMUNICATIONS LETTERS, 2010, 14 (12) : 1176 - 1178
  • [49] On-demand learning for a wireless campus
    Fong, ACM
    Hui, SC
    Lau, CT
    IEEE MULTIMEDIA, 2004, 11 (04) : 50 - 60
  • [50] Wireless on-demand drug delivery
    Mirvakili, Seyed M.
    Langer, Robert
    NATURE ELECTRONICS, 2021, 4 (07) : 464 - 477