Wireless Mesh Networks based on OFDMA and the Node-Disjoint Multipath Routing Protocol (NDMR) can provide practical high-speed broadband and robust transmission. In this paper, NDMR, a practical protocol in WMN is studied. it reduces routing overhead and achieves multiple node-disjoint routing paths. Also, the OFDMA based WMN and its subcarrier allocation problem is investigated. A novel QoS guaranteed dynamic subcarrier allocation based on NDMR is introduced.
{"title":"Architecture of QoS Guaranteed Joint Design of Node-Disjoint Multipath Routing and Subcarrier Allocation in OFDMA Mesh Networks","authors":"Dapeng Zhang, L. Cuthbert","doi":"10.1109/MESH.2009.32","DOIUrl":"https://doi.org/10.1109/MESH.2009.32","url":null,"abstract":"Wireless Mesh Networks based on OFDMA and the Node-Disjoint Multipath Routing Protocol (NDMR) can provide practical high-speed broadband and robust transmission. In this paper, NDMR, a practical protocol in WMN is studied. it reduces routing overhead and achieves multiple node-disjoint routing paths. Also, the OFDMA based WMN and its subcarrier allocation problem is investigated. A novel QoS guaranteed dynamic subcarrier allocation based on NDMR is introduced.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134642722","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}
Data rates in 3GPP LTE supports 100Mbps in the downlink and 50Mbps in the uplink. Currently, almost all manufactured MTs uses HDLC_PPP to make connections between TE and MT. However HDLC_PPP uses byte stuffing for HDLC framing. As the communication speed is increased dramatically between TE and MT, byte stuffing seriously limits communication speed. As the connection methods between TE and MT and between MT and RN Care different, HDLC_PPP used between TE and MT can be replaced by other method without affecting the wireless interface. We propose an Ethernet interface instead of HDLC_PPP interface. The Ethernet-based interface provides higher data throughput than that of HDLC_PPP. The test result shows that data throughputs of HDLC_PPP over USB, pure Ethernet, and Ethernet over USB are 18Mbps,95Mbps, and 68Mbps respectively.
3GPP LTE的数据速率支持下行100Mbps，上行50Mbps。目前，几乎所有生产的MT都使用HDLC_PPP在TE和MT之间建立连接，然而HDLC_PPP使用字节填充用于HDLC帧。随着TE和MT之间通信速度的急剧增加，字节填充严重限制了通信速度。由于TE与MT、MT与RN之间的连接方式不同，因此TE与MT之间使用的HDLC_PPP可以用其他方式替代，而不会影响无线接口。我们建议使用以太网接口代替HDLC_PPP接口。基于以太网的接口比HDLC_PPP提供更高的数据吞吐量。测试结果表明，HDLC_PPP over USB、纯以太网和以太网over USB的数据吞吐量分别为18Mbps、95Mbps和68Mbps。
{"title":"High Speed Ethernet Interface between TE and MT in 3GPP LTE Network","authors":"Y. Baek, Sung-Gi Min, Hyungkwon Lee","doi":"10.1109/MESH.2009.11","DOIUrl":"https://doi.org/10.1109/MESH.2009.11","url":null,"abstract":"Data rates in 3GPP LTE supports 100Mbps in the downlink and 50Mbps in the uplink. Currently, almost all manufactured MTs uses HDLC_PPP to make connections between TE and MT. However HDLC_PPP uses byte stuffing for HDLC framing. As the communication speed is increased dramatically between TE and MT, byte stuffing seriously limits communication speed. As the connection methods between TE and MT and between MT and RN Care different, HDLC_PPP used between TE and MT can be replaced by other method without affecting the wireless interface. We propose an Ethernet interface instead of HDLC_PPP interface. The Ethernet-based interface provides higher data throughput than that of HDLC_PPP. The test result shows that data throughputs of HDLC_PPP over USB, pure Ethernet, and Ethernet over USB are 18Mbps,95Mbps, and 68Mbps respectively.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134249742","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 conventional opportunistic scheduling algorithm in cognitive radio networks does the scheduling among the secondary users based on the reported state values. However, such opportunistic scheduling algorithm can be challenged in a system where each secondary user belongs to a different independent agent and the users work in competitive way. In order to optimize his own utility, a selfish user can choose not to reveal his true information to the central scheduler. In this paper, we proposed a pricing mechanism which combines the mechanism design with the opportunistic scheduling algorithm and ensures that each rational selfish user maximizes his own utility function, at the same time optimizing the overall system utility. The proposed pricing mechanism is based on the classic Vickrey-Clark-Groves (VCG) mechanism and had several desirable economic properties. A mechanism learning algorithm is then provided for users to learn the mechanism and to obtain the Nash equilibrium. A numerical example shows the Nash equilibrium of such algorithm achieves system optimality.
{"title":"Application of Mechanism Design in Opportunistic Scheduling under Cognitive Radio Systems","authors":"Jane Wei Huang, V. Krishnamurthy","doi":"10.1109/MESH.2009.16","DOIUrl":"https://doi.org/10.1109/MESH.2009.16","url":null,"abstract":"The conventional opportunistic scheduling algorithm in cognitive radio networks does the scheduling among the secondary users based on the reported state values. However, such opportunistic scheduling algorithm can be challenged in a system where each secondary user belongs to a different independent agent and the users work in competitive way. In order to optimize his own utility, a selfish user can choose not to reveal his true information to the central scheduler. In this paper, we proposed a pricing mechanism which combines the mechanism design with the opportunistic scheduling algorithm and ensures that each rational selfish user maximizes his own utility function, at the same time optimizing the overall system utility. The proposed pricing mechanism is based on the classic Vickrey-Clark-Groves (VCG) mechanism and had several desirable economic properties. A mechanism learning algorithm is then provided for users to learn the mechanism and to obtain the Nash equilibrium. A numerical example shows the Nash equilibrium of such algorithm achieves system optimality.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133343916","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}
This paper evaluates our work of Scalable Proxy Mobile IPv6 (SPMIPv6) in a Wireless Mesh Network (WMN), which is a promising solution for ubiquitous Internet access and a wide range of applications. The aspects of scalability and signaling cost are evaluated respectively: the scalability is evaluated by numerical analysis while the signaling cost with respect to delay is evaluated by a virtualization-based method. It is shown that the SPMIPv6 extension can scale the network better than the base Proxy Mobile IPv6 (PMIPv6) protocol. The quantitative results are provided to complete our previous qualitative results and to validate the application of SPMIPv6 for WMN.
本文评估了我们在无线网状网络(WMN)中的可扩展代理移动IPv6 (SPMIPv6)的工作，它是一种有前途的无处不在的互联网接入和广泛应用的解决方案。分别从可扩展性和信令成本两个方面进行了评估:可扩展性采用数值分析的方法进行了评估，时延方面的信令成本采用基于虚拟化的方法进行了评估。结果表明，SPMIPv6扩展比基本的代理移动IPv6 (Proxy Mobile IPv6, PMIPv6)协议具有更好的网络扩展能力。定量结果补充了我们之前的定性结果，验证了SPMIPv6在WMN中的应用。
{"title":"Evaluation of Scalable Proxy Mobile IPv6 in Wireless Mesh Networks","authors":"H. Nguyen, C. Bonnet","doi":"10.1109/MESH.2009.12","DOIUrl":"https://doi.org/10.1109/MESH.2009.12","url":null,"abstract":"This paper evaluates our work of Scalable Proxy Mobile IPv6 (SPMIPv6) in a Wireless Mesh Network (WMN), which is a promising solution for ubiquitous Internet access and a wide range of applications. The aspects of scalability and signaling cost are evaluated respectively: the scalability is evaluated by numerical analysis while the signaling cost with respect to delay is evaluated by a virtualization-based method. It is shown that the SPMIPv6 extension can scale the network better than the base Proxy Mobile IPv6 (PMIPv6) protocol. The quantitative results are provided to complete our previous qualitative results and to validate the application of SPMIPv6 for WMN.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121280682","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}
Yusuke Kato, Y. Diao, N. Pham, Ken-ichiro Yagura, Takayuki Kitada, K. Yamaguchi, Yumi Takaki, Mitsuhiro Kuwano, C. Ohta
Publish/subscribe (Pub/Sub) systems can disseminate information scalability. This systems also enable users to get only their interesting information in real time. We are planning demonstration experiments of Pub/Sub systems as a word-mouth information distribution service (WIDS)for users such as resident, shopper and traveler in Kobe,Japan, with the support of the Strategic Information and Communications R&D Promotion Programme (SCOPE).In this paper, we present a summary of the WIDS, and propose a dissemination tree construction protocol, which is implemented in the WIDS. Then, we show the effectiveness of our proposal protocol on simulation. Finally, we confirm the WIDS implemented operation in real environment experimentation.
{"title":"Implementation and Experiment of Publish/Subscribe System on Wireless Mesh Networks - Word-Mouth Information Distribution Service","authors":"Yusuke Kato, Y. Diao, N. Pham, Ken-ichiro Yagura, Takayuki Kitada, K. Yamaguchi, Yumi Takaki, Mitsuhiro Kuwano, C. Ohta","doi":"10.1109/MESH.2009.26","DOIUrl":"https://doi.org/10.1109/MESH.2009.26","url":null,"abstract":"Publish/subscribe (Pub/Sub) systems can disseminate information scalability. This systems also enable users to get only their interesting information in real time. We are planning demonstration experiments of Pub/Sub systems as a word-mouth information distribution service (WIDS)for users such as resident, shopper and traveler in Kobe,Japan, with the support of the Strategic Information and Communications R&D Promotion Programme (SCOPE).In this paper, we present a summary of the WIDS, and propose a dissemination tree construction protocol, which is implemented in the WIDS. Then, we show the effectiveness of our proposal protocol on simulation. Finally, we confirm the WIDS implemented operation in real environment experimentation.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128925205","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}
Tiankui Zhang, Lin Xiao, Chunyan Feng, L. Cuthbert
In cooperation relay system, two relay stations transmit cooperatively for the relay link users, and the relay link users receive signal by maximal ratio combining. The traditional multiuser scheduling algorithms, Max C/I algorithm for system throughput maximization and proportional fairness (PF) algorithm for user fairness, are extended into the DF cooperative relay systems. The simulation results show that the Max C/I algorithm obtains great multiuser diversity gain and cooperation diversity gain. In the Max C/I algorithm, deploying more RSs in the cell has a constructive effect on the multiuser diversity. However in PF algorithm, adding more RSs in the cell has an adverse effect on the multiuser diversity. Varying number of users has big impact on the user fairness performance of Max C/I, but the user fairness of PF is mainly affected by the RS number.
{"title":"System Level Performance of Multiuser Diversity in Cooperative Relay Based OFDMA Networks","authors":"Tiankui Zhang, Lin Xiao, Chunyan Feng, L. Cuthbert","doi":"10.1109/MESH.2009.22","DOIUrl":"https://doi.org/10.1109/MESH.2009.22","url":null,"abstract":"In cooperation relay system, two relay stations transmit cooperatively for the relay link users, and the relay link users receive signal by maximal ratio combining. The traditional multiuser scheduling algorithms, Max C/I algorithm for system throughput maximization and proportional fairness (PF) algorithm for user fairness, are extended into the DF cooperative relay systems. The simulation results show that the Max C/I algorithm obtains great multiuser diversity gain and cooperation diversity gain. In the Max C/I algorithm, deploying more RSs in the cell has a constructive effect on the multiuser diversity. However in PF algorithm, adding more RSs in the cell has an adverse effect on the multiuser diversity. Varying number of users has big impact on the user fairness performance of Max C/I, but the user fairness of PF is mainly affected by the RS number.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131090050","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 realization that single channel MAC protocols do not offer adequate end-to-end throughput have prompted researchers to explore more scalable approaches such as multi-channel MAC protocols. Current multi-channel schemes implementing a dedicated control channel lead to saturation problems. Channel selection and coordination schemes which minimize the effects of channel switching penalty and channel bottlenecks are required. The paper proposes a cyclical scheduling algorithm where data transmission is phased. A single dedicated channel with two data channels and one transceiver system is explored. The capacity of a single control channel is investigated as the number of data channels is increased from two to fourteen. Channel saturation is observed on data channels. Analytical results show that a single dedicated control channel causes no bottlenecks up to a fourteen data channels system. Its capacity is affected by the saturation of data channels.
{"title":"A Multiple Channel Selection and Coordination MAC Scheme","authors":"M. Velempini, M. Dlodlo","doi":"10.1109/MESH.2009.30","DOIUrl":"https://doi.org/10.1109/MESH.2009.30","url":null,"abstract":"The realization that single channel MAC protocols do not offer adequate end-to-end throughput have prompted researchers to explore more scalable approaches such as multi-channel MAC protocols. Current multi-channel schemes implementing a dedicated control channel lead to saturation problems. Channel selection and coordination schemes which minimize the effects of channel switching penalty and channel bottlenecks are required. The paper proposes a cyclical scheduling algorithm where data transmission is phased. A single dedicated channel with two data channels and one transceiver system is explored. The capacity of a single control channel is investigated as the number of data channels is increased from two to fourteen. Channel saturation is observed on data channels. Analytical results show that a single dedicated control channel causes no bottlenecks up to a fourteen data channels system. Its capacity is affected by the saturation of data channels.","PeriodicalId":115389,"journal":{"name":"2009 Second International Conference on Advances in Mesh Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126893573","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
扫码关注我们
求助内容：
应助结果提醒方式：