... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies最新文献
The FIRESENSE FP7 project aims to implement an automatic early warning system to remotely monitor areas of archaeological and cultural interest from the risk of fire and extreme weather conditions. This challenging task requires the operation of a multimodal wireless sensor network, the setting up of an infrastructure to publish and access sensor data and the fusion of multiple modalities in a real-time fashion. This paper discusses the multimodal sensor data access and fusion aspects of the project.
{"title":"Multimodal monitoring of cultural heritage sites and the FIRESENSE project","authors":"A. A. Salah, J. Han, E. Pauwels, P. M. D. Zeeuw","doi":"10.1145/2093698.2093850","DOIUrl":"https://doi.org/10.1145/2093698.2093850","url":null,"abstract":"The FIRESENSE FP7 project aims to implement an automatic early warning system to remotely monitor areas of archaeological and cultural interest from the risk of fire and extreme weather conditions. This challenging task requires the operation of a multimodal wireless sensor network, the setting up of an infrastructure to publish and access sensor data and the fusion of multiple modalities in a real-time fashion. This paper discusses the multimodal sensor data access and fusion aspects of the project.","PeriodicalId":91990,"journal":{"name":"... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies","volume":"245 1","pages":"152:1-152:5"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76275894","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}
Narun Asvarujanon, N. Wakamiya, K. Leibnitz, M. Murata
Computer networks have become highly complicated and less flexible to handle emerging problems which often occur nowadays. In order to cope with unpredictable problems, the concept of biologically inspired networks has been introduced, which provides a high degree of robustness and adaptability to computer networks. However, the performance of the network often relies heavily on the configurable parameters assigned during the deployment process, where end nodes cannot change these parameters during runtime to achieve the desirable performance. In this paper, we introduce a new method, called attractor perturbation (AP) allowing end nodes to influence the average of an observable performance metric at runtime without directly manipulating any optimal parameters of underlying protocols. An example application in this paper is a traffic distribution over multi-path routing protocol in MANETs, where the target variable is end-to-end delay. The approach to solve for the appropriate amount of management influence and simulation results are shown in this paper.
{"title":"Noise-assisted traffic distribution over multi-path ad hoc routing","authors":"Narun Asvarujanon, N. Wakamiya, K. Leibnitz, M. Murata","doi":"10.1145/2093698.2093823","DOIUrl":"https://doi.org/10.1145/2093698.2093823","url":null,"abstract":"Computer networks have become highly complicated and less flexible to handle emerging problems which often occur nowadays. In order to cope with unpredictable problems, the concept of biologically inspired networks has been introduced, which provides a high degree of robustness and adaptability to computer networks. However, the performance of the network often relies heavily on the configurable parameters assigned during the deployment process, where end nodes cannot change these parameters during runtime to achieve the desirable performance. In this paper, we introduce a new method, called attractor perturbation (AP) allowing end nodes to influence the average of an observable performance metric at runtime without directly manipulating any optimal parameters of underlying protocols. An example application in this paper is a traffic distribution over multi-path routing protocol in MANETs, where the target variable is end-to-end delay. The approach to solve for the appropriate amount of management influence and simulation results are shown in this paper.","PeriodicalId":91990,"journal":{"name":"... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies","volume":"215 1","pages":"125:1-125:5"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79714378","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}
Pål Anders Floor, A. N. Kim, T. Ramstad, I. Balasingham, Niklas Wernersson, M. Skoglund
In this paper, we study the problem of communicating multiple correlated Gaussian memoryless sources over a Gaussian Multiple Access Channel (GMAC). We focus on distributed delay-free, low complexity, joint source-channel coding (JSCC) solutions to the problem. Theoretical performance bounds are derived and linear and nonlinear JSCC schemes are evaluated. The main contribution is a nonlinear hybrid discrete-analog mapping based on distributed quantization and a linear continuous mapping named Distributed Quantizer Linear Coder (DQLC). The proposed scheme shows promising performance which improve with increasing correlation and is robust against variations in noise level.
{"title":"Transmitting multiple correlated gaussian sources over a Gaussian MAC using delay-free mappings","authors":"Pål Anders Floor, A. N. Kim, T. Ramstad, I. Balasingham, Niklas Wernersson, M. Skoglund","doi":"10.1145/2093698.2093808","DOIUrl":"https://doi.org/10.1145/2093698.2093808","url":null,"abstract":"In this paper, we study the problem of communicating multiple correlated Gaussian memoryless sources over a Gaussian Multiple Access Channel (GMAC). We focus on distributed delay-free, low complexity, joint source-channel coding (JSCC) solutions to the problem. Theoretical performance bounds are derived and linear and nonlinear JSCC schemes are evaluated. The main contribution is a nonlinear hybrid discrete-analog mapping based on distributed quantization and a linear continuous mapping named Distributed Quantizer Linear Coder (DQLC). The proposed scheme shows promising performance which improve with increasing correlation and is robust against variations in noise level.","PeriodicalId":91990,"journal":{"name":"... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies","volume":"30 1","pages":"110:1-110:5"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79067202","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}
M. Jofre, F. Steinlechner, G. Anzolin, J. Torres, M. Mitchell, V. Pruneri, M. Curty
We have developed optical sources for high bit rate Quantum Communications (QC) using active elements as well as passive schemes. These sources allow achieving 100 Mbps free space Quantum Key Distribution (QKD) with improved security and use components space qualifiable, the latter being an essential aspect for their deployment in space missions.
{"title":"Compact optical sources for quantum communications","authors":"M. Jofre, F. Steinlechner, G. Anzolin, J. Torres, M. Mitchell, V. Pruneri, M. Curty","doi":"10.1145/2093698.2093886","DOIUrl":"https://doi.org/10.1145/2093698.2093886","url":null,"abstract":"We have developed optical sources for high bit rate Quantum Communications (QC) using active elements as well as passive schemes. These sources allow achieving 100 Mbps free space Quantum Key Distribution (QKD) with improved security and use components space qualifiable, the latter being an essential aspect for their deployment in space missions.","PeriodicalId":91990,"journal":{"name":"... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies","volume":"57 1","pages":"188:1-188:2"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87109470","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}
An algorithm for correction and soft verification of message protected by cryptographic check values like MAC is presented. The algorithm uses soft output values of the channel decoder which are given as input of the cryptographic verification module. The criterion of standard verification becomes less strict, when the algorithm for correction and soft verification is introduced. Soft verification allows the correction of messages, if only some bits of the message and the MAC are modified. So, many disturbed messages, which cannot be corrected by repetition, can be recovered -- at the cost of trust in the message. This paper introduces the quantified unit of trust in a message and presents the results of simulations, showing a significant improvement of the acceptance rate of the cryptographic verification.
{"title":"Trust in corrected messages protected by message authentication codes","authors":"N. Zivic","doi":"10.1145/2093698.2093764","DOIUrl":"https://doi.org/10.1145/2093698.2093764","url":null,"abstract":"An algorithm for correction and soft verification of message protected by cryptographic check values like MAC is presented. The algorithm uses soft output values of the channel decoder which are given as input of the cryptographic verification module. The criterion of standard verification becomes less strict, when the algorithm for correction and soft verification is introduced. Soft verification allows the correction of messages, if only some bits of the message and the MAC are modified. So, many disturbed messages, which cannot be corrected by repetition, can be recovered -- at the cost of trust in the message. This paper introduces the quantified unit of trust in a message and presents the results of simulations, showing a significant improvement of the acceptance rate of the cryptographic verification.","PeriodicalId":91990,"journal":{"name":"... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies","volume":"4 1","pages":"66:1-66:4"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90350156","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}
When designing coding algorithms for the wireless endoscope, achieving good performance with very low complexity is of great importance. This is due to the fact that hardware implementation is much constrained by the small size of the endoscope capsule and available power is also very limited. In this paper, we propose a very low complexity image coder for the wireless endoscope which operates within these constraints, with special emphasis on low bit rate performance. The scheme encodes the captured images frame-by-frame using simple DPCM (Differential Pulse Coded Modulation) coding, combined with multi-rate processing, dead-zone quantization and efficient run-length coding of the quantization indices. Simulation results show that proposed coder is able to meet our objectives.
{"title":"Very low complexity low rate image coding for the wireless endoscope","authors":"A. N. Kim, T. Ramstad, I. Balasingham","doi":"10.1145/2093698.2093788","DOIUrl":"https://doi.org/10.1145/2093698.2093788","url":null,"abstract":"When designing coding algorithms for the wireless endoscope, achieving good performance with very low complexity is of great importance. This is due to the fact that hardware implementation is much constrained by the small size of the endoscope capsule and available power is also very limited. In this paper, we propose a very low complexity image coder for the wireless endoscope which operates within these constraints, with special emphasis on low bit rate performance. The scheme encodes the captured images frame-by-frame using simple DPCM (Differential Pulse Coded Modulation) coding, combined with multi-rate processing, dead-zone quantization and efficient run-length coding of the quantization indices. Simulation results show that proposed coder is able to meet our objectives.","PeriodicalId":91990,"journal":{"name":"... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies","volume":"72 1","pages":"90:1-90:5"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90134476","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 multi-hop routing protocols within Wireless Ad-hoc Networks (MANET), all the nodes are assumed to be cooperative. However, this assumption might not hold especially when the nodes behave selfishly to reduce their own resource utilization or there exist intentional attackers. Therefore, how to enforce the cooperative behavior is an important issue in MANET. In this paper, we propose a Reputation-Aware Multi-hop routing Protocol (RAMP) to enforce node cooperation. We take advantage of congestion control from Transmission Control Protocol (TCP) to quantify the reputation/trust value of each node, which makes the selfish behaviors not attractive in MANET. To the best of our knowledge, we are the first to integrate the congestion control from TCP for the reputation-based system design. In addition, the respective simulation in NS2 shows RAMP could achieve 10--15% less packet loss than the existing reputation-based scheme such as CONFIDANT and RAMP could outperform CONFIDANT by up to 20% in goodput with the presence of the compromised/selfish nodes.
{"title":"RAMP: a reputation-aware multi-hop routing protocol in wireless ad-hoc networks","authors":"Hailun Tan","doi":"10.1145/2093698.2093758","DOIUrl":"https://doi.org/10.1145/2093698.2093758","url":null,"abstract":"In multi-hop routing protocols within Wireless Ad-hoc Networks (MANET), all the nodes are assumed to be cooperative. However, this assumption might not hold especially when the nodes behave selfishly to reduce their own resource utilization or there exist intentional attackers. Therefore, how to enforce the cooperative behavior is an important issue in MANET. In this paper, we propose a Reputation-Aware Multi-hop routing Protocol (RAMP) to enforce node cooperation. We take advantage of congestion control from Transmission Control Protocol (TCP) to quantify the reputation/trust value of each node, which makes the selfish behaviors not attractive in MANET. To the best of our knowledge, we are the first to integrate the congestion control from TCP for the reputation-based system design. In addition, the respective simulation in NS2 shows RAMP could achieve 10--15% less packet loss than the existing reputation-based scheme such as CONFIDANT and RAMP could outperform CONFIDANT by up to 20% in goodput with the presence of the compromised/selfish nodes.","PeriodicalId":91990,"journal":{"name":"... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies","volume":"29 1","pages":"60:1-60:5"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86046553","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}
Recent progresses in the design of wearable RFID tag antennas stimulate the idea of passive body centric systems wherein the required power to drive the wearable tags is directly scavenged from the interrogation signal emitted by the reader unit. While active body-centric links have been extensively investigated, the feasibility of passive systems is still questionable due to the poor sensitivity of the tags and to the modest read distances. This paper describes an articulated measurement campaign with textile wearable low-profile tags in the UHF RFID band. It is demonstrated that both on-body and off-body links are feasible with a power budget fully compliant with the available technology. The experiments permits to identify the most efficient tag placements and to propose some quantitative and general guidelines useful to characterize and design this kind of new systems.
{"title":"Body-centric RFID systems","authors":"S. Manzari, C. Occhiuzzi, G. Marrocco","doi":"10.1145/2093698.2093799","DOIUrl":"https://doi.org/10.1145/2093698.2093799","url":null,"abstract":"Recent progresses in the design of wearable RFID tag antennas stimulate the idea of passive body centric systems wherein the required power to drive the wearable tags is directly scavenged from the interrogation signal emitted by the reader unit. While active body-centric links have been extensively investigated, the feasibility of passive systems is still questionable due to the poor sensitivity of the tags and to the modest read distances. This paper describes an articulated measurement campaign with textile wearable low-profile tags in the UHF RFID band. It is demonstrated that both on-body and off-body links are feasible with a power budget fully compliant with the available technology. The experiments permits to identify the most efficient tag placements and to propose some quantitative and general guidelines useful to characterize and design this kind of new systems.","PeriodicalId":91990,"journal":{"name":"... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies","volume":"161 1","pages":"101:1-101:5"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86049215","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}
M. Radványi, Zóra Solymár, A. Stubendek, K. Karacs
Portable assistive devices are getting more and more widespread. Since most cell phones are nowadays equipped with cameras they can provide an easy way for blind and visually impaired people to obtain visual information about their environment. In this paper we present a banknote recognition system for our previously proposed mobile device, called the bionic eyeglass. We employ a recognition scheme based on the structural topology of banknotes that enables that the visual features detected are not joined in an ensemble classifier independently, but they are coupled via an excitation-inhibition model. We have shown that the technique outperforms classical ensemble classifiers.
{"title":"Mobile banknote recognition: topological models in scene understanding","authors":"M. Radványi, Zóra Solymár, A. Stubendek, K. Karacs","doi":"10.1145/2093698.2093883","DOIUrl":"https://doi.org/10.1145/2093698.2093883","url":null,"abstract":"Portable assistive devices are getting more and more widespread. Since most cell phones are nowadays equipped with cameras they can provide an easy way for blind and visually impaired people to obtain visual information about their environment. In this paper we present a banknote recognition system for our previously proposed mobile device, called the bionic eyeglass. We employ a recognition scheme based on the structural topology of banknotes that enables that the visual features detected are not joined in an ensemble classifier independently, but they are coupled via an excitation-inhibition model. We have shown that the technique outperforms classical ensemble classifiers.","PeriodicalId":91990,"journal":{"name":"... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies","volume":"4 1","pages":"185:1-185:5"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81892138","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 non-coherent multiple-input multiple-output (MIMO) systems, the conventional noncoherent MAP detector is too complex to be performed if the number of labelling bits conveyed within one single coherence block is high. In order to overcome this difficulty, in this paper, we propose a noncoherent MAP (maximum a posteriori) detector with very low complexity for orthogonally designed USTM (unitary space-time modulation) schemes. In addition, we show that the detected soft values are independent of the extrinsic information fed back from the turbo decoder. As a result, iterative detection and decoding between the noncoherent detector and the turbo decoder can be avoided without performance degradation. Compared to the scheme using the exhaustive-search-based noncoherent MAP detector, the proposed scheme achieves the same error performance, and has a much lower detection complexity.
{"title":"A low-complexity noncoherent MAP detector for turbo-coded unitary space-time modulation scheme","authors":"Yeong-Luh Ueng, Yen-ming Chen","doi":"10.1145/2093698.2093785","DOIUrl":"https://doi.org/10.1145/2093698.2093785","url":null,"abstract":"In non-coherent multiple-input multiple-output (MIMO) systems, the conventional noncoherent MAP detector is too complex to be performed if the number of labelling bits conveyed within one single coherence block is high. In order to overcome this difficulty, in this paper, we propose a noncoherent MAP (maximum a posteriori) detector with very low complexity for orthogonally designed USTM (unitary space-time modulation) schemes. In addition, we show that the detected soft values are independent of the extrinsic information fed back from the turbo decoder. As a result, iterative detection and decoding between the noncoherent detector and the turbo decoder can be avoided without performance degradation. Compared to the scheme using the exhaustive-search-based noncoherent MAP detector, the proposed scheme achieves the same error performance, and has a much lower detection complexity.","PeriodicalId":91990,"journal":{"name":"... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies","volume":"1 1","pages":"87:1-87:5"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79297111","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}
... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：