Connecting separate home networks into a single logical private network simplifies resource sharing. Home networks commonly connect to the Internet via a home gateway that allows multiple devices in the home network to share a single IPv4 address through some form of dynamic network address translation. This may limit the set of home devices and ports that can receive incoming connections. We describe a secure, transparent and distributed method to interconnect private home networks via home gateways enabling full, two-way communication among all devices across the separate homes.
{"title":"Peer-to-Peer Interconnection of Home Networks","authors":"Arthur Harvey, Ying-ieh Lin, P. Maurer","doi":"10.1109/CCNC.2007.182","DOIUrl":"https://doi.org/10.1109/CCNC.2007.182","url":null,"abstract":"Connecting separate home networks into a single logical private network simplifies resource sharing. Home networks commonly connect to the Internet via a home gateway that allows multiple devices in the home network to share a single IPv4 address through some form of dynamic network address translation. This may limit the set of home devices and ports that can receive incoming connections. We describe a secure, transparent and distributed method to interconnect private home networks via home gateways enabling full, two-way communication among all devices across the separate homes.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123846598","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}
One of the most critical disadvantages of the IP- based surveillance is the network reliability problem. That is, since the IP-based surveillance system is IP-based, all of the services provided by the IP-based surveillance system will not be accessible at all if network failure occurs. In this paper, a network-fault-tolerable IP-based surveillance (NeTSurv) system is proposed. In addition to the existing features of current video surveillance systems, a multihome-based approach is adopted to improve the network fault tolerance capability of the NeTSurv system. Furthermore, the fault tolerance mechanism is developed to solve the connectivity issue and the continuity issue of video playout for different link failure scenarios.
{"title":"Enabling Robust Network Fault Tolerance for IP-Based Surveillance Systems","authors":"Chung-Ming Huang, Ching-Hsien Tsai, Jia‐Xuan Huang, Cheng-Yen Chuang","doi":"10.1109/CCNC.2007.15","DOIUrl":"https://doi.org/10.1109/CCNC.2007.15","url":null,"abstract":"One of the most critical disadvantages of the IP- based surveillance is the network reliability problem. That is, since the IP-based surveillance system is IP-based, all of the services provided by the IP-based surveillance system will not be accessible at all if network failure occurs. In this paper, a network-fault-tolerable IP-based surveillance (NeTSurv) system is proposed. In addition to the existing features of current video surveillance systems, a multihome-based approach is adopted to improve the network fault tolerance capability of the NeTSurv system. Furthermore, the fault tolerance mechanism is developed to solve the connectivity issue and the continuity issue of video playout for different link failure scenarios.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124432433","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 a novel signal classification method using cyclic spectral analysis and neural network for cognitive radio applications. In cogni- tive radio, it is desirable to have an accurate and reliable signal classification algorithm which can operate at low signal to noise ratio and without knowledge of the carrier frequency and bandwidth of the target signal. Cyclic spectral analysis has been proven to be a powerful tool for classifying signals. However, the amount of data introduced by spectral analysis is too large for any classifier to employ. Hence, a spectral analysis based feature extraction has to be performed to drastically reduce the data. Specifically, we propose to use both the α profile and the frequency profile of the Spectral Coherence Function (SOF) as the feature. Numerical results show significant performance improvement compared to those of using only the α profile feature.
{"title":"Reliable Modulation Classification at Low SNR Using Spectral Correlation","authors":"Zhiqiang Wu, E. Like, V. Chakravarthy","doi":"10.1109/CCNC.2007.228","DOIUrl":"https://doi.org/10.1109/CCNC.2007.228","url":null,"abstract":"In this paper, we propose a novel signal classification method using cyclic spectral analysis and neural network for cognitive radio applications. In cogni- tive radio, it is desirable to have an accurate and reliable signal classification algorithm which can operate at low signal to noise ratio and without knowledge of the carrier frequency and bandwidth of the target signal. Cyclic spectral analysis has been proven to be a powerful tool for classifying signals. However, the amount of data introduced by spectral analysis is too large for any classifier to employ. Hence, a spectral analysis based feature extraction has to be performed to drastically reduce the data. Specifically, we propose to use both the α profile and the frequency profile of the Spectral Coherence Function (SOF) as the feature. Numerical results show significant performance improvement compared to those of using only the α profile feature.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124586503","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 increasing popularity of Internet wide overlay networks require mechanisms for delay prediction between any given pair of nodes without having to actually measure the delay. Internet Coordinate Systems (ICS) have been proposed to enable such delay prediction. Most of the known ICS mechanisms require a set of landmark servers for hosts to measure their distance with and use those mea- surements to derive their coordinates. For P2P systems, it is preferable to use a distributed scheme where deployment of landmarks are not required. Vivaldi is such a distributed scheme. We propose an improved scheme in which hosts dynamically change the set of neighbors with which they measure distances. Our proposed improvement to the Vi- valdi algorithm reduces the bandwidth consumption by up to 50% while maitaining the same accuracy of the delay es- timations. We introduce a new metric named relative delay loss (rdl) that captures how well the coordinate system picks the closest node between two given nodes and captures the magnitude of the error when the pick is wrong. Our pro- posed scheme presents a significant improvement measured with this new metric.
{"title":"Performance Improvement of a Distributed Internet Coordinates System","authors":"S. Narayanan, E. Shim","doi":"10.1109/CCNC.2007.30","DOIUrl":"https://doi.org/10.1109/CCNC.2007.30","url":null,"abstract":"The increasing popularity of Internet wide overlay networks require mechanisms for delay prediction between any given pair of nodes without having to actually measure the delay. Internet Coordinate Systems (ICS) have been proposed to enable such delay prediction. Most of the known ICS mechanisms require a set of landmark servers for hosts to measure their distance with and use those mea- surements to derive their coordinates. For P2P systems, it is preferable to use a distributed scheme where deployment of landmarks are not required. Vivaldi is such a distributed scheme. We propose an improved scheme in which hosts dynamically change the set of neighbors with which they measure distances. Our proposed improvement to the Vi- valdi algorithm reduces the bandwidth consumption by up to 50% while maitaining the same accuracy of the delay es- timations. We introduce a new metric named relative delay loss (rdl) that captures how well the coordinate system picks the closest node between two given nodes and captures the magnitude of the error when the pick is wrong. Our pro- posed scheme presents a significant improvement measured with this new metric.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127859461","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}
Various multimedia streaming have started to be offered in Internet protocol (IP) networks. However, since current networks cannot operate well if the consumers' end system sends multimedia stream at will, an admission control is becoming an important part of IP networks. Therefore, we previously proposed an admission control scheme we call "tentative accommodating and congestion confirming strategy (TACCS)". The basic idea is to accommodate incoming flows tentatively and then confirm congestion after a certain period. In TACCS, the ingress nodes of a domain make flow-accommodating decisions based on information about packet-loss events. The information is assumed to be advertised from congestion detection agents (CDAs) located in the domain. If comparable performance could be achieved without adding CDA functions to core nodes, the cost of deploying TACCS would be reduced and its scalability would be improved. We have thus developed an enhanced TACCS called "edge-based TACCS" that achieves admission control based on cooperation of high functional edge nodes and does not depend on CDAs in the core network. Simulation showed that the performance of edge-based TACCS is comparable to that of conventional TACCS that depends on CDAs in the core network.
{"title":"Edge-Based TACCS: A More Scalable TACCS Based on Cooperation of High Functional Edge Nodes","authors":"Hiroki Date, K. Yasukawa, K. Baba, K. Yamaoka","doi":"10.1109/CCNC.2007.180","DOIUrl":"https://doi.org/10.1109/CCNC.2007.180","url":null,"abstract":"Various multimedia streaming have started to be offered in Internet protocol (IP) networks. However, since current networks cannot operate well if the consumers' end system sends multimedia stream at will, an admission control is becoming an important part of IP networks. Therefore, we previously proposed an admission control scheme we call \"tentative accommodating and congestion confirming strategy (TACCS)\". The basic idea is to accommodate incoming flows tentatively and then confirm congestion after a certain period. In TACCS, the ingress nodes of a domain make flow-accommodating decisions based on information about packet-loss events. The information is assumed to be advertised from congestion detection agents (CDAs) located in the domain. If comparable performance could be achieved without adding CDA functions to core nodes, the cost of deploying TACCS would be reduced and its scalability would be improved. We have thus developed an enhanced TACCS called \"edge-based TACCS\" that achieves admission control based on cooperation of high functional edge nodes and does not depend on CDAs in the core network. Simulation showed that the performance of edge-based TACCS is comparable to that of conventional TACCS that depends on CDAs in the core network.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129074952","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}
S. Rieche, Klaus Wehrle, M. Fouquet, H. Niedermayer, L. Petrak, G. Carle
Multiplayer games played over the Internet have become very popular in the lastfew years. An interesting subcategory are the so-called massively multiplayeronline games (MMOGs) that allow thousands of player characters to share asingle game world. Such a world is usually run on a high-performance and high-availability server cluster. However, even with games that have been extensivelybeta-tested, downtimes of several hours because of hard- or software failures arenot uncommon. Downtimes, especially in the first few weeks after the release,can negatively affect the image of the game and the company that created it.Traditionally, a cluster of servers contains one virtual world of a MMOG.Such infrastructure is inflexible and error-prone. One would rather like to havea system that allows disconnecting a server at runtime while others take overits tasks. Server-based MMOGs can have performance problems if players areconcentrated in certain parts of the game world or some worlds are overpopu-lated. Thus, there is also a need for load balancing mechanisms. Peer-to-Peer(P2P) systems quite naturally support the use of load balancing.In this paper we use a structured P2P technology for the organization of theinfrastructure and thus for the reduction of downtimes in MMOGs. We splitthe game world in disjunctive rectangular zones and distribute them on differentnodes of the P2P network.Online games are an interesting challenge and chance for the future devel-opment of the P2P paradigm. A wide variety of aspects of only theoreticallysolved and especially yet completely unsolved problems are covered by this ap-plication. Security and trust problems appear as well as the need to preventcheating. The application is not as tolerant to faults as instant messaging or filesharing. Consistent data storage is a problem, decisions and transactions haveto be performed in a decentralized way. Moreover, the P2P network is not usedas pure lookup service, but more as a communication and application-specificsocial structure.The rest of this paper is organized as follows: First we discuss related work inSection 2 and give a brief introduction to P2P and MMOGs and their challengesin Section 3. Section 4 shows our approach to use structured P2P Systems forMMOGs and section 5 the evaluation with player traces from a real MMOG.Finally, Section 6 provides conclusions.
{"title":"Peer-to-Peer-Based Infrastructure Support for Massively Multiplayer Online Games","authors":"S. Rieche, Klaus Wehrle, M. Fouquet, H. Niedermayer, L. Petrak, G. Carle","doi":"10.1109/CCNC.2007.155","DOIUrl":"https://doi.org/10.1109/CCNC.2007.155","url":null,"abstract":"Multiplayer games played over the Internet have become very popular in the lastfew years. An interesting subcategory are the so-called massively multiplayeronline games (MMOGs) that allow thousands of player characters to share asingle game world. Such a world is usually run on a high-performance and high-availability server cluster. However, even with games that have been extensivelybeta-tested, downtimes of several hours because of hard- or software failures arenot uncommon. Downtimes, especially in the first few weeks after the release,can negatively affect the image of the game and the company that created it.Traditionally, a cluster of servers contains one virtual world of a MMOG.Such infrastructure is inflexible and error-prone. One would rather like to havea system that allows disconnecting a server at runtime while others take overits tasks. Server-based MMOGs can have performance problems if players areconcentrated in certain parts of the game world or some worlds are overpopu-lated. Thus, there is also a need for load balancing mechanisms. Peer-to-Peer(P2P) systems quite naturally support the use of load balancing.In this paper we use a structured P2P technology for the organization of theinfrastructure and thus for the reduction of downtimes in MMOGs. We splitthe game world in disjunctive rectangular zones and distribute them on differentnodes of the P2P network.Online games are an interesting challenge and chance for the future devel-opment of the P2P paradigm. A wide variety of aspects of only theoreticallysolved and especially yet completely unsolved problems are covered by this ap-plication. Security and trust problems appear as well as the need to preventcheating. The application is not as tolerant to faults as instant messaging or filesharing. Consistent data storage is a problem, decisions and transactions haveto be performed in a decentralized way. Moreover, the P2P network is not usedas pure lookup service, but more as a communication and application-specificsocial structure.The rest of this paper is organized as follows: First we discuss related work inSection 2 and give a brief introduction to P2P and MMOGs and their challengesin Section 3. Section 4 shows our approach to use structured P2P Systems forMMOGs and section 5 the evaluation with player traces from a real MMOG.Finally, Section 6 provides conclusions.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129131075","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}
Yeong-Hun Cho, J. Nah, Moon-Sang Jeong, Jin-Gu Lee, Jongtae Park
Recent advances in home network technology, combined with IP-based home appliances such as IPTV, can provide high-quality IP-based video conferencing service at relatively low cost. This paper presents SIP-based management architecture for large-scale home conferencing service using IPTV. In the proposed architecture, we extended the protocol stack of IPTV for the support of SIP-based signaling, and applied IPTV to large-scale home conferencing. High scalability of the proposed architecture is achieved by coordinated distributed conference control and media processing. The signaling procedures for the integrated control of IPTV have been designed in detail for SIP-based conferencing service. The performance of the proposed system has been evaluated by simulation. The simulation results show that the proposed architecture greatly improves scalability 1 .
{"title":"SIP-Based Management Architecture for Large-Scale Home Conferencing Using IPTV","authors":"Yeong-Hun Cho, J. Nah, Moon-Sang Jeong, Jin-Gu Lee, Jongtae Park","doi":"10.1109/CCNC.2007.75","DOIUrl":"https://doi.org/10.1109/CCNC.2007.75","url":null,"abstract":"Recent advances in home network technology, combined with IP-based home appliances such as IPTV, can provide high-quality IP-based video conferencing service at relatively low cost. This paper presents SIP-based management architecture for large-scale home conferencing service using IPTV. In the proposed architecture, we extended the protocol stack of IPTV for the support of SIP-based signaling, and applied IPTV to large-scale home conferencing. High scalability of the proposed architecture is achieved by coordinated distributed conference control and media processing. The signaling procedures for the integrated control of IPTV have been designed in detail for SIP-based conferencing service. The performance of the proposed system has been evaluated by simulation. The simulation results show that the proposed architecture greatly improves scalability 1 .","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117137019","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}
Real-time traffic will be a predominant traffic type in the next generation networks and 100% reliability and availability of networks will be required by real-time premium traffic (PT). It is believed that QoS guarantees could be better provided by the connection oriented networks such as Multi Protocol Label Switching (MPLS). These connection oriented networks are more vulnerable to network failures. Conventional path protections perform re-routing to cope with them. However, re-routing always causes packet losses and results in service outage. These losses are bursty in nature and highly degrade QoS of the real-time premium traffic. The novel path protection proposed in this paper recovers the bursty packet losses due to re-routing using forward error correction (FEC) path. Therefore, it can provide the network architecture with no service outage for such traffic. The numerical results show that the proposed method can achieve a very high availability for the real-time premium traffic in future IP/MPLS networks. routing (4). However, the problem of re-routing mentioned above still exists, and therefore it is necessary to find proactive techniques to recover the bursty packet losses due to re- routings. The novel idea of path protection with forward error correction (FEC) path proposed in this article can be used for real time premium traffic that needs a guaranteed QoS. It combines a FEC path with conventional path protection methods using re-routings and recovers the packet losses due to re-routings by way of a FEC recovery technique. The numerical result shows that this is a promising proactive technique to provide a guaranteed QoS for real time premium traffic that otherwise can lead to severe effects if 100% availability is not achieved. The rest of this paper is organized as follows. In the next section, the problem description and the existing solutions are analyzed briefly. In Section III, we discuss the proposed method in detail. The performance of the proposed method is evaluated and the results are presented in Section IV. Finally this paper is concluded in Section V.
{"title":"Seamless Failure Recovery for Real-time Premium Traffic in MPLS Networks","authors":"M. Hayasaka, T. Miki","doi":"10.1109/CCNC.2007.31","DOIUrl":"https://doi.org/10.1109/CCNC.2007.31","url":null,"abstract":"Real-time traffic will be a predominant traffic type in the next generation networks and 100% reliability and availability of networks will be required by real-time premium traffic (PT). It is believed that QoS guarantees could be better provided by the connection oriented networks such as Multi Protocol Label Switching (MPLS). These connection oriented networks are more vulnerable to network failures. Conventional path protections perform re-routing to cope with them. However, re-routing always causes packet losses and results in service outage. These losses are bursty in nature and highly degrade QoS of the real-time premium traffic. The novel path protection proposed in this paper recovers the bursty packet losses due to re-routing using forward error correction (FEC) path. Therefore, it can provide the network architecture with no service outage for such traffic. The numerical results show that the proposed method can achieve a very high availability for the real-time premium traffic in future IP/MPLS networks. routing (4). However, the problem of re-routing mentioned above still exists, and therefore it is necessary to find proactive techniques to recover the bursty packet losses due to re- routings. The novel idea of path protection with forward error correction (FEC) path proposed in this article can be used for real time premium traffic that needs a guaranteed QoS. It combines a FEC path with conventional path protection methods using re-routings and recovers the packet losses due to re-routings by way of a FEC recovery technique. The numerical result shows that this is a promising proactive technique to provide a guaranteed QoS for real time premium traffic that otherwise can lead to severe effects if 100% availability is not achieved. The rest of this paper is organized as follows. In the next section, the problem description and the existing solutions are analyzed briefly. In Section III, we discuss the proposed method in detail. The performance of the proposed method is evaluated and the results are presented in Section IV. Finally this paper is concluded in Section V.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115541554","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}
Most geometric routing algorithms for ad-hoc wire- less networks rely on greedy forwarding strategies to deliver messages from their sources to destinations. However, there is no guarantee that paths produced by these protocols are optimal. In this paper, we present a Path Regression approach which improves the qualities of paths produced by all geometric routing protocols. Furthermore, we show the use of Path Regression in RFR which progressively looks for an optimal path that can only be produced by DSR. Extensive experiments show that the proposed algorithm out-performs other approaches such as GOAFR+ by a significant margin.
{"title":"Efficient Geometric Routing in Ad-hoc Wireless Networks","authors":"V. M. Chhieng, R. Choi, R. Wong","doi":"10.1109/CCNC.2007.58","DOIUrl":"https://doi.org/10.1109/CCNC.2007.58","url":null,"abstract":"Most geometric routing algorithms for ad-hoc wire- less networks rely on greedy forwarding strategies to deliver messages from their sources to destinations. However, there is no guarantee that paths produced by these protocols are optimal. In this paper, we present a Path Regression approach which improves the qualities of paths produced by all geometric routing protocols. Furthermore, we show the use of Path Regression in RFR which progressively looks for an optimal path that can only be produced by DSR. Extensive experiments show that the proposed algorithm out-performs other approaches such as GOAFR+ by a significant margin.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114405630","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 investigates a multiple input single output (MISO) time reversal system for ultra-wideband (UWB) communication over inter-symbol interference (ISI) channels. Time reversal takes advantage of rich scattering environments to achieve signal focusing, which enables the use of simple receiver structures without sacrificing performance. On-off-keying (OOK) modulation and energy detection (square law) are considered for the purpose of low complexity at the receiver. This research is motivated by the need for high-data-rate wireless network with simple receive nodes. The discrete channel models and bit error rate (BER) formulas for the energy detector receiver over ISI channels are derived. Performance is evaluated based on measured data, considering practical signal waveforms. One reason to use our own measured data is that there is no proper UWB channel model for antenna array related study. Numerical results suggest that the proposed MISO time reversal system with extremely simple receiver is promising to support high data rate in severe multipath environments for robust communication in the UWB band.
{"title":"UWB MISO Time Reversal With Energy Detector Receiver Over ISI Channels","authors":"S. Mo, N. Guo, Johnson Zhang, R. Qiu","doi":"10.1109/CCNC.2007.129","DOIUrl":"https://doi.org/10.1109/CCNC.2007.129","url":null,"abstract":"This paper investigates a multiple input single output (MISO) time reversal system for ultra-wideband (UWB) communication over inter-symbol interference (ISI) channels. Time reversal takes advantage of rich scattering environments to achieve signal focusing, which enables the use of simple receiver structures without sacrificing performance. On-off-keying (OOK) modulation and energy detection (square law) are considered for the purpose of low complexity at the receiver. This research is motivated by the need for high-data-rate wireless network with simple receive nodes. The discrete channel models and bit error rate (BER) formulas for the energy detector receiver over ISI channels are derived. Performance is evaluated based on measured data, considering practical signal waveforms. One reason to use our own measured data is that there is no proper UWB channel model for antenna array related study. Numerical results suggest that the proposed MISO time reversal system with extremely simple receiver is promising to support high data rate in severe multipath environments for robust communication in the UWB band.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115768519","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
扫码关注我们
求助内容：
应助结果提醒方式：