S. Fujitsu, K. Nuida, M. Hagiwara, T. Kitagawa, Hajime Watanabe, Kazuto Ogawa, H. Imai
We give a tracing algorithm for 2-secure probabilis- tic fingerprinting codes with the property that it never accuses innocent users when there are up to 2 attackers. Moreover, by using our code and tracing algorithm, innocent users are also unlikely to be accused even if either the number of attackers or attackers' abilities exceed our assumption. Our code is the first example of collusion-secure fingerprinting codes with both of these two properties. Furthermore, our code has shorter length among the preceding 2-secure codes, and possesses further properties desirable in a practical use.
{"title":"A Tracing Algorithm for Short 2-Secure Probabilistic Fingerprinting Codes Strongly Protecting Innocent Users","authors":"S. Fujitsu, K. Nuida, M. Hagiwara, T. Kitagawa, Hajime Watanabe, Kazuto Ogawa, H. Imai","doi":"10.1109/CCNC.2007.215","DOIUrl":"https://doi.org/10.1109/CCNC.2007.215","url":null,"abstract":"We give a tracing algorithm for 2-secure probabilis- tic fingerprinting codes with the property that it never accuses innocent users when there are up to 2 attackers. Moreover, by using our code and tracing algorithm, innocent users are also unlikely to be accused even if either the number of attackers or attackers' abilities exceed our assumption. Our code is the first example of collusion-secure fingerprinting codes with both of these two properties. Furthermore, our code has shorter length among the preceding 2-secure codes, and possesses further properties desirable in a practical use.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"109 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":"114556018","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}
H. Sumino, N. Ishikawa, Shingo Murakami, Takeshi Kato, J. Hjelm
Compared with traditional Internet technologies, peer-to-peer has functions to realize resource discovery, resource sharing, and load balancing in a highly distributed manner. In addition to the Internet, new networks such as home network, ad-hoc network and sensor network are emerging. An easy prediction is the emergence of a new environment in which many sensors, people, and many different kinds of devices coexist, move, and communicate with one another over such heterogeneous networks. Peer-to-peer is one of the most important and suitable technologies for such ubiquitous networking 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. Peer-to-peer Universal Computing Consortium (PUCC) was established in 2005 to develop a peer-to-peer networking platform for realizing applications in ubiquitous networking environment, which include home appliance applications. This paper presents PUCC architecture, protocols and applications.
{"title":"PUCC Architecture, Protocols and Applications","authors":"H. Sumino, N. Ishikawa, Shingo Murakami, Takeshi Kato, J. Hjelm","doi":"10.1109/CCNC.2007.160","DOIUrl":"https://doi.org/10.1109/CCNC.2007.160","url":null,"abstract":"Compared with traditional Internet technologies, peer-to-peer has functions to realize resource discovery, resource sharing, and load balancing in a highly distributed manner. In addition to the Internet, new networks such as home network, ad-hoc network and sensor network are emerging. An easy prediction is the emergence of a new environment in which many sensors, people, and many different kinds of devices coexist, move, and communicate with one another over such heterogeneous networks. Peer-to-peer is one of the most important and suitable technologies for such ubiquitous networking 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. Peer-to-peer Universal Computing Consortium (PUCC) was established in 2005 to develop a peer-to-peer networking platform for realizing applications in ubiquitous networking environment, which include home appliance applications. This paper presents PUCC architecture, protocols and applications.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"29 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":"116481879","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}
Over the past few years there has been a growing demand for radio resources and at the same time these resources are under utilized due to static spectrum allocation techniques. Dynamic spectrum access (DSA) has been thought of as a solution that would satisfy both the growing demand for radio resources and to efficiently utilize the spectrum. The radio devices that have the capability to dynamically sense the spectrum and access the under utilized bands are called cognitive radios (CR). There are two broad classes of users in CR, the primary user is a licensed user of a particular radio frequency band and the secondary users are unlicensed users who cognitively operate without causing harmful interference to the primary user. In this paper we consider a denial attack on centralized DSA networks where a malicious secondary user masquerades as a primary user and effectively shuts off access to all other secondary users. Note that this problem is unique to CR due to the distinction between primary and secondary users. We propose a public key cryptography based primary user identification mechanism that prevents malicious secondary users from masquerading as primary users. We show that the proposed identification mechanism and the associated key management are computationally light weight. We also discuss some advantages and limitations of the proposed identification mechanism.
{"title":"Digital Signatures for Centralized DSA Networks","authors":"C. N. Mathur, K.P. Subbalakshmi","doi":"10.1109/CCNC.2007.209","DOIUrl":"https://doi.org/10.1109/CCNC.2007.209","url":null,"abstract":"Over the past few years there has been a growing demand for radio resources and at the same time these resources are under utilized due to static spectrum allocation techniques. Dynamic spectrum access (DSA) has been thought of as a solution that would satisfy both the growing demand for radio resources and to efficiently utilize the spectrum. The radio devices that have the capability to dynamically sense the spectrum and access the under utilized bands are called cognitive radios (CR). There are two broad classes of users in CR, the primary user is a licensed user of a particular radio frequency band and the secondary users are unlicensed users who cognitively operate without causing harmful interference to the primary user. In this paper we consider a denial attack on centralized DSA networks where a malicious secondary user masquerades as a primary user and effectively shuts off access to all other secondary users. Note that this problem is unique to CR due to the distinction between primary and secondary users. We propose a public key cryptography based primary user identification mechanism that prevents malicious secondary users from masquerading as primary users. We show that the proposed identification mechanism and the associated key management are computationally light weight. We also discuss some advantages and limitations of the proposed identification mechanism.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"54 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":"129747411","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}
Binding and tracking are the two major phases of Location Management System (LMS). Thus, the communication costs during these two phases should be considered mostly for LMS optimization, without impairing the LMS performance. This paper describes a new optimization algorithm and, the key points of our improvement are: first, for each mobile terminal, we define more than one “anchor” node between its HLR and the serving VLR and construct a logical chain among all of them; second, the mobile terminal would memorize the current chain structure. Whenever the mobile terminal moves into a region served by a new VLR, the terminal will submit the chain structure which is saved in its memory to the new VLR. Then, the optimizing algorithm is conducted at the new VLR. The Records (that come from the terminal) and the routing information (of the new VLR) are used in the optimizing algorithm. The result of the optimization is a new chain structure in which the new VLR is one end of the chain, (the other end is always HLR of the terminal). After that, the new VLR updates the anchor chain according to the optimization result, and also downloads the new chain structure (the optimization result) to update the terminal’s memory. The binding cost and the tracking cost are both considered in the optimization algorithm. The complexity analysis shows that in the worst case, the total cost (binding plus tracking) with zero call blocking probability can be O(M), which is better than the latest result O(M·log(M)). Here, M is the distance that the terminal has moved. The simulation investigates the efficiency of our improvement with different CMR (Call-toMobility Ratio). Keywords-wireless network, cellular system, mobile computing, mobility management, location management, anchor chain.
{"title":"The Optimization of Location Management","authors":"Xiwei Zhao, N. Pissinou, S. Makki","doi":"10.1109/CCNC.2007.81","DOIUrl":"https://doi.org/10.1109/CCNC.2007.81","url":null,"abstract":"Binding and tracking are the two major phases of Location Management System (LMS). Thus, the communication costs during these two phases should be considered mostly for LMS optimization, without impairing the LMS performance. This paper describes a new optimization algorithm and, the key points of our improvement are: first, for each mobile terminal, we define more than one “anchor” node between its HLR and the serving VLR and construct a logical chain among all of them; second, the mobile terminal would memorize the current chain structure. Whenever the mobile terminal moves into a region served by a new VLR, the terminal will submit the chain structure which is saved in its memory to the new VLR. Then, the optimizing algorithm is conducted at the new VLR. The Records (that come from the terminal) and the routing information (of the new VLR) are used in the optimizing algorithm. The result of the optimization is a new chain structure in which the new VLR is one end of the chain, (the other end is always HLR of the terminal). After that, the new VLR updates the anchor chain according to the optimization result, and also downloads the new chain structure (the optimization result) to update the terminal’s memory. The binding cost and the tracking cost are both considered in the optimization algorithm. The complexity analysis shows that in the worst case, the total cost (binding plus tracking) with zero call blocking probability can be O(M), which is better than the latest result O(M·log(M)). Here, M is the distance that the terminal has moved. The simulation investigates the efficiency of our improvement with different CMR (Call-toMobility Ratio). Keywords-wireless network, cellular system, mobile computing, mobility management, location management, anchor chain.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"22 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":"128313833","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}
Unsolicited bulk email or spam is a menace to the usability of Internet email. The possibility of cheap Voice over IP (VoIP) services have introduced the threat of Spam over Internet Telephony (SPIT). A previously unexperimented solution for tackling the spam machinery is to increase its cost via Human Interactive Proofs (HIP). These proofs are basically applicable to all kind of spam, including email, but we concentrate on the Session Initiation Protocol (SIP) in this paper. Our approach allows the use of varying kinds of HIPs to prevent automated call connection attempts. The HIPs are used as an enrollment feature for configuring the call-recipient's call pass or block lists. By giving a proof of humanity, the caller is automatically put e.g. to the call-recipient's graylist for further processing by the user. The approach can be also used to mitigate unsolicited call connection attempts made by humans. We also present our SIP signaling based solution to address the SPIT threat.
{"title":"Cure for Spam Over Internet Telephony","authors":"J. Lindqvist, M. Komu","doi":"10.1109/CCNC.2007.181","DOIUrl":"https://doi.org/10.1109/CCNC.2007.181","url":null,"abstract":"Unsolicited bulk email or spam is a menace to the usability of Internet email. The possibility of cheap Voice over IP (VoIP) services have introduced the threat of Spam over Internet Telephony (SPIT). A previously unexperimented solution for tackling the spam machinery is to increase its cost via Human Interactive Proofs (HIP). These proofs are basically applicable to all kind of spam, including email, but we concentrate on the Session Initiation Protocol (SIP) in this paper. Our approach allows the use of varying kinds of HIPs to prevent automated call connection attempts. The HIPs are used as an enrollment feature for configuring the call-recipient's call pass or block lists. By giving a proof of humanity, the caller is automatically put e.g. to the call-recipient's graylist for further processing by the user. The approach can be also used to mitigate unsolicited call connection attempts made by humans. We also present our SIP signaling based solution to address the SPIT threat.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"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":"128419788","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. Donsez, Johann Bourcier, C. Escoffier, P. Lalanda, A. Bottaro
The convergence of smart home appliances and business services stands to profoundly change the way we interact with our environment. However, implementing and maintaining home-control applications is still far from easy. This demonstration presents our service-oriented platform to facilitate the development of home-control applications. This prototype is used in the ANSO industrial European project.
{"title":"A Multi-Protocol Service-Oriented Platform for Home Control Applications","authors":"D. Donsez, Johann Bourcier, C. Escoffier, P. Lalanda, A. Bottaro","doi":"10.1109/CCNC.2007.239","DOIUrl":"https://doi.org/10.1109/CCNC.2007.239","url":null,"abstract":"The convergence of smart home appliances and business services stands to profoundly change the way we interact with our environment. However, implementing and maintaining home-control applications is still far from easy. This demonstration presents our service-oriented platform to facilitate the development of home-control applications. This prototype is used in the ANSO industrial European project.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"65 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":"128694303","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}
This paper reports the design and implementation of a multicast transport-layer protocol called Sender Initiated Congestion Control (SICC) which provides adaptive flow control for multicast methods such as Application Layer Multicast (ALM) or eXplicit multi-unicast (XCAST). SICC is a NAK based protocol and is designed to be extensible to adapt to various codecs, able to handle variable length of application data units (ADU) and to notify availability of ADU at the receiver for real-time streaming. We have implemented SICC in both user space on NetBSD and kernel space on Linux 2.6.10, and have used these implementations to evaluate TCP fairness. The results show the fairly shared bandwidth with 128 competing TCP flows with 1ms timer accuracy in various RTT. We also verified the applicability to small appliance by implementing SICC/XCAST6 on a prototype network camera and evaluated SICC in a field experiment.
{"title":"Design and Implementation of Sender Initiated Congestion Control","authors":"Eiichi Muramoto, T. Yoneda, Kazunobu Konishi","doi":"10.1109/CCNC.2007.223","DOIUrl":"https://doi.org/10.1109/CCNC.2007.223","url":null,"abstract":"This paper reports the design and implementation of a multicast transport-layer protocol called Sender Initiated Congestion Control (SICC) which provides adaptive flow control for multicast methods such as Application Layer Multicast (ALM) or eXplicit multi-unicast (XCAST). SICC is a NAK based protocol and is designed to be extensible to adapt to various codecs, able to handle variable length of application data units (ADU) and to notify availability of ADU at the receiver for real-time streaming. We have implemented SICC in both user space on NetBSD and kernel space on Linux 2.6.10, and have used these implementations to evaluate TCP fairness. The results show the fairly shared bandwidth with 128 competing TCP flows with 1ms timer accuracy in various RTT. We also verified the applicability to small appliance by implementing SICC/XCAST6 on a prototype network camera and evaluated SICC in a field experiment.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"22 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":"131980909","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}
Telemedicine is not medicine but to use computing and communications to delivery access to high-quality medical care regardless of locations. It reduces cost, time, and resources and it saves lives. Furthermore, wireless technologies play significant roles in telemedicine, and therefore, it is called wireless telemedicine or mobile-heath. This paper provides a short survey on wireless telemedicine and mobile-heath, and introduces wireless technologies for wireless telemedicine. Keywords-Telemedicine, Wireless, E-heath, RFID, WLAN, WPAN, 3G/4G
{"title":"Wireless Telemedicine and M-Heath","authors":"Yang Xiao, Fei Hu","doi":"10.1109/CCNC.2007.148","DOIUrl":"https://doi.org/10.1109/CCNC.2007.148","url":null,"abstract":"Telemedicine is not medicine but to use computing and communications to delivery access to high-quality medical care regardless of locations. It reduces cost, time, and resources and it saves lives. Furthermore, wireless technologies play significant roles in telemedicine, and therefore, it is called wireless telemedicine or mobile-heath. This paper provides a short survey on wireless telemedicine and mobile-heath, and introduces wireless technologies for wireless telemedicine. Keywords-Telemedicine, Wireless, E-heath, RFID, WLAN, WPAN, 3G/4G","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"22 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":"126501438","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}
other flexible rights language is often a difficult task, due to the flexibility of the language and the lack of formal semantics. An efficient way to manage this complexity is to translate the license into a set of clearly defined knowledge predicate, and process this knowledge via inference rules using an expert system. This improves computational efficiency and allows authorization request to be verified against a large number of licenses without dependency issues. I. INTRODUCTION ith the increased proliferation of digital information and media, especially in the field of on-line sales of digital media, brings about a change in the business model of sales of information. In order to support more creative business models, which was not possible before, a method in which rights and transactions can be described with greater flexibility is required. Through an intensive standardization process, the Rights Expression Language (REL) [1] from MPEG-21 [2], strives to define a flexible and extensible description language, which can be used to describe generic rights model between different parties. Digital Rights Management (DRM) systems use rights expression languages together with cryptographic algorithms to protect and manage digital contents. A more flexible or expressive rights expression language, which can closely model the rights exchange between consumers and content providers, would brings about greater convenience for users and improve the user experience. This would be crucial to the acceptance of DRM systems, as DRM becomes a convenient means of exchange of digital information, without placing unnecessary restrictions on the user. However, with the increased flexibility, brings about greater complexity in analyzing and interpreting licenses. Thus, this paper proposes an efficient design for a license interpretation engine, based on an expert system architecture. Part II of this paper describes the implementation of this expert system based license interpreter. Section A shows the
{"title":"Efficient Design of Interpretation of REL License Using Expert Systems","authors":"Chun Hui Suen","doi":"10.1109/CCNC.2007.214","DOIUrl":"https://doi.org/10.1109/CCNC.2007.214","url":null,"abstract":"other flexible rights language is often a difficult task, due to the flexibility of the language and the lack of formal semantics. An efficient way to manage this complexity is to translate the license into a set of clearly defined knowledge predicate, and process this knowledge via inference rules using an expert system. This improves computational efficiency and allows authorization request to be verified against a large number of licenses without dependency issues. I. INTRODUCTION ith the increased proliferation of digital information and media, especially in the field of on-line sales of digital media, brings about a change in the business model of sales of information. In order to support more creative business models, which was not possible before, a method in which rights and transactions can be described with greater flexibility is required. Through an intensive standardization process, the Rights Expression Language (REL) [1] from MPEG-21 [2], strives to define a flexible and extensible description language, which can be used to describe generic rights model between different parties. Digital Rights Management (DRM) systems use rights expression languages together with cryptographic algorithms to protect and manage digital contents. A more flexible or expressive rights expression language, which can closely model the rights exchange between consumers and content providers, would brings about greater convenience for users and improve the user experience. This would be crucial to the acceptance of DRM systems, as DRM becomes a convenient means of exchange of digital information, without placing unnecessary restrictions on the user. However, with the increased flexibility, brings about greater complexity in analyzing and interpreting licenses. Thus, this paper proposes an efficient design for a license interpretation engine, based on an expert system architecture. Part II of this paper describes the implementation of this expert system based license interpreter. Section A shows the","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":"126518409","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 usage of mobile phones has rapidly increased in the recent years. As the result of this, many companies have appeared at the markets that propose various services for mobile communication. Therefore, the customer's choice of the telephone provider depends both on the cost policy and the proposed services of the companies. In our work, innovative services for providers are introduced. They implement both centralized and decentralized control of mobile phones by having access to the kernel of the operating system running on the mobile phone. The delivery of multimedia contents to the mobile device can be done using one of the following options: direct communication between two mobile phones or indirect communication between two mobile phones via a server providing the multimedia content. This leads to an IP-based distributed multimedia mobile system in local and global areas. Our research in this field shows that mobile devices are comparable to any computer in the network that gives opportunity to download multimedia information. Our demonstration with client and server software will show the functional features of the developed system.
{"title":"Media-Push Technology in Multimedia Mobile Environment","authors":"Pavlo Krasovs'ky, M. Debes, J. Seitz","doi":"10.1109/CCNC.2007.243","DOIUrl":"https://doi.org/10.1109/CCNC.2007.243","url":null,"abstract":"The usage of mobile phones has rapidly increased in the recent years. As the result of this, many companies have appeared at the markets that propose various services for mobile communication. Therefore, the customer's choice of the telephone provider depends both on the cost policy and the proposed services of the companies. In our work, innovative services for providers are introduced. They implement both centralized and decentralized control of mobile phones by having access to the kernel of the operating system running on the mobile phone. The delivery of multimedia contents to the mobile device can be done using one of the following options: direct communication between two mobile phones or indirect communication between two mobile phones via a server providing the multimedia content. This leads to an IP-based distributed multimedia mobile system in local and global areas. Our research in this field shows that mobile devices are comparable to any computer in the network that gives opportunity to download multimedia information. Our demonstration with client and server software will show the functional features of the developed system.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"16 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":"116638097","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
扫码关注我们
求助内容：
应助结果提醒方式：