Pub Date : 2009-06-23DOI: 10.1109/WIOPT.2009.5291596
Mikko Vehkaperä, K. Takeuchi, R. Müller, Toshiyuki TANAKA
We study the spectral efficiency of large random direct-sequence code-division multiple-access systems utilizing linear minimum mean square error (LMMSE) channel estimation and iterative multiuser detection and decoding (MUDD). Iterative MUDD based on non-linear data estimation and single-user decoding is considered as a benchmark for the more practical iterative LMMSE data estimator with soft parallel interference cancellation. The results showed that the channel parameters and the choice of error correction code have a great impact on the achievable spectral efficiency. It was also found that for the considered setups, the iterative LMMSE based channel estimator is near optimal for slowly time-varying multipath fading channels.
{"title":"On asymptotic performance of iterative channel and data estimation in large DS-CDMA systems","authors":"Mikko Vehkaperä, K. Takeuchi, R. Müller, Toshiyuki TANAKA","doi":"10.1109/WIOPT.2009.5291596","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291596","url":null,"abstract":"We study the spectral efficiency of large random direct-sequence code-division multiple-access systems utilizing linear minimum mean square error (LMMSE) channel estimation and iterative multiuser detection and decoding (MUDD). Iterative MUDD based on non-linear data estimation and single-user decoding is considered as a benchmark for the more practical iterative LMMSE data estimator with soft parallel interference cancellation. The results showed that the channel parameters and the choice of error correction code have a great impact on the achievable spectral efficiency. It was also found that for the considered setups, the iterative LMMSE based channel estimator is near optimal for slowly time-varying multipath fading channels.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130692259","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}
The computation of the intersection area of a large number of circles with known centers and radii is a challenging geometric problem. Nevertheless, its resolution finds several applications in the analysis and modeling of wireless networks. Prior literature discusses up to three circles and even in this case there are many possible geometric configurations, each leading to a different involved close-form expression for the intersection area. In this paper, we derive two novel geometric results, that allow the check of the existence and the computation of the area of the intersection regions generated by more than three circles by simple algebraic manipulations of the intersection areas of a smaller number of circles. Based on these results, we construct an iterative algorithm based on a trellis structure that efficiently computes the intersection areas of an arbitrary number of circles. As an example of practical application of our results, we derive the probability that a fixed number of mobiles can be reliably allocated to a set of base stations in code division multiple access-based cellular networks.
{"title":"An algorithmic solution for computing circle intersection areas and its applications to wireless communications","authors":"F. Librino, M. Levorato, M. Zorzi","doi":"10.1002/wcm.2305","DOIUrl":"https://doi.org/10.1002/wcm.2305","url":null,"abstract":"The computation of the intersection area of a large number of circles with known centers and radii is a challenging geometric problem. Nevertheless, its resolution finds several applications in the analysis and modeling of wireless networks. Prior literature discusses up to three circles and even in this case there are many possible geometric configurations, each leading to a different involved close-form expression for the intersection area. In this paper, we derive two novel geometric results, that allow the check of the existence and the computation of the area of the intersection regions generated by more than three circles by simple algebraic manipulations of the intersection areas of a smaller number of circles. Based on these results, we construct an iterative algorithm based on a trellis structure that efficiently computes the intersection areas of an arbitrary number of circles. As an example of practical application of our results, we derive the probability that a fixed number of mobiles can be reliably allocated to a set of base stations in code division multiple access-based cellular networks.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133673625","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}
Pub Date : 2009-06-23DOI: 10.1109/WIOPT.2009.5291574
D. Havey, R. Chertov, K. Almeroth
A wired testbed's usefulness for wireless research hinges on its ability to faithfully reproduce the wireless medium. One of the key properties of a wireless medium is its broadcast nature. Wireless broadcast behavior is used in applications such as cell phone and satellite networks to disseminate the same data to multiple users as well as perform time synchronization. In this paper, we investigate two methods that can be used to ascertain if a given wireless emulator is modeling the broadcast property correctly. Our results indicate that the better of the two proposed methods offers micro-second precision.
{"title":"Wired wireless broadcast emulation","authors":"D. Havey, R. Chertov, K. Almeroth","doi":"10.1109/WIOPT.2009.5291574","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291574","url":null,"abstract":"A wired testbed's usefulness for wireless research hinges on its ability to faithfully reproduce the wireless medium. One of the key properties of a wireless medium is its broadcast nature. Wireless broadcast behavior is used in applications such as cell phone and satellite networks to disseminate the same data to multiple users as well as perform time synchronization. In this paper, we investigate two methods that can be used to ascertain if a given wireless emulator is modeling the broadcast property correctly. Our results indicate that the better of the two proposed methods offers micro-second precision.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130943709","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}
Pub Date : 2009-06-23DOI: 10.1109/WIOPT.2009.5291636
Tae-Suk Kim, Yong Yang, J. Hou, S. Krishnamurthy
Many next generation applications (such as video flows) are likely to have associated minimum data rate requirements to ensure satisfactory quality as perceived by end-users. While there have been prior approaches on supporting quality-of-service (QoS) in mesh networks, they have largely ignored the issues that arise due to self-interference, the interference between different link layer transmissions of a single flow along a multi-hop path. In this paper, we develop a framework to address the problem of maximizing the aggregate utility of traffic flows in wireless mesh networks, with constraints imposed both due to self-interference and minimum rate requirements. The output of our framework is a schedule that dictates which links are to be activated simultaneously, and provides specifications of the resources associated with each of those links. Utilizing the proposed framework as a basis, we build an admission control module that intelligently manages the resources among the flows in the network and admits as many new flows as possible without violating the QoS of the existing flows. We provide numerical results to demonstrate the efficacy of our framework.
{"title":"Joint resource allocation and admission control in wireless mesh networks","authors":"Tae-Suk Kim, Yong Yang, J. Hou, S. Krishnamurthy","doi":"10.1109/WIOPT.2009.5291636","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291636","url":null,"abstract":"Many next generation applications (such as video flows) are likely to have associated minimum data rate requirements to ensure satisfactory quality as perceived by end-users. While there have been prior approaches on supporting quality-of-service (QoS) in mesh networks, they have largely ignored the issues that arise due to self-interference, the interference between different link layer transmissions of a single flow along a multi-hop path. In this paper, we develop a framework to address the problem of maximizing the aggregate utility of traffic flows in wireless mesh networks, with constraints imposed both due to self-interference and minimum rate requirements. The output of our framework is a schedule that dictates which links are to be activated simultaneously, and provides specifications of the resources associated with each of those links. Utilizing the proposed framework as a basis, we build an admission control module that intelligently manages the resources among the flows in the network and admits as many new flows as possible without violating the QoS of the existing flows. We provide numerical results to demonstrate the efficacy of our framework.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128307450","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}
Pub Date : 2009-06-23DOI: 10.1109/WIOPT.2009.5291580
K. Gomez, R. Riggio, D. Miorandi
Wireless mesh networks are emerging as a promising access network architecture. In this work, we report on an extensive measurement campaign performed over an experimental WiFi-based mesh network, deployed in an office building environment. The measurements are focused on the performance of HTTP traffic. Results demonstrate the existence of an unfairness issue, whereby longer sessions achieve better performance than shorter ones. This is known to be potentially harmful in terms of mean session delay and user-perceived quality of service. Potential countermeasures are presented and discussed.
{"title":"Mice over mesh: HTTP measurements over a WiFi-based wireless mesh network","authors":"K. Gomez, R. Riggio, D. Miorandi","doi":"10.1109/WIOPT.2009.5291580","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291580","url":null,"abstract":"Wireless mesh networks are emerging as a promising access network architecture. In this work, we report on an extensive measurement campaign performed over an experimental WiFi-based mesh network, deployed in an office building environment. The measurements are focused on the performance of HTTP traffic. Results demonstrate the existence of an unfairness issue, whereby longer sessions achieve better performance than shorter ones. This is known to be potentially harmful in terms of mean session delay and user-perceived quality of service. Potential countermeasures are presented and discussed.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122404979","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}
Pub Date : 2009-06-23DOI: 10.1109/WIOPT.2009.5291625
M. Ibrahim, P. Nain, Iacopo Carreras
This paper addresses the design and performance evaluation of relay strategies for opportunistic Delay Tolerant Networks (DTNs) augmented with throwboxes. By opportunistic we mean that a node does not have any knowledge regarding its past and future contact opportunities with the other nodes. We consider a network model composed of both mobile relay nodes and throwboxes, where throwboxes are stationary wireless devices acting simply as fixed relays. We propose and evaluate various relay strategies, where the goal is to take advantage of the presence of throwboxes to minimize resources consumption at mobile nodes. Under Markovian assumptions we introduce a mathematical framework which allows us to calculate the main performance metrics (average delivery delay, overhead, etc.) of each proposed relay scheme. The obtained results highlight the various trade-offs that are left to network designers when adding throwboxes to a DTN, and draw insights on the effectiveness of these strategies.
{"title":"Analysis of relay protocols for throwbox-equipped DTNs","authors":"M. Ibrahim, P. Nain, Iacopo Carreras","doi":"10.1109/WIOPT.2009.5291625","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291625","url":null,"abstract":"This paper addresses the design and performance evaluation of relay strategies for opportunistic Delay Tolerant Networks (DTNs) augmented with throwboxes. By opportunistic we mean that a node does not have any knowledge regarding its past and future contact opportunities with the other nodes. We consider a network model composed of both mobile relay nodes and throwboxes, where throwboxes are stationary wireless devices acting simply as fixed relays. We propose and evaluate various relay strategies, where the goal is to take advantage of the presence of throwboxes to minimize resources consumption at mobile nodes. Under Markovian assumptions we introduce a mathematical framework which allows us to calculate the main performance metrics (average delivery delay, overhead, etc.) of each proposed relay scheme. The obtained results highlight the various trade-offs that are left to network designers when adding throwboxes to a DTN, and draw insights on the effectiveness of these strategies.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123629317","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}
Pub Date : 2009-06-23DOI: 10.1109/WIOPT.2009.5291599
Haewoon Nam, G. Veciana, Mohamed-Slim Alouini
A feedback scheme based on an iterative group splitting along with an opportunistic scheduling in a time division multiplexed wireless system with adaptive modulation is proposed in this paper. Considering a dynamic behavior of users in joining and leaving the multiuser networks, the proposed scheme does not assume any prior knowledge on users' channel statistics and therefore allows more robust and practical design. During a guard period, the proposed scheme exploits user feedback collisions in order to firstly find the signal-to-noise ratio (SNR) region in the adaptive modulation to which the best user belongs and secondly narrow down the range of user candidates by splitting user groups iteratively. As soon as one of the qualified users, whose channel quality falls into the SNR region for the best user, is found during the procedure, this user is selected by the scheduler and no more searching is pursued. Using an iterative group splitting, it is shown that the proposed scheme achieves a significant reduction in the number of feedbacks and thus scales with a large number of users.
{"title":"A feedback scheme based on iterative group splitting for opportunistic scheduling with adaptive modulation","authors":"Haewoon Nam, G. Veciana, Mohamed-Slim Alouini","doi":"10.1109/WIOPT.2009.5291599","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291599","url":null,"abstract":"A feedback scheme based on an iterative group splitting along with an opportunistic scheduling in a time division multiplexed wireless system with adaptive modulation is proposed in this paper. Considering a dynamic behavior of users in joining and leaving the multiuser networks, the proposed scheme does not assume any prior knowledge on users' channel statistics and therefore allows more robust and practical design. During a guard period, the proposed scheme exploits user feedback collisions in order to firstly find the signal-to-noise ratio (SNR) region in the adaptive modulation to which the best user belongs and secondly narrow down the range of user candidates by splitting user groups iteratively. As soon as one of the qualified users, whose channel quality falls into the SNR region for the best user, is found during the procedure, this user is selected by the scheduler and no more searching is pursued. Using an iterative group splitting, it is shown that the proposed scheme achieves a significant reduction in the number of feedbacks and thus scales with a large number of users.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"684 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131969145","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}
Pub Date : 2009-06-23DOI: 10.1109/WIOPT.2009.5291615
Zhengqing Hu, C. Tham
In wireless LANs, throughput is one of, if not the most, important performance metric. This metric becomes more critical at the bottleneck area of the network, which is normally the area around the Access Point (AP). In this paper, we propose SI-CCMAC, a sender initiating concurrent cooperative MAC for wireless LANs. It is designed to improve the throughput performance in the region near the AP through cooperative communication, where data is forwarded through a two-hop high data-rate link instead of a low data-rate direct link. Further-more, nodes are coordinated to enable concurrent transmissions to further increase throughput. The coordination part of SICCMAC is modeled as a vertex coloring problem, a maximum independent set problem and a MDP problem, depending on different scenarios. For all three modeling, solutions can be found, based on the existing algorithms to optimize the throughput performance while guaranteeing a max-min fairness. Through simulation, we show that SI-CCMAC can significantly shorten the transmission time for stations with low data rate links to the AP and it has better throughput performance than other MAC protocols, such as CoopMAC and legacy IEEE 802.11.
{"title":"SI-CCMAC: Sender initiating concurrent cooperative MAC for wireless LANs","authors":"Zhengqing Hu, C. Tham","doi":"10.1109/WIOPT.2009.5291615","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291615","url":null,"abstract":"In wireless LANs, throughput is one of, if not the most, important performance metric. This metric becomes more critical at the bottleneck area of the network, which is normally the area around the Access Point (AP). In this paper, we propose SI-CCMAC, a sender initiating concurrent cooperative MAC for wireless LANs. It is designed to improve the throughput performance in the region near the AP through cooperative communication, where data is forwarded through a two-hop high data-rate link instead of a low data-rate direct link. Further-more, nodes are coordinated to enable concurrent transmissions to further increase throughput. The coordination part of SICCMAC is modeled as a vertex coloring problem, a maximum independent set problem and a MDP problem, depending on different scenarios. For all three modeling, solutions can be found, based on the existing algorithms to optimize the throughput performance while guaranteeing a max-min fairness. Through simulation, we show that SI-CCMAC can significantly shorten the transmission time for stations with low data rate links to the AP and it has better throughput performance than other MAC protocols, such as CoopMAC and legacy IEEE 802.11.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"2007 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125578378","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}
Pub Date : 2009-03-22DOI: 10.1109/WIOPT.2009.5291597
Jack Raymond
Balancing efficiency of bandwidth use and complexity of detection involves choosing a suitable load for a multi-access channel. In the case of synchronous CDMA, with random codes, it is possible to demonstrate the existence of a threshold in the load beyond which there is an apparent jump in computational complexity. At small load unit clause propagation can determine a jointly optimal detection of sources on a noiseless channel, but fails at high load. Analysis provides insight into the difference between the standard dense random codes and sparse codes, and the limitations of optimal detection in the sparse case.
{"title":"Optimal sparse CDMA detection at high load","authors":"Jack Raymond","doi":"10.1109/WIOPT.2009.5291597","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291597","url":null,"abstract":"Balancing efficiency of bandwidth use and complexity of detection involves choosing a suitable load for a multi-access channel. In the case of synchronous CDMA, with random codes, it is possible to demonstrate the existence of a threshold in the load beyond which there is an apparent jump in computational complexity. At small load unit clause propagation can determine a jointly optimal detection of sources on a noiseless channel, but fails at high load. Analysis provides insight into the difference between the standard dense random codes and sparse codes, and the limitations of optimal detection in the sparse case.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"17 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114115466","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}
Pub Date : 2009-02-28DOI: 10.1109/WIOPT.2009.5291584
M. Panda, Anurag Kumar
We provide a simple and accurate analytical model for multi-cell IEEE 802.11 WLANs. Our model applies if the cell radius, R, is much smaller than the carrier sensing range, Rcs. We argue that, the condition Rcs ≫≫ R is likely to hold in a dense deployment of Access Points (APs). We develop a scalable cell level model for such WLANs with saturated nodes as well as for TCP-controlled long file downloads. The accuracy of our model is demonstrated by comparison with ns-2 simulations. Based on the insights provided by our analytical model, we propose a simple channel assignment algorithm which provides static assignments that are Nash equilibria in pure strategies for the objective of maximizing normalized network throughput, and requires only as many steps as there are channels. Furthermore, our channel assignment algorithm does not require any a priori knowledge of topology and can be implemented in a decentralized manner. In contrast to prior work, our approach to channel assignment is based on the throughput metric.
{"title":"Modeling multi-cell IEEE 802.11 WLANs with application to channel assignment","authors":"M. Panda, Anurag Kumar","doi":"10.1109/WIOPT.2009.5291584","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291584","url":null,"abstract":"We provide a simple and accurate analytical model for multi-cell IEEE 802.11 WLANs. Our model applies if the cell radius, R, is much smaller than the carrier sensing range, Rcs. We argue that, the condition Rcs ≫≫ R is likely to hold in a dense deployment of Access Points (APs). We develop a scalable cell level model for such WLANs with saturated nodes as well as for TCP-controlled long file downloads. The accuracy of our model is demonstrated by comparison with ns-2 simulations. Based on the insights provided by our analytical model, we propose a simple channel assignment algorithm which provides static assignments that are Nash equilibria in pure strategies for the objective of maximizing normalized network throughput, and requires only as many steps as there are channels. Furthermore, our channel assignment algorithm does not require any a priori knowledge of topology and can be implemented in a decentralized manner. In contrast to prior work, our approach to channel assignment is based on the throughput metric.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124291939","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：