{"title":"Non-Submodularity and Approximability: Influence Maximization in Online Social Networks","authors":"Huanyang Zheng, Ning Wang, Jie Wu","doi":"10.1109/WoWMoM.2019.8793017","DOIUrl":"https://doi.org/10.1109/WoWMoM.2019.8793017","url":null,"abstract":"Motivated by many Online Social Network (OSN)applications such as viral marketing, the Social Influence Maximization Problem (SIMP)has received tremendous attention. SIMP aims to select $k$ initially-influenced seed users to maximize the number of eventually-influenced users. Under the independent cascade model, the SIMP has been proved to be NP-hard, monotone, and submodular. Therefore, a naive greedy algorithm that maximizes the marginal gain obtains an approximation ratio of $1-e^{-1}$. This paper extends the SIMP by considering the crowd influence which is combined group influence in additional to individual influence among a given crowd. Our problem is proved to be NP-hard and monotone, but not submodular. It is proved to be inapproximable within a ratio of $vert Vvert ^{epsilon-1}$ for any $in > 0$. However, since user connections in OSNs are not random, approximations can be obtained by leveraging the structural properties of OSNs. We prove that the supmodular degree, denoted as $Delta$. of most OSNs has the following property $lim_{vert Vvert rightarrowinfty}frac{Delta}{O(vert Vvert)}=0$, i.e., $Deltain mathrm{o}(vert Vvert)$ for most OSNs. The supermodularity, denoted by $triangle$, is used to measure to what degree our problem violates the submodularity. Two approximation algorithms have been applied with ratios of $frac{1}{triangle+2}$ and $1-e^{-1/(triangle+1)}$, respectively. Experiments demonstrate the efficiency and effectiveness of our algorithms.","PeriodicalId":372377,"journal":{"name":"2019 IEEE 20th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121229095","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 Age Control Transport Protocol for Delivering Fresh Updates in the Internet-of-Things","authors":"Tanya Shreedhar, S. Kaul, R. Yates","doi":"10.1109/WoWMoM.2019.8793011","DOIUrl":"https://doi.org/10.1109/WoWMoM.2019.8793011","url":null,"abstract":"Internet-of-Things (IoT) applications have sources sense and send their measurement updates over the Internet to a monitor (control station) for real-time monitoring and actuation. Ideally, these updates would be delivered fresh, at a high rate constrained only by the supported sensing rate. However, such a rate may lead to network congestion related delays in delivery of updates at the monitor that make the freshest update at the monitor unacceptably old for the application. Alternately, at low rates, while updates arrive at the monitor with smaller delays, new updates arrive infrequently. Thus, both low and high rates may lead to an undesirably aged freshest update at the monitor. We propose a novel transport layer protocol, namely the Age Control Protocol (ACP), which enables timely delivery of such updates to monitors over the Internet in a network-transparent manner. ACP adapts the rate of updates from a source such that the average age of updates at the monitor is minimized. We detail the protocol and the proposed control algorithm. We demonstrate its efficacy using extensive simulations and realworld experiments, including wireless access for the sources and an end-to-end connection with multiple hops to the monitor.","PeriodicalId":372377,"journal":{"name":"2019 IEEE 20th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114377460","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 Online Method for Opportunistic Task Replications","authors":"R. Lent","doi":"10.1109/WoWMoM.2019.8792974","DOIUrl":"https://doi.org/10.1109/WoWMoM.2019.8792974","url":null,"abstract":"We discuss the online optimization of redundant copies of computing tasks. The method helps to overcome the limitations of cloud and edge computing methods for mobile applications where the shared use of mixed and distributed processors often yields unpredictable execution times. While the aim is to obtain the earliest response (discarding the rest), without careful control of the task replication process, the redundant executions may lead to excessive processor contention leading to undesired effects. The current state of practice assumes the use of homogeneous processors, heuristics, and perfect knowledge of the future task runtimes, which limit the application scope of the idea. Through reinforcement learning, the proposed method discovers autonomously how to optimally select for each new request both the number of replicas and their processor assignment. The method can operate effectively without full knowledge of system features and regardless of the changing system state. An extensive simulation study using different scenarios confirms the performance of this proposal and offers a quantitative insight into its advantages and limitations. Diverse mobile applications prospectively benefit from this approach, as computer and communication networks become larger and more diverse, and mobile applications require increasingly higher reliability and lower latency.","PeriodicalId":372377,"journal":{"name":"2019 IEEE 20th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126728902","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":"Leveraging Transfer Learning in Multiple Human Activity Recognition Using WiFi Signal","authors":"S. Arshad, Chunhai Feng, Ruiyun Yu, Yonghe Liu","doi":"10.1109/WoWMoM.2019.8793019","DOIUrl":"https://doi.org/10.1109/WoWMoM.2019.8793019","url":null,"abstract":"Existing works on human activity recognition predominantly consider single-person scenarios, which deviates significantly from real world where multiple people exist simultaneously. In this work, we leverage transfer learning, a deep learning technique, to present a framework (TL-HAR) that accurately detects multiple human activities; exploiting CSI of WiFi extracted from 802.11n. Specifically, for the first time we employ packet-level classification and image transformation together with transfer learning to classify complex scenario of multiple human activities. We design an algorithm that extracts activity based CSI using the variance of MIMO subcarriers. Subsequently, TL-HAR transforms CSI to images to capture correlation among subcarriers and use a deep Convolutional Neural Network (d-CNN) to extract representative features for the classification. We further reduce training complexity through transfer learning, that infers knowledge from a pre-trained model. Experimental results confirm the significance of our approach. We show that using transfer learning TL-HAR improves recognition accuracy to 96.7% and 99.1 % for single and multiple MIMO links.","PeriodicalId":372377,"journal":{"name":"2019 IEEE 20th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117295887","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":"Texting and Driving Recognition Exploiting Subsequent Turns Leveraging Smartphone Sensors","authors":"L. Bedogni, Octavian Bujor, M. Levorato","doi":"10.1109/WoWMoM.2019.8793032","DOIUrl":"https://doi.org/10.1109/WoWMoM.2019.8793032","url":null,"abstract":"Texting while Driving has been reported as one of the major sources of inattention by car drivers, leading to an increased probability of severe road accidents. In fact, notifications, messages and other interactions with mobile devices may make the driver unaware of road and traffic events. To prevent or mitigate this issue, solutions have been proposed that either block the smartphone when inside the vehicle or recognize the activity to issue monetary fines at a later time. This paper proposes a classification framework capable to identify the location of a device within the vehicle using data from integrated sensors. This allow more selective countermeasures targeted specifically to mobile devices used by the driver, rather than by any person inside the vehicle. The framework extracts sensor data from the smartphone, computes ad-hoc features and feeds them to a neural network. Different from prior work, we demonstrate that accurate detection can be achieved even using only one device by combining subsequent turns of the vehicle.","PeriodicalId":372377,"journal":{"name":"2019 IEEE 20th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132077460","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}
Ludovico Ferranti, Salvatore D’oro, Leonardo Bonati, Emrecan Demirors, F. Cuomo, T. Melodia
{"title":"HIRO-NET: Self-Organized Robotic Mesh Networking for Internet Sharing in Disaster Scenarios","authors":"Ludovico Ferranti, Salvatore D’oro, Leonardo Bonati, Emrecan Demirors, F. Cuomo, T. Melodia","doi":"10.1109/WoWMoM.2019.8793029","DOIUrl":"https://doi.org/10.1109/WoWMoM.2019.8793029","url":null,"abstract":"In this paper we present HIRO-NET, Heterogeneous Intelligent Robotic Network. HIRO-NET is an emergency infrastructure-less network tailored to address the problem of providing connectivity in the immediate aftermath of a natural disaster, where no cellular or wide area network is operational and no Internet access is available. HIRO-NET establishes a two-tier wireless mesh network where the Lower Tier connects nearby survivors in a self-organized mesh via Bluetooth Low Energy (BLE)and the Upper Tier creates long-range VHF links between autonomous robots exploring the disaster stricken area. HIRO-NET main goal is to enable users in the disaster to exchange text messages in order to share critical information and request help from first responders. The mesh network discovery problem is analyzed and a network protocol specifically designed to facilitate the exploration process is presented. We show how HIRO-NET robots successfully discover, bridge and interconnect local mesh networks. Results show that the Lower Tier always reaches network convergence and the Upper Tier can virtually extend HIRO-NET functionalities to the range of a small metropolitan area. In the event of an Internet connection still being available to some user, HIRO-NET is able to opportunistically share and provide access to low data-rate services (e.g. Twitter, Gmail)to the whole network. Results suggest that a temporary emergency network to cover a metropolitan area can be created in tens of minutes.","PeriodicalId":372377,"journal":{"name":"2019 IEEE 20th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123244908","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":"Energy Efficiency Enhancement in 5G Mobile Wireless Networks","authors":"Qi Zhao, M. Gerla","doi":"10.1109/WoWMoM.2019.8792998","DOIUrl":"https://doi.org/10.1109/WoWMoM.2019.8792998","url":null,"abstract":"In the era of 5G networks, smaller cell infrastructure with denser deployment of various kinds of base stations is leading the trend of the new generation of cellular networks. Benefits, such as higher throughput and lower latency, are driving people to perform further investigation and optimization while the energy efficiency aspect in 5G lacks enough attention. To enhance the energy efficiency of 5G and provide a green future cellular networks, we propose solutions to reduce the impact caused by several foreseen energy problems. We consider three scenarios from connection, communication and power perspectives, trying to minimize the energy consumption by either enforcing idle base stations to sleep or dynamically adjusting the signal range of base stations via software defined networking. Detailed discussion about scenarios and proposed solutions are presented though the simulation and evaluation are still on-going. More results will be presented in the near future.","PeriodicalId":372377,"journal":{"name":"2019 IEEE 20th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124891438","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":"PhD Forum: Resource Allocation and Task Offloading in Cloud-Assisted Wireless Networks","authors":"Ayman Younis, D. Pompili","doi":"10.1109/WoWMoM.2019.8792996","DOIUrl":"https://doi.org/10.1109/WoWMoM.2019.8792996","url":null,"abstract":"Our goal is to design, develop, and validate via computer simulations and testbed experiments novel resource allocation and computation offloading algorithms aimed at improving the spectral and energy efficiency in next generation cellular networks. To achieve this goal, we exploit the high degree of cooperation provided by Software-Defined Networking (SDN) and Network Function Virtualization (NFV) for cloud-assisted wireless networks, including Cloud Radio Access Network (C-RAN) and Mobile Edge Computing (MEC) infrastructures.","PeriodicalId":372377,"journal":{"name":"2019 IEEE 20th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122718490","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":"Autonomic Service Placement in Fog Computing","authors":"Paridhika Kayal, J. Liebeherr","doi":"10.1109/WoWMoM.2019.8792989","DOIUrl":"https://doi.org/10.1109/WoWMoM.2019.8792989","url":null,"abstract":"Fog computing recently emerged as novel distributed virtualized computing paradigm, where cloud services are extended to the edge of the network, thereby increasing network capacity and reducing latencies. In fog computing, applications are composed of building blocks, called microservices, that are mapped to edge computing and communication devices, referred to as fog nodes. A crucial component in fog computing are placement algorithms that assign microservices to fog nodes, since they determine the overall system performance in terms of energy consumption, communication costs, load balancing, and others. Placement strategies for virtual machines in cloud computing abound, but are generally centralized and therefore not well suited for decentralized fog systems. In this paper, we develop a fully distributed placement strategy that jointly optimizes energy consumption of fog nodes and communication costs of applications. We follow a Markov approximation approach for the design of a fully distributed autonomic service placement strategy without central coordination or global state information. Using numerical examples, we show that our placement algorithm finds solutions that are comparable to existing centralized solutions.","PeriodicalId":372377,"journal":{"name":"2019 IEEE 20th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"33 2-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116599388","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":"Optimizing mmWave Spatial Reuse: Signal-To-Interference Aware Beamtraining","authors":"Guillermo Bielsa, Adrian Loch, Joerg Widmer","doi":"10.1109/WoWMoM.2019.8792988","DOIUrl":"https://doi.org/10.1109/WoWMoM.2019.8792988","url":null,"abstract":"Both IEEE 802.15.3c and 802.11ad use the 60 GHz band for high datarate Wireless Personal/Local Area Network applications. These millimeter-wave communications use very directional antennas since the small wavelength allows to integrate many small antenna elements to form a beamforming antenna array, enabling very high spatial reuse as can be found in dense indoor and IoT settings. However, earlier work shows that current mmWave systems are not as directional as theory would suggest, with significant interference that may prevent spatial reuse. In this work, we propose a centralized system that allows the network to carry out the beamtraining process not only to maximize signal power, but also taking into account other stations in order to minimize interference. This system is designed to work with unmodified clients. We implement and validate our system on commercial off-the-shelf 60 GHz hardware, achieving an average throughput gain of 24.67% for TCP traffic, and up to a twofold throughput gain in specific cases.","PeriodicalId":372377,"journal":{"name":"2019 IEEE 20th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121147050","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}