The performance of a cooperative communication wireless network with a single relay system is studied over Nakagami-m fading channels. The simplest Alamouti space-time block code is transmitted through an amplify- and-forward (AF) relay terminal in a two-hop network. The exact symbol error rates (SER) are analyzed using the moment generating function (MGF) of the total signal to noise ratio (SNR) for a particular signal in the case of M-ary phase shift keying (M-PSK) modulation schemes. Subsequently, numerical and simulation results are provided to verify the accuracy of the formulation.
{"title":"Performance Evaluation of Alamouti STC through Amplify-Forward Cooperative Relay Network over Nakagami-m Fading Channels","authors":"S. Atapattu, Nandana Rajatheva","doi":"10.1109/FGCN.2007.181","DOIUrl":"https://doi.org/10.1109/FGCN.2007.181","url":null,"abstract":"The performance of a cooperative communication wireless network with a single relay system is studied over Nakagami-m fading channels. The simplest Alamouti space-time block code is transmitted through an amplify- and-forward (AF) relay terminal in a two-hop network. The exact symbol error rates (SER) are analyzed using the moment generating function (MGF) of the total signal to noise ratio (SNR) for a particular signal in the case of M-ary phase shift keying (M-PSK) modulation schemes. Subsequently, numerical and simulation results are provided to verify the accuracy of the formulation.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115326599","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}
Detecting and tracking boundaries of a physical process by a large-scale sensor networks are often desirable or even required in various applications. The first step in the detection and tracking procedures is edge detection. Most of the edge detection schemes proposed for sensor networks require information on sensor locations. Also, quantitative measures by which performance of an edge detector for sensor networks can be analyzed have not been available. In this paper, edge detectors which do not require the absolute or relative location of each sensor node are proposed along with a set of metrics used for performance analysis. Detailed performance analysis results obtained through simulation, varying parameters such as sensor density, communication range, and noise level, are provided.
{"title":"Edge Detection Using Orientation-Independent Operators in Large-Scale Sensor Networks","authors":"Kyungryong Seo, Soo-Young Lee","doi":"10.1109/FGCN.2007.110","DOIUrl":"https://doi.org/10.1109/FGCN.2007.110","url":null,"abstract":"Detecting and tracking boundaries of a physical process by a large-scale sensor networks are often desirable or even required in various applications. The first step in the detection and tracking procedures is edge detection. Most of the edge detection schemes proposed for sensor networks require information on sensor locations. Also, quantitative measures by which performance of an edge detector for sensor networks can be analyzed have not been available. In this paper, edge detectors which do not require the absolute or relative location of each sensor node are proposed along with a set of metrics used for performance analysis. Detailed performance analysis results obtained through simulation, varying parameters such as sensor density, communication range, and noise level, are provided.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130412364","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 new adaptive HARQ scheme based on LDPC codes by observing the reliability and the relations between reliability and BLER with different code rate. The results of the simulations show that this scheme can achieve higher throughput and lower time delay, and that it doesn't increase the complexity of the system.
{"title":"An Adaptive Packet Repeat Proposal RB_IR_HARQ Scheme based on LDPC code","authors":"Ning He, H. Wen, Shuya Yang, Liang Zhou","doi":"10.1109/FGCN.2007.54","DOIUrl":"https://doi.org/10.1109/FGCN.2007.54","url":null,"abstract":"In this paper, we propose a new adaptive HARQ scheme based on LDPC codes by observing the reliability and the relations between reliability and BLER with different code rate. The results of the simulations show that this scheme can achieve higher throughput and lower time delay, and that it doesn't increase the complexity of the system.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131088066","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 an adaptive application-specific cooperative relaying mechanism for delivering layered coded multimedia data over wireless sensor networks. The proposed approach is to optimally map source data layers of different perceptual importance to relay nodes, so that the most important data layer can be transmitted in high quality. Each relay node only needs to detect and forward the assigned sub-streams (layers) of multimedia data. The distinctive benefit of this approach is to minimize the video distortion induced by buffer overflow and delay violation, while reducing transmission processing requirements on each relay node and providing significant savings in transmit and receive energy. Experimental results show that, compared with other cooperative methods, the proposed algorithm achieves significant performance improvement.
{"title":"Adaptive Application-specific Cooperative Relay for Wireless Video Sensor Networks","authors":"Xiaoli Wang, Daqing Gu, Tao Shu","doi":"10.1109/FGCN.2007.49","DOIUrl":"https://doi.org/10.1109/FGCN.2007.49","url":null,"abstract":"In this paper, we propose an adaptive application-specific cooperative relaying mechanism for delivering layered coded multimedia data over wireless sensor networks. The proposed approach is to optimally map source data layers of different perceptual importance to relay nodes, so that the most important data layer can be transmitted in high quality. Each relay node only needs to detect and forward the assigned sub-streams (layers) of multimedia data. The distinctive benefit of this approach is to minimize the video distortion induced by buffer overflow and delay violation, while reducing transmission processing requirements on each relay node and providing significant savings in transmit and receive energy. Experimental results show that, compared with other cooperative methods, the proposed algorithm achieves significant performance improvement.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"353 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128971289","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}
Careless development of Web applications has often caused occurrence of new Web-based attacks. The signature-based intrusion detection system cannot detect these attacks as it seems to lack the capability to deal with such various new intrusions. As a result, it is necessary to research and develop new types of detection methods that can detect new intrusions as well as protect the system from previous well-known attacks. In this paper, we propose a web anomaly detection system. This system can detect suspicious Web traffic using an HTTP traffic pattern analysis and the URI field information analysis of the HTTP packet. We also demonstrate the feasibility of the proposed system by implementing the system and showing some reasonable results.
{"title":"Web Anomaly Detection System for Mobile Web Client","authors":"Sung-Min Jang, Yoo-Hun Won","doi":"10.1109/FGCN.2007.232","DOIUrl":"https://doi.org/10.1109/FGCN.2007.232","url":null,"abstract":"Careless development of Web applications has often caused occurrence of new Web-based attacks. The signature-based intrusion detection system cannot detect these attacks as it seems to lack the capability to deal with such various new intrusions. As a result, it is necessary to research and develop new types of detection methods that can detect new intrusions as well as protect the system from previous well-known attacks. In this paper, we propose a web anomaly detection system. This system can detect suspicious Web traffic using an HTTP traffic pattern analysis and the URI field information analysis of the HTTP packet. We also demonstrate the feasibility of the proposed system by implementing the system and showing some reasonable results.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114572723","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 new storage system architecture called as U-Storage (ubiquitous storage system). U-Storage allows a user to access an on-line storage with any type of information devices that are able to connect to Internet. The on-line storage is virtualized to the user's information devices as a local hard disk or a memory card by our U-Storage. With devices supporting U-Storage, users can read and write their data anytime and anywhere without downloading and uploading operation.
{"title":"U-Storage: A New On-line Storage System for Ubiquitous Environment","authors":"Seokil Song, Y. Kwak","doi":"10.1109/FGCN.2007.227","DOIUrl":"https://doi.org/10.1109/FGCN.2007.227","url":null,"abstract":"In this paper, we propose a new storage system architecture called as U-Storage (ubiquitous storage system). U-Storage allows a user to access an on-line storage with any type of information devices that are able to connect to Internet. The on-line storage is virtualized to the user's information devices as a local hard disk or a memory card by our U-Storage. With devices supporting U-Storage, users can read and write their data anytime and anywhere without downloading and uploading operation.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122725119","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}
Huansheng Ning, Na Ning, Shenfeng Qu, Yan Zhang, Huiping Yang
The development for Internet of Things and RFID technology is described in this paper. A feasible scheme and layered structure is proposed for Internet of Things. Its management is presented according to the demand for Internet of Things in China. The general system contains two parts: computer information subsystem and RFID terminal subsystem, the latter of which is the main focus. The management protocol for Internet of Things explored in the paper includes SNMP and RFID managing protocol (RFID- MP).
{"title":"Layered Structure and Management in Internet of Things","authors":"Huansheng Ning, Na Ning, Shenfeng Qu, Yan Zhang, Huiping Yang","doi":"10.1109/FGCN.2007.158","DOIUrl":"https://doi.org/10.1109/FGCN.2007.158","url":null,"abstract":"The development for Internet of Things and RFID technology is described in this paper. A feasible scheme and layered structure is proposed for Internet of Things. Its management is presented according to the demand for Internet of Things in China. The general system contains two parts: computer information subsystem and RFID terminal subsystem, the latter of which is the main focus. The management protocol for Internet of Things explored in the paper includes SNMP and RFID managing protocol (RFID- MP).","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122941902","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 establish a first passage time analysis for event-driven sensor networks with single hop. Our model can be regarded as a theoretical analysis for time cost of message transmission to sink node in an event-driven process in which Slotted ALOHA protocol is implemented. The first passage time Tn,lambda depends on the size n of activated nodes and their transmission rate lambda. Given n, we study the optimal lambda and give the approximation radic1n n/n, further more we give the estimate of the size n from the view point of sink node. So that we can adjust the transmission rate lambda to attain the optimal expected time cost Tmin (n). Numerical result indicates that given the size of active nodes n, the optimal time cost of the procedure increases nearly linearly with n increasing which implies that ALOHA protocol is efficient even in dense event-driven sensor networks.
{"title":"First Passage Time Analysis in Event-Driven Wireless Sensor Networks","authors":"Lu Yu","doi":"10.1109/FGCN.2007.128","DOIUrl":"https://doi.org/10.1109/FGCN.2007.128","url":null,"abstract":"In this paper, we establish a first passage time analysis for event-driven sensor networks with single hop. Our model can be regarded as a theoretical analysis for time cost of message transmission to sink node in an event-driven process in which Slotted ALOHA protocol is implemented. The first passage time Tn,lambda depends on the size n of activated nodes and their transmission rate lambda. Given n, we study the optimal lambda and give the approximation radic1n n/n, further more we give the estimate of the size n from the view point of sink node. So that we can adjust the transmission rate lambda to attain the optimal expected time cost Tmin (n). Numerical result indicates that given the size of active nodes n, the optimal time cost of the procedure increases nearly linearly with n increasing which implies that ALOHA protocol is efficient even in dense event-driven sensor networks.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133961310","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}
Dong-oh Kang, K. Kang, Hyung-Jik Lee, Eun-Jung Ko, Jeunwoo Lee
Recent developments of information technologies are leading the advent of the era of ubiquitous healthcare service, which means healthcare services at any time and at any places. In a home, the ubiquitous healthcare service requires some context aware system for smart services using home network. In this paper, we propose a systematic design tool of a context aware system for ubiquitous healthcare service in a smart home, which is composed of a home gateway, a home server, a PDA, home network healthcare devices, and wearable sensors. We developed a context aware framework to send information from wearable sensors or healthcare devices to healthcare service entities as a middleware to solve the interoperability problem among sensor makers and healthcare service providers. And, we propose a design tool of ubiquitous healthcare services with the context aware framework in a systematic way. In order to show the feasibility of the proposed system, an application example is given, which is applied to a self check service.
{"title":"A Systematic Design Tool of Context Aware System for Ubiquitous Healthcare Service in a Smart Home","authors":"Dong-oh Kang, K. Kang, Hyung-Jik Lee, Eun-Jung Ko, Jeunwoo Lee","doi":"10.1109/FGCN.2007.45","DOIUrl":"https://doi.org/10.1109/FGCN.2007.45","url":null,"abstract":"Recent developments of information technologies are leading the advent of the era of ubiquitous healthcare service, which means healthcare services at any time and at any places. In a home, the ubiquitous healthcare service requires some context aware system for smart services using home network. In this paper, we propose a systematic design tool of a context aware system for ubiquitous healthcare service in a smart home, which is composed of a home gateway, a home server, a PDA, home network healthcare devices, and wearable sensors. We developed a context aware framework to send information from wearable sensors or healthcare devices to healthcare service entities as a middleware to solve the interoperability problem among sensor makers and healthcare service providers. And, we propose a design tool of ubiquitous healthcare services with the context aware framework in a systematic way. In order to show the feasibility of the proposed system, an application example is given, which is applied to a self check service.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122836807","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}
Packet loss in IP networks can be congestive due to IP interrupt queue overflow on the nodes, and non- congestive due to link disruption caused by hardware failure, signal-fading or obstacles. Recognition of two types of losses can largely help TCP endpoints in making right decisions. In this paper we apply the visualized IP-based network simulator (VINS) to characterize the key differences between two types of packet losses. Based on the analyses, improvements for wireless TCP endpoints are proposed on both kernel and application levels in terms of avoiding useless keep-alive probing and congestion window tuning, but re-routing and re-establishing new connections.
{"title":"Suggested Improvements for Wireless TCP Endpoints","authors":"Nanjun Li, W. Zorn","doi":"10.1109/FGCN.2007.206","DOIUrl":"https://doi.org/10.1109/FGCN.2007.206","url":null,"abstract":"Packet loss in IP networks can be congestive due to IP interrupt queue overflow on the nodes, and non- congestive due to link disruption caused by hardware failure, signal-fading or obstacles. Recognition of two types of losses can largely help TCP endpoints in making right decisions. In this paper we apply the visualized IP-based network simulator (VINS) to characterize the key differences between two types of packet losses. Based on the analyses, improvements for wireless TCP endpoints are proposed on both kernel and application levels in terms of avoiding useless keep-alive probing and congestion window tuning, but re-routing and re-establishing new connections.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121210560","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
扫码关注我们
求助内容：
应助结果提醒方式：