Pub Date : 2013-10-21DOI: 10.1109/LCNW.2013.6758546
M. Elich, P. Velan, Tomás Jirsík, Pavel Čeleda
The exhaustion of IPv4 address space increases pressure on network operators and content providers to continue the transition to IPv6. The IPv6 transition mechanisms such as Teredo and 6to4 allow IPv4 hosts to connect to IPv6 hosts. On the other hand, they increase network complexity and render ineffective many methods to observe IP traffic. In this paper, we modified our flow-based measurement system to involve transition mechanisms information to provide full IPv6 visibility. Our traffic analysis focuses on IPv6 tunneled traffic and uses data collected over one week in the Czech national research and education network. The results expose various traffic characteristics of native and tunneled IPv6 traffic, among others the TTL and HOP limit distribution, geolocation aspect of the traffic, and list of Teredo servers used in the network. Furthermore, we show how the traffic of IPv6 transition mechanisms has evolved since 2010.
{"title":"An investigation into teredo and 6to4 transition mechanisms: Traffic analysis","authors":"M. Elich, P. Velan, Tomás Jirsík, Pavel Čeleda","doi":"10.1109/LCNW.2013.6758546","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758546","url":null,"abstract":"The exhaustion of IPv4 address space increases pressure on network operators and content providers to continue the transition to IPv6. The IPv6 transition mechanisms such as Teredo and 6to4 allow IPv4 hosts to connect to IPv6 hosts. On the other hand, they increase network complexity and render ineffective many methods to observe IP traffic. In this paper, we modified our flow-based measurement system to involve transition mechanisms information to provide full IPv6 visibility. Our traffic analysis focuses on IPv6 tunneled traffic and uses data collected over one week in the Czech national research and education network. The results expose various traffic characteristics of native and tunneled IPv6 traffic, among others the TTL and HOP limit distribution, geolocation aspect of the traffic, and list of Teredo servers used in the network. Furthermore, we show how the traffic of IPv6 transition mechanisms has evolved since 2010.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129359964","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758506
Shadi Janansefat, K. Akkaya, I. Senturk, Michael Gloff
In recent years, a lot of studies proposed to introduce mobility capability to sensor nodes in order to exploit the advantages of mobility in Wireless Sensor Networks (WSNs) applications. In particular, the idea has been exploited heavily to restore connectivity in disjoint WSNs. While the studies demonstrated various capabilities of the proposed connectivity algorithms via simulation, real node and testbed implementations were mostly lacking due to unavailability of proper hardware and/or high robot costs. Since this may hinder the direct applicability of the algorithms in realistic settings, testbeds which can be constructed with low-cost and commercial-off-the-shelf (COTS) hardware are required for realistic evaluations of the connectivity restoration algorithms. To this end, in this paper, we first design a low-cost mobile sensor network (MSN) testbed using iRobot-based mobile nodes. We integrate commercially available iRobot Create platform with IRIS sensor motes to design a new mobile sensor node called iRobotSense. Using a network of iRobotSense nodes, we then implement one of the widely used connectivity restoration algorithms, namely PADRA, on this testbed. The evaluations revealed several factors that need to be taken into consideration in the design and development of connectivity restoration algorithms which were not considered in simulation-based evaluations. We revise several components of PADRA based on the feedback received from the testbed experiments.
{"title":"Rethinking connectivity restoration in WSNs using feedback from a low-cost mobile sensor network testbed","authors":"Shadi Janansefat, K. Akkaya, I. Senturk, Michael Gloff","doi":"10.1109/LCNW.2013.6758506","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758506","url":null,"abstract":"In recent years, a lot of studies proposed to introduce mobility capability to sensor nodes in order to exploit the advantages of mobility in Wireless Sensor Networks (WSNs) applications. In particular, the idea has been exploited heavily to restore connectivity in disjoint WSNs. While the studies demonstrated various capabilities of the proposed connectivity algorithms via simulation, real node and testbed implementations were mostly lacking due to unavailability of proper hardware and/or high robot costs. Since this may hinder the direct applicability of the algorithms in realistic settings, testbeds which can be constructed with low-cost and commercial-off-the-shelf (COTS) hardware are required for realistic evaluations of the connectivity restoration algorithms. To this end, in this paper, we first design a low-cost mobile sensor network (MSN) testbed using iRobot-based mobile nodes. We integrate commercially available iRobot Create platform with IRIS sensor motes to design a new mobile sensor node called iRobotSense. Using a network of iRobotSense nodes, we then implement one of the widely used connectivity restoration algorithms, namely PADRA, on this testbed. The evaluations revealed several factors that need to be taken into consideration in the design and development of connectivity restoration algorithms which were not considered in simulation-based evaluations. We revise several components of PADRA based on the feedback received from the testbed experiments.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124907474","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758537
Guillaume Jourjon, O. Mehani, T. Rakotoarivelo
One-click file hosting systems (1-CFHS) have become a prominent means to exchange files across the Internet. Studies have previously identified that a lot of the hosted content is infringing on its owner's copyright, and some of the most well know 1-CFHSs have been taken offline as a result of this. In this paper, we present a pilot study of how links to, and copies of, such content are exchanged via online forums. We have crawled and parsed pages fromfour of themost prominent sites over a period of a few months in order to extract URLs to these items. These URLs have then been periodically tested until they became unavailable in order to derive the lifespan of these copies on various 1-CFHS. We find that URLs are mostly posted once, presumably by their creators, and that unauthorised content on 1-CFHSs has an availability expectancy of about 40 days before being taken down.We propose an initial simple life-and-death model for such content in the form of a Markov chain. We also show that the 1-CFHS market is still unstable, with most of the past leader services having disappeared from the current charts.
{"title":"Insights of file-sharing system forums","authors":"Guillaume Jourjon, O. Mehani, T. Rakotoarivelo","doi":"10.1109/LCNW.2013.6758537","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758537","url":null,"abstract":"One-click file hosting systems (1-CFHS) have become a prominent means to exchange files across the Internet. Studies have previously identified that a lot of the hosted content is infringing on its owner's copyright, and some of the most well know 1-CFHSs have been taken offline as a result of this. In this paper, we present a pilot study of how links to, and copies of, such content are exchanged via online forums. We have crawled and parsed pages fromfour of themost prominent sites over a period of a few months in order to extract URLs to these items. These URLs have then been periodically tested until they became unavailable in order to derive the lifespan of these copies on various 1-CFHS. We find that URLs are mostly posted once, presumably by their creators, and that unauthorised content on 1-CFHSs has an availability expectancy of about 40 days before being taken down.We propose an initial simple life-and-death model for such content in the form of a Markov chain. We also show that the 1-CFHS market is still unstable, with most of the past leader services having disappeared from the current charts.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114461392","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758502
Sean Purdon, B. Kusy, R. Jurdak, Geoffrey Challen
Optimal control of Heating, Ventilation, and Air Conditioning (HVAC) is an important step towards reducing the carbon footprint of buildings and requires balancing energy reductions and occupant comfort. Conventional thermostats for temperature set points provide a centralised single point of user input, often leading to significant thermal discomfort for occupants. We propose to instead include users in the HVAC control loop through distributed smart-phone based votes about their thermal comfort for aggregated control of HVAC. Unlike existing approaches that require in-situ sensors or build complex comfort models of individual users, we propose a model- and sensor-free HVAC control algorithm that uses simple user input (hot/cold) and adapts to changing office occupancy or ambient temperature in real time. We develop an iterative data fusion algorithm that finds optimal temperature in offices with multiple users and propose techniques that can aggressively save energy by drifting indoor temperatures towards the outdoor temperature. Our evaluation is based on empirical data collected in 12 offices over a 3-week period and shows that adaptive HVAC control can save up to 60% of energy at a relatively small increase of 0.3°C in average occupant discomfort.
{"title":"Model-free HVAC control using occupant feedback","authors":"Sean Purdon, B. Kusy, R. Jurdak, Geoffrey Challen","doi":"10.1109/LCNW.2013.6758502","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758502","url":null,"abstract":"Optimal control of Heating, Ventilation, and Air Conditioning (HVAC) is an important step towards reducing the carbon footprint of buildings and requires balancing energy reductions and occupant comfort. Conventional thermostats for temperature set points provide a centralised single point of user input, often leading to significant thermal discomfort for occupants. We propose to instead include users in the HVAC control loop through distributed smart-phone based votes about their thermal comfort for aggregated control of HVAC. Unlike existing approaches that require in-situ sensors or build complex comfort models of individual users, we propose a model- and sensor-free HVAC control algorithm that uses simple user input (hot/cold) and adapts to changing office occupancy or ambient temperature in real time. We develop an iterative data fusion algorithm that finds optimal temperature in offices with multiple users and propose techniques that can aggressively save energy by drifting indoor temperatures towards the outdoor temperature. Our evaluation is based on empirical data collected in 12 offices over a 3-week period and shows that adaptive HVAC control can save up to 60% of energy at a relatively small increase of 0.3°C in average occupant discomfort.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122048902","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758520
Dustin Maas, Joey Wilson, Neal Patwari
The ability for special operations forces (SOF) to rapidly deploy a through-building tracking system upon arrival at a tactical operation, e.g., a hostage scenario, and thereby estimate the approximate locations of the people within the building has the potential to lower the risk of the operation and save lives. We study the feasibility of a rapidly deployed radio frequency (RF)-based tomographic imaging (RTI) system for use in tactical operations by Special Weapons and Tactics (SWAT) and other SOF, in which several low-power radio devices are placed around a building and used to image and track the motion of humans inside the building. Specifically, we identify and study the constraints of this application, such as the need for the sensor network to self-localize and self-calibrate with minimal input from the SOF. We implement and test, in a wide variety of experimental deployments, a real-time RTI tracking system which adheres to these constraints and provides valuable situational intelligence. We work in concert with local law enforcement and SWAT in order to obtain valuable feedback from end users. We show that our system is capable of providing useful tracking information (average errors of less than two meters) even when the self-localization results are inaccurate (up to three meters average error).
{"title":"Toward a rapidly deployable radio tomographic imaging system for tactical operations","authors":"Dustin Maas, Joey Wilson, Neal Patwari","doi":"10.1109/LCNW.2013.6758520","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758520","url":null,"abstract":"The ability for special operations forces (SOF) to rapidly deploy a through-building tracking system upon arrival at a tactical operation, e.g., a hostage scenario, and thereby estimate the approximate locations of the people within the building has the potential to lower the risk of the operation and save lives. We study the feasibility of a rapidly deployed radio frequency (RF)-based tomographic imaging (RTI) system for use in tactical operations by Special Weapons and Tactics (SWAT) and other SOF, in which several low-power radio devices are placed around a building and used to image and track the motion of humans inside the building. Specifically, we identify and study the constraints of this application, such as the need for the sensor network to self-localize and self-calibrate with minimal input from the SOF. We implement and test, in a wide variety of experimental deployments, a real-time RTI tracking system which adheres to these constraints and provides valuable situational intelligence. We work in concert with local law enforcement and SWAT in order to obtain valuable feedback from end users. We show that our system is capable of providing useful tracking information (average errors of less than two meters) even when the self-localization results are inaccurate (up to three meters average error).","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129848038","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758498
V. Sivaraman, James Carrapetta, Ke Hu, Blanca Gallego Luxan
This paper describes our experiences with building and deploying a low-cost participatory system for urban air pollution monitoring in Sydney. Though air pollution imposes significant health costs on the urban community globally, today's published data on pollution concentrations is spatially too sparse, and does not allow for sufficiently accurate estimation of exposures for (potentially mobile) individuals in order to make medical inferences. The HazeWatch project described in this paper uses several low-cost mobile sensor units attached to vehicles to measure air pollution concentrations, and users' mobile phones to tag and upload the data in real time. The greater spatial granularity of data thus collected enables creation of pollution maps of metropolitan Sydney viewable in real-time over the web, as well as personalized apps that show the individual's exposure history and allow for route planning to reduce future exposure. We share the insights we obtained from building and trialling such a system in Sydney, and highlight challenges that can be addressed collaboratively by groups developing similar systems world-wide.
{"title":"HazeWatch: A participatory sensor system for monitoring air pollution in Sydney","authors":"V. Sivaraman, James Carrapetta, Ke Hu, Blanca Gallego Luxan","doi":"10.1109/LCNW.2013.6758498","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758498","url":null,"abstract":"This paper describes our experiences with building and deploying a low-cost participatory system for urban air pollution monitoring in Sydney. Though air pollution imposes significant health costs on the urban community globally, today's published data on pollution concentrations is spatially too sparse, and does not allow for sufficiently accurate estimation of exposures for (potentially mobile) individuals in order to make medical inferences. The HazeWatch project described in this paper uses several low-cost mobile sensor units attached to vehicles to measure air pollution concentrations, and users' mobile phones to tag and upload the data in real time. The greater spatial granularity of data thus collected enables creation of pollution maps of metropolitan Sydney viewable in real-time over the web, as well as personalized apps that show the individual's exposure history and allow for route planning to reduce future exposure. We share the insights we obtained from building and trialling such a system in Sydney, and highlight challenges that can be addressed collaboratively by groups developing similar systems world-wide.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129241970","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758538
S. Alcock, R. Nelson
Open-source payload-based traffic classifiers are frequently used as a source of ground truth in the traffic classification research field. However, there have been no comprehensive studies that provide evidence that the classifications produced by these software tools are sufficiently accurate for this purpose. In this paper, we present the results of an investigation into the accuracy of four open-source traffic classifiers (L7 Filter, nDPI, libprotoident and tstat) using packet traces captured while using a known selection of common Internet applications, including streaming video, Steam and World of Warcraft. Our results show that nDPI and libprotoident provide the highest accuracy among the evaluated traffic classifiers, whereas L7 Filter is unreliable and should not be used as a source of ground truth.
{"title":"Measuring the accuracy of open-source payload-based traffic classifiers using popular Internet applications","authors":"S. Alcock, R. Nelson","doi":"10.1109/LCNW.2013.6758538","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758538","url":null,"abstract":"Open-source payload-based traffic classifiers are frequently used as a source of ground truth in the traffic classification research field. However, there have been no comprehensive studies that provide evidence that the classifications produced by these software tools are sufficiently accurate for this purpose. In this paper, we present the results of an investigation into the accuracy of four open-source traffic classifiers (L7 Filter, nDPI, libprotoident and tstat) using packet traces captured while using a known selection of common Internet applications, including streaming video, Steam and World of Warcraft. Our results show that nDPI and libprotoident provide the highest accuracy among the evaluated traffic classifiers, whereas L7 Filter is unreliable and should not be used as a source of ground truth.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115568520","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758496
Sebastian Zöller, Markus Wachtel, F. Knapp, R. Steinmetz
The logistics domain constitutes a promising application area for wireless sensor network technology. Wireless sensor nodes can be deployed for example in containers or trucks' load areas to monitor environmental parameters relevant to the condition of transported goods in real time. Exploiting their computation and communication capabilities, wireless sensor nodes can locally detect the occurrence of critical situations, so-called events, and send corresponding alarm messages to responsible decision makers via the network and corresponding gateway nodes in real time. Within this paper, we present a fully working solution and corresponding prototypical implementation of how such real-time monitoring and event detection can be realized in a context-dependent and user-specific way. As such a system requires transmitting alarm messages and sensor data from the wireless sensor network deployment to users' backend systems, we furthermore explore means to interconnect wireless sensor nodes and smartphones. In particular, we present findings from field tests concerning the link quality of such connections for different technological approaches for which we realized prototypical implementations.
{"title":"Going all the way - Detecting and transmitting events with wireless sensor networks in logistics","authors":"Sebastian Zöller, Markus Wachtel, F. Knapp, R. Steinmetz","doi":"10.1109/LCNW.2013.6758496","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758496","url":null,"abstract":"The logistics domain constitutes a promising application area for wireless sensor network technology. Wireless sensor nodes can be deployed for example in containers or trucks' load areas to monitor environmental parameters relevant to the condition of transported goods in real time. Exploiting their computation and communication capabilities, wireless sensor nodes can locally detect the occurrence of critical situations, so-called events, and send corresponding alarm messages to responsible decision makers via the network and corresponding gateway nodes in real time. Within this paper, we present a fully working solution and corresponding prototypical implementation of how such real-time monitoring and event detection can be realized in a context-dependent and user-specific way. As such a system requires transmitting alarm messages and sensor data from the wireless sensor network deployment to users' backend systems, we furthermore explore means to interconnect wireless sensor nodes and smartphones. In particular, we present findings from field tests concerning the link quality of such connections for different technological approaches for which we realized prototypical implementations.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131939340","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758522
M. Elkhodr, S. Shahrestani, Hon Cheung
The Internet of Things (IoT) has the potential to transform our daily lives and societies. This is, at least in part, due to its massively distributed and ubiquitous nature. To realize the benefits of the IoT, security and privacy issues associated with the use of the IoT need to be identified and addressed properly. In this paper, our focus is on protecting the privacy of the users of location-based services in the IoT. To achieve this protection, we propose a context-aware adaptive approach for general devices in the IoT, where the general devices are used by users in accessing the location-based services. The proposed approach is based on developing and utilizing an agent to manage location privacy in the context of requested network-based services. The results of an experiment conducted to show the effectiveness and efficiency of this approach are also reported.
{"title":"A contextual-adaptive Location Disclosure Agent for general devices in the Internet of Things","authors":"M. Elkhodr, S. Shahrestani, Hon Cheung","doi":"10.1109/LCNW.2013.6758522","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758522","url":null,"abstract":"The Internet of Things (IoT) has the potential to transform our daily lives and societies. This is, at least in part, due to its massively distributed and ubiquitous nature. To realize the benefits of the IoT, security and privacy issues associated with the use of the IoT need to be identified and addressed properly. In this paper, our focus is on protecting the privacy of the users of location-based services in the IoT. To achieve this protection, we propose a context-aware adaptive approach for general devices in the IoT, where the general devices are used by users in accessing the location-based services. The proposed approach is based on developing and utilizing an agent to manage location privacy in the context of requested network-based services. The results of an experiment conducted to show the effectiveness and efficiency of this approach are also reported.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130984126","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}
Pub Date : 2013-10-01DOI: 10.1109/LCNW.2013.6758504
Dang-Hai Hoang, T. Strufe, Thieu Nga Pham, Hong-Ngoc Hoang, Chung-Tien Nguyen, Van Tho Tran, Immanuel Schweizer
This paper presents a smart data forwarding method based on adaptive levels in order to collect data in a wide area with a limited number of sensors in wireless sensor networks (WSNs). WSN nodes move on predefined trajectories. In comparison to other works, each WSN node is assigned an adaptive level, which is frequently updated based on levels and weights of other neighbor nodes. Measured data will be forwarded from nodes with higher levels on the outermost trajectories to nodes with lower levels on inner trajectories, until they reach the center. The proposed method has been tested with eight sensor nodes and one base station to cover an area of 14.6 km2 of an urban district of Hanoi City.
{"title":"A smart data forwarding method based on adaptive levels in wireless sensor networks","authors":"Dang-Hai Hoang, T. Strufe, Thieu Nga Pham, Hong-Ngoc Hoang, Chung-Tien Nguyen, Van Tho Tran, Immanuel Schweizer","doi":"10.1109/LCNW.2013.6758504","DOIUrl":"https://doi.org/10.1109/LCNW.2013.6758504","url":null,"abstract":"This paper presents a smart data forwarding method based on adaptive levels in order to collect data in a wide area with a limited number of sensors in wireless sensor networks (WSNs). WSN nodes move on predefined trajectories. In comparison to other works, each WSN node is assigned an adaptive level, which is frequently updated based on levels and weights of other neighbor nodes. Measured data will be forwarded from nodes with higher levels on the outermost trajectories to nodes with lower levels on inner trajectories, until they reach the center. The proposed method has been tested with eight sensor nodes and one base station to cover an area of 14.6 km2 of an urban district of Hanoi City.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126898788","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：