Pub Date : 2009-01-11DOI: 10.1109/CCNC.2009.4784966
S. Ferretti, M. Roccetti, Bruno Zamborlin
We present SPAWC (Signal Parser And Well-Formed Composer), a system for the generation of complex melodies, chords and sounds, based on a simple interaction of the performer with an input instrument, i.e., a modulator. Via modulator, the performer generates inputs which are manipulated by SPAWC and transformed into melodies, chords or complex sounds. Real/virtual instruments, as well as a set of (pre or live) recorded audio samples can be utilized to produce the final output. In this paper, we describe all the system components working inside SPAWC. The final output is dynamically produced based on the utilized carrier, i.e., the exploited real/virtual instrument or the set of audio samples loaded on SPAWC. A real installation of SPAWC has been developed by exploiting a theremin as the modulator. Real experiences have demonstrated that SPAWC can be utilized by artists to produce interactive music generation experiences. Concurrently, the system can be employed for entertainment and educational purposes. The software architecture of SPAWC is designed to allow the distribution of its software components over a network. This would make possible to dynamically exploit different carriers available on the net, and promote novel forms of artistic interactions among users over the Internet.
{"title":"On SPAWC: Discussion on a Musical Signal Parser and Well-Formed Composer","authors":"S. Ferretti, M. Roccetti, Bruno Zamborlin","doi":"10.1109/CCNC.2009.4784966","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784966","url":null,"abstract":"We present SPAWC (Signal Parser And Well-Formed Composer), a system for the generation of complex melodies, chords and sounds, based on a simple interaction of the performer with an input instrument, i.e., a modulator. Via modulator, the performer generates inputs which are manipulated by SPAWC and transformed into melodies, chords or complex sounds. Real/virtual instruments, as well as a set of (pre or live) recorded audio samples can be utilized to produce the final output. In this paper, we describe all the system components working inside SPAWC. The final output is dynamically produced based on the utilized carrier, i.e., the exploited real/virtual instrument or the set of audio samples loaded on SPAWC. A real installation of SPAWC has been developed by exploiting a theremin as the modulator. Real experiences have demonstrated that SPAWC can be utilized by artists to produce interactive music generation experiences. Concurrently, the system can be employed for entertainment and educational purposes. The software architecture of SPAWC is designed to allow the distribution of its software components over a network. This would make possible to dynamically exploit different carriers available on the net, and promote novel forms of artistic interactions among users over the Internet.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127295173","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784893
Xiaoyu Wang, A. Wong, P. Ho
In this paper, a novel cooperative stochastic channel prioritization algorithm is presented for the purpose of improving spectrum sensing efficiency in cooperative cognitive radio systems. The proposed algorithm achieves the goal by prioritizing the channels for fine sensing based on both local statistics obtained by the cognitive radio as well as long-term spatiotemporal statistics obtained from other cognitive radios. Channel priority is determined in a stochastic manner by performing statistical fusion on the local statistics and statistics from neighboring cognitive radios to obtain a biasing density from which stochastic sampling can be used to identify the likelihood of channel availability. Therefore, the individual cognitive radios collaborate to improve the likelihood of each cognitive radio in obtaining available channels. Simulation results show that the proposed cooperative stochastic channel prioritization algorithm can be used to reduce both sensing overhead and percentage of missed opportunities when implemented in a complimentary manner with existing cooperative cognitive radio systems.
{"title":"Stochastic Channel Prioritization for Spectrum Sensing in Cooperative Cognitive Radio","authors":"Xiaoyu Wang, A. Wong, P. Ho","doi":"10.1109/CCNC.2009.4784893","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784893","url":null,"abstract":"In this paper, a novel cooperative stochastic channel prioritization algorithm is presented for the purpose of improving spectrum sensing efficiency in cooperative cognitive radio systems. The proposed algorithm achieves the goal by prioritizing the channels for fine sensing based on both local statistics obtained by the cognitive radio as well as long-term spatiotemporal statistics obtained from other cognitive radios. Channel priority is determined in a stochastic manner by performing statistical fusion on the local statistics and statistics from neighboring cognitive radios to obtain a biasing density from which stochastic sampling can be used to identify the likelihood of channel availability. Therefore, the individual cognitive radios collaborate to improve the likelihood of each cognitive radio in obtaining available channels. Simulation results show that the proposed cooperative stochastic channel prioritization algorithm can be used to reduce both sensing overhead and percentage of missed opportunities when implemented in a complimentary manner with existing cooperative cognitive radio systems.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132965847","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4785004
TaeYoung Song, Y. Kawahara, T. Asami
The home networking becomes more interesting if users can share high quality contents with friends and colleagues living away from the user. DLNA certified devices allow users to share or access digital media contents on the same home network. However, the sharing of the content is only limited inside local area networks. In this paper, we propose a global content sharing home gateway named DAS (DLNA Agent for SNS). Different from exiting approaches using VPN, DAS enables to share specified contents to selected users with support of access control functionality provided by Social Network web services. As DAS behaves as a DLNA certified server, there is no need to modify commercial DLNA CE devices.
如果用户可以与住在远方的朋友和同事分享高质量的内容，那么家庭网络将变得更加有趣。DLNA认证的设备允许用户在同一个家庭网络上共享或访问数字媒体内容。然而，内容的共享仅限于局域网内部。本文提出了一种全局内容共享家庭网关DAS (DLNA Agent for SNS)。与使用VPN的现有方法不同，DAS可以通过支持社交网络web服务提供的访问控制功能，将指定的内容共享给选定的用户。由于DAS作为DLNA认证服务器，因此不需要修改商用DLNA CE设备。
{"title":"Using SNS as Access Control Mechanism for DLNA Content Sharing System","authors":"TaeYoung Song, Y. Kawahara, T. Asami","doi":"10.1109/CCNC.2009.4785004","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4785004","url":null,"abstract":"The home networking becomes more interesting if users can share high quality contents with friends and colleagues living away from the user. DLNA certified devices allow users to share or access digital media contents on the same home network. However, the sharing of the content is only limited inside local area networks. In this paper, we propose a global content sharing home gateway named DAS (DLNA Agent for SNS). Different from exiting approaches using VPN, DAS enables to share specified contents to selected users with support of access control functionality provided by Social Network web services. As DAS behaves as a DLNA certified server, there is no need to modify commercial DLNA CE devices.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"56 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131657345","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784760
M. Mushtaq, T. Ahmed
In this paper, we present an admission control mechanism for video streaming driven by Service Provider (SP) over P2P networks. SP-driven P2P network is a network in which service provider has a comprehensive control over contracted resources utilisation. SP assures the coordination and the creation of overlay P2P network and it is responsible for admission control and resource allocation among others. Our proposed Quality-of-Service (QoS) provisioning mechanism employs video traffic descriptor (i.e. traffic specification) for performing admission control. The proposed mechanism is evaluated using ns2 simulator and the results show the significance of admission control mechanism for QoS provisioning.
{"title":"QoS Provisioning for Video Streaming over SP-Driven P2P Networks Using Admission Control","authors":"M. Mushtaq, T. Ahmed","doi":"10.1109/CCNC.2009.4784760","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784760","url":null,"abstract":"In this paper, we present an admission control mechanism for video streaming driven by Service Provider (SP) over P2P networks. SP-driven P2P network is a network in which service provider has a comprehensive control over contracted resources utilisation. SP assures the coordination and the creation of overlay P2P network and it is responsible for admission control and resource allocation among others. Our proposed Quality-of-Service (QoS) provisioning mechanism employs video traffic descriptor (i.e. traffic specification) for performing admission control. The proposed mechanism is evaluated using ns2 simulator and the results show the significance of admission control mechanism for QoS provisioning.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128843799","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784732
Dimitrios Meintanis, I. Papaefstathiou
Supporting high levels of security in wireless networks is a challenging issue because of the specific problems this environment poses; the provided security by small mobile systems, such as PDAs and mobile phones, is often restricted by their limited battery power and their limited processing power. Driven by these restrictions, the designer will have to decide whether to implement the wireless network security schemes in software or to add special purpose hardware units to the system, executing those CPU intensive tasks. This paper demonstrates and compares the Hardware and Software implementations of a number of widely used security applications employed in wireless networks. We measured the total energy consumption for each security algorithm when implemented in reconfigurable hardware devices and we compared it with the total energy consumption of the equivalent software applications. We demonstrate, that the hardware implementations on a state-of-the-art FPGA are significantly faster while they consume three orders of magnitude less power when compared with the software implementations executed on a state-of-the-art hard-core CPU which is embedded in the same FPGA device.
{"title":"On the Power Consumption of Security Algorithms Employed in Wireless Networks","authors":"Dimitrios Meintanis, I. Papaefstathiou","doi":"10.1109/CCNC.2009.4784732","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784732","url":null,"abstract":"Supporting high levels of security in wireless networks is a challenging issue because of the specific problems this environment poses; the provided security by small mobile systems, such as PDAs and mobile phones, is often restricted by their limited battery power and their limited processing power. Driven by these restrictions, the designer will have to decide whether to implement the wireless network security schemes in software or to add special purpose hardware units to the system, executing those CPU intensive tasks. This paper demonstrates and compares the Hardware and Software implementations of a number of widely used security applications employed in wireless networks. We measured the total energy consumption for each security algorithm when implemented in reconfigurable hardware devices and we compared it with the total energy consumption of the equivalent software applications. We demonstrate, that the hardware implementations on a state-of-the-art FPGA are significantly faster while they consume three orders of magnitude less power when compared with the software implementations executed on a state-of-the-art hard-core CPU which is embedded in the same FPGA device.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126821029","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784738
Yang Yang, Weidong Yi, Yongrui Chen
We propose a trellis-based soft-input-soft-output (SISO) a posteriori probability (APP) decoding technique for variable-length coded correlated sources. This technique allows not only the (ML) sequence estimation but also the computation of bit-based reliability values. The notable feature of the proposed technique is that its calculation complexity and memory space requirement are both low. Moreover, we bring the technique of scaling extrinsic information to the field of iterative joint source-channel decoding (ISCD), and obtain fixed scaling factors (SFs) based on the extrinsic information transfer (EXIT) charts analysis. This technique obviously improves the ISCD performance with increasing neglectable complexity. Simulation results show that the proposed ISCD scheme provides a significant improvement on error protection capability for the variable-length coded correlated sources.
{"title":"Reliable Transfer of Variable-Length Coded Correlated Date: An Low Complexity Iterative Joint Source-Channel Decoding Approach","authors":"Yang Yang, Weidong Yi, Yongrui Chen","doi":"10.1109/CCNC.2009.4784738","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784738","url":null,"abstract":"We propose a trellis-based soft-input-soft-output (SISO) a posteriori probability (APP) decoding technique for variable-length coded correlated sources. This technique allows not only the (ML) sequence estimation but also the computation of bit-based reliability values. The notable feature of the proposed technique is that its calculation complexity and memory space requirement are both low. Moreover, we bring the technique of scaling extrinsic information to the field of iterative joint source-channel decoding (ISCD), and obtain fixed scaling factors (SFs) based on the extrinsic information transfer (EXIT) charts analysis. This technique obviously improves the ISCD performance with increasing neglectable complexity. Simulation results show that the proposed ISCD scheme provides a significant improvement on error protection capability for the variable-length coded correlated sources.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123293028","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784706
J. You, D. Lieckfeldt, D. Timmermann
As sensor networks are deployed over various terrains, the complexity of their topology continues to grow. Holes in networks often cause existing geographic routing algorithms to fail. In this paper, we propose a novel geographic routing algorithm called Greedy Forwarding with VIrtual Position (GF-ViP). We introduce virtual position as the middle position of all neighbors of a node. Instead of comparing nodes' geographic position, GF-ViP employs virtual position for selecting the next hop. Such virtual position reflects the neighborhood of a sensor node, as well as the tendency of further forwarding. For network with routing holes, GF-ViP significantly increases success rate of packet routing, while the overhead is kept low. Furthermore, multiple levels of virtual position can be obtained with localized iteration. We propose the Greedy Forwarding with Multi-level Virtual Position (GF-MVP) algorithm. According to various context information of a sensor network, different levels of virtual position can be used alternatively to increase success rate of packet routing in sensor networks.
{"title":"Tendency-Based Geographic Routing for Sensor Networks","authors":"J. You, D. Lieckfeldt, D. Timmermann","doi":"10.1109/CCNC.2009.4784706","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784706","url":null,"abstract":"As sensor networks are deployed over various terrains, the complexity of their topology continues to grow. Holes in networks often cause existing geographic routing algorithms to fail. In this paper, we propose a novel geographic routing algorithm called Greedy Forwarding with VIrtual Position (GF-ViP). We introduce virtual position as the middle position of all neighbors of a node. Instead of comparing nodes' geographic position, GF-ViP employs virtual position for selecting the next hop. Such virtual position reflects the neighborhood of a sensor node, as well as the tendency of further forwarding. For network with routing holes, GF-ViP significantly increases success rate of packet routing, while the overhead is kept low. \u0000 \u0000Furthermore, multiple levels of virtual position can be obtained with localized iteration. We propose the Greedy Forwarding with Multi-level Virtual Position (GF-MVP) algorithm. According to various context information of a sensor network, different levels of virtual position can be used alternatively to increase success rate of packet routing in sensor networks.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126523207","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4785006
P. Danielis, S. Kubisch, H. Widiger, Jens Rohrbeck, Vladyslav Altman, J. Skodzik, D. Timmermann, T. Bahls, D. Duchow
This demonstration shows the hardware prototype of the IPclip (IP Calling Line Identification Presentation) mechanism for IPv6 networks. IPclip is a mechanism, which provides Trust-by-Wire in IP-based networks by adding trustworthy location information to IP packets. It is implemented on an FPGA development board and configurable at runtime via a graphical configuration tool. We show IPclip's basic functionality in a localization scenario using an analysis tool and Google Earth and discuss several application scenarios during the demonstration.
{"title":"Trust-by-Wire in Packet-Switched IPv6 Networks: Tools and FPGA Prototype for the IPclip System","authors":"P. Danielis, S. Kubisch, H. Widiger, Jens Rohrbeck, Vladyslav Altman, J. Skodzik, D. Timmermann, T. Bahls, D. Duchow","doi":"10.1109/CCNC.2009.4785006","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4785006","url":null,"abstract":"This demonstration shows the hardware prototype of the IPclip (IP Calling Line Identification Presentation) mechanism for IPv6 networks. IPclip is a mechanism, which provides Trust-by-Wire in IP-based networks by adding trustworthy location information to IP packets. It is implemented on an FPGA development board and configurable at runtime via a graphical configuration tool. We show IPclip's basic functionality in a localization scenario using an analysis tool and Google Earth and discuss several application scenarios during the demonstration.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123074757","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784908
Takeshi Kato, Tomoyuki Osano, N. Ishikawa
In recent years, due to the rise in crime, growing numbers of governments, companies, and schools are equipping their facilities with security cameras to deter crime and to investigate crimes that have happened. In this study, we investigate a distributed application that provides an efficient access method for security cameras placed in various areas. Peer-to-peer is a suitable technology for such ubiquitous applications since it supports discovery mechanisms, simple one-to-one communication, free and extensible distribution of resources, and distributed search to handle the enormous number of resources expected. Our system uses protocols defined by Peer-to-peer Universal Computing Consortium (PUCC) to control various kinds of devices over a peer-to-peer network. This paper presents the design and implementation of a camera control protocol on the PUCC platform for controlling security cameras from mobile phones. The prototype implementation system consists of a media gateway to deliver streaming video to multiple mobile phones and proxies to serve as peer-to-peer nodes for cameras. Camera control and signaling protocols for video streaming are realized by using PUCC protocols.
{"title":"Design and Implementation of Security Camera Control Application for Mobile Phones","authors":"Takeshi Kato, Tomoyuki Osano, N. Ishikawa","doi":"10.1109/CCNC.2009.4784908","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784908","url":null,"abstract":"In recent years, due to the rise in crime, growing numbers of governments, companies, and schools are equipping their facilities with security cameras to deter crime and to investigate crimes that have happened. In this study, we investigate a distributed application that provides an efficient access method for security cameras placed in various areas. Peer-to-peer is a suitable technology for such ubiquitous applications since it supports discovery mechanisms, simple one-to-one communication, free and extensible distribution of resources, and distributed search to handle the enormous number of resources expected. Our system uses protocols defined by Peer-to-peer Universal Computing Consortium (PUCC) to control various kinds of devices over a peer-to-peer network. This paper presents the design and implementation of a camera control protocol on the PUCC platform for controlling security cameras from mobile phones. The prototype implementation system consists of a media gateway to deliver streaming video to multiple mobile phones and proxies to serve as peer-to-peer nodes for cameras. Camera control and signaling protocols for video streaming are realized by using PUCC protocols.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"296 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122213607","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 : 2009-01-11DOI: 10.1109/CCNC.2009.4784754
Dongmin Yang, Jongmin Shin, Jeonggyu Kim, Cheeha Kim
In opportunistic networking, networks are sparse and nodes are moving around, so it is hard to predict when a node gets and how long it keeps in contact with another. For prompt neighbor discovery, a node is assumed to broadcast continuously probing messages to discover another in its vicinity. This kind of persistent probing consumes too much energy for battery-operated devices to afford. One way to save energy for neighbor discovery is simply to turn off radio during non-contact time. In this paper, as the first step toward the general solution, we simplify the problem consisting of one sender and one receiver moving around and present a novel neighbor discovery scheme with radio "on" and "off" which is optimal in a sense that it does not miss a contact with the minimum energy consumed.
{"title":"An Energy-Optimal Scheme for Neighbor Discovery in Opportunistic Networking","authors":"Dongmin Yang, Jongmin Shin, Jeonggyu Kim, Cheeha Kim","doi":"10.1109/CCNC.2009.4784754","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784754","url":null,"abstract":"In opportunistic networking, networks are sparse and nodes are moving around, so it is hard to predict when a node gets and how long it keeps in contact with another. For prompt neighbor discovery, a node is assumed to broadcast continuously probing messages to discover another in its vicinity. This kind of persistent probing consumes too much energy for battery-operated devices to afford. One way to save energy for neighbor discovery is simply to turn off radio during non-contact time. In this paper, as the first step toward the general solution, we simplify the problem consisting of one sender and one receiver moving around and present a novel neighbor discovery scheme with radio \"on\" and \"off\" which is optimal in a sense that it does not miss a contact with the minimum energy consumed.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"15 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114092973","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
扫码关注我们
求助内容：
应助结果提醒方式：