무선 센서 네트웍에서 근접한 k개의 Dominant 검색방법
- 무선 센서 네트웍에서 근접한 k개의 Dominant 검색방법
- Date Issued
- The Network Centric Warfare(NCW) model is currently attracting attention in modern warfare research. In this model, data processing issues, such as efficiently determining enemies of high threat, are critical for optimizing war tactics. In this paper, by adopting the concept of skyline queries which have been extensively studied in database research, we address the problem of searching highly threatening enemies, named ``dominants''. While skyline queries have been
extensively studied in database research, most existing solutions assume centralized scenarios. However, during warfare, tactics should consider data distributed all over the field, where existing solutions for centralized scenarios cannot apply. In this paper, we treat each Forward Air Controller in Close Air Support operation as a sensor node and propose a novel algorithm to determine dominants. Our proposed algorithm works by considering
the distance from the query to the enemies, and prioritizes the retrieval of enemies of high threat.
- Article Type
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.