{"title":"Real time Haptic data transferring","authors":"G. Kokkonis, K. Psannis, M. Roumeliotis","doi":"10.1109/WD.2016.7461507","DOIUrl":"https://doi.org/10.1109/WD.2016.7461507","url":null,"abstract":"The improvement of the Internet's network conditions have made possible for the real time Haptic data transferring over the Internet. With the word Haptic we refer to the sense of touch that the user feels when he uses a Haptic service. This paper deals with the transfer of real time Haptic data over the Internet. It presents the related work on Haptic data transferring. It outlines the Haptic data transmission characteristics and the necessary QoS requirements for the maximization of the Quality of Experience for Haptic users. It describes a proposed Haptic system architecture. It analyses the metrics that have to be taken into consideration for the evaluation of Haptic transferring. It also presents experiments for real time Haptic data transferring that have been carried out by the authors through different networks and locations.","PeriodicalId":435963,"journal":{"name":"2016 Wireless Days (WD)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116692157","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":"Traffic-adaptive duty cycle adaptation in TR-MAC protocol for wireless sensor networks","authors":"S. Morshed, Mitra Baratchi, G. Heijenk","doi":"10.1109/WD.2016.7461501","DOIUrl":"https://doi.org/10.1109/WD.2016.7461501","url":null,"abstract":"The Medium Access Control (MAC) layer can influence the energy consumption of a wireless sensor network (WSN) to a significant level. TR-MAC is an energy-efficient preamble sampling based MAC protocol for low power WSNs suitable for low data rate and low duty cycle scenario. However, low data rate is not always maintained in wireless sensor networks which often have to deal with event-driven scenarios where a sudden event rapidly increases traffic load within the network. In this paper we propose a traffic-adaptive duty cycle adaptation mechanism in order to provide responsiveness to traffic rate variations for TR-MAC protocol. This mechanism increases throughput and decreases packet delay while maintaining energy-efficiency without any extra information exchange among the sensor nodes in the network.","PeriodicalId":435963,"journal":{"name":"2016 Wireless Days (WD)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128586714","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":"Social-aware clustering for wireless ad hoc networks","authors":"Luís Conceição, M. Curado","doi":"10.1109/WD.2016.7461488","DOIUrl":"https://doi.org/10.1109/WD.2016.7461488","url":null,"abstract":"Clustering is a widely used solution to provide routing scalability in wireless ad hoc networks. The design of clustering schemes is a complex problem due to the dynamic nature of this type of networks. This work proposes a Social-aware Clustering Scheme (SoCS) based on link history to improve the performance of clustering management operations. Each node maintains a history of past links with neighbour nodes with the prospect of improving the performance of future cluster formations. SoCS was evaluated with the Social Network Theory (SNT) mobility model, analysing clustering, routing and traffic performance. Obtained results demonstrate an overall significant improvement, proving that social-awareness is a quality attribute in a clustering scheme.","PeriodicalId":435963,"journal":{"name":"2016 Wireless Days (WD)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129004049","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":"Fragment retransmission scheme with enhanced collision avoidance for energy-efficient IEEE 802.11 WLANs","authors":"Prosper Mafole, M. Kissaka, M. Aritsugi","doi":"10.1109/WD.2016.7461475","DOIUrl":"https://doi.org/10.1109/WD.2016.7461475","url":null,"abstract":"In IEEE 802.11 based wireless local area networks (WLANs), channel induced errors and collisions cause transmission failures which waste bandwidth and energy. To improve the energy efficiency of battery powered mobile devices we propose a scheme which mitigates channel induced errors and collisions by using two ideas namely, backoff-free fragment retransmission and collision-free transmission schedules, respectively. Performance evaluation using ns-3 showed that the proposed scheme outperforms existing schemes in energy efficiency, throughput and delay.","PeriodicalId":435963,"journal":{"name":"2016 Wireless Days (WD)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130609768","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}
F. G. Ortíz, C. López, M. A. Hernández, Alberto Miranda, J. Matías
{"title":"Laboratory tests of ATSC M/H commercial receivers","authors":"F. G. Ortíz, C. López, M. A. Hernández, Alberto Miranda, J. Matías","doi":"10.1109/WD.2016.7461503","DOIUrl":"https://doi.org/10.1109/WD.2016.7461503","url":null,"abstract":"In Mexico, the adopted standard for Digital Terrestrial Television is ATSC (A/53), which uses 8-VSB modulation. In addition, ATSC M/H (A/153) is the standard for Mobile and Handheld Television, which also uses 8-VSB but with several improvements in channel coding. Mexico recently lived the analog to digital television transition, for this reason the performance of some ATSC M/H commercial receivers was studied in this work. The objective of these laboratory tests was to evaluate the performance of the receivers for different FEC configurations and different Doppler frequencies, following the ATSC A/174 Recommendation issued in 2011. Also, the degradation of C/N threshold for some typical mobile reception channel models and SFN conditions was evaluated.","PeriodicalId":435963,"journal":{"name":"2016 Wireless Days (WD)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125570105","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":"Towards quality of service for long-range IoT in unlicensed radio spectrum","authors":"C. Pham","doi":"10.1109/WD.2016.7461450","DOIUrl":"https://doi.org/10.1109/WD.2016.7461450","url":null,"abstract":"The flexibility of long-range transmission comes at the cost of stricter legal regulations where duty-cycle approaches limits a transmitter to 1% duty-cycle in the general case. To provide better surveillance service guarantee we propose an activity time sharing mechanism for a pool of devices deployed by a single organization. Devices that need to go beyond the activity time limitation can borrow activity time from other devices. The proposed mechanism has been implemented as a library that can easily be integrated into existing projects.","PeriodicalId":435963,"journal":{"name":"2016 Wireless Days (WD)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131465756","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":"Machine-to-machine communications over the Internet of Things: Private Wi-Fi access prospects","authors":"Mohamed Anis, Y. Gadallah, Hadia M. Elhennawy","doi":"10.1109/WD.2016.7461484","DOIUrl":"https://doi.org/10.1109/WD.2016.7461484","url":null,"abstract":"Machine-to-machine (M2M) applications are expected to be the main traffic contributors through the Internet of Things (IoT) paradigm. One of the most prevalent communication access technologies is Wi-Fi. While open Wi-Fi hotspots can be easily used by M2M communications of static or mobile devices, this is not the case for private Wi-Fi installations that are normally secured against unauthorized access. In this study, we explore the possibility of enabling machine type communication devices (MTCDs) for Internet access through private Wi-Fi networks. We discuss the system architecture, main functional elements and the possibility for compensating network owners for such access.","PeriodicalId":435963,"journal":{"name":"2016 Wireless Days (WD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131812401","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":"Maximally pair-wise disjoint set covers for directional sensors in visual sensor networks","authors":"Shahla Farzana, Khaleda Akther Papry, Ashikur Rahman, Raqeebir Rab","doi":"10.1109/WD.2016.7461479","DOIUrl":"https://doi.org/10.1109/WD.2016.7461479","url":null,"abstract":"Directional sensors in visual sensor networks (VSNs) spend most of their energy for two major tasks: sensing and communication. As sensing regions of directional sensors often overlap, the sensing task can be rotationally scheduled among different sensors. Thus, efficient scheduling of directional sensors became one of the fundamental interesting problems attracting many researchers over the past decade. One possible scheduling scheme can be achieved by partitioning the directional sensors into a maximal number of disjoint set covers each of which is capable of monitoring all the targets using minimal number of sensors. The derived set covers can be activated successively in a round robin fashion. As a result, the larger the number of disjoint sets, the longer the lifetime of the network. Moreover, fault tolerance can be easily achieved by activating more than one set covers at the same time. In this paper, we solve the problem of finding maximum possible disjoint set covers using minimal number of directional sensors. We formulate the problem as an Integer Linear Programming (ILP) problem. The ILP partitions the sensors into optimum number of disjoint set covers. As ILP does not scale well over large problem instances, we design a new target oriented heuristic and modify couple of existing heuristics for generating near-optimal disjoint set covers. We compare the performance of all three heuristics using extensive simulations.","PeriodicalId":435963,"journal":{"name":"2016 Wireless Days (WD)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114408559","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":"A dynamic rate adaptation algorithm using WB E-model for voice traffic over LTE network","authors":"D. Nguyen, Hang Nguyen","doi":"10.1109/WD.2016.7461490","DOIUrl":"https://doi.org/10.1109/WD.2016.7461490","url":null,"abstract":"This paper presents a dynamic adaptation algorithm of joint source-channel code rate for enhancing voice transmission over LTE network. In order to assess the speech quality, we use the Wideband (WB) E-model. In this model, both end-to-end delay and packet loss are taken into account. The goal of this paper is to find out the best suboptimal solution for improving voice traffic over LTE network with some constraints on allowed maximum end-to-end delay, allowed maximum packet loss and minimum required bandwidth. The best suboptimal choice is channel code rate corresponding to each mode of the AMR-WB codec that minimizes redundant bits generated by channel coding with an acceptable MOS reduction. Besides, this algorithm can be integrated with rate control in AMR-WB codec to offer the required mode of LTE network. Our results show that the MOS degradation is not significant, but the percent of reduced redundant bits to be very considerable. This will requires less bandwidth, thus, more mobile users can be served. The algorithm has simple computational operations, it can be applied to realtime voice communications.","PeriodicalId":435963,"journal":{"name":"2016 Wireless Days (WD)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114440964","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":"A novel dynamic secure combinatorial key approach for differentiated heterogeneous WSNs","authors":"Wael Hosny Fouad Aly","doi":"10.1109/WD.2016.7461446","DOIUrl":"https://doi.org/10.1109/WD.2016.7461446","url":null,"abstract":"The goal of this paper is to construct an dynamic secure combinatorial keying approach. We focus on heterogeneous mobile wireless sensor network environments. The proposed approach is called dynamic secure combinatorial keying approach (DSCKAD). Most of the previous work on WSN security focuses on homogeneous motes. In homogeneous WSN, sensors have the same resource specifications such as battery life time in addition to memory capacity. Approaches designed for these networks are complex. In this work, we use three types of sensors. We classify them into gold, silver and bronze motes based on the battery life time for each category. DSCKAD uses exclusion basis system to improve the overall performance. DSCKAD outperforms other similar reference approaches in terms of security and local communication connectivity.","PeriodicalId":435963,"journal":{"name":"2016 Wireless Days (WD)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126932088","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}