{"title":"无线传感器网络中灵活传输的并行多径路由算法","authors":"Zhendong Wu, Shanping Li","doi":"10.1109/AINAW.2007.41","DOIUrl":null,"url":null,"abstract":"Multi-path strategy is one of the favorable choices for various applications and environments in sensor networks. In this paper, we study how to choose multi-paths effectively by taking full advantage of the known geographic information. Geographic routing has to face a fundamental difficulty: the local minimum phenomenon. To help the packets get out of the local minima, long-known right hand rule is used, which lose many links and doesn 't suit parallel multi-paths. We propose a new method that greedy forwarding can be used in local minima through restricting forwarding regions. Based on the new method, a parallel multi-path routing algorithm (P2MR) is proposed. It can flexibly adjust forwarding schemes to satisfy different requirements of applications. Simulations show that P2MR can improve the performance of networks significantly.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Parallel Multi-Path Routing Algorithm for Flexible Transmission in Wireless Sensor Networks\",\"authors\":\"Zhendong Wu, Shanping Li\",\"doi\":\"10.1109/AINAW.2007.41\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multi-path strategy is one of the favorable choices for various applications and environments in sensor networks. In this paper, we study how to choose multi-paths effectively by taking full advantage of the known geographic information. Geographic routing has to face a fundamental difficulty: the local minimum phenomenon. To help the packets get out of the local minima, long-known right hand rule is used, which lose many links and doesn 't suit parallel multi-paths. We propose a new method that greedy forwarding can be used in local minima through restricting forwarding regions. Based on the new method, a parallel multi-path routing algorithm (P2MR) is proposed. It can flexibly adjust forwarding schemes to satisfy different requirements of applications. Simulations show that P2MR can improve the performance of networks significantly.\",\"PeriodicalId\":338799,\"journal\":{\"name\":\"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINAW.2007.41\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINAW.2007.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Parallel Multi-Path Routing Algorithm for Flexible Transmission in Wireless Sensor Networks
Multi-path strategy is one of the favorable choices for various applications and environments in sensor networks. In this paper, we study how to choose multi-paths effectively by taking full advantage of the known geographic information. Geographic routing has to face a fundamental difficulty: the local minimum phenomenon. To help the packets get out of the local minima, long-known right hand rule is used, which lose many links and doesn 't suit parallel multi-paths. We propose a new method that greedy forwarding can be used in local minima through restricting forwarding regions. Based on the new method, a parallel multi-path routing algorithm (P2MR) is proposed. It can flexibly adjust forwarding schemes to satisfy different requirements of applications. Simulations show that P2MR can improve the performance of networks significantly.