Pub Date : 2009-06-07DOI: 10.1109/ICUFN.2009.5174300
B. S. Choi, D. Suh, G. Park, Kyuheon Kim, Jung Ah Park
This paper proposes a method for saving resources of the video distribution server by using peer-to-peer communications. In order to adapt to a time-varying channel, scalable video coding and a fountain code, a Raptor code is used. The Raptor code protects video quality asymmetrically according to the significance of scalable video layers; varying in peer-to-peer networks, as a forward error correction (FEC) method. It is also a more efficient peer-to-peer distribution tool (because of its rateless feature) than conventional erasure recovery FEC such as the Reed Solomon code. The simulation shows that peer-to-peer data exchange between the clients can save the resources of the server.
{"title":"Peer-to-peer scalable video streaming using Raptor code","authors":"B. S. Choi, D. Suh, G. Park, Kyuheon Kim, Jung Ah Park","doi":"10.1109/ICUFN.2009.5174300","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174300","url":null,"abstract":"This paper proposes a method for saving resources of the video distribution server by using peer-to-peer communications. In order to adapt to a time-varying channel, scalable video coding and a fountain code, a Raptor code is used. The Raptor code protects video quality asymmetrically according to the significance of scalable video layers; varying in peer-to-peer networks, as a forward error correction (FEC) method. It is also a more efficient peer-to-peer distribution tool (because of its rateless feature) than conventional erasure recovery FEC such as the Reed Solomon code. The simulation shows that peer-to-peer data exchange between the clients can save the resources of the server.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121174288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-07DOI: 10.1109/ICUFN.2009.5174316
Sunheui Ryoo, S. Bahk
As wireless networks evolve, the spatial reuse becomes important because it heavily affects overall network throughput. Especially in a dense network, the selection of transmission nodes highly influences the number of simultaneous transmissions. In this paper, we propose a spatial reuse enhanced medium access control (SRE MAC) that gives transmission priority to the nodes that have a small number of interferers. Both centralized and distributed approaches are considered with a hierarchical network model. The performance comparison shows that, with a perfect MAC control, the proposed SRE MAC enhances the network-wide throughput through allowing more number of transmissions in parallel.
{"title":"Spatial reuse enhanced MAC for wireless dense networks","authors":"Sunheui Ryoo, S. Bahk","doi":"10.1109/ICUFN.2009.5174316","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174316","url":null,"abstract":"As wireless networks evolve, the spatial reuse becomes important because it heavily affects overall network throughput. Especially in a dense network, the selection of transmission nodes highly influences the number of simultaneous transmissions. In this paper, we propose a spatial reuse enhanced medium access control (SRE MAC) that gives transmission priority to the nodes that have a small number of interferers. Both centralized and distributed approaches are considered with a hierarchical network model. The performance comparison shows that, with a perfect MAC control, the proposed SRE MAC enhances the network-wide throughput through allowing more number of transmissions in parallel.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126956824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-07DOI: 10.1109/ICUFN.2009.5174294
É. Renault, S. Boumerdassi
This article presents a theoretical evaluation of the Simple Mutual Authentication Protocol (SMAP). After a brief description of the protocol and a qualitative comparison with some related works, the paper aims at showing that the proposed solution has a minimal cost. In order to do so, the article first presents the characteristics of the ISO/IEC 14443 smart card which is a common smart-card solution; then, an evaluation and the time analysis to perform the mutual authentication with SMAP on ISO/IEC 14443 smart cards is provided.
{"title":"Evaluation of the Simple Mutual Authentication Protocol for ISO/IEC 14443 smart cards","authors":"É. Renault, S. Boumerdassi","doi":"10.1109/ICUFN.2009.5174294","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174294","url":null,"abstract":"This article presents a theoretical evaluation of the Simple Mutual Authentication Protocol (SMAP). After a brief description of the protocol and a qualitative comparison with some related works, the paper aims at showing that the proposed solution has a minimal cost. In order to do so, the article first presents the characteristics of the ISO/IEC 14443 smart card which is a common smart-card solution; then, an evaluation and the time analysis to perform the mutual authentication with SMAP on ISO/IEC 14443 smart cards is provided.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"55 35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128367517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-07DOI: 10.1109/ICUFN.2009.5174284
Q. D. Bui, A. Jennings
Relay path selection is one of the critical components of VoIP overlay systems. This paper looks at the choice of relay nodes and its impact on the performance of VoIP overlay paths in interdomain environment. We model the network at the Autonomous System level and simulate different scenarios of relay path selection. For the optimal relay path performance, we recommend to select relay nodes whose distances are less than or equal to three hops away from the sources. Our analysis shows that the performance of relay paths in existing methods is influenced by the density of the relay nodes. There is a trade-off between delay and hop overlap performance objectives. We propose new algorithm for selecting relay nodes. Initial results show that the proposed method can improve performance.
{"title":"Relay node selection in large-scale VoIP overlay networks","authors":"Q. D. Bui, A. Jennings","doi":"10.1109/ICUFN.2009.5174284","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174284","url":null,"abstract":"Relay path selection is one of the critical components of VoIP overlay systems. This paper looks at the choice of relay nodes and its impact on the performance of VoIP overlay paths in interdomain environment. We model the network at the Autonomous System level and simulate different scenarios of relay path selection. For the optimal relay path performance, we recommend to select relay nodes whose distances are less than or equal to three hops away from the sources. Our analysis shows that the performance of relay paths in existing methods is influenced by the density of the relay nodes. There is a trade-off between delay and hop overlap performance objectives. We propose new algorithm for selecting relay nodes. Initial results show that the proposed method can improve performance.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"57 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120815820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-07DOI: 10.1109/ICUFN.2009.5174298
K. Ho, K. T. Lot
In this paper, we propose a peer-based cooperative streaming framework with the use of broadcast capability of the network. The basic idea is to ask the concurrent high-end machines denoted peer server to cooperate to broadcast a video encoded by layered coding to clients. This transmission strategy aims to take the benefit of peer-to-peer (P2P) and video broadcasting for video delivery. Due to the dynamic nature of the P2P environment, the system performance of the proposed framework depends on the factors of the central server resource supplied, the number of peer server recruited and the minimum quality levels acquired. Hence, the main focus of this paper is to explore the relationship among these factors in the proposed architecture by an analytical model.
{"title":"Cooperative video broadcasting in heterogeneous network environment","authors":"K. Ho, K. T. Lot","doi":"10.1109/ICUFN.2009.5174298","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174298","url":null,"abstract":"In this paper, we propose a peer-based cooperative streaming framework with the use of broadcast capability of the network. The basic idea is to ask the concurrent high-end machines denoted peer server to cooperate to broadcast a video encoded by layered coding to clients. This transmission strategy aims to take the benefit of peer-to-peer (P2P) and video broadcasting for video delivery. Due to the dynamic nature of the P2P environment, the system performance of the proposed framework depends on the factors of the central server resource supplied, the number of peer server recruited and the minimum quality levels acquired. Hence, the main focus of this paper is to explore the relationship among these factors in the proposed architecture by an analytical model.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115206134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-07DOI: 10.1109/ICUFN.2009.5174285
M. Islam, Sanaa Waheed, I. Zubair
Overlay networks have emerged as a means to enhance end-to-end application performance and availability. Network topology plays an important role in utilizing resources in Peer-to-peer systems. Epidemic algorithms are potentially effective solutions for disseminating information in large scale and dynamic systems. P2P networks are popular for their dynamicity, but they are easy to deploy, robust and provide high resilience to failures. They proactively fight random process and network failures and do not need any reconfiguration when failures occur. This characteristic is particularly useful in P2P systems deployed on Internet or ad-hoc networks. In this paper we propose a new efficient gossip based algorithm for intelligent node selection (INS) and local view maintenance of a node. We also argue that the random node selection leads to data duplication which results in increasing bandwidth utilization. However, when selecting nodes on INS basis the bandwidth utilization has been reduced significantly. By using INS in application-level gossip multi-cast protocol the routing path will converge rapidly. For INS a distinctive overlay network which closely matches the Internet topology is constructed by combining different network topology-aware technique., The P2P system based on this structure is not only highly efficient for routing, but also keeps maintenance overhead very low even under highly dynamic environment, like ad-hoc networks.
{"title":"An Efficient Gossip Based Overlay Network For Peer-To-Peer Networks","authors":"M. Islam, Sanaa Waheed, I. Zubair","doi":"10.1109/ICUFN.2009.5174285","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174285","url":null,"abstract":"Overlay networks have emerged as a means to enhance end-to-end application performance and availability. Network topology plays an important role in utilizing resources in Peer-to-peer systems. Epidemic algorithms are potentially effective solutions for disseminating information in large scale and dynamic systems. P2P networks are popular for their dynamicity, but they are easy to deploy, robust and provide high resilience to failures. They proactively fight random process and network failures and do not need any reconfiguration when failures occur. This characteristic is particularly useful in P2P systems deployed on Internet or ad-hoc networks. In this paper we propose a new efficient gossip based algorithm for intelligent node selection (INS) and local view maintenance of a node. We also argue that the random node selection leads to data duplication which results in increasing bandwidth utilization. However, when selecting nodes on INS basis the bandwidth utilization has been reduced significantly. By using INS in application-level gossip multi-cast protocol the routing path will converge rapidly. For INS a distinctive overlay network which closely matches the Internet topology is constructed by combining different network topology-aware technique., The P2P system based on this structure is not only highly efficient for routing, but also keeps maintenance overhead very low even under highly dynamic environment, like ad-hoc networks.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126941062","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-07DOI: 10.1109/ICUFN.2009.5174314
Dong-Eun Kim, Jongwoo Kim, Suwon Park, S. Rhee, Chul-Ho Kang, Kiyoung Han, Hyongoo Kang
Performance of a collocated system containing WiMAX and Wi-Fi systems in a single device is analyzed for two cases: Collaborative and Non-Collaborative. In order to reduce the mutual interference between Wi-Fi and WiMAX system in the collocated system, a circulator-based collocated system is proposed and its performance is analyzed with simulation.
{"title":"Circulator-based interference reduction method for WiMAX system and Wi-Fi system in shared band","authors":"Dong-Eun Kim, Jongwoo Kim, Suwon Park, S. Rhee, Chul-Ho Kang, Kiyoung Han, Hyongoo Kang","doi":"10.1109/ICUFN.2009.5174314","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174314","url":null,"abstract":"Performance of a collocated system containing WiMAX and Wi-Fi systems in a single device is analyzed for two cases: Collaborative and Non-Collaborative. In order to reduce the mutual interference between Wi-Fi and WiMAX system in the collocated system, a circulator-based collocated system is proposed and its performance is analyzed with simulation.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130093155","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-07DOI: 10.1109/ICUFN.2009.5174279
S. Chobsri, Watinee Sumalai, W. Usaha
This paper proposes a data acquisition scheme which supports probabilistic data quality assurance in an error-prone Wireless Sensor Network (WSN). Given a query and a statistical model of real-world data which is highly correlated, the aim of the scheme is to find a sensor selection scheme which is used to deal with inaccurate data and probabilistic guarantee on the query result. Since most sensor readings are real-valued, we formulate the data acquisition problem as a continuous-state partially observable Markov Decision Process (POMDP). To solve the continuous-state POMDP, the fitted value iteration (FVI) is applied to find a sensor selection scheme. Numerical results show that FVI can achieve high average long-term reward and provide probabilistic guarantees on the query result more often when compared to other algorithms.
{"title":"Quality assurance for data acquisition in error prone WSNs","authors":"S. Chobsri, Watinee Sumalai, W. Usaha","doi":"10.1109/ICUFN.2009.5174279","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174279","url":null,"abstract":"This paper proposes a data acquisition scheme which supports probabilistic data quality assurance in an error-prone Wireless Sensor Network (WSN). Given a query and a statistical model of real-world data which is highly correlated, the aim of the scheme is to find a sensor selection scheme which is used to deal with inaccurate data and probabilistic guarantee on the query result. Since most sensor readings are real-valued, we formulate the data acquisition problem as a continuous-state partially observable Markov Decision Process (POMDP). To solve the continuous-state POMDP, the fitted value iteration (FVI) is applied to find a sensor selection scheme. Numerical results show that FVI can achieve high average long-term reward and provide probabilistic guarantees on the query result more often when compared to other algorithms.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130116158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-07DOI: 10.1109/ICUFN.2009.5174312
Zong-Jhe Wu, Jeng-Ji Huang
Distributed coordination function (DCF) is the main technique of IEEE 802.11, which relies on carrier sense multiple access/collision avoidance (CSMA/CA) to reduce collision among stations. In this paper, a scheme is proposed to improve the throughput performance of the DCF in a hybrid environment, where a ready to send (RTS) frame is used when the length of a packet exceeds a threshold. Suppose, e.g., that a RTS frame and a packet are transmitted simultaneously, the result under the legacy DCF is that a collision occurs and both of them fail; the transmission bandwidth is thus wasted. To prevent this, an extra portion is added in front of the packet in the proposed scheme, and its length equals the size of a RTS frame. Clearly, it can prevent the packet from the collision process whenever it experiences a collision with one or multiple RTS frames.
{"title":"An improved 802.11 DCF in a hybrid environment","authors":"Zong-Jhe Wu, Jeng-Ji Huang","doi":"10.1109/ICUFN.2009.5174312","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174312","url":null,"abstract":"Distributed coordination function (DCF) is the main technique of IEEE 802.11, which relies on carrier sense multiple access/collision avoidance (CSMA/CA) to reduce collision among stations. In this paper, a scheme is proposed to improve the throughput performance of the DCF in a hybrid environment, where a ready to send (RTS) frame is used when the length of a packet exceeds a threshold. Suppose, e.g., that a RTS frame and a packet are transmitted simultaneously, the result under the legacy DCF is that a collision occurs and both of them fail; the transmission bandwidth is thus wasted. To prevent this, an extra portion is added in front of the packet in the proposed scheme, and its length equals the size of a RTS frame. Clearly, it can prevent the packet from the collision process whenever it experiences a collision with one or multiple RTS frames.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133428338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-07DOI: 10.1109/ICUFN.2009.5174288
Sangheon Pack, Jaeyong An, Wonjun Lee
The multiple registration scheme can reduce the location update cost in hierarchical cellular networks; however, it leads to the increased call setup latency to find out the current location of a mobile terminal. In this paper, we propose an efficient call delivery algorithm that employs a timer estimating the low-tier cell residence time. Analytical and simulation results demonstrate that the proposed algorithm outperforms high-tier cell first and low-tier cell first algorithms in terms of call setup latency.
{"title":"An efficient call delivery algorithm in hierarchical cellular networks","authors":"Sangheon Pack, Jaeyong An, Wonjun Lee","doi":"10.1109/ICUFN.2009.5174288","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174288","url":null,"abstract":"The multiple registration scheme can reduce the location update cost in hierarchical cellular networks; however, it leads to the increased call setup latency to find out the current location of a mobile terminal. In this paper, we propose an efficient call delivery algorithm that employs a timer estimating the low-tier cell residence time. Analytical and simulation results demonstrate that the proposed algorithm outperforms high-tier cell first and low-tier cell first algorithms in terms of call setup latency.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133130488","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
扫码关注我们
求助内容：
应助结果提醒方式：