K. Nolan, P. Sutton, L. Doyle, T. Rondeau, B. Le, C. Bostian
The Centre for Telecommunications Value-Chain Research (CTVR) and the Center for Wireless Telecommunications (CWT) are undertaking a joint collaborative research project investigating the potential of different software-defined radio (SDR) and cognitive radio (CR) systems that can interoperate and co-exist in common frequency bands. This paper presents some key results from this experience so far, including an over-the-air interoperability analysis of two different SDR architectures in the same frequency band. An initial analysis of actual co-existence experiences involving primary users and secondary opportunistic spectrum users in a common frequency band is also presented.
{"title":"Demonstration and Analyses of Collaboration, Coexistence, and Interoperability of Cognitive Radio Platforms","authors":"K. Nolan, P. Sutton, L. Doyle, T. Rondeau, B. Le, C. Bostian","doi":"10.1109/CCNC.2007.231","DOIUrl":"https://doi.org/10.1109/CCNC.2007.231","url":null,"abstract":"The Centre for Telecommunications Value-Chain Research (CTVR) and the Center for Wireless Telecommunications (CWT) are undertaking a joint collaborative research project investigating the potential of different software-defined radio (SDR) and cognitive radio (CR) systems that can interoperate and co-exist in common frequency bands. This paper presents some key results from this experience so far, including an over-the-air interoperability analysis of two different SDR architectures in the same frequency band. An initial analysis of actual co-existence experiences involving primary users and secondary opportunistic spectrum users in a common frequency band is also presented.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123211269","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 article we propose a novel Dynamic Spectrum Access (DSA) paradigm to combine the benefits of UWB transmission and cognitive radio technology to optimize the efficiency of wireless spectrum usage and maximize the channel capacity. Specifically, this work presents a multi-carrier platform not only transmits over unused spectrum "holes", but transmits over underused spectrum blocks as well, while minimizing interference to existing primary narrowband transmissions. It is also shown that current cognitive radio and UWB transmission are two special cases of the proposed general paradigm. As a direct result, this paradigm offers a high degree of flexibility of spectrum use for next generation wireless communication systems.
{"title":"Interference Tolerant Agile Cognitive Radio: Maximize Channel Capacity of Cognitive Radio","authors":"Zhiqiang Wu, B. Natarajan","doi":"10.1109/CCNC.2007.207","DOIUrl":"https://doi.org/10.1109/CCNC.2007.207","url":null,"abstract":"In this article we propose a novel Dynamic Spectrum Access (DSA) paradigm to combine the benefits of UWB transmission and cognitive radio technology to optimize the efficiency of wireless spectrum usage and maximize the channel capacity. Specifically, this work presents a multi-carrier platform not only transmits over unused spectrum \"holes\", but transmits over underused spectrum blocks as well, while minimizing interference to existing primary narrowband transmissions. It is also shown that current cognitive radio and UWB transmission are two special cases of the proposed general paradigm. As a direct result, this paradigm offers a high degree of flexibility of spectrum use for next generation wireless communication systems.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"2 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123730397","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}
Asma BEN LETAIFA, T. Bejaoui, S. Tabbane, Z. Choukair
In reconfiguration process, dynamic service deployment needs to find at anytime the best way to lead data from source to destination. In this paper, we propose an optimization approach for routing in mobile radio networks. Three main algorithms are proposed. At first, a genetic algorithm based approach is used to find an optimal way in sub-network, when nodes number is low, but when this number is increasing, we used an algorithm based on flow deviation method indicating which link will be used and how much bytes will be leaded on this link. Finally, we give an hybrid solution that solve routing problem when linear solution doesn't succeed. This heuristic approach is based on load balancing techniques which maximise the use of network resources to offer as much as possible new available bandwidth. This paper gives at first the network model and used approach from commonly used algorithms in transport problem, simulates the three proposed algorithm and highlights the conclusion and future work.
{"title":"Optimal Routing Approaches for Radio Mobile Multimedia Services","authors":"Asma BEN LETAIFA, T. Bejaoui, S. Tabbane, Z. Choukair","doi":"10.1109/CCNC.2007.220","DOIUrl":"https://doi.org/10.1109/CCNC.2007.220","url":null,"abstract":"In reconfiguration process, dynamic service deployment needs to find at anytime the best way to lead data from source to destination. In this paper, we propose an optimization approach for routing in mobile radio networks. Three main algorithms are proposed. At first, a genetic algorithm based approach is used to find an optimal way in sub-network, when nodes number is low, but when this number is increasing, we used an algorithm based on flow deviation method indicating which link will be used and how much bytes will be leaded on this link. Finally, we give an hybrid solution that solve routing problem when linear solution doesn't succeed. This heuristic approach is based on load balancing techniques which maximise the use of network resources to offer as much as possible new available bandwidth. This paper gives at first the network model and used approach from commonly used algorithms in transport problem, simulates the three proposed algorithm and highlights the conclusion and future work.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114800134","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}
Abstract — Since XML became an official recommendation of the World Wide Web Consortium (W3C) in 1998, it is increasingly being used to transmit data on networks but is a verbose format and needs an efficient encoding to send relatively large amounts of data efficiently. This requirement is particularly important for wireless data communications. It is a common technical challenge for researchers in XML-driven networks to have good performance. One may employ a middleware to enhance performance by minimizing the impact of transmission time [1, 3]. Normally, to reduce the amount of data sent the XML documents are converted to a binary format using a compression routine such as Gzip. However while this would reduce the payload, it results in an increase in the CPU time as the XML document must be compressed before being sent and uncompressed when it is received. In this paper we extended our previous research results [2, 11-13] to an enabling technology, namely Dynamic Adaptive Threshold Transmission (DATT) for XML data on networks. We also show the experimental results obtained from our technique and that from the Network Adaptable Middleware (NAM) established by Ghandeharizadeh et al [1]. Experimental results show that our method is superior to the NAM method [1], supported by the fact that the time taken is 220.6 times better. We have introduced another way of determining when to
{"title":"A Dynamic Adaptive Threshold Transmission for XML Data on Networks","authors":"Xu Huang, A. Ridgewell, D. Sharma","doi":"10.1109/CCNC.2007.33","DOIUrl":"https://doi.org/10.1109/CCNC.2007.33","url":null,"abstract":"Abstract — Since XML became an official recommendation of the World Wide Web Consortium (W3C) in 1998, it is increasingly being used to transmit data on networks but is a verbose format and needs an efficient encoding to send relatively large amounts of data efficiently. This requirement is particularly important for wireless data communications. It is a common technical challenge for researchers in XML-driven networks to have good performance. One may employ a middleware to enhance performance by minimizing the impact of transmission time [1, 3]. Normally, to reduce the amount of data sent the XML documents are converted to a binary format using a compression routine such as Gzip. However while this would reduce the payload, it results in an increase in the CPU time as the XML document must be compressed before being sent and uncompressed when it is received. In this paper we extended our previous research results [2, 11-13] to an enabling technology, namely Dynamic Adaptive Threshold Transmission (DATT) for XML data on networks. We also show the experimental results obtained from our technique and that from the Network Adaptable Middleware (NAM) established by Ghandeharizadeh et al [1]. Experimental results show that our method is superior to the NAM method [1], supported by the fact that the time taken is 220.6 times better. We have introduced another way of determining when to","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"134 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126301083","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}
The paper presents an interference avoidance al- gorithm for codeword and power adaptation in the uplink of a Code Division Multiple Access (CDMA) system with variable number of active users. The algorithm tracks changes in the system configuration, and transitions incrementally from one optimal point corresponding to a given number of active users to a new optimal point corresponding to the new number of active users. The transition uses gradient-based adaptive interference avoidance in which users adapt their codewords to optimize their corresponding spectral efficiency subject to constraints on the signal-to-interference plus noise-ratio (SINR). The algorithm is illustrated with numerical examples obtained from simulations. I. INTRODUCTION Interference avoidance has emerged in the literature as a new technique by which transmitters in a wireless communication system are optimized in response to changing patterns of interference to better suit the environment in which they operate. Currently, interference avoidance algorithms are static in the number of users (1), and each time this changes the algorithms must be reiterated in order to determine the socially optimal solution for the new number of users. We note that other related algorithms for codeword adaptation for uplink CDMA systems (2)-(7) have the same characteristic, and are not adaptable to changing numbers of active users in the system. In order to overcome this limitation, recent research (8) proposes using Grassmannian signatures for use in dynamic systems with variable number of users in the system. These are designed to support a maximum number of active users in the system subject to a given interference level, and have the nice property that interference among users does not change when less users are active in the system. As noted in (8) the disadvantage associated with equiangular Grassmannian signatures is that they may not exist for any desired system configuration specified by given number of users and processing gain value. In this paper we present an alternative approach to dealing with variable number of active users in the uplink of a CDMA system, and propose an adaptive algorithm that moves the system incrementally from an optimal configuration with a given number of active users, to a new optimal configuration with a different number of active users. The transition between the two optimal configurations is based on an adaptive inter- ference avoidance procedure: when a change in the system status occurs this translates in a change of the SINR of active users which will employ a greedy gradient-based technique to optimize their corresponding spectral efficiency subject to
{"title":"Adaptive Interference Avoidance for Dynamic Wireless Systems","authors":"C. Lacatus, D. Popescu","doi":"10.1109/CCNC.2007.37","DOIUrl":"https://doi.org/10.1109/CCNC.2007.37","url":null,"abstract":"The paper presents an interference avoidance al- gorithm for codeword and power adaptation in the uplink of a Code Division Multiple Access (CDMA) system with variable number of active users. The algorithm tracks changes in the system configuration, and transitions incrementally from one optimal point corresponding to a given number of active users to a new optimal point corresponding to the new number of active users. The transition uses gradient-based adaptive interference avoidance in which users adapt their codewords to optimize their corresponding spectral efficiency subject to constraints on the signal-to-interference plus noise-ratio (SINR). The algorithm is illustrated with numerical examples obtained from simulations. I. INTRODUCTION Interference avoidance has emerged in the literature as a new technique by which transmitters in a wireless communication system are optimized in response to changing patterns of interference to better suit the environment in which they operate. Currently, interference avoidance algorithms are static in the number of users (1), and each time this changes the algorithms must be reiterated in order to determine the socially optimal solution for the new number of users. We note that other related algorithms for codeword adaptation for uplink CDMA systems (2)-(7) have the same characteristic, and are not adaptable to changing numbers of active users in the system. In order to overcome this limitation, recent research (8) proposes using Grassmannian signatures for use in dynamic systems with variable number of users in the system. These are designed to support a maximum number of active users in the system subject to a given interference level, and have the nice property that interference among users does not change when less users are active in the system. As noted in (8) the disadvantage associated with equiangular Grassmannian signatures is that they may not exist for any desired system configuration specified by given number of users and processing gain value. In this paper we present an alternative approach to dealing with variable number of active users in the uplink of a CDMA system, and propose an adaptive algorithm that moves the system incrementally from an optimal configuration with a given number of active users, to a new optimal configuration with a different number of active users. The transition between the two optimal configurations is based on an adaptive inter- ference avoidance procedure: when a change in the system status occurs this translates in a change of the SINR of active users which will employ a greedy gradient-based technique to optimize their corresponding spectral efficiency subject to","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130241449","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}
Growth and propagation of the Internet has been a contributing factor for information overload which acts as a deterrent for quick and easy discovery of information. As Web services proliferate, the same dilemma perceived in the discovery of Web pages will become tangible. Currently, the automatic discovery of Web services, an important capability of service- oriented architecture (SOA), is mainly achieved by performing inquiries to business registries such as the UDDI or ebXML. The ability to discover Web services across multiple heterogeneous registries is becoming a challenging task and raises several issues such as performance, reliability, and robustness. In this paper, we introduce the Web Service Repository Builder (WRSB) that serves as an integrated SOA registry and repository for managing the proliferation of Web services and system artifacts. Specifically, the proposed framework actively captures and navigates among multiple service registries and provides a unified environment for the discovery of Web services. The WSRB framework is compatible with, and can be integrated seamlessly into, the existing infrastructure without any modifications to the existing environments.
互联网的发展和传播是造成信息过载的一个因素，它阻碍了人们快速方便地发现信息。随着Web服务的激增，在发现Web页面时所感受到的同样的困境将变得切实可见。目前，Web服务的自动发现(面向服务的体系结构(SOA)的一项重要功能)主要是通过对UDDI或ebXML等业务注册中心执行查询来实现的。跨多个异构注册中心发现Web服务的能力正在成为一项具有挑战性的任务，并引发了诸如性能、可靠性和健壮性等几个问题。在本文中，我们将介绍Web Service Repository Builder (WRSB)，它作为一个集成的SOA注册中心和存储库，用于管理Web服务和系统构件的扩展。具体地说，建议的框架主动捕获和导航多个服务注册中心，并为发现Web服务提供统一的环境。WSRB框架与现有基础设施兼容，并且可以无缝集成到现有基础设施中，而无需对现有环境进行任何修改。
{"title":"A Framework for Efficient Discovery of Web Services Across Heterogeneous Registries","authors":"Eyhab Al-Masri, Q. Mahmoud","doi":"10.1109/CCNC.2007.88","DOIUrl":"https://doi.org/10.1109/CCNC.2007.88","url":null,"abstract":"Growth and propagation of the Internet has been a contributing factor for information overload which acts as a deterrent for quick and easy discovery of information. As Web services proliferate, the same dilemma perceived in the discovery of Web pages will become tangible. Currently, the automatic discovery of Web services, an important capability of service- oriented architecture (SOA), is mainly achieved by performing inquiries to business registries such as the UDDI or ebXML. The ability to discover Web services across multiple heterogeneous registries is becoming a challenging task and raises several issues such as performance, reliability, and robustness. In this paper, we introduce the Web Service Repository Builder (WRSB) that serves as an integrated SOA registry and repository for managing the proliferation of Web services and system artifacts. Specifically, the proposed framework actively captures and navigates among multiple service registries and provides a unified environment for the discovery of Web services. The WSRB framework is compatible with, and can be integrated seamlessly into, the existing infrastructure without any modifications to the existing environments.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134234265","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}
Although various publications confirm the need for a generic DRM software architecture, we observe that current efforts to define a DRM architecture do not always provide sufficient support to enable the creation and management of DRM systems and content distribution applications. This is a considerable problem that implies a crucial challenge for the evolution of DRM, given the impact of a software architecture on the functional and non-functional qualities of the implemen- tation. This paper (1) presents a generic DRM architecture, (2) evaluates it in the context of interoperability, extendability, and modifiability, and (3) compares it to related work in the Digital Media Project (DMP). To the best of our knowledge, the proposed architecture is more detailed than related work published so far.
{"title":"A Software Architecture to Facilitate the Creation of DRM Systems","authors":"Koen Buyens, Sam Michiels, W. Joosen","doi":"10.1109/CCNC.2007.193","DOIUrl":"https://doi.org/10.1109/CCNC.2007.193","url":null,"abstract":"Although various publications confirm the need for a generic DRM software architecture, we observe that current efforts to define a DRM architecture do not always provide sufficient support to enable the creation and management of DRM systems and content distribution applications. This is a considerable problem that implies a crucial challenge for the evolution of DRM, given the impact of a software architecture on the functional and non-functional qualities of the implemen- tation. This paper (1) presents a generic DRM architecture, (2) evaluates it in the context of interoperability, extendability, and modifiability, and (3) compares it to related work in the Digital Media Project (DMP). To the best of our knowledge, the proposed architecture is more detailed than related work published so far.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132863804","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}
Sensor grids integrate wireless sensor networks with the grid computing infrastructure, enabling sensor resources to be shared as distributed and heterogeneous resources. By combining the complementary strengths of sensor networks and grid comput- ing, sensor grids can support applications that require real-time sensor data from the physical environment, and vast amount of computational and storage resources. A major challenge in the design of sensor grids is the man- agement of sensor data from wireless sensor networks in order to efficiently provide data related services to applications. In this paper, we design a Data Management component for our sensor grid architecture. The Data Management component provides services such as data conversion, streaming and event notification to applications. We have implemented the Data Management component on a real sensor grid testbed. Our validation tests indicate that this component works well within our sensor grid testbed. Keyword: Wireless Sensor Networks, Grid Computing, Sensor Grid, Data Management
{"title":"Data Management Services for Sensor Grids","authors":"H. Lim, David Li","doi":"10.1109/CCNC.2007.125","DOIUrl":"https://doi.org/10.1109/CCNC.2007.125","url":null,"abstract":"Sensor grids integrate wireless sensor networks with the grid computing infrastructure, enabling sensor resources to be shared as distributed and heterogeneous resources. By combining the complementary strengths of sensor networks and grid comput- ing, sensor grids can support applications that require real-time sensor data from the physical environment, and vast amount of computational and storage resources. A major challenge in the design of sensor grids is the man- agement of sensor data from wireless sensor networks in order to efficiently provide data related services to applications. In this paper, we design a Data Management component for our sensor grid architecture. The Data Management component provides services such as data conversion, streaming and event notification to applications. We have implemented the Data Management component on a real sensor grid testbed. Our validation tests indicate that this component works well within our sensor grid testbed. Keyword: Wireless Sensor Networks, Grid Computing, Sensor Grid, Data Management","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133646628","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}
A mobile device's intrusion protection system (IPS) is at odds with itself: it should run as often as necessary and remain transparent to the system and the users; however, it should use as little system resources as possible to detect, report and prevent intrusions. By creating a forensics report that regularly monitors demands placed on battery current (mA) as well as correlating power and event activities, such as processes, open ports, and registry keys, a mobile host-based form of intrusion protection can be easily integrated into virtually any network intrusion detection system (IDS.) This paper outlines a novel design, test and build methodology to generate an effective security profile and an efficient bit-vector reporting format, to provide an enhancement in detecting, alerting and responding to various misuse conditions.
{"title":"Effective Reporting (ER) for Mobile Host-Based Security and Forensics","authors":"G. A. Jacoby, J. S. Ransbottom","doi":"10.1109/CCNC.2007.60","DOIUrl":"https://doi.org/10.1109/CCNC.2007.60","url":null,"abstract":"A mobile device's intrusion protection system (IPS) is at odds with itself: it should run as often as necessary and remain transparent to the system and the users; however, it should use as little system resources as possible to detect, report and prevent intrusions. By creating a forensics report that regularly monitors demands placed on battery current (mA) as well as correlating power and event activities, such as processes, open ports, and registry keys, a mobile host-based form of intrusion protection can be easily integrated into virtually any network intrusion detection system (IDS.) This paper outlines a novel design, test and build methodology to generate an effective security profile and an efficient bit-vector reporting format, to provide an enhancement in detecting, alerting and responding to various misuse conditions.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127417204","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}
Previous work for maximizing system lifetime in sensor networks has proposed mechanism such on clustered networks or energy-aware routing protocols. In those works, prediction of lifetime and measurement of energy are dependent on predefined data such as transmission energy, data rate and so on. In common sensor networks, packets are unevenly generated and transmission energy is difficult to measure. Previous work cannot reflect the attributes of real networks. In this paper, we propose a routing algorithm that considers hardware-dependent battery consumption behavior of underlying sensor hardware. Each node reads its current voltage level and estimates its lifetime. Routing is then decided upon the predicted lifetime. Simulation results show that the proposed protocol extends the network lifetime by more than 12% over traditional methods.
{"title":"Energy-Aware Routing Based on Runtime Power Consumption Characteristics of Sensor Hardware","authors":"Hojoon Lee, Jiyoung Yi, H. Cha","doi":"10.1109/CCNC.2007.111","DOIUrl":"https://doi.org/10.1109/CCNC.2007.111","url":null,"abstract":"Previous work for maximizing system lifetime in sensor networks has proposed mechanism such on clustered networks or energy-aware routing protocols. In those works, prediction of lifetime and measurement of energy are dependent on predefined data such as transmission energy, data rate and so on. In common sensor networks, packets are unevenly generated and transmission energy is difficult to measure. Previous work cannot reflect the attributes of real networks. In this paper, we propose a routing algorithm that considers hardware-dependent battery consumption behavior of underlying sensor hardware. Each node reads its current voltage level and estimates its lifetime. Routing is then decided upon the predicted lifetime. Simulation results show that the proposed protocol extends the network lifetime by more than 12% over traditional methods.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115877623","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
扫码关注我们
求助内容：
应助结果提醒方式：