{"title":"改进吞吐量的自组织网络中的机会中继","authors":"S. K. Malekee, Ehsan Rahimi, M. Mayiami","doi":"10.1109/ICCITECHNOL.2012.6285791","DOIUrl":null,"url":null,"abstract":"In this paper, n mobile source-destination pairs and m relay nodes are considered in the same frequency band. In the previous works, it is assumed that the ad hoc nodes were fixed which causes users with lower SINR cannot communicate through relays. Here, we propose a scheme in which the mobility is managed in opportunistic manner to let ad hoc nodes satisfy a lower SINR threshold to be active and transmit successfully. We compute new SINR threshold for n source-destination pairs and m relays distributed uniformly and randomly on the constant area. This threshold is achieved as 1-√(log n/n)/R which causes the lower bound of the throughput to be increased. Also, we investigate the required time for movement of nodes and estimate it as Θ(√(log n)). This time is negligible compared to queuing delay term which is computed previously as in the order of Θ(n). Both of the simulation results and analytical calculations show that we achieve the better throughput while the delay does not change meaningfully.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Opportunistic relaying in ad-hoc networks for throughput improvement\",\"authors\":\"S. K. Malekee, Ehsan Rahimi, M. Mayiami\",\"doi\":\"10.1109/ICCITECHNOL.2012.6285791\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, n mobile source-destination pairs and m relay nodes are considered in the same frequency band. In the previous works, it is assumed that the ad hoc nodes were fixed which causes users with lower SINR cannot communicate through relays. Here, we propose a scheme in which the mobility is managed in opportunistic manner to let ad hoc nodes satisfy a lower SINR threshold to be active and transmit successfully. We compute new SINR threshold for n source-destination pairs and m relays distributed uniformly and randomly on the constant area. This threshold is achieved as 1-√(log n/n)/R which causes the lower bound of the throughput to be increased. Also, we investigate the required time for movement of nodes and estimate it as Θ(√(log n)). This time is negligible compared to queuing delay term which is computed previously as in the order of Θ(n). Both of the simulation results and analytical calculations show that we achieve the better throughput while the delay does not change meaningfully.\",\"PeriodicalId\":435718,\"journal\":{\"name\":\"2012 International Conference on Communications and Information Technology (ICCIT)\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Communications and Information Technology (ICCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCITECHNOL.2012.6285791\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Communications and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHNOL.2012.6285791","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Opportunistic relaying in ad-hoc networks for throughput improvement
In this paper, n mobile source-destination pairs and m relay nodes are considered in the same frequency band. In the previous works, it is assumed that the ad hoc nodes were fixed which causes users with lower SINR cannot communicate through relays. Here, we propose a scheme in which the mobility is managed in opportunistic manner to let ad hoc nodes satisfy a lower SINR threshold to be active and transmit successfully. We compute new SINR threshold for n source-destination pairs and m relays distributed uniformly and randomly on the constant area. This threshold is achieved as 1-√(log n/n)/R which causes the lower bound of the throughput to be increased. Also, we investigate the required time for movement of nodes and estimate it as Θ(√(log n)). This time is negligible compared to queuing delay term which is computed previously as in the order of Θ(n). Both of the simulation results and analytical calculations show that we achieve the better throughput while the delay does not change meaningfully.