{"title":"Collaborative system construction with networked appliances and networked sensors","authors":"T. Yamazaki, M. Yamauchi, Y. Tajika","doi":"10.1109/EMNETS.2005.1469111","DOIUrl":"https://doi.org/10.1109/EMNETS.2005.1469111","url":null,"abstract":"A collaborative system with networked appliances and networked sensors has been developed at a real-life testbed. The networked appliances are connected by the middleware that establishes a service using distributed function elements on the networked appliances. The networked sensors are connected by IEEE 802.15.4 and work collaboratively with the networked appliances. We show a prototype implementation of the collaborative system.","PeriodicalId":371563,"journal":{"name":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127697421","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":"SASHA: toward a self-healing hybrid sensor network architecture","authors":"T. Bokareva, N. Bulusu, S. Jha","doi":"10.1109/EMNETS.2005.1469101","DOIUrl":"https://doi.org/10.1109/EMNETS.2005.1469101","url":null,"abstract":"For widespread adoption of sensor technology, robustness in the event of abnormal behavior, such as a network intrusion or failures of components or nodes, is critical. Current research on robust and resilient sensor networking is focused on specific tasks - secure broadcast, secure aggregation, secure localization or fault-tolerant feature extraction. While these primitives provide useful functionality, what has been lacking is a comprehensive, holistic approach to sensor network robustness across various failure modalities. We propose a self-healing hybrid sensor network architecture, called SASHA, that is inspired by and coopts several mechanisms used by the acquired natural immune system to attain its autonomy, robustness, diversity and adaptability to unknown pathogens, and compactness. SASHA encompasses automatic fault recognition and response over a wide range of possible faults. Moreover, it is an adaptive architecture that can learn and evolve its monitoring and inference capabilities over time to deal with unknown faults. We illustrate the workings of SASHA using the example of fault-tolerant sensor data collection and outline an agenda for future research.","PeriodicalId":371563,"journal":{"name":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131189325","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":"The use of scalable source routing for networked sensors","authors":"T. Fuhrmann","doi":"10.1109/EMNETS.2005.1469115","DOIUrl":"https://doi.org/10.1109/EMNETS.2005.1469115","url":null,"abstract":"In this paper, we briefly present a novel routing algorithm, scalable source routing (SSR), which is capable of memory and message efficient routing in networks with 'random topology'. This algorithm enables sensor networks to use recent peer to-peer mechanisms from the field of overlay networks, like e.g. distributed hash tables and indirection infrastructures. Unlike other proposals along that direction, SSR integrates all necessary routing tasks into one simple, highly efficient routing protocol. Simulations demonstrate that in a small-world network with more than 100 000 nodes, SSR requires each node to only store routing data for 255 other nodes to establish routes between arbitrary pairs of nodes. These routes are on average only about 20-30% longer than the globally optimal path between these nodes.","PeriodicalId":371563,"journal":{"name":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134643037","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":"Controlling sensor density using mobility","authors":"Bin Zhang, G. Sukhatme","doi":"10.1109/EMNETS.2005.1469109","DOIUrl":"https://doi.org/10.1109/EMNETS.2005.1469109","url":null,"abstract":"We present a distributed deployment algorithm for a mobile sensor network which is able to deploy sensor nodes in a distribution proportional to a scalar field. The algorithm randomly partitions space into sufficiently small neighborhoods at each iteration. Within each neighborhood a redistribution process directed by a cluster head is enacted. We prove that after sufficiently many iterations, the distribution of nodes approaches the desired profile in the overall region. The algorithm is scalable to large network sizes, and is not restricted to planar domains. We show experimentally that the algorithm is noise tolerant.","PeriodicalId":371563,"journal":{"name":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127509074","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":"Constrained random sensor selection for application-specific data gathering in wireless sensor networks","authors":"Wook Choi, Sajal K. Das, H. Choe","doi":"10.1109/EMNETS.2005.1469106","DOIUrl":"https://doi.org/10.1109/EMNETS.2005.1469106","url":null,"abstract":"Due to the application-specific nature of sensor networks, sensing-quality control factors, such as coverage and delay, need to be parameterized in order to optimize energy conservation depending on the type of applications. An application-specific data gathering scheme is an example of such an application-specific algorithm design. In this scheme, only a minimum number of data reporters (sensors) are in each round randomly selected based on the desired sensing coverage (DSC) specified by the applications/users. In this paper, we investigate the use of the Poisson sampling technique which maintains a certain minimum distance between sampled points, to cope with an undesirable property that the selected data reporters may be located too closely. Then, based on this sampling technique we propose a constrained random sensor selection scheme, called CROSS. Inherently, the CROSS improves the spatial regularity of selected sensors, thus reducing the variance of the sensor covered area in each round. Consequently, the fidelity of meeting the DSC in each round improves. We present an algorithm to compute a desired minimum distance (DMD) to be forced between the selected sensors. Simulation results demonstrate that the DMD computed by our algorithm is almost optimal in terms of the improvement on the fidelity of meeting the DSC.","PeriodicalId":371563,"journal":{"name":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126205770","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":"Sensor networks for agent based distributed energy resources [cool room control example]","authors":"J. Ward, G. Platt","doi":"10.1109/EMNETS.2005.1469113","DOIUrl":"https://doi.org/10.1109/EMNETS.2005.1469113","url":null,"abstract":"We are developing agents for the control of distributed energy resources (DERS) in the electricity network. These resources consist of both generators and loads, physically located close to load centres. Although traditionally DERs have operated independently, we have been able to demonstrate an architecture whereby DERs collaborate to present an aggregated response. This aggregated response can be used to support the network at times of peak demand, increasing efficiency and robustness. In this paper, we focus on one such DER agent, which provides control of a commercial cool room. This agent utilizes a wireless sensor network to collect information on various products in the cool room, allowing the control system to respond based on aggregated conditions across the sensor network. Through development of new software and protocols, the sensor network is able to exist on the same control channel as traditional control hardware and provide extra reliability and fault tolerance.","PeriodicalId":371563,"journal":{"name":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133976573","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 neighbor join and link breakage detection for METX-based routing in wireless sensor networks","authors":"H. Wang, L. Ngoh, W. Seah, D. He","doi":"10.1109/EMNETS.2005.1469103","DOIUrl":"https://doi.org/10.1109/EMNETS.2005.1469103","url":null,"abstract":"In this paper, we present fast neighbor join and fast link breakage detection schemes to enhance the minimal expected transmission (METX)-based routing scheme reported recently (Woo et al. (2003)). Current METX-based routing scheme uses a link estimator named window mean with exponential weighted moving average (WMEWMA) (Woo et al. (2003)), which is relatively slow in neighbor join and delete, thus affecting the way the network adapts to the dynamic of links. To solve this problem, we propose a fast neighbor join and a fast link breakage detection scheme. The fast join scheme can turn on the links with good quality rapidly while the fast link breakage detection scheme shortens the time to identify the broken link. Through extensive simulation we show that the two schemes work well together with the WMEWMA estimator and therefore improve the performance of routing in a dynamic environment.","PeriodicalId":371563,"journal":{"name":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115815954","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. Tynan, Gregory M. P. O'Hare, D. Marsh, D. O'Kane
{"title":"Interpolation for wireless sensor network coverage","authors":"R. Tynan, Gregory M. P. O'Hare, D. Marsh, D. O'Kane","doi":"10.1109/EMNETS.2005.1469107","DOIUrl":"https://doi.org/10.1109/EMNETS.2005.1469107","url":null,"abstract":"One of the primary issues for any wireless sensor network (WSN) deployment is that of longevity of the network. The lifespan of the network must be maximized while maintaining the quality of the sensory data received from the network. Most current solutions for achieving this require the definition of a sensing radius for each sensor together with a coverage level k. The sensed area is covered if every point within the area is inside the sensing radius of at least k sensors. When some points are covered by more than k sensors, it may be possible to instruct the surplus sensors to enter a low power sleep mode. This will conserve the energy of the network while maintaining the required coverage level. In. this paper we propose a novel alternative to this approach based on interpolation. If the sensor network is capable of interpolating the sensed medium at a given sensor's location to a specified accuracy or higher, then we propose that this sensor is redundant and can be put into sleep mode. We demonstrate our approach using live sensory data.","PeriodicalId":371563,"journal":{"name":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121640813","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}
Ian Mccauley, Brett Matthews, Liz Nugent, Andrew Mather, Julie Simons Pirvic
{"title":"Wired pigs: ad-hoc wireless sensor networks in studies of animal welfare","authors":"Ian Mccauley, Brett Matthews, Liz Nugent, Andrew Mather, Julie Simons Pirvic","doi":"10.1109/EMNETS.2005.1469096","DOIUrl":"https://doi.org/10.1109/EMNETS.2005.1469096","url":null,"abstract":"The potential for the use of ad-hoc wireless sensor network technology in experimental investigations in animal welfare was explored in a study of the effect of the immediate environment on the body temperature of pigs. Sensors to simultaneously measure core and surface temperature were implanted in four pigs and monitored for a week using the open source application, TinyDB. Concurrently, a network of environmental sensors measuring predominantly temperature and humidity was placed around the pigs and this network was managed and monitored using a commercial package, Sensicast Developers Version (Sensicast DV). Approximately 100000 data points were gathered during the study. It was found to be significantly easier to develop, deploy and maintain the sensor network using Sensicast DV, and that there were significant problems when TinyDB was faced with large amounts of frequent sampling. However, TinyDB provided greater flexibility than Sensicast DV in its capacity to support more sensor platforms.","PeriodicalId":371563,"journal":{"name":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129542567","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":"Cluster-based congestion control for supporting multiple classes of traffic in sensor networks","authors":"K. Karenos, V. Kalogeraki, S. Krishnamurthy","doi":"10.1109/EMNETS.2005.1469105","DOIUrl":"https://doi.org/10.1109/EMNETS.2005.1469105","url":null,"abstract":"In wireless sensor networks, multiple flows from data collecting sensors to an aggregating sink could traverse paths that are largely interference coupled. These interference effects manifest themselves as congestion, and cause high packet loss and arbitrary packet delays. This is particularly problematic in event-based sensor networks where some flows are of greater importance than others and require fidelity in terms of higher packet delivery and timeliness. In this paper we present COMUT (congestion control for multi-class traffic), a distributed cluster-based mechanism for supporting multiple classes of traffic in sensor networks. COMUT is based on the self-organization of the network into clusters each of which autonomously and proactively monitors congestion within its localized scope. The clusters then exchange appropriate information to facilitate system wide rate control. Our simulation results demonstrate that our techniques are highly effective in dealing with multiple, randomly initiated flows.","PeriodicalId":371563,"journal":{"name":"The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132227813","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}