{"title":"A DTN Routing and Buffer Management Strategy for Message Delivery Delay Optimization","authors":"Tuan Le, H. Kalantarian, M. Gerla","doi":"10.1109/WMNC.2015.11","DOIUrl":"https://doi.org/10.1109/WMNC.2015.11","url":null,"abstract":"Delay Tolerant Networks (DTNs) are sparse mobile ad-hoc networks in which there is typically no complete path between the source and destination. To increase the reliability of message delivery, multi-copy routing is often used at the expense of high buffer and bandwidth overhead. While much work has been done in the design of forwarding algorithms, little work has focused on studying forwarding under the presence of resource constraints such as short contact durations and small buffers. In this paper, we investigate a multi-copy routing strategy and a buffer management policy that minimize the average message delivery delay in DTN networks with resource constraints. We focus on three key issues: (1) to which next hop relay node should messages be replicated, (2) in which order should messages be replicated when contact duration and forwarding bandwidth are limited, and (3) which messages should be dropped first when the buffer is full. We propose to forward a message to a neighboring node with the least expected minimum delay among all possible routes to the message's destination. For the second and third issue, we develop a utility function using global network information to compute per-packet average delay utility. Messages are then scheduled and dropped according to their utility values. Extensive simulation results based on the real-world San Francisco cab trace show that our proposed scheme can deliver messages in up to 30% less time than existing schemes, while still achieving a high delivery ratio.","PeriodicalId":240086,"journal":{"name":"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"441 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127606323","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":"Lightweight Indoor Localization System","authors":"Mihai Bâce, Y. Pignolet","doi":"10.1109/WMNC.2015.22","DOIUrl":"https://doi.org/10.1109/WMNC.2015.22","url":null,"abstract":"Indoor localization is an important topic for context aware applications. In particular, many applications for wireless devices can benefit from knowing the location of a user. Despite the huge effort from the research community to solve the localization problem, there is no widely accepted solution for localization in an indoor environment. In this paper we focus on constrained devices and propose an extremely lightweight indoor localization system that can be scaled to different devices, from smart phones to smart glasses and other devices. We devise a simple yet effective WiFi-based system with low computational complexity, which does not need any additional special infrastructure nor map or an internet connection. Our system relies on IEEE 802.11 Received Signal Strength Indicator (RSSI) values and a dead reckoning module to collect walking trajectories which are further clustered and compressed to build a sensor map. The key novelty of our work is a merging algorithm that can fuse multiple sensor maps. We evaluate our system in a real world scenario and we show that using the map produced by our merging algorithm we achieve room-level accuracy. Our system is also comparable to state of the art systems, despite the lightweight approach.","PeriodicalId":240086,"journal":{"name":"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115453509","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":"Fast Information Exchange in Proximity-Based Multichannel Wireless Networks","authors":"A. Gonga, Themistoklis Charalambous, M. Johansson","doi":"10.1109/WMNC.2015.24","DOIUrl":"https://doi.org/10.1109/WMNC.2015.24","url":null,"abstract":"This paper considers the problem of distributed neighbor discovery in multi-channel wireless networks. We propose a protocol in which nodes randomly select a channel and decide whether to transmit or listen for neighbor discovery beacons. When nodes transmit, they use epidemic information dissemination to spread knowledge about all the nodes they have discovered so far. Theoretical guarantees on discovery times are complemented by extensive simulations and practical implementations. The evaluations show that multi-channel communication effectively reduces the number of collisions between nodes in the network (especially in dense networks) and that epidemic information dissemination yields both significant speed-ups and increased resilience to packet losses. Finally, we also show that our protocol compares favorably to previously proposed solutions in the literature.","PeriodicalId":240086,"journal":{"name":"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117252988","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}
R. Agliamzanov, Ö. Gürcan, A. Belbachir, K. Yıldırım
{"title":"Robust and Efficient Self-Adaptive Position Tracking in Wireless Embedded Systems","authors":"R. Agliamzanov, Ö. Gürcan, A. Belbachir, K. Yıldırım","doi":"10.1109/WMNC.2015.25","DOIUrl":"https://doi.org/10.1109/WMNC.2015.25","url":null,"abstract":"Apart from static deployments, sensor nodes in Wireless Sensor Networks (WSNs) are unaware of their location information. In order to estimate their actual or relative positions with respect to other nodes, they are required to self-localize themselves by collecting information from their environment. However, due to the high dynamism and the noise introduced by the WSN environment, self-localization procedures are not straightforward and they may require quite sophisticated algorithmic techniques to satisfy precision requirements of the WSN applications. Among the self-localization procedures in the literature, the ones based upon the technique of trilateration are easy to implement and efficient in terms of resource requirements. On the other hand, their performance is fragile against environmental dynamics. Besides, even though multilateration based procedures are reported to be more robust, their practicability in WSNs seems questionable due to their high resource requirements. In this paper, our objective is to develop a practical self-localization procedure for WSNs that puts away the fragility against noisy ranging measurements in an efficient manner. To that end, we take a different approach to self-localization procedure and treat it as a search process during which sensor nodes find their relative positions without knowing the actual correct values. We present a novel trilateration-based self-localization procedure by exploiting a robust and efficient search technique, named Adaptive Value Tracking (AVT), that finds and tracks a dynamic searched value in a given search space through successive feedbacks. We evaluate this procedure on a real test bed setup and show that our approach to self-localization is efficient, robust to environmental dynamics and adaptive in the sense of reacting to position changes.","PeriodicalId":240086,"journal":{"name":"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128463599","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 Cognitive-Based Ego Network Detection System for Mobile Social Networking","authors":"M. Mordacchini, A. Passarella, M. Conti","doi":"10.1109/WMNC.2015.35","DOIUrl":"https://doi.org/10.1109/WMNC.2015.35","url":null,"abstract":"In future generation mobile systems information about social networking structures of users will be fundamental, being a key element for social networking applications, and a crucial contextual information for personalising the behaviour of mobile applications/services. In this paper, we focus specifically on the detection of ego networks. They are networks formed by an individual (ego) and all the other people she has a social relationship with. We propose a completely decentralised algorithm that allows each user's mobile device to identify the structure of its user's ego network. The algorithm monitors social interaction patterns between the ego and its peers. It is completely decentralised and runs at each individual node using local information only, scaling with the network size. It does not disclose social interaction patterns, and it is able to dynamically detect changes in the structure of the ego network, being self-adaptive. The algorithm is based on social cognitive heuristics, i.e. Models about how the human brain groups social relationships, described in the cognitive psychology literature. Therefore, our approach reproduces - in users' personal mobile devices - the cognitive processes used by their human users to understand their ego networks' structure. We test it on real datasets of interactions corresponding to (i) physical contacts and (ii) exchange of information in online social networks. We show that in both cases the detected social structures are remarkably consistent with those described in the social sciences literature. In addition, we study the dynamic behaviour of the algorithm, highlighting how such structures evolve dynamically over time.","PeriodicalId":240086,"journal":{"name":"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133373918","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":"VANET-based Intersection Control with a Throughput/Fairness Tradeoff","authors":"M. Pasin, B. Scheuermann, Rafael Fão de Moura","doi":"10.1109/WMNC.2015.37","DOIUrl":"https://doi.org/10.1109/WMNC.2015.37","url":null,"abstract":"Efficient intersection control represents a major challenge in traffic management, as it can contribute to reducing traffic congestion and travel times. Communicating vehicles, for instance using VANETs, open up new opportunities for intersection control, providing fairness and throughput to transportation networks. In this paper, we are interested in the tradeoffs between fairness and throughput in intersection control. Our key contributions are (i) novel intersection control algorithms which consider both fairness and throughput, and (ii) a simulative evaluation which compares these algorithms with other solutions. We evaluate the algorithms in a comparative simulation study, using microscopic traffic simulation and considering different traffic demands.","PeriodicalId":240086,"journal":{"name":"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133247776","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 Integrated Security Framework for Access Control and Address Auto-Configuration for MANETs","authors":"Ehab E. Zakaria, H. Hamza, I. Saroit","doi":"10.1109/WMNC.2015.18","DOIUrl":"https://doi.org/10.1109/WMNC.2015.18","url":null,"abstract":"As mobile ad-hoc networks (MANETs) continue to receive an increasing attention in research due to its vast amount of applications, security is becoming one of the main research challenges. Most of the proposed research in MANET security focused on secure routing and key management. In this paper, we propose an access control mechanism with features that is inherited to produce a secure address auto-configuration scheme providing a framework that guarantee access control and secure address auto-configuration for MANET nodes utilizing the concepts of identity-based cryptography and threshold secret sharing. Our mechanism provides key management service without any assumption of a prefixed trust relationship between nodes, which effectively resolves the problem of single point of failure in the traditional public key infrastructure. Simulations showed that the proposed architecture enhance QoS level compared to the existing approaches that aims to provide only access control or address auto-configuration separately. With a similar or a lower cost, our integrated approach enhanced MANET security and performance.","PeriodicalId":240086,"journal":{"name":"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126579665","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}
Shugo Kajita, H. Yamaguchi, T. Higashino, Hirofumi Urayama, M. Yamada, M. Takai
{"title":"Throughput and Delay Estimator for 2.4GHz WiFi APs: A Machine Learning-Based Approach","authors":"Shugo Kajita, H. Yamaguchi, T. Higashino, Hirofumi Urayama, M. Yamada, M. Takai","doi":"10.1109/WMNC.2015.30","DOIUrl":"https://doi.org/10.1109/WMNC.2015.30","url":null,"abstract":"This paper reports our recent result in designing a function for autonomous APs to estimate throughput and delay of its clients in 2.4GHz WiFi channels to support those APs' dynamic channel selection. Our function takes as inputs the traffic volume and strength of signals emitted from nearby interference APs as well as the target AP's traffic volume. By this function, the target AP can estimate throughput and delay of its clients without actually moving to each channel, it is just required to monitor IEEE802.11 MAC frames sent or received by the interference APs. The function is composed of an SVM-based classifier to estimate capacity saturation and a regression function to estimate both throughput and delay in case of saturation in the target channel. The training dataset for the machine learning is created by a highly-precise network simulator. We have conducted over 10,000 simulations to train the model, and evaluated using additional 2,000 simulation results. The result shows that the estimated throughput error is less than 10%.","PeriodicalId":240086,"journal":{"name":"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116786701","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}
Pavlos Basaras, L. Maglaras, Dimitrios Katsaros, H. Janicke
{"title":"A Robust Eco-Routing Protocol against Malicious Data in Vehicular Networks","authors":"Pavlos Basaras, L. Maglaras, Dimitrios Katsaros, H. Janicke","doi":"10.1109/WMNC.2015.27","DOIUrl":"https://doi.org/10.1109/WMNC.2015.27","url":null,"abstract":"Vehicular networks have a diverse range of applications that vary from safety, to traffic management and comfort. Vehicular communications (VC) can assist in the ecorouting of vehicles in order to reduce the overall mileage and CO2 emissions by the exchange of data among vehicle-entities. However, the trustworthiness of these data is crucial as false information can heavily affect the performance of applications. Hence, the devising of mechanisms that reassure the integrity of the exchanged data is of utmost importance. In this article we investigate how tweaked information originating from malicious nodes can affect the performance of a real time eco-routing mechanism that uses Dedicated Short Ranged Communications (DSRC), namely Erou Ve. We improve the routing decision mechanism of the original algorithm and also develop and evaluate defense mechanisms that exploit vehicular communications in order to filter out tweaked data. We prove that our proposed mechanisms can restore the performance of the Erou Ve to near its optimal operation and can be used as a basis for protecting other similar traffic management systems.","PeriodicalId":240086,"journal":{"name":"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130937658","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}