2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)最新文献

筛选
英文 中文
The Coverage of Dynamic Area in Mobile Sensor Networks 移动传感器网络中动态区域的覆盖
Ying Deng, Wei Wang, Min Li
{"title":"The Coverage of Dynamic Area in Mobile Sensor Networks","authors":"Ying Deng, Wei Wang, Min Li","doi":"10.1109/MSN.2016.064","DOIUrl":"https://doi.org/10.1109/MSN.2016.064","url":null,"abstract":"The surveillance for data collection in wireless sensor networks (WSNs) setting is recognized as an important application of WSNs. Given an area of interest and a number of wireless sensors, typical problems to be addressed are covering the whole area while prolonging the network lifetime. It is explicitly observed that most existing studies focus on limited case in which the interested area is static. In many WSN applications, however, the areas of interest are dynamic, e.g., deploying sensors to monitor the contaminated area of poisonous material which is fluid or diffusing. Accordingly, this paper turns to solve the Dynamic Area Coverage (DAC) problem. Our work focuses on tackling two key challenges: 1) determine the candidate positions for sensors once the area has evolved, 2) map each sensor to one of the candidate positions to achieve the desirable requirements. Different algorithms are proposed to determine the candidate positions and mappings with constraints. Through extensive simulations, the efficiency and efficacy of the proposed algorithms are well validated.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121126785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Bandwidth-Delay-Constrained Least-Cost Multimedia Broadcasting Based on Heuristic Genetic Algorithm on Overlay Networks 基于启发式遗传算法的覆盖网络带宽延迟约束最小代价多媒体广播
Ting Lu, Shan Chang, Wenjing Guo
{"title":"Bandwidth-Delay-Constrained Least-Cost Multimedia Broadcasting Based on Heuristic Genetic Algorithm on Overlay Networks","authors":"Ting Lu, Shan Chang, Wenjing Guo","doi":"10.1109/MSN.2016.059","DOIUrl":"https://doi.org/10.1109/MSN.2016.059","url":null,"abstract":"Since the heterogeneous Internet Service Provider (ISP) router policies prevent the quality-of-service (QoS) multimedia applications which require IP layer multicasting from being widely deployed on the Internet, the mechanism of implementing such applications by application layer broadcasting through organizing the multicast group in a peer-to-peer overlay network is proposed. In this paper, we study the bandwidth-delay-constrained minimum spanning tree problem in an overlay network, which is NP-complete. We propose a novel genetic algorithm for resolving this problem and compare it with a state-of-the-art method. Simulation results demonstrate that the proposed algorithm is effective and efficient.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127798572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Stable Defense Reference for Cooperative Spectrum Sensing and Its Performance Analysis 协同频谱感知的稳定防御参考及其性能分析
G. Nie, Linyuan Zhang, Guoru Ding
{"title":"A Stable Defense Reference for Cooperative Spectrum Sensing and Its Performance Analysis","authors":"G. Nie, Linyuan Zhang, Guoru Ding","doi":"10.1109/MSN.2016.065","DOIUrl":"https://doi.org/10.1109/MSN.2016.065","url":null,"abstract":"Cooperative spectrum sensing (CSS) in cognitive radio networks plays an important role in saluting the problem of spectrum scarcity. Unfortunately, the existence of spectrum sensing data falsification (SSDF) attack, also known as Byzantine attack, brings fatal threat to the reliability of CSS. In SSDF attack, malicious user(s) will send false sensing results to the fusion center to mislead the global decision about spectrum occupancy. In order to have a sufficient acknowledgement of spectrum state, we introduce an stable defense reference on the basis of existing defense references in this paper. Not only has the drawback that the existing defense references have strong assumptions such as the attackers are in minority and/or a trusted node exists for data fusion been overcome, but also situation such as sensors' sensing and reporting process has been taken into account, which is much closer to the actual situation. Based on the proposed reference, we also adopt a novel and easy to implement technique to counter Byzantine attacks in CRNs. Our analysis indicates that the proposed reference is robust against Byzantine attacks and can successfully remove the Byzantines in a short time span.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134415613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Toward 5G: A Novel Sleeping Strategy for Green Distributed Base Stations in Small Cell Networks 迈向5G:小型蜂窝网络中绿色分布式基站的新型休眠策略
Yiwei Xu, Jin Chen, Ducheng Wu, Wanru Xu
{"title":"Toward 5G: A Novel Sleeping Strategy for Green Distributed Base Stations in Small Cell Networks","authors":"Yiwei Xu, Jin Chen, Ducheng Wu, Wanru Xu","doi":"10.1109/MSN.2016.027","DOIUrl":"https://doi.org/10.1109/MSN.2016.027","url":null,"abstract":"Confronted with the rapidly increasing demand of mobile traffic and heavy energy consumption on base stations (BSs), the base station (BS) sleeping strategy becomes a promising method to promote the system energy efficiency (EE). To switch off the redundant small-cell base stations (s-BSs) without whittling down the network EE in small cell networks, we propose a novel environment-friendly distributed BS sleeping strategy, which consists of two parts, matching and connecting between the s-BSs and the user equipments (UEs), and activating the BS-turning-off procedure for the further promotion of EE. An initializing matching connection algorithm (IMCA) is proposed for the first subproblem and the energy efficiency ratio (EER) obtained by this proposed IMCA surpasses the EE gained from traditional initializing random connection method. Moreover, a turn-off if possible algorithm (TIPA) is proposed as the sleeping strategy to handle the BS-turning-off procedure. Both the EE and the convergence speed obtained by the sleeping deployment using TIPA surpass those of the traditional best response algorithm.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124614940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Ocean Barrier: A Floating Intrusion Detection Ocean Sensor Networks 海洋屏障:一种浮动入侵检测海洋传感器网络
Hanjiang Luo, Kaishun Wu, Feng Hong
{"title":"Ocean Barrier: A Floating Intrusion Detection Ocean Sensor Networks","authors":"Hanjiang Luo, Kaishun Wu, Feng Hong","doi":"10.1109/MSN.2016.071","DOIUrl":"https://doi.org/10.1109/MSN.2016.071","url":null,"abstract":"Ocean sensor networks have many applications ranging from oceanographic data collection, pollution monitoring, disasters prevention to tactical surveillance. However, due to the harsh ocean environment, it is difficult to deploy three-dimensional sensor networks underwater for sustainable monitoring tasks. In this paper, we propose a novel floating three-dimensional sensor networks for ocean monitoring and surveillance applications, which leverage nodes' restricted movement to enlarge the monitoring area. The networks are deployed on both the surface of the ocean and underwater, with many chains of nodes attached to mooring lines. Compared with deployments requiring self-adjusted nodes, our scheme is simpler and more cost-efficient, and the sustainable monitoring cost is low. We design deployment strategies, and provide in-depth mathematical analysis for network coverage. Then we derive the minimum number of sensors to achieve full surface coverage. Evaluated by simulations of a few underwater scenarios, the effectiveness and efficiency of the proposed scheme is proved.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121297464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Home-Based Multi-Copy Routing in Mobile Social Networks 移动社交网络中基于家庭的多副本路由
Tao Jing, Yangyang Liu, Yan Huo, Yingkun Wen
{"title":"Home-Based Multi-Copy Routing in Mobile Social Networks","authors":"Tao Jing, Yangyang Liu, Yan Huo, Yingkun Wen","doi":"10.1109/MSN.2016.052","DOIUrl":"https://doi.org/10.1109/MSN.2016.052","url":null,"abstract":"A Mobile Social Network (MSN) is a typical Delay Tolerant Network (DTN) composed of mobile nodes with social characteristics. Routing design and optimization are difficult because of the fast topology changes in such network. However, realistic mobility trace shows that mobile nodes in MSNs generally visit a few locations called homes, frequently, while other locations are visited less frequently. In order to evaluate the influence of the home on the routing design and improve the delivery success ratio, we propose two novel home-based multi-copy routing protocols, HBMRZ and HBMR. In HBMRZ, we assume that the message holder has zero-knowledge about the destination when it delivers the message, while in HBMR, the message holder not only knows its own homes but also the destination. Nevertheless, both of the protocols can broadcast message on the basis of the known home information. In addition, extensive simulations are conducted. Numerical simulation demonstrates that it is important to exploit home factor in routing protocols for delivering the message accurately. By using home characteristic, HBMRZ and HBMR achieve a better performance on the delivery success ratio than existing MSN routing algorithms, including Epidemic and Spray&Wait.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127071158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Infrared Optical Wireless Communication for Smart Door Locks Using Smartphones 基于智能手机的智能门锁红外光无线通信
K. Dhondge, Kaushik Ayinala, Baek-Young Choi, Sejun Song
{"title":"Infrared Optical Wireless Communication for Smart Door Locks Using Smartphones","authors":"K. Dhondge, Kaushik Ayinala, Baek-Young Choi, Sejun Song","doi":"10.1109/MSN.2016.047","DOIUrl":"https://doi.org/10.1109/MSN.2016.047","url":null,"abstract":"With the recent rapid advancements in the Internetof-Things (IoT), one of the applications being developed is thatof smart door lock (SDL) systems. SDL are intended to offerhigh security, easy access and easy sharing. Unlike existing SDLsolutions that mostly use biometrics or crunched RF spectrum, we uniquely propose to use Infrared (IR) optical wireless signal(OWS) using IR light emitting diode (LED) of smartphones. We designed and developed a complete system of Androidsmartphone app including physical layer encoding, a cloud serverand programmable hardware prototypes using Arduino as wellas Raspberry Pi. Optlock includes multi-level security schemesincluding user registration, authentication and authorizationusing one-time-password (OTP). Our extensive experiments show100% accuracy with 1.33 kbps of average data rate is achievedup to 20 meters of distance between a smartphone and a lock. Itallows convenient remote access, easy access control and sharingas well as high security.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117350182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Distributed Beamforming and BS Sleep under Small Cell Network 小蜂窝网络下的分布式波束形成与BS睡眠
Yang Qiao, Lihua Li, Zhi Wang, Hui Tian, Xin Su
{"title":"Distributed Beamforming and BS Sleep under Small Cell Network","authors":"Yang Qiao, Lihua Li, Zhi Wang, Hui Tian, Xin Su","doi":"10.1109/MSN.2016.081","DOIUrl":"https://doi.org/10.1109/MSN.2016.081","url":null,"abstract":"Green telecommunication is becoming an important part in designing the wireless communication systems. Small Cell Network (SCN) is considered as one of the most promising techniques in the future cellular networks. In order to reduce the high power consumption caused by dense deployment of small base stations (BSs), we first propose a new decentralized precoding algorithm which aims to maximize the energy efficiency of the SCN and the suboptimal solution can be obtained by two times of iterations. For further consideration, when the quantity of UEs is low in the network, it is a waste of energy to open a BS to serve only a few UEs or provide a low data rate to the UEs. So we introduce a BS closing strategy, which takes advantage of the property of SCN that different BSs cover more overlapping areas. Simulation results show that the proposed decentralized precoding algorithm outperforms the traditional precoding algorithms such as BD precoding, and the sleep strategy does not only take linear time complexity but also improve the energy efficiency of the SCN obviously.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124391634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Conflict-Aware Network State Updates in SDN SDN中冲突感知网络状态更新
Ningning Li, Chungang Yan, Xin Wang, Cheng Wang
{"title":"Conflict-Aware Network State Updates in SDN","authors":"Ningning Li, Chungang Yan, Xin Wang, Cheng Wang","doi":"10.1109/MSN.2016.042","DOIUrl":"https://doi.org/10.1109/MSN.2016.042","url":null,"abstract":"In SDN (Software-Defined Networks), applications are granted the ability to control and manage networks, such as routing, access control, and load balance, which is considered one of the most significant characters of SDN. However, these concurrent applications are lack of interactions when they operate on overlapping portions of the traffic and introduce a critical challenge of potentially conflicting flow rules (including match fields and actions). When their actions are dropping, forwarding, or diverting to the controller, these kinds of flow rule conflicts are inherent and arduous, and there exist no appropriate compositional methods of resolving them. Under the circumstances, the paper proposes a general model of abstract network states where different applications can own their different network views. When conflicting rules are detected, the model provides new network states for applications by composing original network states and conflicting rules. Therefore, applications do not need to handle underlying conflicting rules and just achieve the latest network states to install flow rules correctly.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124203550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Based Point of Interest and Experience to Task Assignment on Location-Based Social Networks 基于兴趣点和经验的位置社交网络任务分配
Shiyan Wang, Xiulan Wang, Yue Yang, Haibin Cai
{"title":"Based Point of Interest and Experience to Task Assignment on Location-Based Social Networks","authors":"Shiyan Wang, Xiulan Wang, Yue Yang, Haibin Cai","doi":"10.1109/MSN.2016.021","DOIUrl":"https://doi.org/10.1109/MSN.2016.021","url":null,"abstract":"In recent years, with the popularity of smart mobile devices, mobile Internet has rapidly developed. When the social network meets the localization technology, it gives birth to a Location-Based Social Network (LBSN). The situational awareness based on the location has become more research significance. However, how to combine the context awareness, mobile sensors and abundant users' historical location data to make the platform more efficient, how to ensure that the proceeds can improve the accuracy of recommendation and perceived task assignment, are still challenges in the location-based social network. In this paper, we demonstrate a model to use historical location data of the participants and analyze the point-of-interest (POI). Then we propose the user location and the empirical value algorithm PTHS based on the HITS algorithm. Through analyzing the interest points of the selected scene perception task, we find that those users have similar point-of-interest, and rank them by the location and experience PTHS algorithm. Finally, much more appropriate users are assigned to the tasks. Through theoretical analysis and extensive simulations, we validate that proposed method is effective and efficient.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121070375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信