C. Sammarco, F. Fitzek, G. P. Perrucci, A. Iera, A. Molinaro
Localization information retrieval is breaking new ground for mobile applications for indoor or urban areas. GPS is the positioning technology that powers the majority of the navigation devices today, it comes along with high complexity, high energy consumption and limited coverage for indoor. The main idea of this paper is to exploit cooperation among mobile devices to retrieve their geographical position without using GPS. The information used by the proposed mechanism is only based on the cell-id and the signal strength. Google has launched something similar for stand alone mobile phones with its new feature called My Location. We enhance this service using cooperation among mobile devices sharing the knowledge of cell IDs and signal strength. In this paper, after a short introduction about the proposed method, we are going to show how cooperation improves mobile devices' localization. We propose a new architecture that aims to localize mobile phones without using GPS devices. Afterwards, we are going to describe our setup and to discuss the achieved results. The main result of this paper is that the proposed scheme with three cooperating mobile devices can reduce the estimation area of more than five times compared to cell ID approaches such as the one of Google.
{"title":"Localization Information Retrieval Exploiting Cooperation Among Mobile Devices","authors":"C. Sammarco, F. Fitzek, G. P. Perrucci, A. Iera, A. Molinaro","doi":"10.1109/ICCW.2008.33","DOIUrl":"https://doi.org/10.1109/ICCW.2008.33","url":null,"abstract":"Localization information retrieval is breaking new ground for mobile applications for indoor or urban areas. GPS is the positioning technology that powers the majority of the navigation devices today, it comes along with high complexity, high energy consumption and limited coverage for indoor. The main idea of this paper is to exploit cooperation among mobile devices to retrieve their geographical position without using GPS. The information used by the proposed mechanism is only based on the cell-id and the signal strength. Google has launched something similar for stand alone mobile phones with its new feature called My Location. We enhance this service using cooperation among mobile devices sharing the knowledge of cell IDs and signal strength. In this paper, after a short introduction about the proposed method, we are going to show how cooperation improves mobile devices' localization. We propose a new architecture that aims to localize mobile phones without using GPS devices. Afterwards, we are going to describe our setup and to discuss the achieved results. The main result of this paper is that the proposed scheme with three cooperating mobile devices can reduce the estimation area of more than five times compared to cell ID approaches such as the one of Google.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125961000","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 provides a method for multi-path selection based on parameters prediction. In wireless networks, links with different bandwidths induce different end-to-end delay and the packet loss rate characteristics. It means that we should be able to gain some knowledge of the type of links given the end-to-end delay and the packet loss rate. In this work, we use a neural network machine learning method to infer the types of the links. After predicting the types of the links, we can choose the path based on the prediction of the incremental throughput, for example by choosing the path with the largest potential incremental throughput.
{"title":"Intelligent Multi-Path Selection Based on Parameters Prediction","authors":"Suyang Ju, Joseph B. Evans","doi":"10.1109/ICCW.2008.106","DOIUrl":"https://doi.org/10.1109/ICCW.2008.106","url":null,"abstract":"This paper provides a method for multi-path selection based on parameters prediction. In wireless networks, links with different bandwidths induce different end-to-end delay and the packet loss rate characteristics. It means that we should be able to gain some knowledge of the type of links given the end-to-end delay and the packet loss rate. In this work, we use a neural network machine learning method to infer the types of the links. After predicting the types of the links, we can choose the path based on the prediction of the incremental throughput, for example by choosing the path with the largest potential incremental throughput.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128196059","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}
In this paper, we formulate a proportional fairness problem for downlink OFDM systems. Different from all the previous works, a completely new framework is presented by decomposing it into two levels: the master problem and the subproblems. Our proposed algorithm could remarkably reduce the computational complexity in the base station and the feedback overhead. Numerical results demonstrate that this algorithm could provide much better proportional fairness as well as enhance the system throughput.
{"title":"Decomposition Proportional Fairness Algorithm for Multiuser OFDM Systems","authors":"Lili Zhang, Cihang Jin, Wuyang Zhou","doi":"10.1109/ICCW.2008.9","DOIUrl":"https://doi.org/10.1109/ICCW.2008.9","url":null,"abstract":"In this paper, we formulate a proportional fairness problem for downlink OFDM systems. Different from all the previous works, a completely new framework is presented by decomposing it into two levels: the master problem and the subproblems. Our proposed algorithm could remarkably reduce the computational complexity in the base station and the feedback overhead. Numerical results demonstrate that this algorithm could provide much better proportional fairness as well as enhance the system throughput.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133098863","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 emerging IEEE 802.11s standard draft is a key technology of next-generation wireless networks. It can provide end users with broadband access of fast deployment, low cost, large coverage, and robust architecture. Recently, IEEE 802.11s draft has defined hybrid routing as default routing protocol. When tree-based topology is enabled, different mesh points (MPs) and mesh access points (MAPs) will achieve different loads according to their hops to the root, while previous discussions assumed that all the stations in the network have the same load. In this paper, we proposed an analytical model for IEEE 802.11 networks which considers different loads in hybrid routing. In the model, MPs/MAPs are classified into different groups according to their hops from the root and those closer to the root have a heavier load. We calculate their packet arrival rates in reasonable assumptions and derive the throughput and end-to-end delay. At last, numerical results show the factors, such as hops, affect network performance.
新兴的IEEE 802.11s标准草案是下一代无线网络的关键技术。它可以为终端用户提供部署速度快、成本低、覆盖范围大、体系结构健壮的宽带接入。最近，IEEE 802.11s草案将混合路由定义为缺省路由协议。当启用基于树的拓扑结构时，不同的mesh point (MPs)和mesh access point (map)将根据其到根节点的跳数获得不同的负载，而前面的讨论假设网络中所有站点具有相同的负载。本文提出了一种考虑混合路由中不同负载的IEEE 802.11网络分析模型。在模型中，MPs/ map根据其从根的跳数被划分为不同的组，离根越近的组负载越重。我们在合理的假设下计算了它们的数据包到达率，并得出了吞吐量和端到端延迟。最后，数值结果表明了跳数等因素对网络性能的影响。
{"title":"Delay and throughput Analysis of IEEE 802.11s Networks","authors":"Ming-Xin Hu, G. Kuo","doi":"10.1109/ICCW.2008.19","DOIUrl":"https://doi.org/10.1109/ICCW.2008.19","url":null,"abstract":"The emerging IEEE 802.11s standard draft is a key technology of next-generation wireless networks. It can provide end users with broadband access of fast deployment, low cost, large coverage, and robust architecture. Recently, IEEE 802.11s draft has defined hybrid routing as default routing protocol. When tree-based topology is enabled, different mesh points (MPs) and mesh access points (MAPs) will achieve different loads according to their hops to the root, while previous discussions assumed that all the stations in the network have the same load. In this paper, we proposed an analytical model for IEEE 802.11 networks which considers different loads in hybrid routing. In the model, MPs/MAPs are classified into different groups according to their hops from the root and those closer to the root have a heavier load. We calculate their packet arrival rates in reasonable assumptions and derive the throughput and end-to-end delay. At last, numerical results show the factors, such as hops, affect network performance.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"706 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115119116","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}
An improvement to a recently proposed packet combining procedure based on the use of a CRC is developed. Upon receiving two packets, sent over independent channels, a large error burst may appear in one; however, it is unlikely that the same situation will have occurred for its pair. By making an intelligent choice as to which packet the burst is most likely to be in, and choosing the other packet for correction, the decoding time can be reduced significantly. A practical implementation is provided with real results that show not only can this decision be made correctly on the majority of occasions but, once the correct packet is chosen, an intelligent search operation can be performed further reducing overhead.
{"title":"A Practical Implementation of an Improved Packet Combining Scheme for Wireless Sensor Networks","authors":"D. O'Rourke, C. Brennan","doi":"10.1109/ICCW.2008.69","DOIUrl":"https://doi.org/10.1109/ICCW.2008.69","url":null,"abstract":"An improvement to a recently proposed packet combining procedure based on the use of a CRC is developed. Upon receiving two packets, sent over independent channels, a large error burst may appear in one; however, it is unlikely that the same situation will have occurred for its pair. By making an intelligent choice as to which packet the burst is most likely to be in, and choosing the other packet for correction, the decoding time can be reduced significantly. A practical implementation is provided with real results that show not only can this decision be made correctly on the majority of occasions but, once the correct packet is chosen, an intelligent search operation can be performed further reducing overhead.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128915985","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}
While very successful in traditional radio communications, the usage of TDMA and CSMA schemes for underwater acoustic communications is severely limited in efficiency and scalability, primarily due to the very large propagation delays. FDMA seems a viable alternative in that the propagation delay does not impact significantly its efficiency. However, in underwater communications, the capacity achievable on a particular channel depends strongly both on its frequency and on the communication distance, unlike in traditional radio transmissions where FDMA channels usually have comparable performance. Therefore, fixed channel allocation schemes traditionally used for radio FDMA do not perform well in underwater communications. In this paper, we investigate the application of the principles of cognitive radio and dynamic spectrum access to underwater communications. In particular, we propose a channel allocation scheme which exploits user location knowledge in order to maximize the minimum channel capacity among those achieved by the users. This provides maximum fairness and makes a more efficient use of the available spectrum resources. Performance evaluation carried out by means of simulation shows that our approach can achieve a great improvement in fairness among users, with respect to fixed allocation schemes, while at the same time scaling much better and thus allowing effective communications over larger distances.
{"title":"Cognitive Spectrum Access for Underwater Acoustic Communications","authors":"N. Baldo, P. Casari, M. Zorzi","doi":"10.1109/ICCW.2008.104","DOIUrl":"https://doi.org/10.1109/ICCW.2008.104","url":null,"abstract":"While very successful in traditional radio communications, the usage of TDMA and CSMA schemes for underwater acoustic communications is severely limited in efficiency and scalability, primarily due to the very large propagation delays. FDMA seems a viable alternative in that the propagation delay does not impact significantly its efficiency. However, in underwater communications, the capacity achievable on a particular channel depends strongly both on its frequency and on the communication distance, unlike in traditional radio transmissions where FDMA channels usually have comparable performance. Therefore, fixed channel allocation schemes traditionally used for radio FDMA do not perform well in underwater communications. In this paper, we investigate the application of the principles of cognitive radio and dynamic spectrum access to underwater communications. In particular, we propose a channel allocation scheme which exploits user location knowledge in order to maximize the minimum channel capacity among those achieved by the users. This provides maximum fairness and makes a more efficient use of the available spectrum resources. Performance evaluation carried out by means of simulation shows that our approach can achieve a great improvement in fairness among users, with respect to fixed allocation schemes, while at the same time scaling much better and thus allowing effective communications over larger distances.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"78 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132463154","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}
Position information of the primary user (PU) is important to the transmission among secondary users (SU) in cognitive sensor networks (CSN). A range free geometric localization algorithm aiming at collecting position information of PUs is proposed in this paper. Since PUs do not cooperate with SUs in CSN, opportunistic spectrum access (OSA) protocol is applied in this algorithm. Another difficulty in localization in CSN is the unavailability of received signal strength (RSS) or other precise measurements in the sensor node's physics layer due to the power and size limitation of sensor nodes, so the algorithm in this paper is designed to be range free. This range free feature makes the algorithm robust against the uncertainty of parameters of the physics layer. With respect to the performance of the algorithm, an approximation of mean squared error (MSE) of localization is derived. The roles played by the parameters in the system are analyzed. Simulation results are also presented.
{"title":"High Order Geometric Range Free Localization in Opportunistic Cognitive Sensor Networks","authors":"Dian Gong, Zhiyao Ma, Yunfan Li, Wei Chen, Z. Cao","doi":"10.1109/ICCW.2008.31","DOIUrl":"https://doi.org/10.1109/ICCW.2008.31","url":null,"abstract":"Position information of the primary user (PU) is important to the transmission among secondary users (SU) in cognitive sensor networks (CSN). A range free geometric localization algorithm aiming at collecting position information of PUs is proposed in this paper. Since PUs do not cooperate with SUs in CSN, opportunistic spectrum access (OSA) protocol is applied in this algorithm. Another difficulty in localization in CSN is the unavailability of received signal strength (RSS) or other precise measurements in the sensor node's physics layer due to the power and size limitation of sensor nodes, so the algorithm in this paper is designed to be range free. This range free feature makes the algorithm robust against the uncertainty of parameters of the physics layer. With respect to the performance of the algorithm, an approximation of mean squared error (MSE) of localization is derived. The roles played by the parameters in the system are analyzed. Simulation results are also presented.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126386160","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 presents the design of an IP over WDM module for the ns-2 simulator. The module make available the evaluation of QoS metrics, such as blocking probability and delay in IP over WDM networks. The module allows simulation of networks with traffic grooming, single and multi-hop routing, protection and restauration and global reconfiguration. This module is intended to be a valuable tool for research in IP over WDM networks mechanisms.
本文介绍了一种用于ns-2仿真器的IP over WDM模块的设计。该模块实现了对WDM网络中IP阻塞概率和时延等QoS指标的评估。该模块允许模拟网络流量梳理、单跳和多跳路由、保护和恢复以及全局重新配置。本模块旨在成为研究IP over WDM网络机制的一个有价值的工具。
{"title":"IP over WDM Module for the NS-2 Simulator","authors":"A. Drummond, R.T.R. da Silva","doi":"10.1109/ICCW.2008.44","DOIUrl":"https://doi.org/10.1109/ICCW.2008.44","url":null,"abstract":"This paper presents the design of an IP over WDM module for the ns-2 simulator. The module make available the evaluation of QoS metrics, such as blocking probability and delay in IP over WDM networks. The module allows simulation of networks with traffic grooming, single and multi-hop routing, protection and restauration and global reconfiguration. This module is intended to be a valuable tool for research in IP over WDM networks mechanisms.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126510238","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}
In this paper, we propose adaptive multiple time- scale power allocation (AMTPA) method for opportunistic spectrum access (OSA) in the uplink of DS-CDMA networks. In AMTPA, the secondary service is facilitated by granting passive access to the power control commands transmitted by the primary network's base-station. AMTPA manages the secondary service transmission power in two phases, each in different time-scales. In the longer time-scale, Power Allocation Phase adaptively allocates the secondary service transmit power based on the medium-scale variations of the secondary channel, so that the achieved capacity is maximized. Then in the shorter time-scale, power adjustment phase exploits the power control commands transmitted in the primary network to adaptively adjust secondary service transmission power to reduce the effect of the secondary service transmission on the quality-of-service of the primary network. Simulation results show that maintaining a given collision probability constraint, AMTPA makes a significant improvement on the achieved capacity.
{"title":"Adaptive Multiple Time-Scale Power Allocation for Spectrum Sharing in DS-CDMA Networks","authors":"M. Khoshkholgh, K. Navaie, H. Yanikomeroglu","doi":"10.1109/ICCW.2008.94","DOIUrl":"https://doi.org/10.1109/ICCW.2008.94","url":null,"abstract":"In this paper, we propose adaptive multiple time- scale power allocation (AMTPA) method for opportunistic spectrum access (OSA) in the uplink of DS-CDMA networks. In AMTPA, the secondary service is facilitated by granting passive access to the power control commands transmitted by the primary network's base-station. AMTPA manages the secondary service transmission power in two phases, each in different time-scales. In the longer time-scale, Power Allocation Phase adaptively allocates the secondary service transmit power based on the medium-scale variations of the secondary channel, so that the achieved capacity is maximized. Then in the shorter time-scale, power adjustment phase exploits the power control commands transmitted in the primary network to adaptively adjust secondary service transmission power to reduce the effect of the secondary service transmission on the quality-of-service of the primary network. Simulation results show that maintaining a given collision probability constraint, AMTPA makes a significant improvement on the achieved capacity.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132176482","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}
Cognitive radio technologies have emerged as a platform to solve the problem of spectrum scarcity for wireless applications since cognitive radios have the potential to utilize the idle licensed spectrum bands in an intelligent way without interfering with other licensed devices. However, most of the proposed protocols for opportunistic usage of the licensed spectrum bands assume that the participants involved in the protocols are honest and that there are no malicious adversaries that will attack the network. Using two examples, we demonstrate that in the presence of a malicious adversary the systems designed making these assumptions will fail to fulfill their goals of minimal disruption of the primary users and efficient utilization of the unused spectrum. We also briefly discuss some security design goals of the future cognitive DSA networks.
{"title":"Denial-of-Service Attacks on Dynamic Spectrum Access Networks","authors":"G. Jakimoski, K. P. Subbalakshmi","doi":"10.1109/ICCW.2008.105","DOIUrl":"https://doi.org/10.1109/ICCW.2008.105","url":null,"abstract":"Cognitive radio technologies have emerged as a platform to solve the problem of spectrum scarcity for wireless applications since cognitive radios have the potential to utilize the idle licensed spectrum bands in an intelligent way without interfering with other licensed devices. However, most of the proposed protocols for opportunistic usage of the licensed spectrum bands assume that the participants involved in the protocols are honest and that there are no malicious adversaries that will attack the network. Using two examples, we demonstrate that in the presence of a malicious adversary the systems designed making these assumptions will fail to fulfill their goals of minimal disruption of the primary users and efficient utilization of the unused spectrum. We also briefly discuss some security design goals of the future cognitive DSA networks.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133484842","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
扫码关注我们
求助内容：
应助结果提醒方式：