Distinguishing with the radio frequency (RF) communication for the terrestrial wireless sensor net-works, the peculiarity of acoustic communication in underwater environment causes many issues of energy consumption, propagation delay, time synchronization and other factors when designing the sensor network. The MAC protocol, which plays an important role of managing and controlling the channels, should overcome these requirements in the underwater acoustic sensor networks (UWASNs). In this paper, we proposed a new MAC protocol called adaptive energy reservation MAC (AER-MAC) protocol which exploits the transmission signal strength related to a distance concept in order to make the network transmission schedule. Since, the underwater acoustic communication channels are characterized by a path loss and absorption loss that depend on the distance between the transmitter and receiver. Therefore, a sensor node can send a reservation packet with a power value in which other nodes in the calculation range can receipt this packet.
{"title":"Adaptive Energy Reservation MAC Protocol for Underwater Acoustic Sensor Networks","authors":"H. Nguyen, S. Shin, Soo-Hyun Park","doi":"10.1109/EUC.2008.186","DOIUrl":"https://doi.org/10.1109/EUC.2008.186","url":null,"abstract":"Distinguishing with the radio frequency (RF) communication for the terrestrial wireless sensor net-works, the peculiarity of acoustic communication in underwater environment causes many issues of energy consumption, propagation delay, time synchronization and other factors when designing the sensor network. The MAC protocol, which plays an important role of managing and controlling the channels, should overcome these requirements in the underwater acoustic sensor networks (UWASNs). In this paper, we proposed a new MAC protocol called adaptive energy reservation MAC (AER-MAC) protocol which exploits the transmission signal strength related to a distance concept in order to make the network transmission schedule. Since, the underwater acoustic communication channels are characterized by a path loss and absorption loss that depend on the distance between the transmitter and receiver. Therefore, a sensor node can send a reservation packet with a power value in which other nodes in the calculation range can receipt this packet.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"26 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":"127186563","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}
One of the fundamental properties of any mobile agent system is to allow efficient message delivery among mobile agents. However, the agent mobility introduces complexity in the design of a mobile agent communication protocol. To deal with this problem, we adopt the well-known mailbox based framework and propose an Adaptive Mailbox Based Protocol (AMBP) in order to best suit the network environment and the communication requirements. The experimental results show that our AMBP does behave adaptively and can achieve high performance.
{"title":"AMBP: An Adaptive Mailbox Based Protocol for Mobile Agent Communication","authors":"L. Zhang, Beihong Jin, Jiannong Cao","doi":"10.1109/EUC.2008.26","DOIUrl":"https://doi.org/10.1109/EUC.2008.26","url":null,"abstract":"One of the fundamental properties of any mobile agent system is to allow efficient message delivery among mobile agents. However, the agent mobility introduces complexity in the design of a mobile agent communication protocol. To deal with this problem, we adopt the well-known mailbox based framework and propose an Adaptive Mailbox Based Protocol (AMBP) in order to best suit the network environment and the communication requirements. The experimental results show that our AMBP does behave adaptively and can achieve high performance.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"6 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":"125374467","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 a wide range of applications, such as detecting environmental hazards, monitoring remote terrain and even monitoring customer behavior, wireless sensor networks (WSNs) are playing an important role. Due to the limited energy in each node, a lot of attention has been paid on improving energy efficiency. In this paper, we first propose an energy-efficient waiting caching (EEWC) algorithm to improve the data-centric (DC) transport control protocol by cutting down traffic flow. Second, we deploy networked predictive controller (NPC) to shorten network delay. Thus, the energy consumption can be reduced accordingly. We also analyze the proposed algorithm. Finally, we conduct extensive simulation experiments to evaluate the performance of the proposed algorithm.
{"title":"An Energy-Efficient Waiting Caching Algorithm in Wireless Sensor Networks","authors":"Junfeng Xu, Keqiu Li, Yanming Shen, Jian Liu","doi":"10.1109/EUC.2008.39","DOIUrl":"https://doi.org/10.1109/EUC.2008.39","url":null,"abstract":"In a wide range of applications, such as detecting environmental hazards, monitoring remote terrain and even monitoring customer behavior, wireless sensor networks (WSNs) are playing an important role. Due to the limited energy in each node, a lot of attention has been paid on improving energy efficiency. In this paper, we first propose an energy-efficient waiting caching (EEWC) algorithm to improve the data-centric (DC) transport control protocol by cutting down traffic flow. Second, we deploy networked predictive controller (NPC) to shorten network delay. Thus, the energy consumption can be reduced accordingly. We also analyze the proposed algorithm. Finally, we conduct extensive simulation experiments to evaluate the performance of the proposed algorithm.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"47 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":"126644975","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 probabilistic trust management approach for pervasive computing environment. The approach considers trust value as a probability that a device provides satisfactory interactions with its neighbors. A distributed trust management using recommendation was constructed. An iterative filtering method is employed to eliminate the effect of false recommendations while the weighting method is employed to capture the effect of time on the current behavior of devices. We have carried out performance evaluations using simulation experiments. The comparison made with a deterministic trust management scheme demonstrated that the probabilistic trust management approach performs better, than the deterministic approach while also ensuring the security of interactions, and quickly adapting to changes in the environment.
{"title":"Probabilistic Trust Management in Pervasive Computing","authors":"M. Denko, Tao Sun","doi":"10.1109/EUC.2008.149","DOIUrl":"https://doi.org/10.1109/EUC.2008.149","url":null,"abstract":"In this paper, we propose a probabilistic trust management approach for pervasive computing environment. The approach considers trust value as a probability that a device provides satisfactory interactions with its neighbors. A distributed trust management using recommendation was constructed. An iterative filtering method is employed to eliminate the effect of false recommendations while the weighting method is employed to capture the effect of time on the current behavior of devices. We have carried out performance evaluations using simulation experiments. The comparison made with a deterministic trust management scheme demonstrated that the probabilistic trust management approach performs better, than the deterministic approach while also ensuring the security of interactions, and quickly adapting to changes in the environment.","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":"127034135","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}
With the accelerated process of economic globalization, financial globalization is becoming an inevitable trend. More and more investors have diverted their attention to international stock markets. Consequently, international portfolio selection is becoming a hot research topic for scholars. In this paper, following Markowitz's classical mean-variance portfolio selection idea, one new mean-variance model for international portfolio selection is proposed. Using the real data from U.S., U.K., Hong Kong, Indonesia, Singapore and Malaysia Stock Markets, one example is given to illustrate the modeling idea.
{"title":"Mean-Variance Model for International Portfolio Selection","authors":"Qiming Pan, Xiaoxia Huang","doi":"10.1109/EUC.2008.16","DOIUrl":"https://doi.org/10.1109/EUC.2008.16","url":null,"abstract":"With the accelerated process of economic globalization, financial globalization is becoming an inevitable trend. More and more investors have diverted their attention to international stock markets. Consequently, international portfolio selection is becoming a hot research topic for scholars. In this paper, following Markowitz's classical mean-variance portfolio selection idea, one new mean-variance model for international portfolio selection is proposed. Using the real data from U.S., U.K., Hong Kong, Indonesia, Singapore and Malaysia Stock Markets, one example is given to illustrate the modeling idea.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"5 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":"115102442","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}
Ubiquitous and pervasive computing systems are characterized by intelligent sensing and computing. These systems seamlessly understand and respond to the environment with little human intervention. Since such systems are required to be small and inobtrusive, embedded systems play an important role in their design. Furthermore, these systems need to run sophisticated applications in a resource constrained environment. In this paper we focus on computer vision applications in such systems. As these applications require larger memory and are computationally intensive, optimization of these algorithms is imperative. This paper discusses some optimization techniques and their impact on execution time in a complex real-world face tracking example. In certain scenarios, the requirement may be to suggest a hardware architecture for achieving a specific response time. This is especially important for mission critical applications in the fields of automotive, medical or defence. However, the estimation of hardware architecture parameters such as core-clock frequency, memory requirement, optimal number of parallel execution paths for a given application is not straight forward. In this paper, we also present a structured approach to determine the hardware architecture for a driver assistance and safety application with stringent performance constraints.
{"title":"A Novel Approach to Hardware Architecture Design and Advanced Optimization Techniques for Time Critical Applications","authors":"A. Kalyansundar, R. Chattopadhyay","doi":"10.1109/EUC.2008.113","DOIUrl":"https://doi.org/10.1109/EUC.2008.113","url":null,"abstract":"Ubiquitous and pervasive computing systems are characterized by intelligent sensing and computing. These systems seamlessly understand and respond to the environment with little human intervention. Since such systems are required to be small and inobtrusive, embedded systems play an important role in their design. Furthermore, these systems need to run sophisticated applications in a resource constrained environment. In this paper we focus on computer vision applications in such systems. As these applications require larger memory and are computationally intensive, optimization of these algorithms is imperative. This paper discusses some optimization techniques and their impact on execution time in a complex real-world face tracking example. In certain scenarios, the requirement may be to suggest a hardware architecture for achieving a specific response time. This is especially important for mission critical applications in the fields of automotive, medical or defence. However, the estimation of hardware architecture parameters such as core-clock frequency, memory requirement, optimal number of parallel execution paths for a given application is not straight forward. In this paper, we also present a structured approach to determine the hardware architecture for a driver assistance and safety application with stringent performance constraints.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"90 8-9 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":"116559759","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}
Many studies on sensor network have focused on energy efficiency in several layers on communication protocol. In order to increase energy efficiency in sensor network communication, MAC-layer energy efficiency needs to be considered. Even though MAC layer protocols for increasing energy efficiency at MAC layer have been proposed in several papers, there have been few of researches that focused on energy efficiency methods in which transmission power is considered. In this paper we propose a new mechanism named as ELM-MAC that creates, uses, and manages the optimized transmission power level for energy efficiency in MAC layer.
{"title":"ELM-MAC: Energy Efficient Link Management by Using Optimal Transmission Power in MAC Protocol","authors":"Phil-Jung Yun, Changhwa Kim, Sangkyung Kim","doi":"10.1109/EUC.2008.112","DOIUrl":"https://doi.org/10.1109/EUC.2008.112","url":null,"abstract":"Many studies on sensor network have focused on energy efficiency in several layers on communication protocol. In order to increase energy efficiency in sensor network communication, MAC-layer energy efficiency needs to be considered. Even though MAC layer protocols for increasing energy efficiency at MAC layer have been proposed in several papers, there have been few of researches that focused on energy efficiency methods in which transmission power is considered. In this paper we propose a new mechanism named as ELM-MAC that creates, uses, and manages the optimized transmission power level for energy efficiency in MAC layer.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"1 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":"122419166","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}
With the increased popularity of RFID applications, various authentication protocols have been proposed to provide security and privacy for RFID tags. However, most protocols require a high computational cost in verifying the tagpsilas reply in the authentication server. This paper presents an efficient mutual authentication protocol using one-way functions only. In the proposed protocol, the authentication sever just needs to compute very limited times to find out the identifier of the RFID tag irrespective of the total number of the tags. Also, the response of the tag is changed in every authentication to avoid tag tracing. In addition, a challenge-response approach is performed to overcome tag cloning and replay attack. Furthermore, the proposed protocol is secure against eavesdropping, compromising attack, denial of service attack and other common attacks.
{"title":"An Efficient RFID Authentication Protocol for Low-Cost Tags","authors":"Yanfei Liu","doi":"10.1109/EUC.2008.135","DOIUrl":"https://doi.org/10.1109/EUC.2008.135","url":null,"abstract":"With the increased popularity of RFID applications, various authentication protocols have been proposed to provide security and privacy for RFID tags. However, most protocols require a high computational cost in verifying the tagpsilas reply in the authentication server. This paper presents an efficient mutual authentication protocol using one-way functions only. In the proposed protocol, the authentication sever just needs to compute very limited times to find out the identifier of the RFID tag irrespective of the total number of the tags. Also, the response of the tag is changed in every authentication to avoid tag tracing. In addition, a challenge-response approach is performed to overcome tag cloning and replay attack. Furthermore, the proposed protocol is secure against eavesdropping, compromising attack, denial of service attack and other common attacks.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"2 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":"129231645","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}
Relay attacks occur when an adversary simply relays signals between honest reader and tag without modifying it in any way. Since the signal content is not modified by the adversary, none of the extant cryptographic protocols are immune to such attacks. There have been several proposed protocols that purport to alleviate this problem for a single tag. We propose a protocol that considers relay attacks when multiple tags are authenticated for their simultaneous presence in the field of the reader.
{"title":"Distance Bounding Protocol for Multiple RFID Tag Authentication","authors":"G. Kapoor, Wei Zhou, S. Piramuthu","doi":"10.1109/EUC.2008.48","DOIUrl":"https://doi.org/10.1109/EUC.2008.48","url":null,"abstract":"Relay attacks occur when an adversary simply relays signals between honest reader and tag without modifying it in any way. Since the signal content is not modified by the adversary, none of the extant cryptographic protocols are immune to such attacks. There have been several proposed protocols that purport to alleviate this problem for a single tag. We propose a protocol that considers relay attacks when multiple tags are authenticated for their simultaneous presence in the field of the reader.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"23 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":"122240793","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}
Weijia Li, Yu Du, Youtao Zhang, B. Childers, Ping Zhou, Jun Yang
Future wireless sensor networks (WSNs) are projected to run multiple applications in the same network infrastructure. While such multi-application WSNs (MA-WSNs) are economically more efficient and adapt better to the changing environments than traditional single-application WSNs, they usually require frequent code redistribution on wireless sensors, making it critical to design energy efficient post-deployment code dissemination protocols in MA-WSNs. Different applications in MA-WSNs often share some common code segments. Therefore when there is a need to disseminate a new application from the sink node, it is possible to disseminate its shared code segments from peer sensors instead of disseminating everything from the sink node. While dissemination protocols have been proposed to handle code of each single type, it is challenging to achieve energy efficiency when the code contains both types and needs simultaneous dissemination. In this paper we utilize an adaptive buffer management approach to achieve efficient code dissemination in MA-WSNs. Our experimental results show that adaptive buffer management can reduce the completion time and the message overhead up to 10% and 20% respectively.
{"title":"Adaptive Buffer Management for Efficient Code Dissemination in Multi-Application Wireless Sensor Networks","authors":"Weijia Li, Yu Du, Youtao Zhang, B. Childers, Ping Zhou, Jun Yang","doi":"10.1109/EUC.2008.160","DOIUrl":"https://doi.org/10.1109/EUC.2008.160","url":null,"abstract":"Future wireless sensor networks (WSNs) are projected to run multiple applications in the same network infrastructure. While such multi-application WSNs (MA-WSNs) are economically more efficient and adapt better to the changing environments than traditional single-application WSNs, they usually require frequent code redistribution on wireless sensors, making it critical to design energy efficient post-deployment code dissemination protocols in MA-WSNs. Different applications in MA-WSNs often share some common code segments. Therefore when there is a need to disseminate a new application from the sink node, it is possible to disseminate its shared code segments from peer sensors instead of disseminating everything from the sink node. While dissemination protocols have been proposed to handle code of each single type, it is challenging to achieve energy efficiency when the code contains both types and needs simultaneous dissemination. In this paper we utilize an adaptive buffer management approach to achieve efficient code dissemination in MA-WSNs. Our experimental results show that adaptive buffer management can reduce the completion time and the message overhead up to 10% and 20% respectively.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"53 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":"115864853","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
扫码关注我们
求助内容：
应助结果提醒方式：