Pub Date : 2014-10-01DOI: 10.1109/ComComAp.2014.7017182
Shaobo Wu, J. Niu, Long Cheng, Wusheng Chou
Flooding tree construction has been widely investigated. However, these existing flooding trees normally could not achieve low latency and high energy efficiency at the same time which is critical to data transmission, especially in low-duty-cycle WSNs with unreliable wireless links. In this work, we propose an efficient local energy optimization algorithm (LEOA) for minimum-delay flooding tree in synchronous low-duty-cycle WSNs. Through adjusting the tree structure locally, LEOA can reduce energy consumption while not increasing flooding delay. Our design fully utilizes the broadcast nature of wireless networks, with considering the unreliability of wireless links. Extensive simulation results indicate that LEOA outperforms state-of-the-art methods in terms of flooding delay and energy efficiency.
{"title":"Energy efficient flooding under minimum delay constraint in synchronous low-duty-cycle wireless sensor networks","authors":"Shaobo Wu, J. Niu, Long Cheng, Wusheng Chou","doi":"10.1109/ComComAp.2014.7017182","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017182","url":null,"abstract":"Flooding tree construction has been widely investigated. However, these existing flooding trees normally could not achieve low latency and high energy efficiency at the same time which is critical to data transmission, especially in low-duty-cycle WSNs with unreliable wireless links. In this work, we propose an efficient local energy optimization algorithm (LEOA) for minimum-delay flooding tree in synchronous low-duty-cycle WSNs. Through adjusting the tree structure locally, LEOA can reduce energy consumption while not increasing flooding delay. Our design fully utilizes the broadcast nature of wireless networks, with considering the unreliability of wireless links. Extensive simulation results indicate that LEOA outperforms state-of-the-art methods in terms of flooding delay and energy efficiency.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125352672","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017205
Di Li, J. Niu, Meikang Qiu, Meiqin Liu
With the development of the Internet, people share their emotion statuses or attitudes on online social websites, leading to an explosive rise on the scale of data. Mining sentiment information behind these data helps people know about public opinions and social trends. In this paper a sentiment analysis algorithm adapting to Weibo (Microblog) data is proposed. Given that a Weibo post is usually short, LDA model is used to generate text features based on semantic information instead of text structure. To decide the sentiment polar and degree, SVR model is used here. Experiment shows the algorithm performs well on Weibo data.
{"title":"Sentiment analysis on Weibo data","authors":"Di Li, J. Niu, Meikang Qiu, Meiqin Liu","doi":"10.1109/ComComAp.2014.7017205","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017205","url":null,"abstract":"With the development of the Internet, people share their emotion statuses or attitudes on online social websites, leading to an explosive rise on the scale of data. Mining sentiment information behind these data helps people know about public opinions and social trends. In this paper a sentiment analysis algorithm adapting to Weibo (Microblog) data is proposed. Given that a Weibo post is usually short, LDA model is used to generate text features based on semantic information instead of text structure. To decide the sentiment polar and degree, SVR model is used here. Experiment shows the algorithm performs well on Weibo data.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122374369","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017165
M. Sun, Hai Wei
With the development of electronic commerce, traditional e-business has gradually changed. Enterprises pay more attention to meet the personalized needs of consumers. Being an all new e-business model, B2M is marketing-oriented. B2M solutions based on RFID are more suitable for the special medical enterprise. Not only do website promotion and shopping guide proceed through online and offline, but also the safety of medicine and medical equipment can be traceable in time. Data and business sharing between different departments can be achieved, and good economic and social benefits can be gained by enterprises. The implementation of B2M platform finally has been a triple-win situation for pharmaceutical enterprises, consumers and Pharmaceutical Administration.
{"title":"Study on B2M integrated information service platform combined with RFID technology in Medicine circulation field","authors":"M. Sun, Hai Wei","doi":"10.1109/ComComAp.2014.7017165","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017165","url":null,"abstract":"With the development of electronic commerce, traditional e-business has gradually changed. Enterprises pay more attention to meet the personalized needs of consumers. Being an all new e-business model, B2M is marketing-oriented. B2M solutions based on RFID are more suitable for the special medical enterprise. Not only do website promotion and shopping guide proceed through online and offline, but also the safety of medicine and medical equipment can be traceable in time. Data and business sharing between different departments can be achieved, and good economic and social benefits can be gained by enterprises. The implementation of B2M platform finally has been a triple-win situation for pharmaceutical enterprises, consumers and Pharmaceutical Administration.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130572020","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017195
Yang Yang, Nannan Cheng
This paper proposed a vehicle anti-collision protocol using on highways, This protocol is based on broadcast mechanism, and vehicles could broadcast the warning messages to all adjacent nodes in the network as fast as possible. Once the adjacent nodes received the broadcasting warning messages, they will forward the messages to the next hop nodes and the previous node will recognized it as the acknowledgment to ensure the reliability. Simulation results show that the protocol is effective and reliable, and can be used for the accident alert on the highway.
{"title":"A highway vehicle anti-collision protocol based on broadcasting feedback mechanism","authors":"Yang Yang, Nannan Cheng","doi":"10.1109/ComComAp.2014.7017195","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017195","url":null,"abstract":"This paper proposed a vehicle anti-collision protocol using on highways, This protocol is based on broadcast mechanism, and vehicles could broadcast the warning messages to all adjacent nodes in the network as fast as possible. Once the adjacent nodes received the broadcasting warning messages, they will forward the messages to the next hop nodes and the previous node will recognized it as the acknowledgment to ensure the reliability. Simulation results show that the protocol is effective and reliable, and can be used for the accident alert on the highway.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125757408","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017190
Zhengping Li, Didi Zhang, Jin Ren, Changliu Niu, J. Zhao, Baotong An, Yihua Meng
In multiple hops network, there would be competition among the Peer to Peer (P2P) links when the amount of the P2P links was large. This paper proposed a novel dynamic channel allocation (DCA) algorithm based on ant colony intelligence (ACI) to solve the problem of multi-hop network competition among the P2P links. Theory analysis showed than the shorter of the average length of the routes of the P2P services, the higher of the system throughput. By offering the P2P services with short length of route high priority to access the channels, the proposed algorithm could improve the network throughput and guarantee the Quality of Service (QoS) of P2P service in the network. Theoretical and simulation results showed that the proposed algorithm could effectively enhance both the overall throughput of the network, and the channel utilization rate. At the same time, the QoS of network also had a lot of improvement.
{"title":"Improved dynamic channel allocation algorithm based on ant colony intelligence for P2P service","authors":"Zhengping Li, Didi Zhang, Jin Ren, Changliu Niu, J. Zhao, Baotong An, Yihua Meng","doi":"10.1109/ComComAp.2014.7017190","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017190","url":null,"abstract":"In multiple hops network, there would be competition among the Peer to Peer (P2P) links when the amount of the P2P links was large. This paper proposed a novel dynamic channel allocation (DCA) algorithm based on ant colony intelligence (ACI) to solve the problem of multi-hop network competition among the P2P links. Theory analysis showed than the shorter of the average length of the routes of the P2P services, the higher of the system throughput. By offering the P2P services with short length of route high priority to access the channels, the proposed algorithm could improve the network throughput and guarantee the Quality of Service (QoS) of P2P service in the network. Theoretical and simulation results showed that the proposed algorithm could effectively enhance both the overall throughput of the network, and the channel utilization rate. At the same time, the QoS of network also had a lot of improvement.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134088082","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017175
Yan Zhang, Fengfan Yang
This paper presents Dayan sequence to construct QC-LDPC codes through the combination of mathematical theory. The paper introduces the procedure of the coding principle and coding. Dayan sequence constructed QC-LDPC codes is compared with rate compatible QC-LDPC, Simulation results show that the bit error rate (BER)performance of Dayan sequence constructed QC-LDPC is improved by 0.5dB. Then QC-LDPC codes constructed by the Dayan sequence are used in coded cooperative communication. Compared it with PEG algorithm, array code and Mackey code,the results show that the performance of Dayan sequence is superior. That is to say that Dayan sequence code constructed QC-LDPC is effective in coded cooperative communication.
{"title":"The performance analysis of QC-LDPC codes constructed by Dayan sequence for coded cooperative relay","authors":"Yan Zhang, Fengfan Yang","doi":"10.1109/ComComAp.2014.7017175","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017175","url":null,"abstract":"This paper presents Dayan sequence to construct QC-LDPC codes through the combination of mathematical theory. The paper introduces the procedure of the coding principle and coding. Dayan sequence constructed QC-LDPC codes is compared with rate compatible QC-LDPC, Simulation results show that the bit error rate (BER)performance of Dayan sequence constructed QC-LDPC is improved by 0.5dB. Then QC-LDPC codes constructed by the Dayan sequence are used in coded cooperative communication. Compared it with PEG algorithm, array code and Mackey code,the results show that the performance of Dayan sequence is superior. That is to say that Dayan sequence code constructed QC-LDPC is effective in coded cooperative communication.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122072743","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017163
Mir Yasir Umair, K. Ramana, Dongkai Yang
With the rapid development and ubiquitous usage of Wireless Local Area Networks (WLAN), Location Based Systems (LBS) employing Signal Strength techniques have become an attractive area of research for location estimation in indoor environments. In this paper we propose a robust fingerprint method for localization based on the traditional K-Nearest Neighbor (KNN) method. Instead of considering a fixed number of neighbors, our approach uses an adaptive method to determine the optimal number of neighbors to be taken into account.. In order to prove the effectiveness of our method, we compare it with the traditional KNN approaches for a variety of number of Access Points (APs). Simulation results using Multi-Wall-Floor path loss model show that the proposed method yields an improved accuracy as compared with the traditional methods.
{"title":"An enhanced K-Nearest Neighbor algorithm for indoor positioning systems in a WLAN","authors":"Mir Yasir Umair, K. Ramana, Dongkai Yang","doi":"10.1109/ComComAp.2014.7017163","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017163","url":null,"abstract":"With the rapid development and ubiquitous usage of Wireless Local Area Networks (WLAN), Location Based Systems (LBS) employing Signal Strength techniques have become an attractive area of research for location estimation in indoor environments. In this paper we propose a robust fingerprint method for localization based on the traditional K-Nearest Neighbor (KNN) method. Instead of considering a fixed number of neighbors, our approach uses an adaptive method to determine the optimal number of neighbors to be taken into account.. In order to prove the effectiveness of our method, we compare it with the traditional KNN approaches for a variety of number of Access Points (APs). Simulation results using Multi-Wall-Floor path loss model show that the proposed method yields an improved accuracy as compared with the traditional methods.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"303 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128626116","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 : 2014-10-01DOI: 10.1109/COMCOMAP.2014.7017204
Lian Pengfei, Meng Qi, Zhang Weihong
Edge detection and segmentation of binary image are used in estimation of the number of several kinds of crop seeds. An available method of segmentation of background and foreground is proposed. To solve the problem of oversegmentation, an improved watershed algorithm to the crop seeds image with the edge information is proposed. Experiments indicate that the method not only overcomes over-segmentation, but improves the precision of segmentation. Besides, area algorithm is appended to correct count number, which improves the accuracy of count number.
{"title":"Estimation of the number of crop seeds based on image identification","authors":"Lian Pengfei, Meng Qi, Zhang Weihong","doi":"10.1109/COMCOMAP.2014.7017204","DOIUrl":"https://doi.org/10.1109/COMCOMAP.2014.7017204","url":null,"abstract":"Edge detection and segmentation of binary image are used in estimation of the number of several kinds of crop seeds. An available method of segmentation of background and foreground is proposed. To solve the problem of oversegmentation, an improved watershed algorithm to the crop seeds image with the edge information is proposed. Experiments indicate that the method not only overcomes over-segmentation, but improves the precision of segmentation. Besides, area algorithm is appended to correct count number, which improves the accuracy of count number.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130035593","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017162
Hailong Zhang, Xiao Guo, Jinyao Yan, Bo Liu, Qianjun Shuai
With the limitation of port densities in the highest-end commercial switches, topologies of data center network often take the form of a multi-rooted tree with higher-speed links. In order to achieve multipath transmission, data center uses Equal Cost Multipath (ECMP) algorithm to forward flows. ECMP algorithm is lack of dynamic scheduling mechanism. In this paper, we completed a full implementation of three scheduling algorithm in the data center network of SDN architecture. One is based on OSPF algorithm. The second is based on ECMP algorithm. In the third algorithm, we optimized the ECMP algorithm through OpenFlow protocol and made it possible to dynamically adjust the flow forwarding link according to the bandwidth utilization of core links. The evaluation results demonstrate that the third scheduling algorithm can improve performance of throughput in data center networks.
{"title":"SDN-based ECMP algorithm for data center networks","authors":"Hailong Zhang, Xiao Guo, Jinyao Yan, Bo Liu, Qianjun Shuai","doi":"10.1109/ComComAp.2014.7017162","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017162","url":null,"abstract":"With the limitation of port densities in the highest-end commercial switches, topologies of data center network often take the form of a multi-rooted tree with higher-speed links. In order to achieve multipath transmission, data center uses Equal Cost Multipath (ECMP) algorithm to forward flows. ECMP algorithm is lack of dynamic scheduling mechanism. In this paper, we completed a full implementation of three scheduling algorithm in the data center network of SDN architecture. One is based on OSPF algorithm. The second is based on ECMP algorithm. In the third algorithm, we optimized the ECMP algorithm through OpenFlow protocol and made it possible to dynamically adjust the flow forwarding link according to the bandwidth utilization of core links. The evaluation results demonstrate that the third scheduling algorithm can improve performance of throughput in data center networks.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129303164","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 : 2014-10-01DOI: 10.1109/ComComAp.2014.7017181
Yubo Deng, Wei Liu, Lei Zhang, Yongping Xiong, Yunchuan Sun
In the opportunistic networks, nodes carry and store the data and forward it until they encounter each other. How to choose an appropriate opportunity to forward data is pivotal for nodes' routing in this type of networks. Since nodes currently will keep a regular movement state in the scene of this paper discussed, forecasting a node's moving track in the near future would be very helpful. Through this way, the node can modify the forwarding strategy in time and increase the success rate of data routing. We proposed a path prediction model based on second-order Markov chain in this paper to analyze and predict node's next path choice at an intersection depending on its statistic of history tracks. Then we use the real data from Dartmouth College to verify the model and the result shows that it is more precise than normal one step Markov models and is more reasonable than some other models such as Manhattan model.
{"title":"Path prediction based on second-order Markov chain for the opportunistic networks","authors":"Yubo Deng, Wei Liu, Lei Zhang, Yongping Xiong, Yunchuan Sun","doi":"10.1109/ComComAp.2014.7017181","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017181","url":null,"abstract":"In the opportunistic networks, nodes carry and store the data and forward it until they encounter each other. How to choose an appropriate opportunity to forward data is pivotal for nodes' routing in this type of networks. Since nodes currently will keep a regular movement state in the scene of this paper discussed, forecasting a node's moving track in the near future would be very helpful. Through this way, the node can modify the forwarding strategy in time and increase the success rate of data routing. We proposed a path prediction model based on second-order Markov chain in this paper to analyze and predict node's next path choice at an intersection depending on its statistic of history tracks. Then we use the real data from Dartmouth College to verify the model and the result shows that it is more precise than normal one step Markov models and is more reasonable than some other models such as Manhattan model.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114598364","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
扫码关注我们
求助内容：
应助结果提醒方式：