2009 IEEE International Conference on Communications Workshops最新文献

{"title":"Supporting Safety Driving with Inter-Vehicle CDMA Networks Under Realistic Accident Scenarios","authors":"H. Yomo, Michio Miyamoto, O. Shagdar, T. Ohyama, M. N. Shirazi, R. Miura, S. Obana","doi":"10.1109/ICCW.2009.5208068","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208068","url":null,"abstract":"In this paper, we investigate inter-vehicle networks offering an application of safety driving support. For appropriately evaluating the efficiency of inter-vehicle communication systems to support such an application, it is of paramount importance to make extensive evaluations under realistic accident model. In this paper, assuming realistic intersection collisions scenarios, we provide simulation results of an inter-vehicle network based on an experimental guide-line defined for inter- vehicle communications system in Japan. Besides the guideline system, we also present our newly developed inter-vehicle communication system based on code division multiple access (CDMA) scheme. Our numerical results show that the proposed CDMA based system can effectively combat hidden-terminal problem as well as high level of congestion around an intersection, and is the only system to satisfy the requirements set by the application for safety driving support.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123708450","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}

{"title":"Loop-Freeness in Multipath BGP through Propagating the Longest Path","authors":"I. van Beijnum, J. Crowcroft, F. Valera, M. Bagnulo","doi":"10.1109/ICCW.2009.5207968","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207968","url":null,"abstract":"The concurrent use of multiple paths through a communications network has the potential to provide many benefits, including better utilisation of the network and increased robustness. A key part of a multipath network architecture is the ability for routing protocols to install multiple routes over multiple paths in the routing table. In this paper we propose changes to local BGP processing that allow a BGP router to use multiple paths concurrently without compromising loop-freeness.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128182904","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}

{"title":"Exploring the Pub/Sub Routing & Forwarding Space","authors":"A. Zahemszky, A. Császár, P. Nikander, C. Esteve Rothenberg","doi":"10.1109/ICCW.2009.5207980","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207980","url":null,"abstract":"We envision an information-centric future Internet where the network is built around named pieces of data instead of explicitly addressable hosts. One clear way of implementing information-centric networking is using publish and subscribe (pub/sub) operations instead of the send and receive primitives. Internet-like pub/sub networking requires completely different routing protocols and forwarding mechanisms compared to those that are extensively used today. Consequently, we are facing a clean-slate design exercise, where we should start our adventure by exploring the new design space. We identify four key metrics (signalling overhead, state in nodes, information in packets and routing stretch) to help us evaluating the different proposals. We present a general five-step approach for routing in pub/sub networks. The presented approach is recursive, so it can be repeated as many times as necessary until we reach manageable sized problem instances. The final part of the mechanism is to glue together the created and assigned forwarding structures to the publication to ensure that all interested subscribers at any domains in the network will get the requested data.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114383784","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}

{"title":"On the Performance of a FH-MC-CDMA System","authors":"D. Osipov","doi":"10.1109/ICCW.2009.5208102","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208102","url":null,"abstract":"In what follows a novel quasisynchronous FH-MC- CDMA system with threshold reception is introduced. An ex- pression for the optimum (in maximum a posteriori sense ) threshold value is obtained. Error and erasure probability values for the system under consideration are estimated.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114818575","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}

{"title":"Ergodic and Outage Capacity Analysis of Cooperative Diversity Systems under Rayleigh Fading Channels","authors":"S. Chen, W. Wang, X. Zhang","doi":"10.1109/ICCW.2009.5208077","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208077","url":null,"abstract":"In this paper, assuming the channel state information (CSI) is only known at the receivers, the ergodic and outage capacity of cooperative diversity systems with an arbitrary number of half-duplex relays are analyzed under independently not necessarily identically distributed Rayleigh fading channels. Approximated closed-form analytical expressions for the calculation of ergodic and outage capacity are derived for both the amplify-and-forward (AF) protocol and decode-and-forward (DF) protocol. Numerical results show that all the derived analytical expressions are very tight and are valid for the evaluations of the ergodic and outage capacity with arbitrary number of relays and in any practical SNR regions. Our study shows that with low SNR, AF offers higher ergodic and outage capacity than the DF protocol while with high SNR, DF provides higher capacity performance.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114871123","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}

{"title":"Assessing GPS Robustness in Presence of Communication Signals","authors":"B. Motella, S. Savasta, D. Margaria, F. Dovis","doi":"10.1109/ICCW.2009.5207985","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207985","url":null,"abstract":"A constantly increasing number of new applications are based on wireless communication system integrated with navigation/positioning platforms. The mutual benefits they can obtain from each others are intrinsically related to the interoperability level and to a properly designed coexistence. In this paper a new family of curves, called interference error envelope (IEE), is used to assess the impact of possible interference generated by other systems (e.g. communications) on Global Navigation Satellite System (GNSS) signals. The focus is on the analysis of the GPS C/A code robustness.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127767046","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}

{"title":"Vertical and Horizontal End-to-End Arguments in the Internet","authors":"Matthias Bärwolff","doi":"10.1109/ICCW.2009.5207972","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207972","url":null,"abstract":"We propose a novel taxonomy for the end-to-end arguments associated with the Internet: a vertical and horizontal version. While the former captures the trade-offs of where to place functions in a vertical network protocol stack, the latter deals with the trade-offs of spreading them across different hosts. Those two versions of the end-to-end argument were effectively one and the same in the early days of the Internet. However, this congruence is now thoroughly broken, and it is thus useful to separate the two conceptually. Primarily, this helps framing the broader debate on network design in light of tussles between the Internet's various stakeholders and higher order objectives such as user choice and fostering innovation.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127817794","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}

{"title":"An Auction Mechanism for Channel Access in Vehicle-to-Roadside Communications","authors":"K. Akkarajitsakul, E. Hossain","doi":"10.1109/ICCW.2009.5208115","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208115","url":null,"abstract":"This paper considers a public transportation system, which offers Internet access services to the commuting passen- gers. Suppose the Internet connection is available at few road- side base stations (RSBs) in a city. Our objective is to solve the bandwidth allocation problem when there are several vehicles connected to an RSB at the same time and the bandwidth of the link to the RSB has to be shared among these vehicles. To solve this bandwidth allocation problem, we propose a game-theoretic model. The main concept of the model is to let each vehicle compete with others in order to obtain the required amount of bandwidth. We formulate this game as an auction game where the vehicles are the bidders and the RSB is the auctioneer. From the performance study, we observe that there is an equilibrium which is a solution in this game. To obtain the solution in a distributed manner, an iterative algorithm is presented.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121237846","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}

{"title":"On Frame Synchronization for Multiple Access Channels","authors":"Dawei Shen, Wenyi Zhang, David Reed, Andrew Lippman","doi":"10.1109/ICCW.2009.5208107","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208107","url":null,"abstract":"The problem of frame synchronization is formulated and investigated for multiple access channels (MAC). Several decision rules for locating the starting positions in continuously transmitted frames are proposed and compared, for both user- synchronous and user-asynchronous cases. It is shown that the common decision rule based on the correlation statistic is suboptimal, and that correction terms need be added in order to achieve an improved detection performance. For the user- asynchronous case, the optimal joint decision rule is derived in analytical form for two-user MAC and is highly complex, and is shown to suffer from a high computational complexity. To reduce the complexity, suboptimal separate decision algorithms with and without Gaussian approximation are derived, and it is il- lustrated using Monte Carlo simulation that those low-complexity algorithms only incur a slight degradation in optimality. by the specific problem of RFID signal separation (6). When multiple RFID tags are activated, symbol-synchronous signals from these tags are simultaneously transmitted in a continuous and repeated fashion, with fixed sync-words inserted into the data streams. Such a system model exactly fits into the research domain of frame synchronization. In this paper, we investigate both the user-synchronous and user-asynchronous cases. In the user-synchronous case, transmitters are scheduled such that their transmitted frames align synchronously. We derive the optimal maximum a pos- terior (MAP) decision rule in this case, which akin to single- user channels includes a correction term in addition to the correlation statistic. In the more general and complicated user- asynchronous case, multiple transmitters start transmitting frames at different time instants and thus there are multiple frame positions to locate. The computational complexity of the MAP joint decision rule grows exponentially with the number of transmitters thus rendering it infeasible for practical implementation. Consequently, an alternative approach which performs frame synchronization for each transmitter separately is proposed, with and without the further complexity reduction via Gaussian approximation of multiple access interference. The performance of the various approaches is evaluated through Monte Carlo simulation, in which different design parameters like the choice of sync words, the relative signal strength between transmitters, and the number of transmitters are examined.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121995928","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}

{"title":"Device-to-Device Communications; Functional Prospects for LTE-Advanced Networks","authors":"K. Doppler, Mika Rinne, Pekka Janis, C. Ribeiro, K. Hugl","doi":"10.1109/ICCW.2009.5208020","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208020","url":null,"abstract":"In this paper the possibility of device-to-device (D2D) communications as an underlay of an LTE-A network is introduced. The D2D communication enables new service opportunities and reduces the eNB load for short range data intensive peer-to-peer communication. The cellular network may establish a new type of radio bearer dedicated for D2D communications and stay in control of the session setup and the radio resources without routing the user plane traffic. The paper addresses critical issues and functional blocks to enable D2D communication as an add-on functionality to the LTE SAE architecture. Unlike 3G spread spectrum cellular and OFDM WLAN techniques, LTE-A resource management is fast and operates in high time-frequency resolution. This could allow the use of non-allocated time-frequency resources, or even partial reuse of the allocated resources for D2D with eNB controlled power constraints. The feasibility and the range of D2D communication, and its impact to the power margins of cellular communications are studied by simulations in two example scenarios. The results demonstrate that by tolerating a modest increase in interference, D2D communication with practical range becomes feasible. By tolerating higher interference power the D2D range will increase.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123757470","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}