Pub Date : 2011-12-01DOI: 10.1109/ISCIT.2011.6089954
Thorsten Ries, R. State, T. Engel
Popularity and awareness of anonymisation systems increased tremendously over the past years, however only a very few systems made it from research to production. These systems usually add intermediate nodes in the communication path aiming to hide user identities. Several attacks against these systems exist, like timing attacks or exploitation of latency information. In this paper, we propose an alternative approach to disclose users of current popular anonymisation systems in practice by the means of virtual network coordinate systems, a widely accepted method for latency prediction and network optimisation. Mapping physical nodes to a n-dimensional space can reveal a geographical proximity that is used to disclose users, who expect to stay anonymous. We define a model that leverages network coordinates in order to measure quantitatively the anonymity services and evaluate it on the Planet-Lab research network. The basic idea is to analyse the relative distance between nodes and to calculate the probability of nodes being hosted in the same location. Evaluation proves that our proposed model can be used as a measure of anonymity.
{"title":"Measuring anonymity using network coordinate systems","authors":"Thorsten Ries, R. State, T. Engel","doi":"10.1109/ISCIT.2011.6089954","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089954","url":null,"abstract":"Popularity and awareness of anonymisation systems increased tremendously over the past years, however only a very few systems made it from research to production. These systems usually add intermediate nodes in the communication path aiming to hide user identities. Several attacks against these systems exist, like timing attacks or exploitation of latency information. In this paper, we propose an alternative approach to disclose users of current popular anonymisation systems in practice by the means of virtual network coordinate systems, a widely accepted method for latency prediction and network optimisation. Mapping physical nodes to a n-dimensional space can reveal a geographical proximity that is used to disclose users, who expect to stay anonymous. We define a model that leverages network coordinates in order to measure quantitatively the anonymity services and evaluate it on the Planet-Lab research network. The basic idea is to analyse the relative distance between nodes and to calculate the probability of nodes being hosted in the same location. Evaluation proves that our proposed model can be used as a measure of anonymity.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132499467","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 Japan, senior citizen population is rapidly increasing as a result of the progress in super-aging society, while many younger generation people live separately from their elderly relatives under the current societal environment. Nevertheless, young people often have a desire for constantly watching health conditions of their elderly relatives even remotely. In this paper, we propose a system to constantly trace the moves of elderly people and accumulate the information obtained through Smart-Phone in the management server so that watchers (families and/or relatives) are able to cope with the situation urgently, should any abnormal conditions be detected. We have implemented part of our proposed system and confirmed the effectiveness of the system.
{"title":"Proposal and implementation of a system to remotely watch the health conditions of elderly persons","authors":"Hiroyuki Yamagishi, Daichi Kato, Kazunori Teshima, Hidekazu Suzuki, Osami Yamamoto, A. Watanabe","doi":"10.1109/ISCIT.2011.6089965","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089965","url":null,"abstract":"In Japan, senior citizen population is rapidly increasing as a result of the progress in super-aging society, while many younger generation people live separately from their elderly relatives under the current societal environment. Nevertheless, young people often have a desire for constantly watching health conditions of their elderly relatives even remotely. In this paper, we propose a system to constantly trace the moves of elderly people and accumulate the information obtained through Smart-Phone in the management server so that watchers (families and/or relatives) are able to cope with the situation urgently, should any abnormal conditions be detected. We have implemented part of our proposed system and confirmed the effectiveness of the system.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115666371","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089746
Qin-long Qiu, Liang Zhao, Ling-di Ping, Chunming Wu, Qiang Yang
In the Long Term Evolution (LTE) network, buffer overflows often occur in the evolved Node B (eNB) when dealing with the traffic bursts from the wired part due to restricted bandwidth or environmental interferences in the wireless part. In this paper, a novel approach is proposed to protect the buffer from overflow by appropriately controlling the advertisement window to enhance the Transmission Control Protocol (TCP) when the buffer becomes congested. The sender will slow down the data sending rate upon the receipt of reduced advertisement window, and hence the buffer overflow will be alleviated. To evaluate the suggested solution, a LTE network model is implemented and validated through extensive numerical experiments. It is demonstrated that the proposed approach can enhance the end to end system performance in terms of network throughput, average packet delay and jitter, as well as packet loss rate.
在LTE (Long Term Evolution)网络中，演进节点B (eNB)在处理来自有线部分的业务突发时，由于无线部分的带宽限制或环境干扰，经常会发生缓冲区溢出。本文提出了一种在缓冲区拥塞时通过适当控制广告窗口来防止缓冲区溢出的新方法，以提高TCP (Transmission Control Protocol，传输控制协议)的性能。发送方接收到减少的广告窗口后，将减慢数据发送速率，从而缓解缓冲区溢出。为了评估建议的解决方案，实现了一个LTE网络模型，并通过大量的数值实验进行了验证。实验结果表明，该方法在网络吞吐量、平均数据包延迟和抖动以及丢包率等方面都能提高端到端系统的性能。
{"title":"Avoiding the evolved node B buffer overflow by using advertisement window control","authors":"Qin-long Qiu, Liang Zhao, Ling-di Ping, Chunming Wu, Qiang Yang","doi":"10.1109/ISCIT.2011.6089746","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089746","url":null,"abstract":"In the Long Term Evolution (LTE) network, buffer overflows often occur in the evolved Node B (eNB) when dealing with the traffic bursts from the wired part due to restricted bandwidth or environmental interferences in the wireless part. In this paper, a novel approach is proposed to protect the buffer from overflow by appropriately controlling the advertisement window to enhance the Transmission Control Protocol (TCP) when the buffer becomes congested. The sender will slow down the data sending rate upon the receipt of reduced advertisement window, and hence the buffer overflow will be alleviated. To evaluate the suggested solution, a LTE network model is implemented and validated through extensive numerical experiments. It is demonstrated that the proposed approach can enhance the end to end system performance in terms of network throughput, average packet delay and jitter, as well as packet loss rate.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125413156","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092192
Shufang Tan, Xiaoning Zhang, Lemin Li, Sheng Wang
In this paper, we study green (energy efficient) optical networks with availability guarantee. After introducing a power consumption model for green optical network design, we propose a design method called Availability-Guaranteed Energy-Efficient Design (AGEED). In AGEED, we employ dedicated path protection as backup capacity in order to improve the availability. Based on iterative routing by modifying link weight, we can make some resources be switched to sleep mode, thus obtain an energy-saving effect if there is no heavy traffic. Our simulation shows that AGEED is more advantageous to achieve energy-efficient purposes and guarantee satisfied availability levels in comparison with other methods.
{"title":"Green optical networks with availability guarantee","authors":"Shufang Tan, Xiaoning Zhang, Lemin Li, Sheng Wang","doi":"10.1109/ISCIT.2011.6092192","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092192","url":null,"abstract":"In this paper, we study green (energy efficient) optical networks with availability guarantee. After introducing a power consumption model for green optical network design, we propose a design method called Availability-Guaranteed Energy-Efficient Design (AGEED). In AGEED, we employ dedicated path protection as backup capacity in order to improve the availability. Based on iterative routing by modifying link weight, we can make some resources be switched to sleep mode, thus obtain an energy-saving effect if there is no heavy traffic. Our simulation shows that AGEED is more advantageous to achieve energy-efficient purposes and guarantee satisfied availability levels in comparison with other methods.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125258958","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089966
Shusmita Anwar Sharna, M. R. Amin, M. M. Murshed
An increasing demand for wireless access to packet-based services has, in turn, driven the need for call admission control strategies to make network roaming more seamless. This paper investigates the optimal call admission control (CAC) policy for heterogeneous wireless networks based on Markov Decision Process (MDP) and Value Iteration Algorithm (VIA). We concentrate on the optimization problems of when different type of calls (i.e., new calls, vertical handoff calls, and horizontal handoff calls) can be admitted into the system where each call may have single or multiple channel requirements (multiclass). Experimental results confirm that the proposed technique can effectively control call admission of a highly dynamic heterogeneous system, which will be crucial for accommodating vertical handoff decision algorithms.
{"title":"Call admission control policy for multiclass traffic in heterogeneous wireless networks","authors":"Shusmita Anwar Sharna, M. R. Amin, M. M. Murshed","doi":"10.1109/ISCIT.2011.6089966","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089966","url":null,"abstract":"An increasing demand for wireless access to packet-based services has, in turn, driven the need for call admission control strategies to make network roaming more seamless. This paper investigates the optimal call admission control (CAC) policy for heterogeneous wireless networks based on Markov Decision Process (MDP) and Value Iteration Algorithm (VIA). We concentrate on the optimization problems of when different type of calls (i.e., new calls, vertical handoff calls, and horizontal handoff calls) can be admitted into the system where each call may have single or multiple channel requirements (multiclass). Experimental results confirm that the proposed technique can effectively control call admission of a highly dynamic heterogeneous system, which will be crucial for accommodating vertical handoff decision algorithms.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123660944","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089758
Yongjie Xu, Zhiquan Bai, K. Kwak
In this paper, a dual-hop regenerative cooperative relaying UWB communication system with detect-and-forward (DTF) and decoded-and-forward (DF) is studied. The average system bit error rate (BER) and the system performance with DTF and DF relaying schemes are provided. The DF relaying with convolutional coding is employed in this cooperative relaying UWB system. The Gaussian quadrature numerical method is used to obtain the Moment-Generating Function (MGF) of the received energy. Our simulation results show the advantages of the DF based cooperative IR-UWB system over IEEE 802.15.3a channels.
{"title":"On the performance of dual-hop regenerative cooperative relaying of IR-UWB system","authors":"Yongjie Xu, Zhiquan Bai, K. Kwak","doi":"10.1109/ISCIT.2011.6089758","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089758","url":null,"abstract":"In this paper, a dual-hop regenerative cooperative relaying UWB communication system with detect-and-forward (DTF) and decoded-and-forward (DF) is studied. The average system bit error rate (BER) and the system performance with DTF and DF relaying schemes are provided. The DF relaying with convolutional coding is employed in this cooperative relaying UWB system. The Gaussian quadrature numerical method is used to obtain the Moment-Generating Function (MGF) of the received energy. Our simulation results show the advantages of the DF based cooperative IR-UWB system over IEEE 802.15.3a channels.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128957886","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092152
P. Phaneendra, C. Vudadha, Syed Ershad Ahmed, S. Veeramachaneni, N. Muthukrishnan, M. Srinivas
Algorithms based Media applications operate on operands of varying data lengths. Although much work has been done in designing adder and multiplier architectures which operate on varying data lengths, there has been little work on implementing other operations like increment/decrement, 2's complement etc. This paper presents an architecture which can perform increment/decrement/2's complement/priority-encode operations on varying data lengths. A 32-bit implementation of the proposed multifunctional architecture is presented, which can operate on four 8-bit operands, two 16-bit operands or one 32-bit operand.
{"title":"Increment/decrement/2's complement/priority encoder circuit for varying operand lengths","authors":"P. Phaneendra, C. Vudadha, Syed Ershad Ahmed, S. Veeramachaneni, N. Muthukrishnan, M. Srinivas","doi":"10.1109/ISCIT.2011.6092152","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092152","url":null,"abstract":"Algorithms based Media applications operate on operands of varying data lengths. Although much work has been done in designing adder and multiplier architectures which operate on varying data lengths, there has been little work on implementing other operations like increment/decrement, 2's complement etc. This paper presents an architecture which can perform increment/decrement/2's complement/priority-encode operations on varying data lengths. A 32-bit implementation of the proposed multifunctional architecture is presented, which can operate on four 8-bit operands, two 16-bit operands or one 32-bit operand.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"798 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120877172","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089961
Peng Sun, Xing Yang, Daoben Li, Li Fang
In this paper, a new efficient scheme is proposed for the fast detection in spatially correlated MEMO systems. By adding cutting planes to the original semi definite relaxation scheme, the new method shows more robustness than other fast detection schemes towards the increasing condition number of the channel matrix, which is always caused by the correlation between different antennas. In order to prove its advancement, the bit error rate performance of the new scheme is compared with other detection schemes like lattice reduction, serial interference cancelation and the original semi definite relaxation. Simulation results show clearly that with the ill conditioned channel matrix, the new detection strategy outperforms the other schemes, while its complexity remains cubic to the number of antennas plus the number of cutting planes added.
{"title":"Near-maximum-likelihood detection in spatially correlated MIMO systems using semi-definite relaxation with cutting planes","authors":"Peng Sun, Xing Yang, Daoben Li, Li Fang","doi":"10.1109/ISCIT.2011.6089961","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089961","url":null,"abstract":"In this paper, a new efficient scheme is proposed for the fast detection in spatially correlated MEMO systems. By adding cutting planes to the original semi definite relaxation scheme, the new method shows more robustness than other fast detection schemes towards the increasing condition number of the channel matrix, which is always caused by the correlation between different antennas. In order to prove its advancement, the bit error rate performance of the new scheme is compared with other detection schemes like lattice reduction, serial interference cancelation and the original semi definite relaxation. Simulation results show clearly that with the ill conditioned channel matrix, the new detection strategy outperforms the other schemes, while its complexity remains cubic to the number of antennas plus the number of cutting planes added.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122879755","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089699
Gengfa Fang, E. Dutkiewicz, M. A. Huq, R. Vesilo, Yihuai Yang
Medical Body Area Network (MBAN) is a new wireless communications technology designed to sense human's vital signals through tiny nodes in, on and around the human body wirelessly. MBAN will play an important role in enabling ubiquitous and non-invasive telemetry and healthcare systems in the future. In this paper, we firstly explore the opportunities of MBAN from the point of new applications, and then we analyze the enabling technologies and challenges to achieve the goal of MBAN, which includes energy efficiency, robustness, high data rate for video support and network co-existence issues. Finally, we describe our MQWIN400 radio platform which was designed to work at 400MHz MICS band, as well as the related research activities and experimental results.
医学体域网络(Medical Body Area Network, MBAN)是一种新型无线通信技术，旨在通过人体内外和周围的微小节点无线感知人体的生命信号。MBAN将在未来实现无处不在的非侵入式遥测和医疗保健系统中发挥重要作用。本文首先从新应用的角度探讨了MBAN的机遇，然后分析了实现MBAN目标的使能技术和挑战，包括能效、鲁棒性、视频支持的高数据速率和网络共存问题。最后，介绍了我们设计的工作在400MHz MICS频段的MQWIN400无线电平台，以及相关的研究活动和实验结果。
{"title":"Medical Body Area Networks: Opportunities, challenges and practices","authors":"Gengfa Fang, E. Dutkiewicz, M. A. Huq, R. Vesilo, Yihuai Yang","doi":"10.1109/ISCIT.2011.6089699","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089699","url":null,"abstract":"Medical Body Area Network (MBAN) is a new wireless communications technology designed to sense human's vital signals through tiny nodes in, on and around the human body wirelessly. MBAN will play an important role in enabling ubiquitous and non-invasive telemetry and healthcare systems in the future. In this paper, we firstly explore the opportunities of MBAN from the point of new applications, and then we analyze the enabling technologies and challenges to achieve the goal of MBAN, which includes energy efficiency, robustness, high data rate for video support and network co-existence issues. Finally, we describe our MQWIN400 radio platform which was designed to work at 400MHz MICS band, as well as the related research activities and experimental results.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127833163","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089955
Daichi Kato, Hiroyuki Yamagishi, Hidekazu Suzuki, E. Konaka, A. Watanabe
There is an increasing tendency that elderly people live separately from their children or relatives with the advance of low-birth-rate, aging society and the changes in living environment. Under such circumstances, a number of systems to remotely watch vulnerable people by utilizing sensor devices and communication functions have been proposed. Existing systems to watch vulnerable people are, however, mainly aiming at health management or obtaining merely locational information of vulnerable people, and they are not able to perform a high-level observation to grasp the actual situation of those people. In this paper, we introduce a new system to remotely watch conditions of vulnerable people while they are walking or driving a car, by utilizing various types of sensors embedded in a smartphone. In our system, information obtained is periodically sent to and accumulated in the management server on the Internet, and watching people can observe their vulnerable relatives from anywhere and cope with emergency situations promptly.
{"title":"Proposal of a remote watching system utilizing a smartphone and sensors","authors":"Daichi Kato, Hiroyuki Yamagishi, Hidekazu Suzuki, E. Konaka, A. Watanabe","doi":"10.1109/ISCIT.2011.6089955","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089955","url":null,"abstract":"There is an increasing tendency that elderly people live separately from their children or relatives with the advance of low-birth-rate, aging society and the changes in living environment. Under such circumstances, a number of systems to remotely watch vulnerable people by utilizing sensor devices and communication functions have been proposed. Existing systems to watch vulnerable people are, however, mainly aiming at health management or obtaining merely locational information of vulnerable people, and they are not able to perform a high-level observation to grasp the actual situation of those people. In this paper, we introduce a new system to remotely watch conditions of vulnerable people while they are walking or driving a car, by utilizing various types of sensors embedded in a smartphone. In our system, information obtained is periodically sent to and accumulated in the management server on the Internet, and watching people can observe their vulnerable relatives from anywhere and cope with emergency situations promptly.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131236236","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
扫码关注我们
求助内容：
应助结果提醒方式：