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

Modeling Interest-Driven Data Dissemination in Online Social Networks 在线社交网络中兴趣驱动的数据传播建模

2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2016-12-01 DOI: 10.1109/MSN.2016.053

Cheng Wang, Zhenzhen Zhang, Jieren Zhou, Yuan He, Jipeng Cui, Changjun Jiang

引用次数: 2

Privacy Inference on Knowledge Graphs: Hardness and Approximation 知识图的隐私推断:硬度和近似

2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2016-12-01 DOI: 10.1109/MSN.2016.030

Jianwei Qian, Shaojie Tang, Huiqi Liu, Taeho Jung, Xiangyang Li

引用次数: 5

An Energy-Efficient Position Transformation Approach 一种节能的位置转换方法

2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2016-12-01 DOI: 10.1109/MSN.2016.020

Keming Tang, Yong Xu, Hao Yang, Yue Ye, Weipeng Lv

引用次数: 0

Scalable Video-on-Demand Streaming for Heterogeneous Clients in Wireless Network 无线网络中异构客户端的可扩展视频点播流

2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2016-12-01 DOI: 10.1109/MSN.2016.014

Li Zhou, Xiaohua Tian, Xiaoying Gan, Hui Yu, Xinbing Wang

引用次数: 1

S-Mirror: Mirroring Sensing Signals for Mobile Robots in Indoor Environments S-Mirror:室内环境下移动机器人的镜像传感信号

2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2016-12-01 DOI: 10.1109/MSN.2016.055

Qiang Zhai, Fan Yang, Adam C. Champion, Chunyi Peng, Junda Zhu, D. Xuan, Biao Chen, Yuan F. Zheng, Wei Zhao

{"title":"S-Mirror: Mirroring Sensing Signals for Mobile Robots in Indoor Environments","authors":"Qiang Zhai, Fan Yang, Adam C. Champion, Chunyi Peng, Junda Zhu, D. Xuan, Biao Chen, Yuan F. Zheng, Wei Zhao","doi":"10.1109/MSN.2016.055","DOIUrl":"https://doi.org/10.1109/MSN.2016.055","url":null,"abstract":"Many mobile robots are expected to work for or interact with humans indoors in applications such as guided shopping, policing, and senior care. Mobile robots' sensors alone are insufficient in order to realize these applications, infrastructural support is needed. Existing support for mobile robots requires heavy or expensive infrastructures with limited scalability or deployment of unsightly lines or magnetic strips. This paper presents S-Mirror, a novel approach that \"reflects\" various ambient signals towards mobile robots, greatly extending their sensing abilities. S-Mirror forms a network of S-Mirror nodes that mainly reflect visual signals (as well as electronic and acoustic signals) to assist mobile robots. To illustrate the advantages of S-Mirror, we develop a localization approach for mobile robots that integrates S-Mirror and robots' on-board motion sensors. We implement S-Mirror and a mobile robot prototype on commercial off-the-shelf hardware. Our real-world experimental validation shows that S-Mirror achieves accurate timely localization with low network bandwidth consumption as well as robustness and scalability to many mobile robots.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"24 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":"121632866","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

Quality-Driven Proactive Caching of Scalable Videos over Small Cell Networks 小蜂窝网络上可扩展视频的质量驱动的主动缓存

2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2016-12-01 DOI: 10.1109/MSN.2016.023

Tong Zhen, Yuedong Xu, Tao Yang, Bo Hu

{"title":"Quality-Driven Proactive Caching of Scalable Videos over Small Cell Networks","authors":"Tong Zhen, Yuedong Xu, Tao Yang, Bo Hu","doi":"10.1109/MSN.2016.023","DOIUrl":"https://doi.org/10.1109/MSN.2016.023","url":null,"abstract":"The explosion of mobile video traffic imposes tremendous challenges on present cellular networks. To alleviate the pressure on backhaul links and to enhance the quality of experience (QoE) of video streaming service, small cell base stations (SBS) with caching ability are introduced to assist the content delivery. In this paper, we present the first study on the optimal caching strategy of scalable video coding (SVC) streaming in small cell networks with the consideration of channel diversity and video scalability. We formulate an integer programming problem to maximize the average subjective quality of SVC streaming under the constraint of cache size at each SBS. By establishing connections between subjective quality and caching state of each video, we simplify the proactive caching of SVC as a multiple-choice knapsack problem (MCKP), and propose a low-complexity algorithm using dynamic programming. Our proactive caching strategy reveals the structural properties of cache allocation to each video based on their popularity profiles. Simulation results manifest that the SBSs with caching ability can greatly improve the average quality of SVC streaming, and that our proposed caching strategy acquires significant performance gain compared with other conventional caching policies.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"30 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":"130115164","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

A Node Performance and Encountering Probability-Based Adaptive Routing for Delay Tolerant Networks 时延容忍网络中基于节点性能和相遇概率的自适应路由

2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2016-12-01 DOI: 10.1109/MSN.2016.044

Fang Lu, Jianbo Li

{"title":"A Node Performance and Encountering Probability-Based Adaptive Routing for Delay Tolerant Networks","authors":"Fang Lu, Jianbo Li","doi":"10.1109/MSN.2016.044","DOIUrl":"https://doi.org/10.1109/MSN.2016.044","url":null,"abstract":"Delay Tolerant Networks (DTNs) are characterized by node mobility and partitioned network topology, extremely long delivery latency, etc. Consequently, the traditional ad-hoc routing algorithms cannot work well in DTNs. In order to provide effective communication services in DTNs, in this paper, we propose an adaptive routing based on Node Performance and Encountering Probability (NPEP). NPEP chronologically consists of two phases, the asymmetric distribution stage and the probability forwarding stage. In the asymmetric distribution stage, by considering node throughput, we define an absorbing metric to select a better node as the next relay node. We also define another node activeness metric to asymmetrically allocate copies to relay nodes. In the probability forwarding stage, we evaluate the encountering probability with the destination node in order to select a better next relay node to optimize delivery ratio. Extensive simulations have been conducted and the results show that NPEP outperforms Epidemic, FirstContact and NPSW in terms of delivery rate, average latency and average hop count in the Random Waypoint mobility model. Specifically, NPEP has less average hop count than other three algorithms, and the overhead ratio of NPEP is 45% and 43% less than that of Epidemic, FirstContact.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"155 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":"132580826","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

Data Aggregation with Principal Component Analysis in Big Data Wireless Sensor Networks 基于主成分分析的大数据无线传感器网络数据聚合

2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2016-12-01 DOI: 10.1109/MSN.2016.015

Jun Yu Li, Songtao Guo, Yuanyuan Yang, Jing He

引用次数: 12

Parallel Implementation of ECC Point Multiplication on a Homogeneous Multi-Core Microcontroller ECC点乘法在同质多核微控制器上的并行实现

2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2016-12-01 DOI: 10.1109/MSN.2016.070

M. Albahri, M. Benaissa, Z. Khan

引用次数: 2

Implementing Forward and Drop Policies for Improving PRoPHET's Routing Performance 实现Forward和Drop策略以提高PRoPHET的路由性能

2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2016-12-01 DOI: 10.1109/MSN.2016.045

Salem Sati, Christopher Probst, Kalman Graffi

{"title":"Implementing Forward and Drop Policies for Improving PRoPHET's Routing Performance","authors":"Salem Sati, Christopher Probst, Kalman Graffi","doi":"10.1109/MSN.2016.045","DOIUrl":"https://doi.org/10.1109/MSN.2016.045","url":null,"abstract":"Routing protocols for delay tolerant network are designed to operate in an environment where there is no stable end to end path. The DTN research has focused primarily on the performance of routing protocols that build on a Store-Carry-Forward manner without consideration of a physical buffer limitation. Therefore, the need of a message sorting and drop policy according to priorities is very critical and favorable in such restricted environments. In this paper, we present effective forward and drop policies to improve the performance of the PRoPHET routing protocol. These forward and drop policies are applied on the PRoPHET version 2 routing protocol, which is currently commonly used as routing protocol for practical implementations of DTN middlewares. In this paper, we propose a stopping rule for the forward strategy in PRoPHET together with a dynamic drop policy. By this, we optimize the routing performance based on reducing the number of relayed messages while keeping a desired delivery ratio. To further improve the resource conservation, we propose new rules for message forwarding when encountering nodes. A forwarding error approximation is used to give the optimal threshold of the forwarding decision. In addition, we propose a dynamic drop policy which considers delay and overhead of the message based on multiple parameters. Simulation results show that the PRoPHET protocol with our new forward and drop policies gives better performance improvement in terms of relayed messages.","PeriodicalId":135328,"journal":{"name":"2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"50 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":"126711411","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