A novel idea presented in this paper is to deploy the Open Flow technology in wireless sensor networks that can lead to a significant achievement in Internet of things and cloud computing arena through network virtualization. Two new abstract layers namely Common platform layer and virtualization layer can be added at the top and bottom of a preset Infrastructure as a Service architecture. Our proposed IOT virtualization can be applicable in a random topology scenario which makes possible of the flow-sensors' resources to be shared, establishment of multi operational sensor networks and escalation of the reach ability under the same platform without establishing any further physical networks. Flow-sensor achieved 39% more reach ability than the typical sensors in an ideal scenario and even better results are possible from the amount of packets generation and simulation time viewpoint for larger scale networks.
{"title":"Deployment of Flow-Sensors in Internet of Things' Virtualization via OpenFlow","authors":"A. Mahmud, R. Rahmani, T. Kanter","doi":"10.1109/MUSIC.2012.41","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.41","url":null,"abstract":"A novel idea presented in this paper is to deploy the Open Flow technology in wireless sensor networks that can lead to a significant achievement in Internet of things and cloud computing arena through network virtualization. Two new abstract layers namely Common platform layer and virtualization layer can be added at the top and bottom of a preset Infrastructure as a Service architecture. Our proposed IOT virtualization can be applicable in a random topology scenario which makes possible of the flow-sensors' resources to be shared, establishment of multi operational sensor networks and escalation of the reach ability under the same platform without establishing any further physical networks. Flow-sensor achieved 39% more reach ability than the typical sensors in an ideal scenario and even better results are possible from the amount of packets generation and simulation time viewpoint for larger scale networks.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127291316","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 growing interest in utilizing short-range wireless for object positioning is compounded by the inherent GPS limitations. In order to harness the highest accuracy out of short-range positioning systems, we need to optimize the placement of Base-Stations (BS) in a given area. Hence, we need to study the impact of different influential attributes on the positioning problem as we alter the BS placement approach. In this paper we investigate different scenarios for short-range BS placement that maximize coverage and minimize the offset and strength of positioning error. Simulation results demonstrate that the optimal layout tends to be uniform placement of BSs in the area.
{"title":"Evaluation of Base Station Placement Scenarios for Mobile Node Localization","authors":"Abdul Bais, Y. Morgan","doi":"10.1109/MUSIC.2012.42","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.42","url":null,"abstract":"The growing interest in utilizing short-range wireless for object positioning is compounded by the inherent GPS limitations. In order to harness the highest accuracy out of short-range positioning systems, we need to optimize the placement of Base-Stations (BS) in a given area. Hence, we need to study the impact of different influential attributes on the positioning problem as we alter the BS placement approach. In this paper we investigate different scenarios for short-range BS placement that maximize coverage and minimize the offset and strength of positioning error. Simulation results demonstrate that the optimal layout tends to be uniform placement of BSs in the area.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130470324","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}
Recently, according to the emerging development of smart mobile phones and tablet PC, mobile e-commerce has dramatically increased due to the reason that the function of smart mobile phone and tablet PC are combined together. M-banking is thus become more convenient, effective and timely through the new mobile communication systems. In order to raise the security of M-banking, some banks adopt the one-time password (OTP) to remedy the possible M-banking stealing risk. In the past, the OTP is sent to personal mobile phone. But, currently most of the smart mobile phone can performing M-banking easily. Thus, it gains higher risk of information security due to mobile phone hacking. In order to provide a reliable and secure M-banking process without decrease the convenience concurrently, in the paper one-time password (OTP) and personal biometric have been combined with personal identification and password for verification while M-banking. As the client side initiates a request for M-banking to the server side of a bank that provides M-banking service, the server side will generate an OTP with limited period for registration the M-banking and transmit to the client side. After receiving the OTP message, the client side must verify if the OTP message is validation and provided by the desired real server side. After then, the client side will register the on-line M-banking with the OTP in the specified short period. After receiving the service request, the server side will then request the client side to capture personal biometric such as fingerprint, iris, photo, and etc. immediately for further verification with the existed data stored in the server side to prevent the M-banking embezzling. If the personal biometric has been verified as an old one, the M-banking will immediately terminated by the server side. As the verification is finally done by the server side, the client side then can perform transaction via M-banking smoothly. The proposed scheme not only can provide secure M-banking, but also can clearly define the process. Therefore, if there are any M-banking arguments occurred due to Internet hacking or mobile phone stealing for M-banking, both of the server side and client side could protect their rights and interests.
{"title":"Secure OTP and Biometric Verification Scheme for Mobile Banking","authors":"Chang-Lung Tsai, Chun-Jung Chen, Deng-Jie Zhuang","doi":"10.1109/MUSIC.2012.31","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.31","url":null,"abstract":"Recently, according to the emerging development of smart mobile phones and tablet PC, mobile e-commerce has dramatically increased due to the reason that the function of smart mobile phone and tablet PC are combined together. M-banking is thus become more convenient, effective and timely through the new mobile communication systems. In order to raise the security of M-banking, some banks adopt the one-time password (OTP) to remedy the possible M-banking stealing risk. In the past, the OTP is sent to personal mobile phone. But, currently most of the smart mobile phone can performing M-banking easily. Thus, it gains higher risk of information security due to mobile phone hacking. In order to provide a reliable and secure M-banking process without decrease the convenience concurrently, in the paper one-time password (OTP) and personal biometric have been combined with personal identification and password for verification while M-banking. As the client side initiates a request for M-banking to the server side of a bank that provides M-banking service, the server side will generate an OTP with limited period for registration the M-banking and transmit to the client side. After receiving the OTP message, the client side must verify if the OTP message is validation and provided by the desired real server side. After then, the client side will register the on-line M-banking with the OTP in the specified short period. After receiving the service request, the server side will then request the client side to capture personal biometric such as fingerprint, iris, photo, and etc. immediately for further verification with the existed data stored in the server side to prevent the M-banking embezzling. If the personal biometric has been verified as an old one, the M-banking will immediately terminated by the server side. As the verification is finally done by the server side, the client side then can perform transaction via M-banking smoothly. The proposed scheme not only can provide secure M-banking, but also can clearly define the process. Therefore, if there are any M-banking arguments occurred due to Internet hacking or mobile phone stealing for M-banking, both of the server side and client side could protect their rights and interests.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123348897","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}
Because of the lack of infrastructure in mobile ad hoc networks (MANETs), their proper functioning must rely on co-operations among mobile nodes. However, mobile nodes tend to save their own resources and might be reluctant to forward packets for other nodes. In this paper, we address the charging and accounting problems in MANETs. We develop a theoretical game model that offer advice to a central authority about the allocation of resources for monitoring mobile nodes. The solution provides the optimal monitoring probability, which discourages nodes from cheating because the gain would be compensated by the penalty. The solution is then extended to accommodate realistic assumptions such as finite punishments and imperfect monitoring. The efficiency and usefulness of the deployment of monitoring mobile agents were confirmed by simulation results.
{"title":"A Node Control Model for the Charging and Accounting Problem in MANETs","authors":"Inna Kofman, U. T. Nguyen, Hoang Lan Nguyen","doi":"10.1109/MUSIC.2012.40","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.40","url":null,"abstract":"Because of the lack of infrastructure in mobile ad hoc networks (MANETs), their proper functioning must rely on co-operations among mobile nodes. However, mobile nodes tend to save their own resources and might be reluctant to forward packets for other nodes. In this paper, we address the charging and accounting problems in MANETs. We develop a theoretical game model that offer advice to a central authority about the allocation of resources for monitoring mobile nodes. The solution provides the optimal monitoring probability, which discourages nodes from cheating because the gain would be compensated by the penalty. The solution is then extended to accommodate realistic assumptions such as finite punishments and imperfect monitoring. The efficiency and usefulness of the deployment of monitoring mobile agents were confirmed by simulation results.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116498389","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}
Wireless mesh networks are at the forefront of the technological drive. Achieving high system throughput in these networks is challenging due to interference which limits concurrent transmissions. In this paper we study routing and link scheduling in time division multiple access networks free of contention. We extend the work in the literature in several ways: (a) we present simple joint routing and time slot scheduling algorithms that have outperformed the existing proposals in most of our experiments, (b) we report the results using a simple combinatorial bound on the optimal routing/scheduling solution which gives us an absolute measure of the quality of the routes, (c) we depart from the classical routing tree approach by constructing session based routes for data and we quantify the performance gains for this approach to justify its use when QoS constraints are considered. We perform extensive experiments to evaluate our model. Results from the experiments indicate that our model outperforms most of the known approaches in the literature.
{"title":"Towards Global Connectivity by Joint Routing and Scheduling in Wireless Mesh Networks","authors":"Stephen Atambire Nsoh, R. Benkoczi","doi":"10.1109/MUSIC.2012.44","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.44","url":null,"abstract":"Wireless mesh networks are at the forefront of the technological drive. Achieving high system throughput in these networks is challenging due to interference which limits concurrent transmissions. In this paper we study routing and link scheduling in time division multiple access networks free of contention. We extend the work in the literature in several ways: (a) we present simple joint routing and time slot scheduling algorithms that have outperformed the existing proposals in most of our experiments, (b) we report the results using a simple combinatorial bound on the optimal routing/scheduling solution which gives us an absolute measure of the quality of the routes, (c) we depart from the classical routing tree approach by constructing session based routes for data and we quantify the performance gains for this approach to justify its use when QoS constraints are considered. We perform extensive experiments to evaluate our model. Results from the experiments indicate that our model outperforms most of the known approaches in the literature.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129343097","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}
Jin-Yao Wang, Yu-Lun Chang, Wei-Sheng Zeng, Shian-Hua Lin
As the rapid development of smart phones and applications, users are familiar to take photos with smart phones on the trip and share photos to friends on social networks. Those photos are usually tagged and shared with trivial location information, such as attractions derived from mobile locations contributed from Facebook users. However, these attractions are not useful for enhancing the photo semantics. In this paper, we propose the Tag Recommendation System (TRS) that automatically mine significant tags from Flickr's photos so that these tags can be recommended to improve the semantics of photos according to location information. Experiments based on the user experience show that TRS can achieve about 85% satisfaction rates.
{"title":"Recommend Significant Tags to Travel Photos Based on Web Mining","authors":"Jin-Yao Wang, Yu-Lun Chang, Wei-Sheng Zeng, Shian-Hua Lin","doi":"10.1109/MUSIC.2012.22","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.22","url":null,"abstract":"As the rapid development of smart phones and applications, users are familiar to take photos with smart phones on the trip and share photos to friends on social networks. Those photos are usually tagged and shared with trivial location information, such as attractions derived from mobile locations contributed from Facebook users. However, these attractions are not useful for enhancing the photo semantics. In this paper, we propose the Tag Recommendation System (TRS) that automatically mine significant tags from Flickr's photos so that these tags can be recommended to improve the semantics of photos according to location information. Experiments based on the user experience show that TRS can achieve about 85% satisfaction rates.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127968633","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 presents an architecture proposal for mobile services. It covers server-side and terminal-side components for the easy creation, provision and consumption of mobile services. The intrinsic characteristics of mobile services are reflected in this approach. Especially the role of the power user, that not only consumes mobile services but also modifies them or creates services of his own, is in the focus of this design. The paper concludes with a proof-of-concept that has been carried out in a European research project.
{"title":"An Architecture Proposal for User-Generated Mobile Services","authors":"Dirk Werth, Andreas Emrich, Alexandra Chapko","doi":"10.1109/MUSIC.2012.32","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.32","url":null,"abstract":"This paper presents an architecture proposal for mobile services. It covers server-side and terminal-side components for the easy creation, provision and consumption of mobile services. The intrinsic characteristics of mobile services are reflected in this approach. Especially the role of the power user, that not only consumes mobile services but also modifies them or creates services of his own, is in the focus of this design. The paper concludes with a proof-of-concept that has been carried out in a European research project.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"46 20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125671664","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}
We propose and study a network design problem whose goal is to ensure Internet reach ability to mobile wireless devices. Such design of networks is a resource location allocation problem related to minimum cost unsplitable flow in a tripartite network. We present IP formulation for the problem, and produce test results with ILOG CPLEX. We also present heuristic algorithms using local search and VNS based procedures. We test the algorithms with different randomly generated network instances from size 500 - 5000 nodes. Our algorithms could obtain optimal solution for some of the input instances, beat the solutions obtained by CPLEX for some others, and obtained a worst case integrality gap of 3% for the rest.
{"title":"Mesh Network Deployment to Ensure Global Reachability","authors":"S. Khaled, R. Benkoczi, Y. Chen","doi":"10.1109/MUSIC.2012.43","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.43","url":null,"abstract":"We propose and study a network design problem whose goal is to ensure Internet reach ability to mobile wireless devices. Such design of networks is a resource location allocation problem related to minimum cost unsplitable flow in a tripartite network. We present IP formulation for the problem, and produce test results with ILOG CPLEX. We also present heuristic algorithms using local search and VNS based procedures. We test the algorithms with different randomly generated network instances from size 500 - 5000 nodes. Our algorithms could obtain optimal solution for some of the input instances, beat the solutions obtained by CPLEX for some others, and obtained a worst case integrality gap of 3% for the rest.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133761663","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}
We present techniques for target identification using resonance-region, multifrequency radar sensor networks. The majority-vote (MV) and sum-distance (SD) nearest-neighbor (NN) algorithms are used. The NN reference set initially contains samples of target features over the possible ranges of target aspect angles. We use a data condensation rule to condense the initial reference set. Simulation results show that the identification error probabilities can be significantly lowered by 1. increasing the number of radar sensors, 2. increasing the number of frequencies, 3. using the complex features instead of the amplitude ones, 4. using the SD algorithm instead of the MV one.
{"title":"Target Identification Using Multifrequency Radar Sensor Networks","authors":"Jen-Shiun Chen","doi":"10.1109/MUSIC.2012.36","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.36","url":null,"abstract":"We present techniques for target identification using resonance-region, multifrequency radar sensor networks. The majority-vote (MV) and sum-distance (SD) nearest-neighbor (NN) algorithms are used. The NN reference set initially contains samples of target features over the possible ranges of target aspect angles. We use a data condensation rule to condense the initial reference set. Simulation results show that the identification error probabilities can be significantly lowered by 1. increasing the number of radar sensors, 2. increasing the number of frequencies, 3. using the complex features instead of the amplitude ones, 4. using the SD algorithm instead of the MV one.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128336524","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}
Kee-Sung Lee, Myung-Duk Hong, Jin-Guk Jung, Geun-Sik Jo
With the emergence of the Smart phone, people can use Online Social Network Services ubiquitously, leading to a significant increase of the number of participants in online social networks. Under these circumstances, online users will require an intelligent and intuitive social relationship management system such as the ontology-driven browsing method. In this paper, to build a user-centered semantic social network and to represent entities and relationships with ontology to improve retrieval performance of the semantic social network, we will design our ontology extended from FOAF, RELATIONSHIP and propose a new method to compute closeness among friends using resources on social networks. Furthermore, we evaluate our ontology-driven browsing on via implementing a prototype system.
{"title":"Building a Semantic Social Network Based on Interpersonal Relationships","authors":"Kee-Sung Lee, Myung-Duk Hong, Jin-Guk Jung, Geun-Sik Jo","doi":"10.1109/MUSIC.2012.23","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.23","url":null,"abstract":"With the emergence of the Smart phone, people can use Online Social Network Services ubiquitously, leading to a significant increase of the number of participants in online social networks. Under these circumstances, online users will require an intelligent and intuitive social relationship management system such as the ontology-driven browsing method. In this paper, to build a user-centered semantic social network and to represent entities and relationships with ontology to improve retrieval performance of the semantic social network, we will design our ontology extended from FOAF, RELATIONSHIP and propose a new method to compute closeness among friends using resources on social networks. Furthermore, we evaluate our ontology-driven browsing on via implementing a prototype system.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123098015","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
扫码关注我们
求助内容：
应助结果提醒方式：