2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)最新文献

筛选
英文 中文
A Weighted Network Model Based on the Correlation Degree between Nodes 基于节点间关联度的加权网络模型
Xiaoheng Deng, You Wu, M. Dong, Chenglong Li, Yan Pan
{"title":"A Weighted Network Model Based on the Correlation Degree between Nodes","authors":"Xiaoheng Deng, You Wu, M. Dong, Chenglong Li, Yan Pan","doi":"10.1109/MSN.2015.29","DOIUrl":"https://doi.org/10.1109/MSN.2015.29","url":null,"abstract":"Many complex networks in practice can be described by weighted network models, and the BBV model is one of the most classical ones. In this paper, by introducing the concept of correlation degree between nodes, a new weighted network model based on the BBV model is proposed. The model takes the both node strength and node correlation into consideration during the network evolution, which better reveals the evolving mechanisms behind various real-world networks. Results from theoretical analysis and numerical simulation have demonstrated the scale-free property and small-world property of the network model, which have been widely observed in many real-world networks. Compared with the BBV model, the added correlation preferential attachment rule in the model leads to a faster network propagation velocity.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129184861","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}
引用次数: 3
A Novel DTN Routing Algorithm in the GEO-Relaying Satellite Network geo中继卫星网络中一种新的DTN路由算法
Yipeng Wu, Zhihua Yang, Qinyu Zhang
{"title":"A Novel DTN Routing Algorithm in the GEO-Relaying Satellite Network","authors":"Yipeng Wu, Zhihua Yang, Qinyu Zhang","doi":"10.1109/MSN.2015.18","DOIUrl":"https://doi.org/10.1109/MSN.2015.18","url":null,"abstract":"Disruption-Tolerant Networks provides store-and-forward enabled routing strategies for the satellite networks with frequently intermittent links. However, current dynamic route selection algorithm (DRSA), including Contact Graph Routing (CGR) algorithm, could not find an end-to-end route over a serial of link segments with time-disjointed contacts. In this paper, we proposed a novel routing algorithm as expanding range route selection (ERRS), which could find the EDT-optimal route by searching at each snapshot of time-varying topology. The proposed algorithm is compared with DRSA on the Linux-based experimental platform with built-in ION (Interplanetary Overlay Networks) software. The results show our algorithm has less delivery time and the obviously improved throughput of the network.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116017653","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}
引用次数: 15
On the Need of Systemic Support for Spatio-Temporal Programming of Mobile Robot Swarms 移动机器人群时空规划的系统支持需求研究
Daniel Graff, Daniel Röhrig, R. Karnapke
{"title":"On the Need of Systemic Support for Spatio-Temporal Programming of Mobile Robot Swarms","authors":"Daniel Graff, Daniel Röhrig, R. Karnapke","doi":"10.1109/MSN.2015.22","DOIUrl":"https://doi.org/10.1109/MSN.2015.22","url":null,"abstract":"In this paper, we present SwarmOS -- a distributed operating system for mobile robot swarms. SwarmOS features transaction-based spatio-temporal programming of mobile robot swarms on a systemic level. We show the programming model and resource management in SwarmOS. Swarm applications consist of concurrent, distributed and context-aware actions. We provide distributed transactions in order to guarantee atomic execution of a set of dependent actions. We distinguish between schedulability and executability of a set of actions: the first one is checked by the space-time scheduler which is a core service of the execution environment. The scheduler plans actions in space and time and computes spatio-temporal trajectories if robot movement is necessary. In order to guarantee executability of a distributed transaction of spatio-temporal actions, we present the concept of path alternatives and a time-based two-phase commit protocol in order to assure consistency. We show the feasibility of our approach by performing experiments on our testbed.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125182964","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
Fairness Counts: Simple Task Allocation Scheme for Balanced Crowdsourcing Networks 公平计数:平衡众包网络的简单任务分配方案
Xiaochen Fan, Panlong Yang, Qingyu Li
{"title":"Fairness Counts: Simple Task Allocation Scheme for Balanced Crowdsourcing Networks","authors":"Xiaochen Fan, Panlong Yang, Qingyu Li","doi":"10.1109/MSN.2015.32","DOIUrl":"https://doi.org/10.1109/MSN.2015.32","url":null,"abstract":"With the increasing development of mobile networking technologies, optimization methods for efficient task assignment plays a key role for mobile crowdsourcing process. However, what hiding behind the strategies are solutions to motivate users for participation, which reveals a fundamental problem: the fairness issue of crowdsourcing system. Since the participators are human beings with intensive interest for obtaining benefits, it is reasonable to build a sustainable crowd with guaranteed fairness among users. Thus in this study, we investigate the fairness issue in mobile social network, which could be more complicated when uncontrollable mobile users are concerned. The intuitive solution is, if the tasks could be effectively assigned among users in a balanced way, the fairness could be guaranteed. Unfortunately, there is still a big challenge for this issue, because it's difficult to acquire accurate global information of task loading, which is highly dynamic and distributed. By leveraging the power of two random choices, which is based on the balls and bins theory, we develop a lightweight scheme to allocate tasks. Indeed, we proposed a heuristic algorithm to achieve balanced task allocation effectively with O(1) complexity. To the best of our knowledge, it is the first effort for incorporating fair load balancing in pure distributed mobile crowdsourcing systems. Our extensive evaluation results validate our task offloading algorithm, showing that the proposed scheme outperforms the random choice method.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132109620","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}
引用次数: 9
An Iterated Local Search Approach for Multiple Itinerary Planning in Mobile Agent-Based Sensor Fusion 基于移动agent的传感器融合多路径规划迭代局部搜索方法
D. Gavalas, Ioannis E. Venetis, G. Pantziou, C. Konstantopoulos
{"title":"An Iterated Local Search Approach for Multiple Itinerary Planning in Mobile Agent-Based Sensor Fusion","authors":"D. Gavalas, Ioannis E. Venetis, G. Pantziou, C. Konstantopoulos","doi":"10.1109/MSN.2015.12","DOIUrl":"https://doi.org/10.1109/MSN.2015.12","url":null,"abstract":"The investigation of mobile agent (MA) middleware as a technology for implementing efficient data fusion schemes on wireless sensor networks (WSN) has been a subject of intense research in the past few years. Nevertheless, the itineraries followed by travelling MAs largely determine the overall performance of the data fusion applications. Along this line, this article introduces a novel algorithmic approach for efficient itinerary planning of MA objects engaged in data fusion tasks. Our algorithm adopts an iterated local search (ILS) approach in deriving the hop sequence of multiple travelling MAs over the deployed source nodes. Simulation results demonstrate the performance gain of our method against existing multiple MA itinerary planning methods.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129319272","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}
引用次数: 3
CoDA: Connectivity-Oriented Data Dissemination Algorithm for Vehicular Internet Access Networks CoDA:面向连接的车载互联网接入网络数据传播算法
Chisheng Zhang, Jiannong Cao, G. Yao
{"title":"CoDA: Connectivity-Oriented Data Dissemination Algorithm for Vehicular Internet Access Networks","authors":"Chisheng Zhang, Jiannong Cao, G. Yao","doi":"10.1109/MSN.2015.43","DOIUrl":"https://doi.org/10.1109/MSN.2015.43","url":null,"abstract":"As a typical scenario of mobile Internet, a vehicular Internet access network is a network where vehicles exploit wireless technologies to communicate with infrastructure directly or indirectly via other vehicles or road-side units in high speed. Thus, opportunistic interactions through neighboring vehicles and infrastructure networks can be utilized to exchange useful data and information. Much effort has been made to improve the total amount of data delivered under the delay tolerant network model, in which data links from and to vehicles are always intermittent. However, the network connectivity is critical to real time or interactive applications and services. In this paper, we investigate the problem to maximize network connectivity in vehicular Internet access networks, where vehicles adopt both vehicle-to-vehicle and vehicle-to-infrastructure communications. First, we analyze the characteristics of network connectivity in vehicular Internet access networks and derive a closed-form expression to represent the connectivity probability under specific RSU deployment model and vehicle arrival rate. Then, we develop a connectivity-oriented data dissemination (CoDA) algorithm to maximize the network connectivity probability in vehicular Internet access networks based on probabilistic analysis, which considers multiple factors related to the network connectivity. Finally, we validate the CoDA algorithm through extensive simulations based on the traces from real practise.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116243678","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}
引用次数: 4
Outsourcing Two-Party Privacy Preserving K-Means Clustering Protocol in Wireless Sensor Networks 无线传感器网络中外包两方隐私保护K-Means聚类协议
Xiaoyan Liu, Z. L. Jiang, S. Yiu, Xuan Wang, Chuting Tan, Ye Li, Zechao Liu, Yabin Jin, Jun-bin Fang
{"title":"Outsourcing Two-Party Privacy Preserving K-Means Clustering Protocol in Wireless Sensor Networks","authors":"Xiaoyan Liu, Z. L. Jiang, S. Yiu, Xuan Wang, Chuting Tan, Ye Li, Zechao Liu, Yabin Jin, Jun-bin Fang","doi":"10.1109/MSN.2015.42","DOIUrl":"https://doi.org/10.1109/MSN.2015.42","url":null,"abstract":"Nowadays wireless sensor network (WSN) is widely used in human-centric applications and environmental monitoring. Different institutes deploy their own WSNs for data collection and processing. It becomes a challenging problem when institutes collaborate to do data mining while intend to keep data privacy on each side. Privacy preserving data mining (PPDM) is used to solve the above problem, which enables multiple parties owning confidential data to run a data mining algorithm on their combined data, without revealing any unnecessary information to each other. However, due to the huge amount of data collected and the complexity of data mining algorithms, it is preferable to outsource most of the computations to the cloud. In this paper, we consider a scenario in which two parties with weak computational power need jointly run a k-means clustering protocol, at the same time outsource most of the computation of the protocol to the cloud. As a result, each party can have the correct result calculated by the data from both parties with most of the computation outsourced to the cloud. As for privacy, the data owned by one party should be kept confidential from both the other party and the cloud.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126827370","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}
引用次数: 20
Multi-rate Based Channel Assignment Algorithm for Multi-radio Multi-channel Wireless Mesh Networks 基于多无线电多信道无线Mesh网络的多速率信道分配算法
Guanjie Sun, Shuisheng Lin, F. Yu, Bo Yan, Jie Zhang
{"title":"Multi-rate Based Channel Assignment Algorithm for Multi-radio Multi-channel Wireless Mesh Networks","authors":"Guanjie Sun, Shuisheng Lin, F. Yu, Bo Yan, Jie Zhang","doi":"10.1109/MSN.2015.33","DOIUrl":"https://doi.org/10.1109/MSN.2015.33","url":null,"abstract":"Much attention has been paid to efficiently use channel assignment algorithm to enhance throughput of multi-radio multi-channel (MRMC) wireless Mesh networks (WMNs). However, most prior works on channel assignment assume that all links work on a same rate. In this paper, a multi-rate based channel assignment algorithm called Multi-Rate Based Channel Assignment (MRBCA) is proposed to solve problems caused by multi-rate links. Firstly a proper root node is selected and then a multi-rate topology is established with consideration of connectivity and avoidance of single-direction links. After that, links are ordered and bandwidth loss function is proposed. At last, channels are assigned to links according to the order and minimization of bandwidth loss. Simulation results using ns-3 show that MRBCA outperforms other two classic channel assignment algorithms.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122286618","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}
引用次数: 3
A Low Computational Complexity Authentication Scheme in Underwater Wireless Sensor Network 一种低计算复杂度的水下无线传感器网络认证方案
Chi Yuan, Wenping Chen, Yuqing Zhu, Deying Li, Jie Tan
{"title":"A Low Computational Complexity Authentication Scheme in Underwater Wireless Sensor Network","authors":"Chi Yuan, Wenping Chen, Yuqing Zhu, Deying Li, Jie Tan","doi":"10.1109/MSN.2015.26","DOIUrl":"https://doi.org/10.1109/MSN.2015.26","url":null,"abstract":"Underwater Wireless Sensor Networks (UWSNs) are vulnerable to attack because of the broadcast nature of the transmission. The sensor nodes in UWSN are highly constrained in terms of computational capabilities and communication bandwidth. Authentication schemes for ground WSNs might not be applicable for UWSNs due to their less computation and communication capacity. Thus, it is necessary to design special schemes tailored to underwater environments. In this paper, a low computational complexity authentication scheme is proposed. By using Vandermonde matrix, we replace the matrix multiplication by matrix addition to greatly reduce the computation overhead. Moreover, our scheme is self-correctable and irreversible which further enhances the security of the UWSNs. Experiment results indicate our algorithm has advantages in energy and time consumption over traditional RSA and Blom's scheme.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132122938","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}
引用次数: 17
An Incentive Scheme for Packet Forwarding and Payment Reduction in Wireless Ad-hoc Networks Using XOR Network Coding 一种基于异或网络编码的无线自组网分组转发和减少支付的激励方案
Yuan Zhang, S. Zhong, Haifan Yao
{"title":"An Incentive Scheme for Packet Forwarding and Payment Reduction in Wireless Ad-hoc Networks Using XOR Network Coding","authors":"Yuan Zhang, S. Zhong, Haifan Yao","doi":"10.1109/MSN.2015.30","DOIUrl":"https://doi.org/10.1109/MSN.2015.30","url":null,"abstract":"In wireless ad-hoc networks using XOR network coding, intermediate nodes are required to XOR packets whenever possible. Although there are lots of existing incentive compatible schemes aiming to provide incentives for intermediate nodes to forward packets, they are not suitable for XOR network coding. In this paper, we first present a basic payment scheme to provide incentives to intermediate nodes to follow XOR network coding protocol. We prove that, under our scheme each intermediate node has incentives to follow the XOR protocol. Then we consider the overpayment in the basic scheme, and propose an enhanced payment scheme using SVM model to reduce the payment to a reasonable level. The results show that under the enhanced scheme, the payments can be reduced by up to 70%, and these payment are close to the real forwarding costs.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131252415","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
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学术文献互助群
群 号:604180095
Book学术官方微信