{"title":"Demo: A Low-cost, Highly Customizable Robotic Platform for Testing Mobile Sensor Networks","authors":"Eduardo Castelló Ferrer, Y. S. Hanay","doi":"10.1145/2746285.2764935","DOIUrl":"https://doi.org/10.1145/2746285.2764935","url":null,"abstract":"Developing a mobile platform which can be useful for sensor network scientists is a challenging task. In this paper, we propose a low-cost, highly customizable robotic mobile platform in order to test mobile sensor network algorithms within lab environments. Using 3D printing technology and user friendly electronics, we provide a useful tool for mobile networking community. This way, the community will have the opportunity to test their algorithms before the deployment in real sensor nodes. A brief market study about the mobile platforms field is given in the paper which reveals that current platforms are either more expensive or simply do not meet the requirements for our target scenario.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121075741","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}
Xi Xiong, Zheng Yang, Longfei Shangguan, Yun Fei, M. Stojmenovic, Yunhao Liu
{"title":"SmartGuide","authors":"Xi Xiong, Zheng Yang, Longfei Shangguan, Yun Fei, M. Stojmenovic, Yunhao Liu","doi":"10.1145/2746285.2746294","DOIUrl":"https://doi.org/10.1145/2746285.2746294","url":null,"abstract":"We introduce SmartGuide, a light-weighted and efficient approach to localize and recognize a distant unknown building. Our approach relies on shooting only a single photo of a target building via a smartphone and a local 2D Google map. SmartGuide first extracts a partial top view contour of a building from its side-view photo by applying vanishing point and the Manhattan World Assumption, and then fetches a candidate building set from a local 2D Google map based on smartphone's GPS readings. Partial top view shape, orientation and distance relative to the camera are used as input parameters in a probability model, which adversely recognizes the best candidate building in the local map. Our model is developed based on kernel density estimation that helps reduce noise in the smartphone sensors, such as GPS readings and camera ray direction reported by noisy accelerometer and compass. Experimental results demonstrate that our approach recognizes buildings ranging from 20m to 520m and achieves 92.7% accuracy in downtown areas where the Manhattan World Assumption is applicable. In addition, the processing time is no more than 6 seconds for 87% of cases. Compared with existing building localization schemes, SmartGuide offers numerous advantages. Our method avoids taking multiple photos, intricate 3D reconstruction or any initial deployment cost of database construction, making it faster and less labor-intensive than existing solutions.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125479054","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}
Jian Liu, Yan Wang, Yingying Chen, J. Yang, Xu Chen, Jerry Q. Cheng
{"title":"Tracking Vital Signs During Sleep Leveraging Off-the-shelf WiFi","authors":"Jian Liu, Yan Wang, Yingying Chen, J. Yang, Xu Chen, Jerry Q. Cheng","doi":"10.1145/2746285.2746303","DOIUrl":"https://doi.org/10.1145/2746285.2746303","url":null,"abstract":"Tracking human vital signs of breathing and heart rates during sleep is important as it can help to assess the general physical health of a person and provide useful clues for diagnosing possible diseases. Traditional approaches (e.g., Polysomnography (PSG)) are limited to clinic usage. Recent radio frequency (RF) based approaches require specialized devices or dedicated wireless sensors and are only able to track breathing rate. In this work, we propose to track the vital signs of both breathing rate and heart rate during sleep by using off-the-shelf WiFi without any wearable or dedicated devices. Our system re-uses existing WiFi network and exploits the fine-grained channel information to capture the minute movements caused by breathing and heart beats. Our system thus has the potential to be widely deployed and perform continuous long-term monitoring. The developed algorithm makes use of the channel information in both time and frequency domain to estimate breathing and heart rates, and it works well when either individual or two persons are in bed. Our extensive experiments demonstrate that our system can accurately capture vital signs during sleep under realistic settings, and achieve comparable or even better performance comparing to traditional and existing approaches, which is a strong indication of providing non-invasive, continuous fine-grained vital signs monitoring without any additional cost.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122391064","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}
{"title":"Poster: An Adaptive Copy Spraying Scheme for Data Forwarding in Mobile Opportunistic Networks","authors":"Peiyan Yuan, Wei Wang, Chenyang Wang","doi":"10.1145/2746285.2764862","DOIUrl":"https://doi.org/10.1145/2746285.2764862","url":null,"abstract":"Mobile opportunistic network (MON) is a new paradigm which exploits node contacts to forward data, enabling numerous and impressive applications. The data copy spraying scheme is a challenging problem in MON, due to the mobility of nodes and lack of global knowledge, it hence captures great interests from research communities. Traditional algorithms allocate data copies with node's statistical information and neglect the temporal contact feature, resulting in a poor delivery performance. We propose AS, an adaptive data copy spraying scheme in MON. AS adjusts the number of copies dynamically based on the temporal contact feature among nodes. Theoretical analysis verifies that AS achieves a lower mean delivery delay than SprayWait, one of the state-of-the-art works. Simulation results show that AS improves the packet delivery ratio simultaneously.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121971300","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}
{"title":"Face Routing on a Non-Planar Graph: Theory and Applications to Networks","authors":"Y. Cheng, Ming-Jer Tsai","doi":"10.1145/2746285.2746314","DOIUrl":"https://doi.org/10.1145/2746285.2746314","url":null,"abstract":"In geographic routing protocols, face forwarding is often used in helping a packet escape from the stuck state. To guarantee packet delivery, face forwarding usually routes a packet in a planar subgraph of the network, which might disable many edges in the network and, in turn, worsen the routing performance and reduce the link failure tolerance. In this paper, we aim to improve the connectivity of the graphs on which face forwarding can guarantee packet delivery. We present a sufficient condition for the packet delivery guarantee of GFG face forwarding, augment the graph used in face forwarding with selected disabled edges in the network, and propose a geographic routing protocol, termed GFG-NP, in which a packet escapes from the stuck state by performing GFG face forwarding on the augmented graph that might be non-planar. We show, using theoretical analysis, that GFG-NP guarantees packet delivery when performed on the augmented graphs of the partial Delaunay triangulation (PDT) and the CLDP-stable graph constructed by the cross-link detection protocol (CLDP), termed PDT- and CLDP-augmented graphs, respectively. In addition, simulations on network simulator NS-2 show that GFG-NP with face forwarding performed on PDT- and CLDP-augmented graphs outperforms GFG with face forwarding performed on PDT and the CLDP-stable graph, respectively, in terms of load balance, path length, routing latency, and packet delivery rate.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116191756","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}
Sixia Chen, A. Russell, Ruofan Jin, Yanyuan Qin, B. Wang, Sudarshan Vasudevan
{"title":"Asynchronous Neighbor Discovery on Duty-cycled Mobile Devices: Integer and Non-Integer Schedules","authors":"Sixia Chen, A. Russell, Ruofan Jin, Yanyuan Qin, B. Wang, Sudarshan Vasudevan","doi":"10.1145/2746285.2746297","DOIUrl":"https://doi.org/10.1145/2746285.2746297","url":null,"abstract":"Neighbor discovery is a fundamental problem in wireless networks. In this paper, we study asynchronous neighbor discovery between duty-cycled mobile devices. Each node is duty-cycled, i.e., its radio may only be active for a small fraction of the time. The duty cycles of the nodes can be the same or different, leading to symmetric or asymmetric cases of the neighbor discovery problem. In addition, the setting is asynchronous, i.e., clocks of different nodes may not be synchronized. Most existing studies assume an integer model (where time proceeds in discrete steps); two recent studies break away from this assumption, which allows them to develop significantly more efficient schemes. Our study improves the state-of-the-art in three main fronts. Firstly, we develop a generalized non-integer model (where time is continuous) that permits unified treatment of the assumptions in existing studies. We also provide a reduction that transforms any schedule in the basic integer model to a corresponding schedule in the generalized non-integer model while improving the performance by a factor of two. Applying this reduction, an optimal schedule in the integer model becomes an optimal schedule in the non-integer model. Thirdly, we establish a new family of lower bounds for the best achievable latency guarantee in the non-integer model. They are applicable to both symmetric and asymmetric settings, and encompass the lower bounds for the integer model as special cases. Finally, we develop a novel optimal construction based on Sidon sets for the symmetric setting. Our approach differs from the approaches taken by all existing studies, and provides a new direction for constructing neighbor discovery schedules.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130689803","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}
{"title":"Poster: Disseminating Content in Interest-centric Opportunistic Social Networks","authors":"C. Kong, Xiaojun Cao","doi":"10.1145/2746285.2764868","DOIUrl":"https://doi.org/10.1145/2746285.2764868","url":null,"abstract":"","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133435561","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}
{"title":"QoE-Optimal Scheduling for On-Demand Video Streams over Unreliable Wireless Networks","authors":"I.-Hong Hou, Ping-Chun Hsieh","doi":"10.1145/2746285.2746288","DOIUrl":"https://doi.org/10.1145/2746285.2746288","url":null,"abstract":"Video streaming is anticipated to dominate wireless traffic in the near future. We study wireless systems where an access point delivers video streams to multiple clients over unreliable wireless channels. The performance of each client is measured by the amount of time that its video playback halts due to buffer underflow, which has been shown to have the most impact on client's perceived quality of experience (QoE). We develop an analytical framework that jointly captures the video playback process and the unreliable and heterogeneous wireless channels. We derive the capacity region for QoE by establishing a lower bound of a weighted sum of video halt durations over all clients. We then propose a QoE-optimal policy that can achieve every point within the capacity region. Finally, we compare our policy against two commonly used policies. Both theoretical analysis and simulation results show that our policy greatly outperforms other policies.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127644222","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}
{"title":"Demo: An Efficient and Reliable Wireless Link for Mobile Video Surveillance Systems","authors":"Liran Li, Cailian Chen, Wenbin Yu, Yiyin Wang, X. Guan","doi":"10.1145/2746285.2764934","DOIUrl":"https://doi.org/10.1145/2746285.2764934","url":null,"abstract":"In this demo, an efficient and reliable wireless link is designed for mobile video surveillance systems. In the link, the idea of cognitive radio is utilized and an adaptive channel switching mechanism is employed to avoid unpredictable interferences. Packets pipelining and accumulative acknowledgement (ACK) is proposed based on the stop-and-wait ARQ protocol to improve the communication efficiency of the link. Moreover, an integration design of the ACK packet is used to piggyback different kinds of control messages. With the efficient and reliable wireless link, a cognitive radio prototype is developed for video transmission between the telerobot and teleoperator. The video information from the telerobot can be transmitted back to the teleoperator quickly and reliably even under channel interferences. The telerobot can also be controlled timely and accurately. A video demo shows the whole story and performance.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115731269","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}
Blerim Cici, Minas Gjoka, A. Markopoulou, C. Butts
{"title":"On the Decomposition of Cell Phone Activity Patterns and their Connection with Urban Ecology","authors":"Blerim Cici, Minas Gjoka, A. Markopoulou, C. Butts","doi":"10.1145/2746285.2746292","DOIUrl":"https://doi.org/10.1145/2746285.2746292","url":null,"abstract":"The goal of this paper is to infer features of urban ecology (i.e., social and economic activities, and social interaction) from spatiotemporal cell phone activity data. We present a novel approach that consists of (i) time series decomposition of the aggregate cell phone activity per unit area using spectral methods, (ii) clustering of areal units with similar activity patterns, and (ii) external validation using a ground truth data set we collected from municipal and online sources. The key to our approach is the spectral decomposition of the original cell phone activity series into seasonal communication series (SCS) and residual communication series (RCS). The former captures regular patterns of socio-economic activity within an area and can be used to segment a city into distinct clusters. RCS across areas enables the detection of regions that are subject to mutual social influence and of regions that are in direct communication contact. The RCS and SCS thus provide distinct probes into the structure and dynamics of the urban environment, both of which can be obtained from the same underlying data. We illustrate the effectiveness of our methodology by applying it to aggregate Call Description Records (CDRs) from the city of Milan.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122060834","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}