{"title":"无线传感器领域移动sink的学习强制时域路由","authors":"Pritam Baruah, Rahul Urgaonkar, B. Krishnamachari","doi":"10.1109/LCN.2004.71","DOIUrl":null,"url":null,"abstract":"We propose a learning-based approach to efficiently and reliably route data to a mobile sink in a wireless sensor field. Specifically, we consider a mobile sink that does not know when to query or does not need to query. Furthermore, the sink moves in a certain pattern within the sensor field. Such a sink passively listens for incoming data that distant source sensors unilaterally push towards it. Unlike traditional routing mechanisms, our technique takes the time-domain explicitly into account, with each node involved making the decision \"at this time what is the best way to forward the packet to the sink?\". In the presented scheme, motes (nodes in the vicinity of the sink) learn its movement pattern over time and statistically characterize it as a probability distribution function. Having obtained this information at the motes, our scheme uses reinforcement learning to locate the sink efficiently at any point of time.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"88","resultStr":"{\"title\":\"Learning-enforced time domain routing to mobile sinks in wireless sensor fields\",\"authors\":\"Pritam Baruah, Rahul Urgaonkar, B. Krishnamachari\",\"doi\":\"10.1109/LCN.2004.71\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a learning-based approach to efficiently and reliably route data to a mobile sink in a wireless sensor field. Specifically, we consider a mobile sink that does not know when to query or does not need to query. Furthermore, the sink moves in a certain pattern within the sensor field. Such a sink passively listens for incoming data that distant source sensors unilaterally push towards it. Unlike traditional routing mechanisms, our technique takes the time-domain explicitly into account, with each node involved making the decision \\\"at this time what is the best way to forward the packet to the sink?\\\". In the presented scheme, motes (nodes in the vicinity of the sink) learn its movement pattern over time and statistically characterize it as a probability distribution function. Having obtained this information at the motes, our scheme uses reinforcement learning to locate the sink efficiently at any point of time.\",\"PeriodicalId\":366183,\"journal\":{\"name\":\"29th Annual IEEE International Conference on Local Computer Networks\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"88\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"29th Annual IEEE International Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2004.71\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"29th Annual IEEE International Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2004.71","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Learning-enforced time domain routing to mobile sinks in wireless sensor fields
We propose a learning-based approach to efficiently and reliably route data to a mobile sink in a wireless sensor field. Specifically, we consider a mobile sink that does not know when to query or does not need to query. Furthermore, the sink moves in a certain pattern within the sensor field. Such a sink passively listens for incoming data that distant source sensors unilaterally push towards it. Unlike traditional routing mechanisms, our technique takes the time-domain explicitly into account, with each node involved making the decision "at this time what is the best way to forward the packet to the sink?". In the presented scheme, motes (nodes in the vicinity of the sink) learn its movement pattern over time and statistically characterize it as a probability distribution function. Having obtained this information at the motes, our scheme uses reinforcement learning to locate the sink efficiently at any point of time.