Environmental sensing is seen as key to understanding the physical processes that affect our lives. The collection of such data is used to enhance the decision making processes of governments, organizations and society as a whole in their future interactions with the planet. In order to be able to generate a global picture of the effects a physical phenomenon may have it is necessary to generate a framework which is capable of networking sensing devices on a global scale. This paper presents an initial overview of a framework to facilitate the worldwide networking of a wide variety of sensing device types into a Worldwide Sensor Web.
{"title":"A Hierarchically Structured Worldwide Sensor Web Architecture","authors":"I. Rhead, M. Merabti, H. Mokhtar, P. Fergus","doi":"10.1109/WAINA.2009.140","DOIUrl":"https://doi.org/10.1109/WAINA.2009.140","url":null,"abstract":"Environmental sensing is seen as key to understanding the physical processes that affect our lives. The collection of such data is used to enhance the decision making processes of governments, organizations and society as a whole in their future interactions with the planet. In order to be able to generate a global picture of the effects a physical phenomenon may have it is necessary to generate a framework which is capable of networking sensing devices on a global scale. This paper presents an initial overview of a framework to facilitate the worldwide networking of a wide variety of sensing device types into a Worldwide Sensor Web.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125228835","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-02-18DOI: 10.1109/CCNC.2009.4784914
Yong Wang, K. Yen, Hao Zhu
Directional antennas widely used in IEEE 802.11 series protocols can offer high gain and low interference to other stations. But they also cause some side effects like the hidden terminal and deafness problems, which will deteriorate the performance of the networks significantly. Therefore, omni-directional antennas have to be used in some cases to avoid these problems. So a station equipped with antennas capable of operating in both omnidirectional and directional modes is desired. In this paper, an entropy-based clustering algorithm is proposed to find an improved solution between using omniand directional antennas, which utilizes the advantage of directional antennas and meanwhile alleviates the effects brought by directional antennas. We compare our proposed algorithms with the traditional ones and the simulation results confirm the effectiveness of our proposed method.
{"title":"Using Entropy Based Clustering Method to Improve the Utilization Heterogeneous Antennas in Ad Hoc Wireless Networks","authors":"Yong Wang, K. Yen, Hao Zhu","doi":"10.1109/CCNC.2009.4784914","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784914","url":null,"abstract":"Directional antennas widely used in IEEE 802.11 series protocols can offer high gain and low interference to other stations. But they also cause some side effects like the hidden terminal and deafness problems, which will deteriorate the performance of the networks significantly. Therefore, omni-directional antennas have to be used in some cases to avoid these problems. So a station equipped with antennas capable of operating in both omnidirectional and directional modes is desired. In this paper, an entropy-based clustering algorithm is proposed to find an improved solution between using omniand directional antennas, which utilizes the advantage of directional antennas and meanwhile alleviates the effects brought by directional antennas. We compare our proposed algorithms with the traditional ones and the simulation results confirm the effectiveness of our proposed method.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131774785","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-02-18DOI: 10.1109/CCNC.2009.4785025
Y. Chen, D. Gibbon, R. Jana, Bernard Renger, D. Stern, Mike Yang, B. Wei, Hailong Sun
GeoTV is a project that explores seamless integration of mobile phones, HDTV sets, and computers in the living room to enrich the user experience of existing services. The three- screen service allows a user to navigate a world map on a smart phone to track geo-located media RSS content that matches her personal interests. The user can show a matching video clip on her phone or direct a nearby HDTV set to play the video. In addition, the user can bring up a world map on a nearby computer screen to navigate areas of interest related to the video clip. GeoTV allows all three screens to be used for what they are best for: HDTV for high resolution video, computer screen for browsing a world map, and a smart phone for personalized control at hand to select media of interest.
{"title":"Project GeoTV - A Three-Screen Service: Navigate on SmartPhone, Browse on PC, Watch on HDTV","authors":"Y. Chen, D. Gibbon, R. Jana, Bernard Renger, D. Stern, Mike Yang, B. Wei, Hailong Sun","doi":"10.1109/CCNC.2009.4785025","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4785025","url":null,"abstract":"GeoTV is a project that explores seamless integration of mobile phones, HDTV sets, and computers in the living room to enrich the user experience of existing services. The three- screen service allows a user to navigate a world map on a smart phone to track geo-located media RSS content that matches her personal interests. The user can show a matching video clip on her phone or direct a nearby HDTV set to play the video. In addition, the user can bring up a world map on a nearby computer screen to navigate areas of interest related to the video clip. GeoTV allows all three screens to be used for what they are best for: HDTV for high resolution video, computer screen for browsing a world map, and a smart phone for personalized control at hand to select media of interest.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124906851","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.4784703
E. Ghadimi, A. Khonsari, M. S. Talebi, N. Yazdani
The research community has recently witnessed the emergence of densely deployed Wireless Sensor Networks (WSNs) consisting of a large number of battery-operated sensor nodes. As a candidate for monitoring remote faulty regions, WSNs may suffer from hardware and software faults which may cause misbehavior of a portion of network. Geographic routing algorithms aims at traversing data packets in such environments with admissible communication complexity. In this paper, we propose a novel region routing algorithm that addresses message loss tolerability in harsh and hostile environments by assigning higher weights to higher harsh regions. Finally, we present extensive simulation experiments to validate the accuracy of the proposed algorithm.
{"title":"Loss-Aware Geographic Routing for Unreliable Wireless Sensor Networks","authors":"E. Ghadimi, A. Khonsari, M. S. Talebi, N. Yazdani","doi":"10.1109/CCNC.2009.4784703","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784703","url":null,"abstract":"The research community has recently witnessed the emergence of densely deployed Wireless Sensor Networks (WSNs) consisting of a large number of battery-operated sensor nodes. As a candidate for monitoring remote faulty regions, WSNs may suffer from hardware and software faults which may cause misbehavior of a portion of network. Geographic routing algorithms aims at traversing data packets in such environments with admissible communication complexity. In this paper, we propose a novel region routing algorithm that addresses message loss tolerability in harsh and hostile environments by assigning higher weights to higher harsh regions. Finally, we present extensive simulation experiments to validate the accuracy of the proposed algorithm.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"47 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":"115613342","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.4784941
Gilles Boccon-Gibod, Julien Boeuf, J. Lacy
Digital Rights Management systems originally arose as an example of a solution to one of the most basic problems associated with secure systems design, the problem of governing access by a credentialed entity to a resource in the context of a set of policies established to restrict or define such access. Most DRMs that are in use today are based on DRM-specific declarative rights expression languages and authorization mechanisms that have strong semantic coupling to the application in which they are employed. A notable exception to this approach can be found in the Octopus system described in this paper. Octopus employs several concepts from the trust management philosophy originally posited by Blaze, et al. in 1996, but perhaps its most striking similarity can be found in its clear separation of authorization mechanism from application semantics.
{"title":"Octopus: An Application Independent DRM Toolkit","authors":"Gilles Boccon-Gibod, Julien Boeuf, J. Lacy","doi":"10.1109/CCNC.2009.4784941","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784941","url":null,"abstract":"Digital Rights Management systems originally arose as an example of a solution to one of the most basic problems associated with secure systems design, the problem of governing access by a credentialed entity to a resource in the context of a set of policies established to restrict or define such access. Most DRMs that are in use today are based on DRM-specific declarative rights expression languages and authorization mechanisms that have strong semantic coupling to the application in which they are employed. A notable exception to this approach can be found in the Octopus system described in this paper. Octopus employs several concepts from the trust management philosophy originally posited by Blaze, et al. in 1996, but perhaps its most striking similarity can be found in its clear separation of authorization mechanism from application semantics.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"51 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":"115666051","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.4784737
Chun-Ting Chou
New applications such as high-definition (HD) video streaming are driving the data rate of wireless links from hundreds of Mbps to multi Gbps. Among a few technologies that can provide such high rates, transmission in 60-GHz bands is considered as a very promising solution. In this paper, we identify key design challenges of wireless transmission in 60-GHz bands from the perspective of medium access control (MAC) design. Ecma TC-48 MAC Protocol is used as a case study to show how these challenges are addressed in a practical and efficient manner.
{"title":"On the Design of Medium Access Control for Multi-Gbps Wireless Networks in 60-GHz Bands","authors":"Chun-Ting Chou","doi":"10.1109/CCNC.2009.4784737","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784737","url":null,"abstract":"New applications such as high-definition (HD) video streaming are driving the data rate of wireless links from hundreds of Mbps to multi Gbps. Among a few technologies that can provide such high rates, transmission in 60-GHz bands is considered as a very promising solution. In this paper, we identify key design challenges of wireless transmission in 60-GHz bands from the perspective of medium access control (MAC) design. Ecma TC-48 MAC Protocol is used as a case study to show how these challenges are addressed in a practical and efficient manner.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"47 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":"117153508","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.4784892
H. Gharavi, Bin Hu
Multipath routing can be effectively used to maximize the utilization of network resources for real-time traffic. In mobile ad-hoc network environments, this approach can suffer from co-channel interference due to the simultaneous transmission of packets via multiple routes. In this paper, by exploiting the directionality of directional antennas, a Directional Dynamic Source Routing (DDSR)-based Multipath routing protocol is proposed for mobile wireless ad hoc networks. Three metrics are considered in the route discovery process in order to select the best multiple routes. These are hop count, beam overlaps, and the number of joint nodes between the different routes. The proposed directional routing protocol has shown to be capable of minimizing inter-path and intra-path interference, hence significantly improving the system throughput performance for simultaneous transmission of multimedia information over multiple routes.
{"title":"Directional Antenna for Multipath Ad Hoc Routing","authors":"H. Gharavi, Bin Hu","doi":"10.1109/CCNC.2009.4784892","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784892","url":null,"abstract":"Multipath routing can be effectively used to maximize the utilization of network resources for real-time traffic. In mobile ad-hoc network environments, this approach can suffer from co-channel interference due to the simultaneous transmission of packets via multiple routes. In this paper, by exploiting the directionality of directional antennas, a Directional Dynamic Source Routing (DDSR)-based Multipath routing protocol is proposed for mobile wireless ad hoc networks. Three metrics are considered in the route discovery process in order to select the best multiple routes. These are hop count, beam overlaps, and the number of joint nodes between the different routes. The proposed directional routing protocol has shown to be capable of minimizing inter-path and intra-path interference, hence significantly improving the system throughput performance for simultaneous transmission of multimedia information over multiple routes.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"3 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":"120939975","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.4784884
D. Gallo, C. Miers, Vlad C. Coroamă, T. Carvalho, V. Souza, P. Karlsson
From the four basic functionalities of video delivery systems - linear TV, Video on Demand (VoD), time-shifted TV (tsTV), and network Personal Video Recorder (nPVR) - most of today's solutions focus either on linear TV, or on VoD. While linear TV usually uses efficient distribution mechanisms such as multicast, VoD is often realized via centralized, bandwidth-inefficient unicast. Even when file sharing P2P algorithms are used for VoD or nPVR, they can not be applied to tsTV since they require the whole content to exist from the beginning. With this paper, we propose a novel solution that aims at offering all four functionalities in one distributed system. Our architecture uses multicast for the distribution of live content, and a modified P2P protocol for offering VoD, nPVR, and tsTV altogether.
{"title":"A Multimedia Delivery Architecture for IPTV with P2P-Based Time-Shift Support","authors":"D. Gallo, C. Miers, Vlad C. Coroamă, T. Carvalho, V. Souza, P. Karlsson","doi":"10.1109/CCNC.2009.4784884","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784884","url":null,"abstract":"From the four basic functionalities of video delivery systems - linear TV, Video on Demand (VoD), time-shifted TV (tsTV), and network Personal Video Recorder (nPVR) - most of today's solutions focus either on linear TV, or on VoD. While linear TV usually uses efficient distribution mechanisms such as multicast, VoD is often realized via centralized, bandwidth-inefficient unicast. Even when file sharing P2P algorithms are used for VoD or nPVR, they can not be applied to tsTV since they require the whole content to exist from the beginning. With this paper, we propose a novel solution that aims at offering all four functionalities in one distributed system. Our architecture uses multicast for the distribution of live content, and a modified P2P protocol for offering VoD, nPVR, and tsTV altogether.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"191 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":"121099578","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.4784768
Y. Chen, R. Jana, D. Stern, Hailong Sun, B. Wei, Mike Yang
Recent advances in P2P technology have made it a viable alternative for the delivery of rich media by both content and service providers. However, to better understand and utilize P2P technologies in building a scalable media distribution platform, the nature of the underlying network must be taken into consideration. Although many P2P simulations have been conducted previously, very few were evaluated on a real P2P testbed with the properties of the physical network in mind. In this paper, we describe VP2P, a virtual machine-based P2P testbed, which supports P2P studies with the consideration of typical service provider networks. We use four fully equipped MacPro's to emulate 32 peers in the current implementation. Experiments of three P2P algorithms for Video On Demand (VoD) services: BitTorrent, Toast, and Zebra, were run on the testbed. We discuss the rationales behind the hardware and software architecture of VP2P, report our results, and conclude with lessons learned and future directions for VM-based testbeds.
{"title":"VP2P: A Virtual Machine-Based P2P Testbed for VoD Delivery","authors":"Y. Chen, R. Jana, D. Stern, Hailong Sun, B. Wei, Mike Yang","doi":"10.1109/CCNC.2009.4784768","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784768","url":null,"abstract":"Recent advances in P2P technology have made it a viable alternative for the delivery of rich media by both content and service providers. However, to better understand and utilize P2P technologies in building a scalable media distribution platform, the nature of the underlying network must be taken into consideration. Although many P2P simulations have been conducted previously, very few were evaluated on a real P2P testbed with the properties of the physical network in mind. In this paper, we describe VP2P, a virtual machine-based P2P testbed, which supports P2P studies with the consideration of typical service provider networks. We use four fully equipped MacPro's to emulate 32 peers in the current implementation. Experiments of three P2P algorithms for Video On Demand (VoD) services: BitTorrent, Toast, and Zebra, were run on the testbed. We discuss the rationales behind the hardware and software architecture of VP2P, report our results, and conclude with lessons learned and future directions for VM-based testbeds.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"13 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":"125272240","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.4784975
Luca Genovali, L. Ricci
This paper presents a P2P support for Massively Multiplayer On line Games. The P2P overlay is defined by considering a Voronoi diagram where the sites correspond to the peers and a link connects Voronoi neigbours. An AOI-cast mechanism is defined to notify events generated by a peer to peers located in its Area of Interest. A routing algorithm exploiting the properties of the Voronoi graph has been defined as well. AOI-cast has been evaluated through a set of simulations developed by Peersim.
{"title":"AOI-Cast Strategies for P2P Massively Multiplayer Online Games","authors":"Luca Genovali, L. Ricci","doi":"10.1109/CCNC.2009.4784975","DOIUrl":"https://doi.org/10.1109/CCNC.2009.4784975","url":null,"abstract":"This paper presents a P2P support for Massively Multiplayer On line Games. The P2P overlay is defined by considering a Voronoi diagram where the sites correspond to the peers and a link connects Voronoi neigbours. An AOI-cast mechanism is defined to notify events generated by a peer to peers located in its Area of Interest. A routing algorithm exploiting the properties of the Voronoi graph has been defined as well. AOI-cast has been evaluated through a set of simulations developed by Peersim.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"270 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":"116066832","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
扫码关注我们
求助内容：
应助结果提醒方式：