MSCC '14 Pub Date : 2014-08-11 DOI: 10.1145/2633675.2633680

Maotian Zhang, Panlong Yang, Chang Tian, Chaocan Xiang, Yan Xiong

引用次数: 2

On optimal scheduling of multiple mobile chargers in wireless sensor networks 无线传感器网络中多个移动充电器的最优调度

MSCC '14 Pub Date : 2014-08-11 DOI: 10.1145/2633675.2633676

R. Beigel, Jie Wu, Huanyang Zheng

{"title":"On optimal scheduling of multiple mobile chargers in wireless sensor networks","authors":"R. Beigel, Jie Wu, Huanyang Zheng","doi":"10.1145/2633675.2633676","DOIUrl":"https://doi.org/10.1145/2633675.2633676","url":null,"abstract":"The limited battery capacities of sensor nodes have become the biggest impediment to the applications of wireless sensor networks (WSNs) over the years. Recent breakthroughs in wireless energy transfer-based rechargeable batteries provide a promising application of mobile vehicles in WSNs. These mobile vehicles act as mobile chargers to transfer energy wirelessly to static sensors in an efficient way. In this paper, we study the mobile charger coverage problem of sensor nodes distributed on a 1-dimensional line and ring. Each sensor needs to be recharged at a given frequency. A mobile charger can charge a sensor after it moves to the location of the sensor. We assume that the mobile charger has an unlimited charging capability, moves at a speed subject to a given limit, and that the charging time is negligible. An optimization problem is then presented on a time-space coverage of sensors so that none of them will run out of energy: (1) What is the minimum number of mobile chargers needed? (2) Given the minimum number of mobile chargers, how should these mobile chargers be scheduled in terms of trajectory planning? Given homogeneous sensors with the same recharging frequency, we provide an optimal solution with a linear complexity in finding the minimum number of charges, as well as the actual schedule. We then examine an extension to heterogeneous sensors and provide a greedy approach that has a constant ratio of 2 to the optimal solutions for a line and ring. Extensive simulations are conducted to verify the competitive performance of the proposed scheme.","PeriodicalId":383145,"journal":{"name":"MSCC '14","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130981673","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}

引用次数: 18

Confidence-interval based sensing quality evaluation for mobile sensor networks 基于置信区间的移动传感器网络感知质量评价

MSCC '14 Pub Date : 2014-08-11 DOI: 10.1145/2633675.2633679

Chaocan Xiang, Panlong Yang, Bin Yu, Chang Tian, Hong He, Jibin Guo, Yan Xiong

引用次数: 1

InterestSpread: an efficient method for content transmission in mobile social networks 兴趣传播:移动社交网络中一种高效的内容传播方式

MSCC '14 Pub Date : 2014-08-11 DOI: 10.1145/2633675.2633677

Ning Wang, Jie Wu

{"title":"InterestSpread: an efficient method for content transmission in mobile social networks","authors":"Ning Wang, Jie Wu","doi":"10.1145/2633675.2633677","DOIUrl":"https://doi.org/10.1145/2633675.2633677","url":null,"abstract":"In Mobile Social Networks (MSNs), the single-path routing might not have enough of a chance to transmit content to the destination (i.e., low network throughput), due to limited contact opportunities. Meanwhile, the multiple-path routing improves the network throughput at the cost of higher system resource consumption (e.g., energy and storage). Therefore, there exists a trade-off between the network throughput and the system resource consumption. Moreover, we should consider user features in MSNs, i.e., some of the nodes would like to help the other nodes with the same social features (e.g., neighbors, classmates) during content transmission, regardless of their resource consumption. These nodes are called interested nodes. The remaining nodes, called uninterested nodes, will be reluctant to transmit contents to save their resources. To achieve high network throughput and control the system resource consumption of uninterested nodes, we propose a novel multiple-path two-stage routing algorithm, InterestSpread, to transmit contents in the MSNs as follows. (1) In the first stage, we limit the content transmission into a relay candidate set. The contact information, bandwidth information, and social features are leveraged together to select such a set. (2) In the second stage, a classical max-flow method is used to get maximum throughput in the relay candidate set. The simulation based on real human and synthetic traces indicate that our algorithm achieves a good trade-off between throughput and the system recourse consumption.","PeriodicalId":383145,"journal":{"name":"MSCC '14","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134366534","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

Scheduling in vehicular cloud using mixed integer linear programming 基于混合整数线性规划的车辆云调度

MSCC '14 Pub Date : 2014-08-11 DOI: 10.1145/2633675.2633681

Puya Ghazizadeh, R. Mukkamala, Samy El-Tawab

引用次数: 19

Evaluating and analyzing the performance of RPL in contiki RPL在contiki中的性能评价与分析

MSCC '14 Pub Date : 2014-08-11 DOI: 10.1145/2633675.2633678

Tao Zhang, Xianfeng Li

{"title":"Evaluating and analyzing the performance of RPL in contiki","authors":"Tao Zhang, Xianfeng Li","doi":"10.1145/2633675.2633678","DOIUrl":"https://doi.org/10.1145/2633675.2633678","url":null,"abstract":"To meet the development of Internet of Things (IoT), IETF has proposed IPv6 standards working under stringent low-power and low-cost constraints. However, the behavior and performance of the proposed standards have not been fully understood, especially the RPL routing protocol lying at the heart the protocol stack. In this work, we make an in-depth study on a popular implementation of the RPL (routing protocol for low power and lossy network) to provide insights and guidelines for the adoption of these standards. Specifically, we use the Contiki operating system and COOJA simulator to evaluate the behavior of the ContikiRPL implementation. We analyze the performance for different networking settings. Different from previous studies, our work is the first effort spanning across the whole life cycle of wireless sensor networks, including both the network construction process and the functioning stage. The metrics evaluated include signaling overhead, latency, energy consumption and so on, which are vital to the overall performance of a wireless sensor network. Furthermore, based on our observations, we provide a few suggestions for RPL implemented WSN. This study can also serve as a basis for future enhancement on the proposed standards.","PeriodicalId":383145,"journal":{"name":"MSCC '14","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128887447","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}

引用次数: 64

MSCC '14最新文献