{"title":"Smart data collection in large scale sparse WSNs","authors":"Ali Sayyed, G. Araújo, L. Becker","doi":"10.1109/WMNC.2016.7543923","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543923","url":null,"abstract":"Mobile wireless sensor networks (MWSNs), a special class of WSN in which one or more elements of the network is mobile, has been extensively studied over the past 15 years. In MWSNs, mobility plays an important role in improving the performance of the network in terms of connectivity, lifetime, and data collection. We exploit controlled mobility to develop a smart data collection scheme in MWSNs. We consider a sensor network where static nodes are deployed and organized into clusters on the basis of distance from each other. These nodes sense their environment and transmit data to their corresponding cluster heads, which in turn send it to a mobile data collector (MDC) when it is in communication range. In this paper, we first show the factors affecting the data collection process of MDC in such an environment. We then present an adaptive algorithm and control parameters that the MDC uses for autonomously controlling its motion. These parameters allow the speed of the MDC to be adjusted at run time in order to adaptively improve the data collection process. Built-in intelligence helps our system adapting to the changing requirements of data collection. Our scheme shows significant advantages for sparsely deployed, large scale sensor networks and heterogeneous networks (where sensors have variable sampling rates). The simulation results show a significant increase in data collection rate and reduction in the overall time and number of laps that the MDC spends for data gathering.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130163086","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":"Efficient QoS-aware heterogeneous architecture for energy-delay constrained connected objects","authors":"M. Doudou, Tifenn Rault, A. Bouabdallah","doi":"10.1109/WMNC.2016.7543924","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543924","url":null,"abstract":"Connected objects such as smart phones and wireless sensors becomes very attractive for our assisted daily life applications, because it offers continuous monitoring capability of both personal and environmental parameters. However, these systems still face a major energy issue that prevent their wide adoption. Indeed, continuous sampling and communication tasks quickly deplete sensors and gateways battery reserves, and frequent battery replacement are not convenient. One solution to address such a challenge consists in minimizing the activation of radio interfaces and switching between them in order to achieve very low duty cycle. In this paper, we propose a new efficient communication architecture for patient supervision in the context of healthcare application making use of dual radio. At runtime, our solution determines the optimal interval parameters of switching on/off each radio interfaces in order to minimize the energy consumption of both sensors and mobile phones while satisfying the QoS requirements. The proposed solution is adequately analyzed and numerically compared against a solution without QoS. The results show that our proposed architecture exhibits better duty-cycle reduction while satisfying the delay constraints.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121441910","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":"Hybrid On-demand greedy routing protocol with backtracking for Mobile Ad-Hoc Networks","authors":"Baban A. Mahmood, A. Ibrahim, D. Manivannan","doi":"10.1109/WMNC.2016.7543977","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543977","url":null,"abstract":"On-demand routing protocols for Mobile Ad Hoc Networks (MANETs) have been extensively studied. Generally, on-demand routing protocols establish routes by flooding route requests throughout the entire network, which is not a scalable approach. On the other hand, geographic routing protocols do not establish route a priory but route data packets in a greedy fashion towards the destination. When a packet encounters a void (i.e., a node that has no neighbor that is closer to the destination than itself), it is routed around the void using various strategies such as constructing a planarized network graph and then using right hand rule to route around the void. In this paper, we present an on-demand routing protocol which uses greedy approach for route request propagation during route establishment. When the route request encounters a void, it simply uses backtracking to forward the route request around the void without requiring the construction of planarized network graph to round around the void. We compare the performance of our protocol with the well known Ad-Hoc On-demand Distance Vector (AODV) routing protocol which has over twenty thousand citations. Simulation results show that our protocol has a higher packet-delivery ratio, lower control overhead, and less hop count on average than AODV.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127380677","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":"Mathematical model for scheduling in IEEE 802.11ad networks","authors":"E. Khorov, A. Ivanov, A. Lyakhov, Vitaly Zankin","doi":"10.1109/WMNC.2016.7543983","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543983","url":null,"abstract":"Wireless networks are replacing cables not only when providing Internet access, but also in such scenarios as multimedia transmission and high performance computing, which require extremely high data rates. Although millimetre waves open the door for multigigabit communications at the PHY layer, these rates do not guarantee an adequate Quality of Service (QoS) at the application layer. In order to improve QoS when serving multimedia flows in an IEEE 802.11ad network, a station (STA) can reserve a sequence of time intervals by means of a new reservation-based channel access mechanism. However, the IEEE 802.11ad amendment provides no recommendation on choosing such positions and durations of the reserved intervals which guarantee required QoS. This problem is significantly complicated by the erroneous nature of wireless channels so that the amount of the reserved channel time should account for possible retransmissions. To solve the problem, we develop a mathematical model of multimedia flow transmission with reserved time intervals over an erroneous channel in an IEEE 802.11ad network. We use the model as a basis for a scheduling method which allocates time intervals in such a way that the QoS requirements of the flow are satisfied with the minimum channel time consumption.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126682568","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}
E. Atxutegi, F. Liberal, Karl-Johan Grinnemo, A. Brunström, Å. Arvidsson, Remi Robert
{"title":"TCP behaviour in LTE: Impact of flow start-up and mobility","authors":"E. Atxutegi, F. Liberal, Karl-Johan Grinnemo, A. Brunström, Å. Arvidsson, Remi Robert","doi":"10.1109/WMNC.2016.7543932","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543932","url":null,"abstract":"Mobile Internet has been widely adopted and it is expected to rise to almost 4 billion users by 2020. Despite the research effort dedicated to the enhancement of its performance, there still exists a gap in the understanding of how TCP and its many variants work over LTE. To this end, this paper evaluates the extent to which five common TCP variants, CUBIC, NewReno, Westwood+, Illinois, and CAIA Delay Gradient (CDG), are able to utilise available radio resources under hard conditions, such as during start-up and in mobile scenarios at different speeds. The paper suggests that CUBIC, due to its Hybrid Slow-Start mechanism, enters congestion avoidance prematurely, and thus experiences a prolonged start-up phase. As a result, it is unable to efficiently utilise radio resources during shorter transmission sessions. Besides, CUBIC, Illinois and NewReno, i.e., the loss-based TCP implementations, offer better throughput, and are able to better utilise available resources during mobility than Westwood+ and CDG - the delay-based variants do.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128677161","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":"Randomized policy for transmission scheduling in cognitive wireless sensor networks","authors":"H. Abu-Ghazaleh, A. Alfa","doi":"10.1109/WMNC.2016.7543986","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543986","url":null,"abstract":"Cognitive wireless sensor networks exploit the spectrum heterogeneity and dynamically accesses the different spectrum bands based on the wireless medium conditions and permissions. The various spectrum access schemes proposed in the previous work have limited such access to a single spectrum band at any given time. This limitation may be insufficient for networks with a large number of nodes that are exchanging high volumes of data. In this paper, we propose a probabilistic transmission scheduling policy that allow the sensor nodes to transmit their data simultaneously across a multiple number of spectrum bands. We further present a mathematical model to analyze the performance of the sensor nodes that employ the proposed scheduling policy. The model can also be utilized for determining the optimal decision policies and parameters.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134620583","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. Karaca, S. Bastani, B. Priyanto, Mohammadhassan Safavi, B. Landfeldt
{"title":"Resource management for OFDMA based next generation 802.11 WLANs","authors":"M. Karaca, S. Bastani, B. Priyanto, Mohammadhassan Safavi, B. Landfeldt","doi":"10.1109/WMNC.2016.7543930","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543930","url":null,"abstract":"Recently, IEEE 802.11ax Task Group has adapted OFDMA as a new technique for enabling multi-user transmission. It has been also decided that the scheduling duration should be same for all the users in a multi-user OFDMA so that the transmission of the users should end at the same time. In order to realize that condition, the users with insufficient data should transmit null data (i.e. padding) to fill the duration. While this scheme offers strong features such as resilience to Overlapping Basic Service Set (OBSS) interference and ease of synchronization, it also poses major side issues of degraded throughput performance and waste of devices' energy. In this work, for OFDMA based 802.11 WLANs we first propose practical algorithm in which the scheduling duration is fixed and does not change from time to time. In the second algorithm the scheduling duration is dynamically determined in a resource allocation framework by taking into account the padding overhead, airtime fairness and energy consumption of the users. We analytically investigate our resource allocation problems through Lyapunov optimization techniques and show that our algorithms are arbitrarily close to the optimal performance at the price of reduced convergence rate. We also calculate the overhead of our algorithms in a realistic setup and propose solutions for the implementation issues.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125195547","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}