{"title":"BSS:用于安全监控的移动总线网络分布式Top-k处理","authors":"Xu Li, Jiajun Hu, Hongyu Huang, Jialiang Lu, W. Shu, Minglu Li, Minyou Wu","doi":"10.1109/VETECS.2010.5494172","DOIUrl":null,"url":null,"abstract":"We consider distributed top-k processing problem in a mobile scenario. Specially, we focus on a real application of a bus network (N nodes), where buses are equipped with cameras for real-time security surveillance. Due to the limited number of screens (k, k<<N) at the traffic management center, how to select k bus nodes with most passengers to upload image data by DSRC needs to be solved. We present a novel distributed scheme BSS to handle this so-called \"top-k node selection\" issue in bus network, in which challenges of low time cost and high accuracy is not trivial. BSS utilizes various strategies to speed up top-k node selection facing poor network condition and application requirements. Performance evaluation is carried out on a real-trace driven simulator, which utilizes about 700 buses in Shanghai. The testing results show that BSS has an excellent performance in terms of time cost and average degree of accuracy, which shows the effectiveness of BSS scheme for real-time security surveillance.","PeriodicalId":325246,"journal":{"name":"2010 IEEE 71st Vehicular Technology Conference","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"BSS: A Distributed Top-k Processing in Mobile BusNet for Security Surveillance\",\"authors\":\"Xu Li, Jiajun Hu, Hongyu Huang, Jialiang Lu, W. Shu, Minglu Li, Minyou Wu\",\"doi\":\"10.1109/VETECS.2010.5494172\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider distributed top-k processing problem in a mobile scenario. Specially, we focus on a real application of a bus network (N nodes), where buses are equipped with cameras for real-time security surveillance. Due to the limited number of screens (k, k<<N) at the traffic management center, how to select k bus nodes with most passengers to upload image data by DSRC needs to be solved. We present a novel distributed scheme BSS to handle this so-called \\\"top-k node selection\\\" issue in bus network, in which challenges of low time cost and high accuracy is not trivial. BSS utilizes various strategies to speed up top-k node selection facing poor network condition and application requirements. Performance evaluation is carried out on a real-trace driven simulator, which utilizes about 700 buses in Shanghai. The testing results show that BSS has an excellent performance in terms of time cost and average degree of accuracy, which shows the effectiveness of BSS scheme for real-time security surveillance.\",\"PeriodicalId\":325246,\"journal\":{\"name\":\"2010 IEEE 71st Vehicular Technology Conference\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 71st Vehicular Technology Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VETECS.2010.5494172\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 71st Vehicular Technology Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VETECS.2010.5494172","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
BSS: A Distributed Top-k Processing in Mobile BusNet for Security Surveillance
We consider distributed top-k processing problem in a mobile scenario. Specially, we focus on a real application of a bus network (N nodes), where buses are equipped with cameras for real-time security surveillance. Due to the limited number of screens (k, k<