{"title":"A Game Theory Based Vertical Handoff Scheme for Wireless Heterogeneous Networks","authors":"Shuai Fu, Jie Li, Ruidong Li, Yusheng Ji","doi":"10.1109/MSN.2014.37","DOIUrl":"https://doi.org/10.1109/MSN.2014.37","url":null,"abstract":"Next-generation wireless networks integrate multiple wireless access technologies to provide seamless wireless connectivity for mobile nodes (MNs). When MNs move in wireless heterogeneous networks, they may suffer from the great degradation of received signal strength (RSS) and further quality of services (QoS), if randomly selecting an access point (AP). We address vertical handoff with game theory to enable MNs to trigger the handoff and select an appropriate network from multiple wireless access technologies. On the other hand, the existing vertical handoff schemes lack of jointly considering the behaviors of MNs and APs for approaching the reality. To solve this problem, we propose a repeated game based scheme for vertical handoff. Each sub-game is formulated as a non-cooperative strategic game between a MN and an AP in which the Nash equilibrium is the solution of each strategic game. The proposed repeated game is to optimize the utility functions of the whole network by finding an equilibrium point. We perform the performance analysis, which shows that proposed scheme can achieve better bandwidth utilization and throughput of the network compared to the AP random selection scheme.","PeriodicalId":229788,"journal":{"name":"2014 10th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129220735","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}
Yitao Li, L. Ding, Jie Sheng, Cong Liu, A. Teredesai
{"title":"An Effective Message Forwarding Algorithm for Delay Tolerant Network with Cyclic Probabilistic Influences","authors":"Yitao Li, L. Ding, Jie Sheng, Cong Liu, A. Teredesai","doi":"10.1109/MSN.2014.31","DOIUrl":"https://doi.org/10.1109/MSN.2014.31","url":null,"abstract":"In this paper, we present a disruption-tolerant message forwarding algorithm for optimizing the message delivery ratio of an ad-hoc network in presence of multiple unknown probabilistic influences that are cyclic in nature. Our model assumes each node moves independently from other nodes in the network, and each node's mobility behavior, although not deterministic, can be considered as random variables associated with an unknown sequence of probability distributions that follows a cyclic pattern over time. Based on those assumptions, our algorithm enables any node in the network to estimate the cycle lengths of hidden events that cause variations in each node's mobility behavior using its known mobility history as well as the history information from all peer nodes at its current landmark. Subsequently using such estimates, each node can predict other nodes' most likely trajectories in future and make optimized routing decisions based on these predictions. In this paper, we also report results from experiments that measure the effectiveness of our proposed algorithm by comparing its message delivery ratio with those of two baselines on networks of different sizes.","PeriodicalId":229788,"journal":{"name":"2014 10th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121418226","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":"APCP: Adaptive Path Control Protocol for Efficient Branch-Based Multicast Routing in Wireless Sensor Networks","authors":"Daehee Kim, Sejun Song, Baek-Young Choi","doi":"10.1109/MSN.2014.20","DOIUrl":"https://doi.org/10.1109/MSN.2014.20","url":null,"abstract":"Multicast routing is essential for various one-to-many Wireless Sensor Network (WSN) applications. While many existing multicast protocols in WSNs suffer from the overhead of the intermediate nodes' states, packet header size, computation time, and energy consumption, branch-based multicast protocol achieves an optimal trade off among problems by maintaining the membership information only on the branch nodes that are created by a bottom-up membership join from the member nodes to a source node. However, the multicast path discovered by the simple bottom-up join may incur an inefficient multicast path, and the inefficiency becomes worse as nodes further join the WSNs. In this paper, we propose an Adaptive Path Control Protocol (APCP) for efficient branch-based multicast routing in a WSN. We leverage a source initiated efficient path control approach (top-down) for building an initial branch-based multicast path. However, to overcome the expensive maintenance cost of the top-down approach, the APCP adaptively runs the top-down and bottom-up join schemes using a formula to measure the multicast path quality and overhead, named the Branch Quality Factor (BQF). Our evaluation results show that the proposed APCP reduces a multicast path length by 20% less than the existing bottom-up join schemes with 10 times lower overhead than using only top-down join that builds up the most efficient multicast path.","PeriodicalId":229788,"journal":{"name":"2014 10th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128101491","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":"Analysis on Evolution and Topological Features of a Real Mobile Social Network","authors":"Qichao Xu, Zhou Su, Dongfeng Fang, Bo Han","doi":"10.1109/MSN.2014.41","DOIUrl":"https://doi.org/10.1109/MSN.2014.41","url":null,"abstract":"With the development of mobile devices, especially the emergence of smart phones, the mobile social networks (MSNs) have emerged to provide a variety of mechanisms for users to share their content. However, because the number of the mobile users still keeps growing rapidly, the MSNs become more complex than before and the features including evolution and topology need to be studied for communication system optimization. Therefore, in this paper, a great deal of data on social interactions among mobile users are collected to reveal the evolution and topological features of the MSNs. Firstly, the evolution feature of the MSN with the time is detailedly studied. Then, the statistical features of MSN including degree distribution, node distance, node closeness, and betweenness are analyzed. From the results of the analysis on the evolution features, we find that the MSN will become complex over time. In addition, the analysis of the topological properties shows that the MSN is a typical scale-free network and has strong small-world features.","PeriodicalId":229788,"journal":{"name":"2014 10th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"349 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125629790","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":"Robust Audio Watermarking Based on Fibonacci Numbers","authors":"Mehdi Fallahpour, D. Megías","doi":"10.1109/MSN.2014.58","DOIUrl":"https://doi.org/10.1109/MSN.2014.58","url":null,"abstract":"This article presents a novel high capacity audio watermarking system to embed data and extract them in a bit-exact manner by changing some of the magnitudes of the FFT spectrum. The key idea is to divide the FFT spectrum into short frames and change the magnitude of the selected FFT samples using Fibonacci numbers. The suggested technique guarantees and proves, mathematically, that the maximum change is less than 61% of the related FFT sample and the average error for each sample is 25%. Using the closest Fibonacci number to FFT magnitudes results in a robust and transparent technique. On top of very remarkable capacity, transparency and robustness, this scheme provides two parameters which facilitate the regulation of these properties. The experimental results show that the method has a high capacity (700 to 3 kbps), without significant perceptual distortion (ODG is about -- 1) and provides robustness against common audio signal processing such as echo, added noise, filtering and MPEG compression (MP3). In addition to the experimental results the fidelity of suggested system is proved mathematically.","PeriodicalId":229788,"journal":{"name":"2014 10th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"233 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134529860","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":"Reducing Idle Listening during Data Collection in Wireless Sensor Networks","authors":"Aram Rasul, T. Erlebach","doi":"10.1109/MSN.2014.10","DOIUrl":"https://doi.org/10.1109/MSN.2014.10","url":null,"abstract":"Data collection is one of the predominant operations in wireless sensor networks. This paper focuses on the problem of efficient data collection in a setting where some nodes may not possess data each time data is collected. In that case, idle listening slots may occur, which lead to a waste of energy and an increase in latency. To alleviate these problems, successive-slot schedules were proposed by Zhao and Tang (Infocom 2011). In this paper, we introduce a so-called extra-bit technique to reduce idle listening further. Each packet includes an extra bit that informs the receiver whether further data packets will follow or not. The extra-bit technique leads to significantly reduced idle listening and improved latency in many cases. We prove that every successive-slot schedule is also an extra-bit schedule. We then consider the special case of linear networks and prove that the optimal length of a successive-slot schedule (or extra-bit schedule) is 4N - 6 time slots, where N ≥ 3 is the number of nodes excluding the sink. Then the proposed extra-bit technique is compared with the successive-slot technique with respect to the expected amount of idle listening, and it is shown that the extra-bit technique reduces idle listening substantially.","PeriodicalId":229788,"journal":{"name":"2014 10th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133778644","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}
Peggy Begerow, S. Krug, Sebastian Schellenberg, J. Seitz
{"title":"Buffer Management for Reliable Multicast over Delay Tolerant Networks","authors":"Peggy Begerow, S. Krug, Sebastian Schellenberg, J. Seitz","doi":"10.1109/MSN.2014.30","DOIUrl":"https://doi.org/10.1109/MSN.2014.30","url":null,"abstract":"Flooding, earthquakes, and other disasters are recent phenomenons which unfortunately occur more and more often. After such occurrences, the infrastructure is likely damaged, but rescue teams need to communicate with each other to plan the rescue missions. Mobile Ad hoc Networks (MANETs) are an efficient and cost-effective opportunity to establish communication, if no working infrastructure is available. However, they come with several challenges, e.g. Interruptions due to partitioned MANETs. Delay Tolerant Networks (DTNs) are a possible solution to overcome this problem. Furthermore, rescue missions require reliable communication between different rescue teams and among their team members. In order to efficiently reach all members of a team, multicast is promising. However, guaranteeing that all recipients receive a DTN multicast message is difficult and might consume too much buffer space in the DTN nodes. In this paper, we present our approach of a DTN-based multicast protocol that provides efficient buffer management without neglecting the required reliability. We explain our algorithm to efficiently free the node buffers. Our simulation results will show that our algorithm increases the delivery ratio for different group sizes.","PeriodicalId":229788,"journal":{"name":"2014 10th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114542502","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":"Indoor Relative Positioning Scheme Using Illuminance and Color Temperature","authors":"H. Aida, H. Ichikawa, Motoi Okada, M. Miki","doi":"10.1109/MSN.2014.35","DOIUrl":"https://doi.org/10.1109/MSN.2014.35","url":null,"abstract":"As schemes for indoor positioning of persons and objects using near field communication and/or visible light communication come closer to reality, expectations are centering on the spread of indoor location-based services. A problem with these schemes is that they are costly because special equipment is often required for transmission and reception. As relative positioning schemes by controlling illuminance and color temperature of existing indoor lighting, this study proposes those using luminance and color temperature. Relative positioning schemes using luminance and color temperature rapidly estimate a relative position by switching multiple lighting patterns of a ceiling lighting system. By gradually adjusting luminance and color temperature for different locations, positioning is possible on the basis of the degree of change in sensed values. We implemented this relative positioning scheme using luminance and color temperature and evaluated the relation between the Euclidean distance and the real distance between sensors in a real space simulating an office. As a result, it was clarified that there was a correlation between the Euclidean distance and the real distances between sensors in 5 stages.","PeriodicalId":229788,"journal":{"name":"2014 10th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131458027","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":"An Mobile Safety Monitoring System for Children","authors":"Zejun Huang, Zhigang Gao, Huijuan Lu, Jiancheng Zhang, Zuoqi Feng, Haixia Xia","doi":"10.1109/MSN.2014.55","DOIUrl":"https://doi.org/10.1109/MSN.2014.55","url":null,"abstract":"Aiming at the increasing security risks of children, this paper presents and implements a kind of Mobile Children Security Monitoring (MCSM) system based on android phones to help guardian to acquire whether children are safe or not. MCSM implements the software hand function and the danger zone function for two typical safety scenarios, i.e., going outside with their guardians and without their guardians respectively. The software hand function can keep children in guardian's view by using Bluetooth near field communication, and the safety zone function can make guardians know children's location timely by using GPS sensors, acceleration sensors, and mobile GIS (Geographic Information System). Experiments shows the system has the characteristics of high reliability, short response time and high accuracy, and can meet the requirements to ensure children's safety.","PeriodicalId":229788,"journal":{"name":"2014 10th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133990930","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}
He Chen, Wen Xu, Xuming Zhai, Yuanjun Bi, Ailian Wang, D. Du
{"title":"How Could a Boy Influence a Girl?","authors":"He Chen, Wen Xu, Xuming Zhai, Yuanjun Bi, Ailian Wang, D. Du","doi":"10.1109/MSN.2014.45","DOIUrl":"https://doi.org/10.1109/MSN.2014.45","url":null,"abstract":"A boy wants to make friends with a pretty girl. He feels that he may get rejected if he invites her directly. In this situation, what he could do is to influence the girl's friends. Similar situations may occur in social activities. Based on this background, we formulate a new optimization problem, the Target Influence Maximization (TIM) problem and show that this problem can be solved in polynomial-time in networks with no directed cycles. Motivated by this, we study a special strategy to construct solutions for TIM, i.e., The Target Influence Maximization through Sub graph without Directed Cycle (TIMSDC). Two polynomial-time approximation algorithms are designed for TIMSDC. Through extensive experiments on real-world data sets, we demonstrate that our algorithms work efficiently and outperform existing methods.","PeriodicalId":229788,"journal":{"name":"2014 10th International Conference on Mobile Ad-hoc and Sensor Networks","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134594576","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}