Pub Date : 2006-03-13DOI: 10.1109/PERCOMW.2006.108
S. Beyer, Robert Taylor, K. Mayes
Sensor network operating systems have to operate with limited hardware resources. Constraints on power consumption greatly reduce the resources available to such an operating system. Therefore, current systems restrict application flexibility and tend to impose certain programming paradigms, such as event-driven programming. The Arena operating system is a special-purpose embedded operating system that has the potential to overcome these problems. The operating system is based on a strict separation of mechanism and policy. All operating system policies are placed in user-level libraries. These libraries can be loaded and replaced using a dynamic code loader, in order to configure the operating system dynamically. The dynamic code loader can also be used to load and replace arbitrary application components
{"title":"Operating system support for dynamic code loading in sensor networks","authors":"S. Beyer, Robert Taylor, K. Mayes","doi":"10.1109/PERCOMW.2006.108","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.108","url":null,"abstract":"Sensor network operating systems have to operate with limited hardware resources. Constraints on power consumption greatly reduce the resources available to such an operating system. Therefore, current systems restrict application flexibility and tend to impose certain programming paradigms, such as event-driven programming. The Arena operating system is a special-purpose embedded operating system that has the potential to overcome these problems. The operating system is based on a strict separation of mechanism and policy. All operating system policies are placed in user-level libraries. These libraries can be loaded and replaced using a dynamic code loader, in order to configure the operating system dynamically. The dynamic code loader can also be used to load and replace arbitrary application components","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114792208","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 open, heterogeneous, context-aware pervasive computing systems, suitable context models and reasoning approaches are necessary to enable collaboration and distributed reasoning among agents. This paper proposes, develops and demonstrates a novel approach to perform distributed reasoning by merging and partitioning context models that represent different perspectives over the object of reasoning. We show how merging different points of view contributes to an enhanced outcome in reasoning about context
{"title":"Merging context perspectives: an approach to adaptive agent reasoning in pervasive computing systems","authors":"A. Padovitz, A. Zaslavsky, S. Loke","doi":"10.1109/PERCOMW.2006.80","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.80","url":null,"abstract":"In open, heterogeneous, context-aware pervasive computing systems, suitable context models and reasoning approaches are necessary to enable collaboration and distributed reasoning among agents. This paper proposes, develops and demonstrates a novel approach to perform distributed reasoning by merging and partitioning context models that represent different perspectives over the object of reasoning. We show how merging different points of view contributes to an enhanced outcome in reasoning about context","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133798673","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 : 2006-03-13DOI: 10.1109/PERCOMW.2006.152
G. Tsudik
Security and privacy in RFID systems is an important and active research area. A number of challenges arise due to the extremely limited computational, storage and communication abilities of a typical RFID tag. This paper describes a simple technique for inexpensive untraceable identification of RFID tags. The proposed protocol (called YA-TRAP) involves minimal interaction between a tag and a reader and places low computational burden on the tag (a single keyed hash). It also imposes low computational load on the back-end server
{"title":"YA-TRAP: yet another trivial RFID authentication protocol","authors":"G. Tsudik","doi":"10.1109/PERCOMW.2006.152","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.152","url":null,"abstract":"Security and privacy in RFID systems is an important and active research area. A number of challenges arise due to the extremely limited computational, storage and communication abilities of a typical RFID tag. This paper describes a simple technique for inexpensive untraceable identification of RFID tags. The proposed protocol (called YA-TRAP) involves minimal interaction between a tag and a reader and places low computational burden on the tag (a single keyed hash). It also imposes low computational load on the back-end server","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123524740","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}
D. Dietterle, J. Ebert, G. Wagenknecht, R. Kraemer
Recent advances in wireless communication technology have opened the way for long-term health monitoring applications. In this paper, we introduce the BASUMA project, which develop novel biomedical sensors and a wireless communication platform that provides connectivity among these sensors. This enables new, intelligent medical applications. The design and implementation of the wireless medium access control (MAC) protocol is the major focus of this paper. We describe our work-in-progress on hardware/software co-design, in particular, our co-simulation framework for profiling and performance estimation
{"title":"A wireless communication platform for long-term health monitoring","authors":"D. Dietterle, J. Ebert, G. Wagenknecht, R. Kraemer","doi":"10.1109/PERCOMW.2006.25","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.25","url":null,"abstract":"Recent advances in wireless communication technology have opened the way for long-term health monitoring applications. In this paper, we introduce the BASUMA project, which develop novel biomedical sensors and a wireless communication platform that provides connectivity among these sensors. This enables new, intelligent medical applications. The design and implementation of the wireless medium access control (MAC) protocol is the major focus of this paper. We describe our work-in-progress on hardware/software co-design, in particular, our co-simulation framework for profiling and performance estimation","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124868807","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 : 2006-03-13DOI: 10.1109/PERCOMW.2006.110
G. Bertoni, L. Breveglieri, Matteo Venturi
Public key cryptography is widely considered as the best building block for key exchange; different public key algorithms are standardized and used in many applications. Among them, ECC (elliptic curve cryptography) is considered the best solution in terms of security, computational requirements and storage need for secret and public keys. Energy consumption is among the main constraints to be considered in wireless sensor networks. In the case of sensor networks, the typical approaches of minimizing latency via a complete hardware coprocessor or reducing area overhead via an efficient implementation of finite field operations might not provide the best solution. In this paper a coprocessor for minimizing both additional resources and power consumption is presented for elliptic curve over binary extension fields. The costs and performances of such new coprocessors are compared with known results, showing that space exists for the reduction of energy consumption without degrading the other performance figures
{"title":"Power aware design of an elliptic curve coprocessor for 8 bit platforms","authors":"G. Bertoni, L. Breveglieri, Matteo Venturi","doi":"10.1109/PERCOMW.2006.110","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.110","url":null,"abstract":"Public key cryptography is widely considered as the best building block for key exchange; different public key algorithms are standardized and used in many applications. Among them, ECC (elliptic curve cryptography) is considered the best solution in terms of security, computational requirements and storage need for secret and public keys. Energy consumption is among the main constraints to be considered in wireless sensor networks. In the case of sensor networks, the typical approaches of minimizing latency via a complete hardware coprocessor or reducing area overhead via an efficient implementation of finite field operations might not provide the best solution. In this paper a coprocessor for minimizing both additional resources and power consumption is presented for elliptic curve over binary extension fields. The costs and performances of such new coprocessors are compared with known results, showing that space exists for the reduction of energy consumption without degrading the other performance figures","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"1977 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130194139","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 : 2006-03-13DOI: 10.1109/PERCOMW.2006.103
F. Abdesslem, L. Iannone, M. Amorim, Konstantin Kabassanov, S. Fdida
Recent research in wireless communications has achieved important results by exploring more and more sophisticated solutions involving power control. Cross-layer design and topology control are the main examples. Although much has been done in the theoretical domain, there is still a large gap between theory and practice. In this paper, we investigate whether current IEEE 802.11 devices are able to comply with cross-layer and topology control requirements. Our study and associated measurement results reveal that many novel power control solutions cannot be efficiently implemented over existing IEEE 802.11 cards
{"title":"On the feasibility of power control in current IEEE 802.11 devices","authors":"F. Abdesslem, L. Iannone, M. Amorim, Konstantin Kabassanov, S. Fdida","doi":"10.1109/PERCOMW.2006.103","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.103","url":null,"abstract":"Recent research in wireless communications has achieved important results by exploring more and more sophisticated solutions involving power control. Cross-layer design and topology control are the main examples. Although much has been done in the theoretical domain, there is still a large gap between theory and practice. In this paper, we investigate whether current IEEE 802.11 devices are able to comply with cross-layer and topology control requirements. Our study and associated measurement results reveal that many novel power control solutions cannot be efficiently implemented over existing IEEE 802.11 cards","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"04 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127251572","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 : 2006-03-13DOI: 10.1109/PERCOMW.2006.132
P. Dukes, C. Colbourn, V. Syrotiuk
In an ad hoc network, each node can be in one of three states: asleep (powered down), listening, or transmitting. Communication is effective only when the sender is transmitting, the destination is receiving, and no other nodes in proximity to the receiver are also transmitting. Our strategy makes no assumptions about knowledge of neighbours or of geographical position; it is topology-transparent. A general combinatorial model for topology-transparent scheduling that treats energy conservation is described. As in the two state (transmit and receive) case, the combinatorial requirements are met by a D cover-free family. Graph designs, where an arc from vertex x to y indicates an opportunity for x to transmit and y to receive, are proposed as a model for schedule construction. In order to achieve reasonable throughput while obtaining a dramatic reduction in energy consumption, we focus on Koarra,a designs, where the number of nodes transmitting and receiving per slot is equal to a. Patterned on constructions for resolvable designs, we examine a computational search method to meet the required combinatorial conditions
{"title":"Topology-transparent schedules for energy limited ad hoc networks","authors":"P. Dukes, C. Colbourn, V. Syrotiuk","doi":"10.1109/PERCOMW.2006.132","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.132","url":null,"abstract":"In an ad hoc network, each node can be in one of three states: asleep (powered down), listening, or transmitting. Communication is effective only when the sender is transmitting, the destination is receiving, and no other nodes in proximity to the receiver are also transmitting. Our strategy makes no assumptions about knowledge of neighbours or of geographical position; it is topology-transparent. A general combinatorial model for topology-transparent scheduling that treats energy conservation is described. As in the two state (transmit and receive) case, the combinatorial requirements are met by a D cover-free family. Graph designs, where an arc from vertex x to y indicates an opportunity for x to transmit and y to receive, are proposed as a model for schedule construction. In order to achieve reasonable throughput while obtaining a dramatic reduction in energy consumption, we focus on Koarra,a designs, where the number of nodes transmitting and receiving per slot is equal to a. Patterned on constructions for resolvable designs, we examine a computational search method to meet the required combinatorial conditions","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129282955","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 : 2006-03-13DOI: 10.1109/PERCOMW.2006.128
Philip Grew, F. Giudici, E. Pagani
This paper proposes a distributed platform designed to support pervasive learning and interactivity on a university campus and to ease tasks related to learning and teaching. The platform exploits wireless technologies in order to provide service access anywhere and anytime. The platform architecture is described, and the functionalities of the modules composing it are discussed, together with the relationships among modules
{"title":"Specification of a functional architecture for e-learning supported by wireless technologies","authors":"Philip Grew, F. Giudici, E. Pagani","doi":"10.1109/PERCOMW.2006.128","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.128","url":null,"abstract":"This paper proposes a distributed platform designed to support pervasive learning and interactivity on a university campus and to ease tasks related to learning and teaching. The platform exploits wireless technologies in order to provide service access anywhere and anytime. The platform architecture is described, and the functionalities of the modules composing it are discussed, together with the relationships among modules","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130448790","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 : 2006-03-13DOI: 10.1109/PERCOMW.2006.116
Justin Mazzola Paluska, H. Pham, U. Saif, C. Terman, Steve Ward
The rapid increase in the number and variety of consumer-level electronic devices without the corresponding development of device management technology has lead to a configuration nightmare. We propose to use goal-oriented programming over a substrate of network-portable objects to help reduce the amount of configuration users must do in order to have their applications use their devices efficiently. We detail an architecture and describe a prototype system using existing pervasive computing technology that plays music on the most appropriate devices without requiring user interaction and configuration
{"title":"Reducing configuration overhead with goal-oriented programming","authors":"Justin Mazzola Paluska, H. Pham, U. Saif, C. Terman, Steve Ward","doi":"10.1109/PERCOMW.2006.116","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.116","url":null,"abstract":"The rapid increase in the number and variety of consumer-level electronic devices without the corresponding development of device management technology has lead to a configuration nightmare. We propose to use goal-oriented programming over a substrate of network-portable objects to help reduce the amount of configuration users must do in order to have their applications use their devices efficiently. We detail an architecture and describe a prototype system using existing pervasive computing technology that plays music on the most appropriate devices without requiring user interaction and configuration","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129643522","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 : 2006-03-13DOI: 10.1109/PERCOMW.2006.100
Chansu Yu, K. Shin, Ben Lee, Seungmin Park, Heung-Nam Kim
In mobile peer-to-peer (MP2P) networks, nodes tend to gather together rather than scattered uniformly across the network area. This paper considers the clustering of peer nodes and its performance impact in MP2P networks. The model for node clustering based on a heavy-tail distribution is first introduced and then a topology generation method that produces a clustered network is presented. Experiments based on ns-2 simulation with AODV routing protocol and IEEE 802.11 MAC reveal that the clustered layout significantly degrades the network performance and the main trouble comes from the MAC layer mechanisms. Node clustering results in as much as 77.6% lower packet delivery ratio compared to random node distribution. Moreover, it results in larger variation in packet delivery service, and thus has a serious impact on QoS, which is important in MP2P networks
{"title":"Node clustering in mobile peer-to-peer multihop networks","authors":"Chansu Yu, K. Shin, Ben Lee, Seungmin Park, Heung-Nam Kim","doi":"10.1109/PERCOMW.2006.100","DOIUrl":"https://doi.org/10.1109/PERCOMW.2006.100","url":null,"abstract":"In mobile peer-to-peer (MP2P) networks, nodes tend to gather together rather than scattered uniformly across the network area. This paper considers the clustering of peer nodes and its performance impact in MP2P networks. The model for node clustering based on a heavy-tail distribution is first introduced and then a topology generation method that produces a clustered network is presented. Experiments based on ns-2 simulation with AODV routing protocol and IEEE 802.11 MAC reveal that the clustered layout significantly degrades the network performance and the main trouble comes from the MAC layer mechanisms. Node clustering results in as much as 77.6% lower packet delivery ratio compared to random node distribution. Moreover, it results in larger variation in packet delivery service, and thus has a serious impact on QoS, which is important in MP2P networks","PeriodicalId":250624,"journal":{"name":"Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115862535","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
扫码关注我们
求助内容：
应助结果提醒方式：