A key challenge in developing distributed real-time embedded (DRE) systems is to meeting critical performance constraints when DRE systems become more difficult to predict in terms of the needs of the application, particularly those needs that are likely to change dynamically during execution of the application. The system design must combine temporal requirements and considerable uncertainty, together with the ability to swiftly adapt to changing environmental conditions. This paper proposes a robust DRE model that does not require precise system parameters. A multivariable Hinfin controller is developed and provides utilisation and deadline guarantees in an unpredictable environment.
{"title":"Robust Feedback Control Scheduling in Distributed Embedded Real-Time Systems","authors":"B. Du, Chun Ruan","doi":"10.1109/EUC.2008.107","DOIUrl":"https://doi.org/10.1109/EUC.2008.107","url":null,"abstract":"A key challenge in developing distributed real-time embedded (DRE) systems is to meeting critical performance constraints when DRE systems become more difficult to predict in terms of the needs of the application, particularly those needs that are likely to change dynamically during execution of the application. The system design must combine temporal requirements and considerable uncertainty, together with the ability to swiftly adapt to changing environmental conditions. This paper proposes a robust DRE model that does not require precise system parameters. A multivariable Hinfin controller is developed and provides utilisation and deadline guarantees in an unpredictable environment.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131443194","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}
Yuan Xue, H. Jürgensen, R. Azarderakhsh, A. Reyhani-Masoleh
Establishing and maintaining secure communication paths in a wireless sensor network poses mathematical and technical challenges. We suggest to use random nonces to set up secure communication links after the network deployment phase. This idea exploits some of the inherent features of sensor networks, e.g.: nodes are densely deployed; the wireless communication areas of neighbouring nodes have a large overlap. We outline the analytical properties of such a scheme and show simulation results which corroborate them for practical purposes.
{"title":"Key Management for Wireless Sensor Networks Using Trusted Neighbors","authors":"Yuan Xue, H. Jürgensen, R. Azarderakhsh, A. Reyhani-Masoleh","doi":"10.1109/EUC.2008.125","DOIUrl":"https://doi.org/10.1109/EUC.2008.125","url":null,"abstract":"Establishing and maintaining secure communication paths in a wireless sensor network poses mathematical and technical challenges. We suggest to use random nonces to set up secure communication links after the network deployment phase. This idea exploits some of the inherent features of sensor networks, e.g.: nodes are densely deployed; the wireless communication areas of neighbouring nodes have a large overlap. We outline the analytical properties of such a scheme and show simulation results which corroborate them for practical purposes.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130251129","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}
RFID tag search is to find a particular tag in a group of tags by using a portable reader. Since a portable reader has own identifier and secret values associated with each tag, the portable reader can wirelessly communicate with the tag without help of central database. The RFID tag search can be useful to find a lost book among all RFID-tagged books in a library. However, the basic operation for RFID tag search has security and privacy problems. Secure search protocols to solve these problems were firstly discussed by Tan et al. Nonetheless, their protocols donpsilat perfectly solve an illegal tag tracking problem by a reuse attack of a search query and also have an illegal reader tracking problem by revealing the portable reader ID over an insecure channel. In this paper, we propose strong authentication protocol for secure RFID tag search without help of central database which utilizes a block cipher (AES-128) and a timestamp. Our protocol can search a particular tag efficiently, and preserve user privacy against all major attacks.
{"title":"Strong Authentication Protocol for Secure RFID Tag Search without Help of Central Database","authors":"Tae-Youn Won, J. Chun, Dong Hoon Lee","doi":"10.1109/EUC.2008.54","DOIUrl":"https://doi.org/10.1109/EUC.2008.54","url":null,"abstract":"RFID tag search is to find a particular tag in a group of tags by using a portable reader. Since a portable reader has own identifier and secret values associated with each tag, the portable reader can wirelessly communicate with the tag without help of central database. The RFID tag search can be useful to find a lost book among all RFID-tagged books in a library. However, the basic operation for RFID tag search has security and privacy problems. Secure search protocols to solve these problems were firstly discussed by Tan et al. Nonetheless, their protocols donpsilat perfectly solve an illegal tag tracking problem by a reuse attack of a search query and also have an illegal reader tracking problem by revealing the portable reader ID over an insecure channel. In this paper, we propose strong authentication protocol for secure RFID tag search without help of central database which utilizes a block cipher (AES-128) and a timestamp. Our protocol can search a particular tag efficiently, and preserve user privacy against all major attacks.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134557611","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 have proposed a framework of systems-on-chips clustering in application to complicated sensor networks. The framework can be applied to address the communication issues in distributed and large-scaled sensor nodes in wireless sensor network application. There are two communication categories under consideration, i.e. intra-nodes and inter-nodes. Due to the potentially higher frequency in the signal propagation within the sensor node, the characteristics of the interconnect among various systems-on-chips cannot be described in the traditionally lumped R, L, C components. We adapt a distributed transmission line model to address such issues and possibly improve the reliability in the intra-nodes communication. Furthermore, based on the bandwidth requirements of each sensor node, the large-scaled senor network is proposed to be transformed into a maze diagram by a user defined threshold bandwidth, so that many existing approaches may be applied to determine the routing paths in the inter-nodes communication to improve the efficiency of the overall network.
{"title":"Communications via Systems-on-Chips Clustering in Large-Scaled Sensor Networks","authors":"Sharon Fan, Jeffrey Fan, K. Makki, N. Pissinou","doi":"10.1109/EUC.2008.184","DOIUrl":"https://doi.org/10.1109/EUC.2008.184","url":null,"abstract":"In this paper, we have proposed a framework of systems-on-chips clustering in application to complicated sensor networks. The framework can be applied to address the communication issues in distributed and large-scaled sensor nodes in wireless sensor network application. There are two communication categories under consideration, i.e. intra-nodes and inter-nodes. Due to the potentially higher frequency in the signal propagation within the sensor node, the characteristics of the interconnect among various systems-on-chips cannot be described in the traditionally lumped R, L, C components. We adapt a distributed transmission line model to address such issues and possibly improve the reliability in the intra-nodes communication. Furthermore, based on the bandwidth requirements of each sensor node, the large-scaled senor network is proposed to be transformed into a maze diagram by a user defined threshold bandwidth, so that many existing approaches may be applied to determine the routing paths in the inter-nodes communication to improve the efficiency of the overall network.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130848901","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}
Recently, researches on underwater sensor networks (USN) for ocean development and disaster prevention have been emerged as one of interesting topics. Since low-power, high-speed and inexpensive communication modem is a prerequisite for deployment of USN, we design and implement an underwater modem by utilizing general-purpose waterproof ultrasonic sensors in this paper. Also, we make an experiment in a water tank containing sensor nodes and a sink node, a gateway, and show that point-to-multipoint communication is possible at a data rate of 1 kbps.
{"title":"Point-to-Multipoint Ultrasonic Communication Modem for Ubiquitous Underwater Wireless Sensor Networks","authors":"Moo-Kwang Byeon, Jun-Ho Jeon, Sung-Joon Park","doi":"10.1109/EUC.2008.180","DOIUrl":"https://doi.org/10.1109/EUC.2008.180","url":null,"abstract":"Recently, researches on underwater sensor networks (USN) for ocean development and disaster prevention have been emerged as one of interesting topics. Since low-power, high-speed and inexpensive communication modem is a prerequisite for deployment of USN, we design and implement an underwater modem by utilizing general-purpose waterproof ultrasonic sensors in this paper. Also, we make an experiment in a water tank containing sensor nodes and a sink node, a gateway, and show that point-to-multipoint communication is possible at a data rate of 1 kbps.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"322 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132387163","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}
Yu-Kai Huang, P. Hsiu, Wei-Ni Chu, Kuan-Chang Hung, Ai-Chun Pang, Tei-Wei Kuo, Min Di, Hua-Wei Fang
Wireless sensor networks have been extensively adopted in numerous application scenarios. However, increasing environmental constraints and performance requirements has spurred the development of tools to expedite deployment and minimize human intervention. This study extends previous work by the authors in network development and aims at the performance evaluation of applications operating in to-be-deployed networks. We prove that the determination of a ZigBee cluster tree over an underlying network is NP - hard and propose an algorithm for generating tree topology. Based on the proposed algorithm/technologies, an integrated development tool is developed. The capability of the tool is demonstrated by a case study of the system deployed in an office building.
{"title":"An Integrated Deployment Tool for ZigBee-Based Wireless Sensor Networks","authors":"Yu-Kai Huang, P. Hsiu, Wei-Ni Chu, Kuan-Chang Hung, Ai-Chun Pang, Tei-Wei Kuo, Min Di, Hua-Wei Fang","doi":"10.1109/EUC.2008.87","DOIUrl":"https://doi.org/10.1109/EUC.2008.87","url":null,"abstract":"Wireless sensor networks have been extensively adopted in numerous application scenarios. However, increasing environmental constraints and performance requirements has spurred the development of tools to expedite deployment and minimize human intervention. This study extends previous work by the authors in network development and aims at the performance evaluation of applications operating in to-be-deployed networks. We prove that the determination of a ZigBee cluster tree over an underlying network is NP - hard and propose an algorithm for generating tree topology. Based on the proposed algorithm/technologies, an integrated development tool is developed. The capability of the tool is demonstrated by a case study of the system deployed in an office building.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133263234","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}
Software reliability represents a major requirement for safety critical applications. Several fault tolerance methods have been proposed to improve software reliability. These methods are based on either fault masking such as N-version programming or on fault detection such as in the recovery block method. The success of the recovery block method depends on a high quality of the effective acceptance test, which is sometimes very difficult to achieve. In this paper, we propose a hybrid fault tolerance method called recovery block with backup voting to improve the reliability of the normal recovery block in the case of a weak acceptance test. In the proposed method, a copy of the outcome of each version is stored in a cache memory as backup, and when the recovery block method fails to produce a correct output due to a weak acceptance test, the stored values are used as inputs to a voting method to produce the correct output. A Monte Carlo based simulation method is used to show the reliability improvement in the new proposed hybrid method as well as to show the decreased dependency of the new method on the quality of the acceptance test, which makes the new method more suitable for critical applications where the construction of an effective acceptance test is difficult.
{"title":"A Hybrid Fault Tolerance Method for Recovery Block with a Weak Acceptance Test","authors":"Ashraf Armoush, F. Salewski, S. Kowalewski","doi":"10.1109/EUC.2008.102","DOIUrl":"https://doi.org/10.1109/EUC.2008.102","url":null,"abstract":"Software reliability represents a major requirement for safety critical applications. Several fault tolerance methods have been proposed to improve software reliability. These methods are based on either fault masking such as N-version programming or on fault detection such as in the recovery block method. The success of the recovery block method depends on a high quality of the effective acceptance test, which is sometimes very difficult to achieve. In this paper, we propose a hybrid fault tolerance method called recovery block with backup voting to improve the reliability of the normal recovery block in the case of a weak acceptance test. In the proposed method, a copy of the outcome of each version is stored in a cache memory as backup, and when the recovery block method fails to produce a correct output due to a weak acceptance test, the stored values are used as inputs to a voting method to produce the correct output. A Monte Carlo based simulation method is used to show the reliability improvement in the new proposed hybrid method as well as to show the decreased dependency of the new method on the quality of the acceptance test, which makes the new method more suitable for critical applications where the construction of an effective acceptance test is difficult.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134480700","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}
Shijun Lin, L. Su, Haibo Su, Depeng Jin, Lieguang Zeng
In this paper, a hierarchical cluster-based irregular topology customization method is proposed for Networks-on-Chip (NoC). This method contains three steps: (1) partitioning IPs into many hierarchical clusters; (2) generating a core network; (3) deleting redundant edge routers. Results show that the irregular topologies generated by our hierarchical cluster-based method consume less power when satisfying the bandwidth and port number constraints. Compared with the previous method, our method can save about 15.41% of power averagely for all benchmark applications. Particularly, for MPEG 4 decoder, our method can save 31.62% of power.
{"title":"Hierarchical Cluster-Based Irregular Topology Customization for Networks-on-Chip","authors":"Shijun Lin, L. Su, Haibo Su, Depeng Jin, Lieguang Zeng","doi":"10.1109/EUC.2008.9","DOIUrl":"https://doi.org/10.1109/EUC.2008.9","url":null,"abstract":"In this paper, a hierarchical cluster-based irregular topology customization method is proposed for Networks-on-Chip (NoC). This method contains three steps: (1) partitioning IPs into many hierarchical clusters; (2) generating a core network; (3) deleting redundant edge routers. Results show that the irregular topologies generated by our hierarchical cluster-based method consume less power when satisfying the bandwidth and port number constraints. Compared with the previous method, our method can save about 15.41% of power averagely for all benchmark applications. Particularly, for MPEG 4 decoder, our method can save 31.62% of power.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134634976","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 : 2008-12-17DOI: 10.1080/17445760.2012.731057
Ze Li, Haiying Shen
In delay tolerant network, a complete routing path from a source to a destination can not be guaranteed at most of the time. Therefore, traditional routing method for ad hoc network is not applicable in these situations. Current approaches for such networks are primarily based on redundant transmissions and single copy direct routing. However, they incur either high overhead due to excessive transmissions or long delays due to the incorrect path choices during forwarding. In this paper, we propose a direction based geographic routing scheme (DIG) for the intermittently connected network. Relying on the geographic location information, the packets are routed in a approximate ideal path to the destination, which significantly reduces the resource required in flooding-based algorithm and lead to decreased delay compared to the direct routing. Theoretical analyzes and simulations show that compared to the epidemic routing and direct routing, DIG provides nearly optimal delay with very low overhead.
{"title":"A Direction Based Geographic Routing Scheme for Intermittently Connected Mobile Networks","authors":"Ze Li, Haiying Shen","doi":"10.1080/17445760.2012.731057","DOIUrl":"https://doi.org/10.1080/17445760.2012.731057","url":null,"abstract":"In delay tolerant network, a complete routing path from a source to a destination can not be guaranteed at most of the time. Therefore, traditional routing method for ad hoc network is not applicable in these situations. Current approaches for such networks are primarily based on redundant transmissions and single copy direct routing. However, they incur either high overhead due to excessive transmissions or long delays due to the incorrect path choices during forwarding. In this paper, we propose a direction based geographic routing scheme (DIG) for the intermittently connected network. Relying on the geographic location information, the packets are routed in a approximate ideal path to the destination, which significantly reduces the resource required in flooding-based algorithm and lead to decreased delay compared to the direct routing. Theoretical analyzes and simulations show that compared to the epidemic routing and direct routing, DIG provides nearly optimal delay with very low overhead.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124301848","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}
Joongman Kim, Seokung Yoon, Hyuncheol Jeong, Yoojae Won
VoIP provides multimedia (audio and video, etc) services through Internet Network. Due to the characteristic of Internet, there are many attacks and threats in Internet, so are VoIP. Therefore, user authentication, confidentiality, and integrity of signaling message, media stream are required for secure communication. TLS and S/MIME are proposed for SIP signaling message protection and SRTP for media protection. MIKEY is also a standard protocol for key management. In this paper, we analyzed and implemented security protocols for VoIP. And then, we accomplished performance test of them by applying implemented security protocols to hardware VoIP phone and SIP proxy.
{"title":"Implementation and Evaluation of SIP-Based Secure VoIP Communication System","authors":"Joongman Kim, Seokung Yoon, Hyuncheol Jeong, Yoojae Won","doi":"10.1109/EUC.2008.79","DOIUrl":"https://doi.org/10.1109/EUC.2008.79","url":null,"abstract":"VoIP provides multimedia (audio and video, etc) services through Internet Network. Due to the characteristic of Internet, there are many attacks and threats in Internet, so are VoIP. Therefore, user authentication, confidentiality, and integrity of signaling message, media stream are required for secure communication. TLS and S/MIME are proposed for SIP signaling message protection and SRTP for media protection. MIKEY is also a standard protocol for key management. In this paper, we analyzed and implemented security protocols for VoIP. And then, we accomplished performance test of them by applying implemented security protocols to hardware VoIP phone and SIP proxy.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114321201","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
扫码关注我们
求助内容：
应助结果提醒方式：