I. Khoufi, E. Livolant, P. Minet, Mohamed Hadded, A. Laouiti
{"title":"Optimized trajectory of a robot deploying wireless sensor nodes","authors":"I. Khoufi, E. Livolant, P. Minet, Mohamed Hadded, A. Laouiti","doi":"10.1109/WD.2014.7020826","DOIUrl":"https://doi.org/10.1109/WD.2014.7020826","url":null,"abstract":"Mobile robots can be used to deploy static wireless sensor nodes to achieve the coverage and connectivity requirements of the applications considered. Many solutions have been provided in the literature to compute the set of locations where the sensor nodes should be placed. In this paper, we show how this set of locations can be used by a mobile robot to optimize its tour to deploy the sensor nodes to their right locations. In order to reduce both the energy consumed by the robot, its exposure time to a hostile environment, as well as the time at which the wireless network becomes operational, the optimal tour of the robot is this minimizing the delay. This delay must take into account not only the time needed by the robot to travel the tour distance but also the time spent in the rotations performed by the robot each time it changes its direction. This problem is called the Robot Deploying Sensor nodes problem, in short RDS. We first show how this problem differs from the well-known traveling salesman problem. We then propose an integer linear program formulation of the RDS problem. We propose various algorithms relevant to iterative improvement by exchanging tour edges, genetic approach and hybridization. The solutions provided by these algorithms are compared and their closeness to the optimal is evaluated in various configurations.","PeriodicalId":311349,"journal":{"name":"2014 IFIP Wireless Days (WD)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129072263","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":"Wireless contacts, Facebook friendships and interests: Analysis of a multi-layer social network in an academic environment","authors":"Annalisa Socievole, F. Rango, Antonio C. Caputo","doi":"10.1109/WD.2014.7020819","DOIUrl":"https://doi.org/10.1109/WD.2014.7020819","url":null,"abstract":"Human mobility traces have drawn increasing attention in recent years due to their usefulness for constructing mobility models and evaluating mobile opportunistic communication systems. Even if human mobility provides us insights into the social behavior of mobile users, there is a growing awareness that human sociality is expressed simultaneously on multiple layers. The multilayered complex network composed by the social network constructed on wireless contacts and other types of social network layers needs still to be analyzed and understood in depth. In this paper, we describe the experiment we performed in a campus environment to trace the wireless contacts in terms of Bluetooth encounters, occurring between nodes inside and outside the group of experimenters carrying smartphones, and to gather the profiles, Facebook friendships, and interests of the participants. By analyzing the multilayer social network constructed on this dataset, we contribute to novel understanding of human behavior at different social dimensions. We study the relationship between offline encounters detected through mobile devices, Facebook friendships and shared interests in terms of closeness between the corresponding social graphs, matching between strong offline ties and the other social ties, and similarity between communities. We show that Bluetooth contacts network layer and Facebook friendships network layer are similar.","PeriodicalId":311349,"journal":{"name":"2014 IFIP Wireless Days (WD)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131040283","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":"Disaster detection in magnetic induction based wireless sensor networks with limited feedback","authors":"S. Kisseleff, I. Akyildiz, W. Gerstacker","doi":"10.1109/WD.2014.7020824","DOIUrl":"https://doi.org/10.1109/WD.2014.7020824","url":null,"abstract":"The use of magnetic induction (MI) based transmissions in challenging environments has been investigated in various works. Recently, a system model has been proposed, which explains how the MI based transmission channel depends on the chosen system parameters. In order to make the system robust against environmental changes, the system parameters like resonance frequency and modulation scheme need to be properly adapted to the current channel state. It is frequently assumed, that perfect channel state information (CSI) is available at the transmitter and at the receiver. However, in practical systems this knowledge may not always be easily acquired. In addition, a permanent feedback signaling is needed in order to update the CSI at the transmitter, which usually causes interference to the surrounding devices and reduces the energy efficiency. In this paper, we investigate the potential of a recently proposed approach for channel estimation within the MI transmitter circuit without explicit feedback signaling of CSI. This technique seems promising especially for disaster detection in wireless underground sensor networks, which is the main focus of this work.","PeriodicalId":311349,"journal":{"name":"2014 IFIP Wireless Days (WD)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133266723","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}
J. Rubio-Loyola, Loreto Gonzalez-Hernandez, L. Díez, Ramón Agüero, J. Serrat
{"title":"An energy-oriented optimization algorithm for solving the cell assignment problem in 4G-LTE communication networks","authors":"J. Rubio-Loyola, Loreto Gonzalez-Hernandez, L. Díez, Ramón Agüero, J. Serrat","doi":"10.1109/WD.2014.7020851","DOIUrl":"https://doi.org/10.1109/WD.2014.7020851","url":null,"abstract":"This paper presents a novel algorithm for solving the cell assignment problem with special emphasis on energy awareness. The algorithm aims at finding the minimum number of base stations (BSs) that have to be turned on to guarantee the required service to the maximum number of users at lowest cost. The main contribution of the algorithm is the design of an effective solution that ensures an optimal assignment in a subset of base stations N ⊆ N resulting in a drastic reduction of the search space within every subset N, eliminating the exponential growth over the number of users M, i.e. reducing the complexity from O(NM) to O(1). A branch-and-bound approach has been designed to determine the optimal base station assignments. Experiments demonstrate that our solution performs as expected in terms of profit, served clients, and energy savings due to active BSs, at the expense of very reasonable execution time overhead.","PeriodicalId":311349,"journal":{"name":"2014 IFIP Wireless Days (WD)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122510892","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":"FREAK DTN: Frequency Routing, Encounters And Keenness for DTN","authors":"Patrice Raveneau, E. Chaput, R. Dhaou, A. Beylot","doi":"10.1109/WD.2014.7020831","DOIUrl":"https://doi.org/10.1109/WD.2014.7020831","url":null,"abstract":"Mobile systems monitoring is an application area for Mobile Wireless Sensor Networks (MWSN), which introduces some specific challenges. Delay/Disruption architecture tackles some of these issues, such as delay and connectivity disruptions, and thus has already been used in this context. However, WSN nodes have severe limitations, concerning storage and processing capabilities. This performance problem has not been investigated as it deserves and this is the purpose of this paper. We propose the FREAK scheme which aims at reducing the computation while performance remains high. This scheme relies on the mean frequency of past encounter with the base station. Transmissions are driven by this metric. The FREAK solution is keen because we assume that future can be predicted from the past events. We also analyse the acknowledgements effects on performance. Our proposition is evaluated through simulations based on real traces. FREAK is compared to several replication and quota-based mainstream DTN solutions and achieves quite better performance in realistic scenarios.","PeriodicalId":311349,"journal":{"name":"2014 IFIP Wireless Days (WD)","volume":"19 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120845963","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}
Xiaofei Zhang, J. Akré, Sébastien Baey, A. Fladenmuller, B. Kervella, Mario Antonio Zancanaro, M. Fonseca
{"title":"Towards localization of RFID tags based on experimental analysis of RSSI","authors":"Xiaofei Zhang, J. Akré, Sébastien Baey, A. Fladenmuller, B. Kervella, Mario Antonio Zancanaro, M. Fonseca","doi":"10.1109/WD.2014.7020829","DOIUrl":"https://doi.org/10.1109/WD.2014.7020829","url":null,"abstract":"RFID has been developed for many applications such as object identification, object traceability, geometric localization, etc. In order to locate an object labeled by a tag, several characteristics of the tag responses have been studied. This yielded theoretical models whose accuracy is not sufficient in practice for targeted applications. In this paper, we investigate how to localize a tag based on the set of received signal strength indicator (RSSI) values measured for a large range of transmission powers. Using an extensive measurement campaign, we establish that the RSSI is a linear function of the transmission power of the RFID reader. Moreover, a minimum transmission power is necessary for activating the tag which also depends on its localization. As a result, the statistics of the RSSI for different transmission powers may be synthetized through a triple. We then show how this triple may be exploited for localizing a tag.","PeriodicalId":311349,"journal":{"name":"2014 IFIP Wireless Days (WD)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128395327","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":"Limiting the interest-packet forwarding in information-centric wireless mesh networks","authors":"D. M. Mascarenhas, I. Moraes","doi":"10.1109/WD.2014.7020794","DOIUrl":"https://doi.org/10.1109/WD.2014.7020794","url":null,"abstract":"This paper proposes three mechanisms in order to reduce the broadcast storm problem in information-centric wireless mesh networks. The first one defines a probability to forward interest packets. The second one limits the number of interest packets forwarded based on the number of previous forwarding actions of these packets. The third one is a hybrid approach that combines the forwarding criteria of the two previous mechanisms. The performance of a information-centric wireless mesh networks is evaluated with the three proposed mechanisms and also with the default forwarding mechanism. The performance of such network is also compared with the one provided by a wireless mesh network based on the TCP/IP stack running the OLSR protocol. Results show the proposed mechanisms provide a delivery rate four times higher than the one provided by OLSR. In addition, our proposals outperform the default forwarding mechanism by up to 19% in terms of data delivery rate in dense scenarios with high number of hops between source and destination.","PeriodicalId":311349,"journal":{"name":"2014 IFIP Wireless Days (WD)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125504397","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}
M. Marotta, C. Both, Juergen Rochol, L. Granville, L. Tarouco
{"title":"Evaluating management architectures for Internet of Things devices","authors":"M. Marotta, C. Both, Juergen Rochol, L. Granville, L. Tarouco","doi":"10.1109/WD.2014.7020811","DOIUrl":"https://doi.org/10.1109/WD.2014.7020811","url":null,"abstract":"The Internet of Things (IoT) is foreseen as a global network infrastructure that provides wireless communication among any kind of objects. One immediate challenge holds: how to manage these objects, considering that they may have limited computational resources. This management can be achieved through the use of gateways, i.e., devices that intermediate wireless communications, minimizing resource consumption of the restrained objects. The communication between gateways and objects can be performed over many architectures. Among these architectures, we highlight the Simple Network Management Protocol (SNMP), the Service Oriented Architecture (SOA), and the Resource Oriented Architecture (ROA). However, there is a lack of deeper investigations to define which is the best architecture to model the communication between gateways and objects. Therefore, the main contribution of this paper is a quantitative evaluation of SNMP, SOA, and ROA as means for the communication between gateways and objects. Results analysis pointed ROA as the most interesting architecture to model the management communication.","PeriodicalId":311349,"journal":{"name":"2014 IFIP Wireless Days (WD)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126356652","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 GPS-less on-demand mobile sink-assisted data collection in wireless sensor networks","authors":"N. R. Zema, N. Mitton, G. Ruggeri","doi":"10.1109/WD.2014.7020847","DOIUrl":"https://doi.org/10.1109/WD.2014.7020847","url":null,"abstract":"The autonomous data collector is a role recently introduced to improve the performance of Wireless Sensor Networks. When a prompt response for data processing and offloading is necessary, i.e. in the case of event-driven networks, a mobile flying sink could be a good option for that role. In this paper, we introduce FreeFall, a distributed algorithm for the autonomous navigation of a mobile collector through a WSN for on-demand data offloading that does not rely on an absolute coordinate system. We show that, under fairly common circumstances, it is possible to set the trajectory of the mobile sink and fulfill the offloading requests without the needs of additional equipment installed on nodes.We show how our system is preferable over more classical routing solutions especially in the presence of localized generation of large amounts of information.","PeriodicalId":311349,"journal":{"name":"2014 IFIP Wireless Days (WD)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129066243","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":"Multi-Frame s-Persistent Neighbor Discovery strategy in DTNs with resource-constrained RFID devices","authors":"Danilo Amendola, N. Cordeschi, F. Rango","doi":"10.1109/WD.2014.7020841","DOIUrl":"https://doi.org/10.1109/WD.2014.7020841","url":null,"abstract":"In this work a Multi-Frame Neighbor Discovery Protocol in DTNs over a RFID devices is proposed. Our approach, which is based on a Sift-distribution (we named it s-Persistent) function, takes Single-Frame and Multi-Frame scenarios into consideration. Our s-Persistent approach is applied in a simulated test and in a real test-bed in order to see the effectiveness of the proposal in comparison with a well-known technique such as p-Persistent protocol. Therefore Performance Evaluation has been considered in terms of number of discovered neighbors under different numbers of nodes and frames, moreover we regarded an intra-frame time evaluation. Obtained results show that our solution performs better than p-Persistent, increasing the number of discovered neighbors with better results in intra-frame time evolution.","PeriodicalId":311349,"journal":{"name":"2014 IFIP Wireless Days (WD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131046096","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}