{"title":"具有两个传输范围的无线传感器的连接保证多对一通信","authors":"W. Lee, H. Paek, J. Yeo, K. Kim","doi":"10.1109/EUC.2010.36","DOIUrl":null,"url":null,"abstract":"The proposed scheme maximizes the communication rates of multiple sender sensors to a terminal sensor while assuring a given connection time without connection abortion caused by the depletion of available battery energy. Each wireless sensor chooses one of two radio transmission ranges with disparate energy consumptions when sending a packet. The proposed scheme generates an edge-capacity graph from a sensor network and finds the routing paths by applying an advanced version of the existing maximum-flow algorithm to the graph. Finally the scheme determines the transmission rate of packets from each sender node to the terminal node, which is the number of transmittable packets in the found routing paths divided by the given connection time.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Connection-assured Many-to-one Communication of Wireless Sensors with Two Transmission Ranges\",\"authors\":\"W. Lee, H. Paek, J. Yeo, K. Kim\",\"doi\":\"10.1109/EUC.2010.36\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The proposed scheme maximizes the communication rates of multiple sender sensors to a terminal sensor while assuring a given connection time without connection abortion caused by the depletion of available battery energy. Each wireless sensor chooses one of two radio transmission ranges with disparate energy consumptions when sending a packet. The proposed scheme generates an edge-capacity graph from a sensor network and finds the routing paths by applying an advanced version of the existing maximum-flow algorithm to the graph. Finally the scheme determines the transmission rate of packets from each sender node to the terminal node, which is the number of transmittable packets in the found routing paths divided by the given connection time.\",\"PeriodicalId\":265175,\"journal\":{\"name\":\"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EUC.2010.36\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUC.2010.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Connection-assured Many-to-one Communication of Wireless Sensors with Two Transmission Ranges
The proposed scheme maximizes the communication rates of multiple sender sensors to a terminal sensor while assuring a given connection time without connection abortion caused by the depletion of available battery energy. Each wireless sensor chooses one of two radio transmission ranges with disparate energy consumptions when sending a packet. The proposed scheme generates an edge-capacity graph from a sensor network and finds the routing paths by applying an advanced version of the existing maximum-flow algorithm to the graph. Finally the scheme determines the transmission rate of packets from each sender node to the terminal node, which is the number of transmittable packets in the found routing paths divided by the given connection time.