{"title":"Design, simulation and measurement of an accurate wireless sensor network localization system","authors":"Philipp M. Glatz, C. Steger, R. Weiss","doi":"10.1145/1868612.1868614","DOIUrl":"https://doi.org/10.1145/1868612.1868614","url":null,"abstract":"Wireless sensor network (WSN) motes are devices of small form factor. Tailoring WSNs towards a specific application domain leads to resource constraints due to limited use of hardware and especially bandwidth and energy. Furthermore, system aspects of interaction of different components and services lead to a number of further non-functional constraints and especially timing and memory issues.\u0000 Though several resources of related work exist that are dealing with localization for WSNs, there are no suitable approaches yet for how to optimize 3D localization accuracy with subject to conserving real-time aspects, memory footprint and power dissipation at the same time. It has also not yet been described how 1D, 2D and 3D errors each relate to one another in experimentation.\u0000 We present an approach that allows designing, prototyping and improving scalable localization systems for mote-class devices. We implement a localization system on networks of Mica2 motes for which the 3D position accuracy error has been validated to be below 30 cm in real world settings.\u0000 The paper presents ways to model, simulate, implement and measure the system model, used components' power dissipation and energy balance impact, timing behavior, memory footprint, robustness and accuracy. Statistical means of simulation results' accuracy are compared to real-world measurements' statistics","PeriodicalId":311005,"journal":{"name":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124863674","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}
S. Shioda, Hiroto Iijima, Tamaki Nakamura, S. Sakata, Y. Hirano, T. Murase
{"title":"ACK pushout to achieve TCP fairness under the existence of bandwidth asymmetry","authors":"S. Shioda, Hiroto Iijima, Tamaki Nakamura, S. Sakata, Y. Hirano, T. Murase","doi":"10.1145/1868612.1868620","DOIUrl":"https://doi.org/10.1145/1868612.1868620","url":null,"abstract":"On a bandwidth asymmetric link, such as an ADSL cable or a wireless link over an IEEE802.11-based wireless LAN, TCP flows are likely either data bottlenecked or ACK bottlenecked, where a data (ACK) bottlenecked flow means the one whose ACK (data) segments are rarely lost but data (ACK) segments are frequently lost. The bandwidth asymmetry causes two types of unfairness problems. One is the unfairness between data- and ACK-bottlenecked flows; ACK bottlenecked flows obtain larger bandwidths than data bottlenecked flows. The other is the unfairness among ACK bottlenecked flows; some of ACK bottlenecked flows consume most of bandwidths. In this article, we propose a buffer management scheme, called the ACK pushout, in order to cope with the two types of unfairness problems simultaneously. To improve the unfairness between data- and ACK-bottlenecked flows, the ACK pushout simply removes an ACK segment from the buffer when a data segment arriving at the buffer finds that it is fully occupied. To improve the unfairness among ACK-bottlenecked flows, the ACK pushout discards one of ACK segments of the flow that has the largest number of ACKs in the buffer when an ACK segment arriving at the buffer finds that it is fully occupied. Through extensive simulation experiments by ns2, we verify that the ACK pushout greatly improves the fairness.","PeriodicalId":311005,"journal":{"name":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","volume":"42 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129961509","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":"Exploiting the distribution of distances between nodes to efficiently solve the localization problem in wireless sensor networks","authors":"Rodrigo S. C. Leão, V. Barbosa","doi":"10.1145/1868612.1868615","DOIUrl":"https://doi.org/10.1145/1868612.1868615","url":null,"abstract":"The localization problem is a central one in the field of wireless sensor networks, but despite the ingenuity of previous attempts at solution, developing an efficient and accurate localization method has remained essentially an open problem. This is so, in our view, because there has been a lack of theoretical results to support more solid advances. In this paper, we build on the semi-analytical approach we developed elsewhere, by exploiting its results regarding the relationship between Euclidean distances and hop distances in wireless sensor networks to improve on one of the most robust localization methods we know of, the well-known DV-hop. Our improvements result in better accuracy, reduced communication costs and local processing, as well as time and energy savings. The results we present are based on simulations through which we compare the new method with the original DV-hop. In addition to the new, more efficient localization method, we also provide a new perspective on the distance relationships, and thereby also contribute to furthering the establishment of a better theoretical understanding of the subject.","PeriodicalId":311005,"journal":{"name":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125933003","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}
Csaba Varga, L. Blázovics, W. Bamford, P. Zanaty, F. Fitzek
{"title":"Gedda-headz: social mobile networks","authors":"Csaba Varga, L. Blázovics, W. Bamford, P. Zanaty, F. Fitzek","doi":"10.1145/1868612.1868629","DOIUrl":"https://doi.org/10.1145/1868612.1868629","url":null,"abstract":"This paper introduces a social mobile network that is combining mobile casual gaming, location based services, social functionalities (chat, making friends, etc.), as well as music and video content. The cross-platform application is running on mobile phones supporting Java ME and iPhone. The paper is introducing the Gedda-Headz concept and looks into optimization towards energy consumption and spectrum usage to save money for the user.","PeriodicalId":311005,"journal":{"name":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128844029","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":"Snoop behaviour in multihop wireless networks","authors":"Prasad Nambiar, Hannan Xiao, J. Malcolm","doi":"10.1145/1868612.1868623","DOIUrl":"https://doi.org/10.1145/1868612.1868623","url":null,"abstract":"Snoop is one proposal for improving TCP throughput in wireless networks. We investigated the application of this protocol in wireless ad hoc networks and observed that a single hop in the ad hoc network experienced large variations in round trip time in a very short period. Without changes to the Snoop protocol to accommodate these dramatic RTT variations, Snoop was performing badly compared with regular TCP even when there were no packet losses or errors. The main cause for poor performance premature retransmissions performed by Snoop. We have modified the Snoop protocol to avoid these unnecessary retransmissions by having a higher local retransmission timeout. The results show us that Snoop benefits from this approach which has made a significant performance improvement over regular TCP in multihop wireless networks.","PeriodicalId":311005,"journal":{"name":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","volume":"56 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113937704","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":"Candidate selection algorithms in opportunistic routing","authors":"A. Darehshoorzadeh, Llorenç Cerdà-Alabern","doi":"10.1145/1868612.1868621","DOIUrl":"https://doi.org/10.1145/1868612.1868621","url":null,"abstract":"Opportunistic Routing (OR) has been investigated in recent years as a way to increase the performance of multi-hop wireless networks by exploiting its broadcast nature. In contrast to traditional routing, where traffic is sent along pre-determined paths, in OR an ordered set of candidates is selected for each next-hop. Upon each transmission, the candidates coordinate such that the most priority one receiving the packet actually forward it. Most of the research in OR has been addressed to investigate candidate selection algorithms. In this paper we compare a selected group of algorithms that have been proposed in the literature. Our main conclusion is that optimality is obtained at a high computational cost, with a performance gain very similar to that of much simpler but non optimal algorithms. Therefore, we conclude that fast and simple OR candidate selection algorithms may be preferable in dynamic networks, where the candidate sets are likely to be updated frequently.","PeriodicalId":311005,"journal":{"name":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115932820","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 failure diagnosis based topology reconfiguration scheme for ad hoc networks","authors":"Ye Ning, Zhiliang Zhu, Jun Liu, Wang Jue","doi":"10.1145/1868612.1868625","DOIUrl":"https://doi.org/10.1145/1868612.1868625","url":null,"abstract":"Ad Hoc networks are distributed self-organizing networks, whose topologies often encounter failures caused by node mobility and wireless links, which has negative impact to network performances. This paper proposed a topology reconfiguration scheme for Ad Hoc networks, which consists of topology reconfiguration triggering stage and topology reconfiguring stage. Three failure models are constructed for each kind of failure event respectively, and thus topology failures are located and diagnosed by failure probability comparison based on transformation between failure models. The connectivity of topology is recovered by increasing node transmitted power hop-by-hop within k-hop vicinity around failures. Topology control algorithm is used to generate an efficient topology with lower interference by adjusting node transmitted power to a proper level. Simulation results show that as network scale and topology changing frequency increase, topology failures can be located and diagnosed with high diagnosis accuracy. The connectivity of topology can be recovered and network performances such as reliability, invulnerability and efficiency are enhanced when encountering failures under the proposed topology reconfiguration scheme.","PeriodicalId":311005,"journal":{"name":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123491068","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":"Network coding: applications and implementations on mobile devices","authors":"F. Fitzek, M. Pedersen, J. Heide, M. Médard","doi":"10.1145/1868612.1868628","DOIUrl":"https://doi.org/10.1145/1868612.1868628","url":null,"abstract":"Network coding has attracted a lot of attention lately. The goal of this paper is to demonstrate that the implementation of network coding is feasible on mobile platforms. The paper will guide the reader through some examples and demonstrate uses for network coding. Furthermore the paper will also show that the implementation of network coding is feasible today on commercial mobile platforms.","PeriodicalId":311005,"journal":{"name":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115488986","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":"Unicast geographic routing protocols for inter-vehicle communications: a survey","authors":"Abdul Wahid, Hongseok Yoo, Dongkyun Kim","doi":"10.1145/1868612.1868616","DOIUrl":"https://doi.org/10.1145/1868612.1868616","url":null,"abstract":"Vehicular ad hoc network (VANET) is a new type of network that has promised countless applications including safety, comfort, infotainment, etc. The high mobility of vehicles in VANET makes routing protocol design a challenging task. Geographic routing is considered a suitable approach for VANET. The proposed geographic routing protocols for VANET, primarily, differ in the forwarding strategy. In this article we classify state-of-the-art unicast geographic routing protocols on the basis of forwarding strategies. We describe each protocol in terms of some qualitative metric. Finally the selected unicast geographic routing protocols are analyzed through a comparative discussion.","PeriodicalId":311005,"journal":{"name":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123650190","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}
Sihame El-Hammani, R. E. Azouzi, Khalil Ibrahimi, S. K. Samanta, E. Bouyakhf
{"title":"Mobility management and call admission control for IEEE 802.16e wireless networks","authors":"Sihame El-Hammani, R. E. Azouzi, Khalil Ibrahimi, S. K. Samanta, E. Bouyakhf","doi":"10.1145/1868612.1868624","DOIUrl":"https://doi.org/10.1145/1868612.1868624","url":null,"abstract":"The demand for wireless broadband access systems supporting mobility of the individual users has dramatically increased in recent years. Therefore, techniques for dynamically adapting the resources to the link condition become necessary for achieving high spectral efficiency. Our aim in this paper is to develop an admission control scheme that handles the intra-cell mobility issue in IEEE802.16e Wireless Networks with link adaptation. In particular we consider two types of intra-cell mobility: Low-mobility and High-mobility. We show how the admission threshold may adaptively controlled to achieve a better balance between guaranteing dropping probability and maximizing resource utilization. Simulation results show that the call admission control scheme under different types of mobility outperforms well by reserving amount of resource in order to provide an high priority of migration calls.","PeriodicalId":311005,"journal":{"name":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116538801","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}