Pub Date : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945454
Mohd Fazil, M. Abulaish
Twitter, a popular microblogging platform, facilitates users to express views and thoughts on any topic of discussion using short messaging texts limited to 140 characters. Due to its open and real-time information sharing and dissemination nature, it is abused by socialbots for political astroturfing, advertising, spamming, and other illicit activities. To this end, we injected an army of 98 socialbots associated to top six Twitter using countries to study socialbots’ infiltration behaviour. In this paper, we present a statistical insight derived through the analysis of the captured data by our socialbots. Socialbots’ profile features, such as age, gender, etc. and their behavioural impact on infiltration performance are studied and presented, wherein a user's following activity to a socialbot is considered as an infiltration. Experimental results and subsequent statistical analyses show that socialbots’ profiles belonging to India were the successful in duping highest number of users, whereas Indonesian socialbots were least infiltrative. Moreover, among various Twitter activities, following is found to be the most effective activity for infiltrating a user. Among the intruded users, trace of the presence of botnets, spammers, and other malicious users have also been observed and presented in this paper.
{"title":"Why a socialbot is effective in Twitter? A statistical insight","authors":"Mohd Fazil, M. Abulaish","doi":"10.1109/COMSNETS.2017.7945454","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945454","url":null,"abstract":"Twitter, a popular microblogging platform, facilitates users to express views and thoughts on any topic of discussion using short messaging texts limited to 140 characters. Due to its open and real-time information sharing and dissemination nature, it is abused by socialbots for political astroturfing, advertising, spamming, and other illicit activities. To this end, we injected an army of 98 socialbots associated to top six Twitter using countries to study socialbots’ infiltration behaviour. In this paper, we present a statistical insight derived through the analysis of the captured data by our socialbots. Socialbots’ profile features, such as age, gender, etc. and their behavioural impact on infiltration performance are studied and presented, wherein a user's following activity to a socialbot is considered as an infiltration. Experimental results and subsequent statistical analyses show that socialbots’ profiles belonging to India were the successful in duping highest number of users, whereas Indonesian socialbots were least infiltrative. Moreover, among various Twitter activities, following is found to be the most effective activity for infiltrating a user. Among the intruded users, trace of the presence of botnets, spammers, and other malicious users have also been observed and presented in this paper.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"91 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":"124674634","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945429
S. Maity, Soumik Dalal, Sayan Ranu, L. Vanajakshi
Global Positioning System (GPS) has found its application in the field of Intelligent Transportation Systems (ITS) in fleet management, prediction of arrival of public transport vehicles, route identification, route navigation, and many other location based services. Map matching algorithms integrate the positioning data received from the GPS, with digital road networks on existing maps. This includes minimizing the error in locating the vehicle on a route, identifying the correct road segment and locating the vehicle's correct position on the road network. This paper presents a weight based map matching algorithm, which can be applied in real-time, for complex urban road networks. The parameters considered in the evaluation of the candidate segments are distance, direction difference and connectivity with the previously identified segment. A comparison between these parameters for the two best road segments was analyzed to identify probable cases of ambiguity in selection of the best segment and a solution to overcome wrong assignments was included in the algorithm. The most noticeable feature about this algorithm is the high accuracy of 96.55% for segment assignment using minimum input variables of latitude and longitude of the vehicles.
{"title":"A weight-based map matching algorithm using minimum input variables for urban road networks","authors":"S. Maity, Soumik Dalal, Sayan Ranu, L. Vanajakshi","doi":"10.1109/COMSNETS.2017.7945429","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945429","url":null,"abstract":"Global Positioning System (GPS) has found its application in the field of Intelligent Transportation Systems (ITS) in fleet management, prediction of arrival of public transport vehicles, route identification, route navigation, and many other location based services. Map matching algorithms integrate the positioning data received from the GPS, with digital road networks on existing maps. This includes minimizing the error in locating the vehicle on a route, identifying the correct road segment and locating the vehicle's correct position on the road network. This paper presents a weight based map matching algorithm, which can be applied in real-time, for complex urban road networks. The parameters considered in the evaluation of the candidate segments are distance, direction difference and connectivity with the previously identified segment. A comparison between these parameters for the two best road segments was analyzed to identify probable cases of ambiguity in selection of the best segment and a solution to overcome wrong assignments was included in the algorithm. The most noticeable feature about this algorithm is the high accuracy of 96.55% for segment assignment using minimum input variables of latitude and longitude of the vehicles.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","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":"130266959","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945433
Arpita Bajpai, B. Choudhury, S. Choudhury
We propose an analytical framework for service oriented computing in Internet of Thing scenarios to derive an optimal performance from an elastic extensible cloud that can serve a request from access, edge and core network. If the number of replicas at different levels (access networks, edge networks and core networks) are maintained according to the values derived from our analysis, then the drop rate and resource utilisation improves significantly without compromising the QoS constraints of the service requests. Under this design, the service consumers devices receive the services from the nearest level of replica(if any) at minimal level of cost which is the most rational form of expectation.
{"title":"An adaptive and elastic cloud based framework for service oriented computing in Internet of Things","authors":"Arpita Bajpai, B. Choudhury, S. Choudhury","doi":"10.1109/COMSNETS.2017.7945433","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945433","url":null,"abstract":"We propose an analytical framework for service oriented computing in Internet of Thing scenarios to derive an optimal performance from an elastic extensible cloud that can serve a request from access, edge and core network. If the number of replicas at different levels (access networks, edge networks and core networks) are maintained according to the values derived from our analysis, then the drop rate and resource utilisation improves significantly without compromising the QoS constraints of the service requests. Under this design, the service consumers devices receive the services from the nearest level of replica(if any) at minimal level of cost which is the most rational form of expectation.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"2 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":"128877132","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945399
S. Yasodharan, V. Sukumaran, C. Singh
We study stability and average delay in single-source single-destination delay tolerant networks with random message arrivals. In particular, we analyze source spray-and-wait routing protocol without feedback. We obtain conditions on arrival rate under which the source queue is stable. We show that the maximum supported arrival rate is linearly proportional to the number of relays and inversely proportional to the spray-and-wait parameter. Further, we obtain an approximate expression for the average queueing delay. We show that it increases with the spray-and-wait parameter. Through simulations, we show that the average delivery delay and average end-to-end delay first decreases and then increases with the spray-and-wait parameter. We also validate our analytical findings through simulations.
{"title":"Stability and delay analysis of delay tolerant networks with random message arrivals","authors":"S. Yasodharan, V. Sukumaran, C. Singh","doi":"10.1109/COMSNETS.2017.7945399","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945399","url":null,"abstract":"We study stability and average delay in single-source single-destination delay tolerant networks with random message arrivals. In particular, we analyze source spray-and-wait routing protocol without feedback. We obtain conditions on arrival rate under which the source queue is stable. We show that the maximum supported arrival rate is linearly proportional to the number of relays and inversely proportional to the spray-and-wait parameter. Further, we obtain an approximate expression for the average queueing delay. We show that it increases with the spray-and-wait parameter. Through simulations, we show that the average delivery delay and average end-to-end delay first decreases and then increases with the spray-and-wait parameter. We also validate our analytical findings through simulations.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","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":"116732958","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945459
Rohit Verma
Bus transports in the cities of many developing countries are marred with severe problems, like information unavailability, bad road and bus conditions, lack of proper scheduling and timing, and so on. An information service can become extremely handy for the travelers in countries with emerging economy, where public traffic systems are generally riddled with uncertainty. We have developed CrowdMap an intelligent data logging module for smart-phones and a server side processing mechanism to extract road and bus route information, and to annotate them over the city map.
{"title":"CrowdMap: Crowdsourcing based city traffic map generation","authors":"Rohit Verma","doi":"10.1109/COMSNETS.2017.7945459","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945459","url":null,"abstract":"Bus transports in the cities of many developing countries are marred with severe problems, like information unavailability, bad road and bus conditions, lack of proper scheduling and timing, and so on. An information service can become extremely handy for the travelers in countries with emerging economy, where public traffic systems are generally riddled with uncertainty. We have developed CrowdMap an intelligent data logging module for smart-phones and a server side processing mechanism to extract road and bus route information, and to annotate them over the city map.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"11 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":"127707991","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945391
P. Priyesh, Subrat Kart Bharti
Energy consumption of Sensor Nodes is an important issue in Wireless Sensor Network design. Since most of the nodes are minuscule battery operated, increased energy consumption will lead to reduced life time of nodes. One of the mechanism used in WSN for reducing energy consumption is the Transmission Power Control. Transmitting at a constant / highest power level leads to energy wastage and also increases the chances of interference in the network. Hence, by controlling the transmission power, energy can be conserved. In this paper we implement a dynamic transmission power control scheme using PID feedback mechanism. We control the RSSI and LQI using PID mechanism with an aim of reducing the energy consumption without compromising link quality. Performance has been evaluated based on both simulation and experimental results. In addition, we compare it with the well known Adaptive Transmission Power Control Algorithm (ATPC).
{"title":"Dynamic transmission power control in wireless sensor networks using P-I-D feedback control technique","authors":"P. Priyesh, Subrat Kart Bharti","doi":"10.1109/COMSNETS.2017.7945391","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945391","url":null,"abstract":"Energy consumption of Sensor Nodes is an important issue in Wireless Sensor Network design. Since most of the nodes are minuscule battery operated, increased energy consumption will lead to reduced life time of nodes. One of the mechanism used in WSN for reducing energy consumption is the Transmission Power Control. Transmitting at a constant / highest power level leads to energy wastage and also increases the chances of interference in the network. Hence, by controlling the transmission power, energy can be conserved. In this paper we implement a dynamic transmission power control scheme using PID feedback mechanism. We control the RSSI and LQI using PID mechanism with an aim of reducing the energy consumption without compromising link quality. Performance has been evaluated based on both simulation and experimental results. In addition, we compare it with the well known Adaptive Transmission Power Control Algorithm (ATPC).","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"24 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":"115376936","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945460
Satadal Sengupta
Proliferation of online social networks (OSNs) has resulted in an unprecedented surge in the volume of multimedia content consumed by users on a daily basis. Popular OSNs such as Facebook enable users to view and share embedded videos and images on their feeds, which increases visibility, prompting repeated requests for the same piece of content. Maintaining desirable quality of service for all users becomes challenging in such a scenario, especially when low-bandwidth cellular network is being used for data download. Such problems have prompted the research community to focus heavily on the emerging paradigm of Information-or Content-Centric Networking (ICN/CCN), where in-network content management (e.g., content distribution, caching, etc.) forms the crux of an enhanced user experience. In this abstract, we argue that social dynamics among OSN users can provide concrete hints regarding future popularity of content. We propose a strategy to identify viewing and sharing patterns of Facebook users served by a cellular base station, by analyzing network traffic. We utilize these patterns to infer social dynamics among cellular users (mapped to cellphone numbers). We validate our strategy with proof-of-concept experiments on real data, and extensive simulations on a simulation framework proposed by us.
{"title":"Predicting social dynamics based on network traffic analysis for CCN/ICN management","authors":"Satadal Sengupta","doi":"10.1109/COMSNETS.2017.7945460","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945460","url":null,"abstract":"Proliferation of online social networks (OSNs) has resulted in an unprecedented surge in the volume of multimedia content consumed by users on a daily basis. Popular OSNs such as Facebook enable users to view and share embedded videos and images on their feeds, which increases visibility, prompting repeated requests for the same piece of content. Maintaining desirable quality of service for all users becomes challenging in such a scenario, especially when low-bandwidth cellular network is being used for data download. Such problems have prompted the research community to focus heavily on the emerging paradigm of Information-or Content-Centric Networking (ICN/CCN), where in-network content management (e.g., content distribution, caching, etc.) forms the crux of an enhanced user experience. In this abstract, we argue that social dynamics among OSN users can provide concrete hints regarding future popularity of content. We propose a strategy to identify viewing and sharing patterns of Facebook users served by a cellular base station, by analyzing network traffic. We utilize these patterns to infer social dynamics among cellular users (mapped to cellphone numbers). We validate our strategy with proof-of-concept experiments on real data, and extensive simulations on a simulation framework proposed by us.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"106 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":"123390176","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945417
M. Giri, S. Jyothi, C. Vorugunti
Online social message classification is an important task for E-Commerce companies to mine and classify the customer opinions. In this paper, we have proposed a first of its kind of an efficient message classification algorithm which is independent of tweet content and considers the set of followers who will retweet during the retweet peaks. By including the followers who will retweet during retweet peaks will get a better sampling of the followers set and reduces the computation and storage complexities drastically. Also, we have eliminated the heavy weight operations like DTW to perform the comparison task between the test vector and training vector. The preliminary experiment results authorize that the proposed system attains an accuracy of 95.96% in classification of tweet messages.
{"title":"A novel online social network (Twitter)message (Tweet)classifier based on message diffusion in the network","authors":"M. Giri, S. Jyothi, C. Vorugunti","doi":"10.1109/COMSNETS.2017.7945417","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945417","url":null,"abstract":"Online social message classification is an important task for E-Commerce companies to mine and classify the customer opinions. In this paper, we have proposed a first of its kind of an efficient message classification algorithm which is independent of tweet content and considers the set of followers who will retweet during the retweet peaks. By including the followers who will retweet during retweet peaks will get a better sampling of the followers set and reduces the computation and storage complexities drastically. Also, we have eliminated the heavy weight operations like DTW to perform the comparison task between the test vector and training vector. The preliminary experiment results authorize that the proposed system attains an accuracy of 95.96% in classification of tweet messages.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"32 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":"122683835","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945413
S. Kumar, V. Sathya, Sreenath Ramanath
Base Stations (BSs) in LTE networks face heavy traffic demand from User Equipments (UEs) for voice, online gaming, video calls, file transfers, etc., We consider a LTE Device-to-device (D2D) network where LTE UEs have primary access to the spectrum and D2D pairs have secondary access. In order to offload traffic from BS and to enhance spectral efficiency, operators can activate multiple D2D pairs within the serving BS coverage area, by reusing the same radio resources across the primary LTE UEs and different D2D pairs. However the reuse of spectrum by D2D pairs may not be sufficient to offload the entire user traffic demand in the LTE cellular network. In this context, we propose to enable more D2D secondary users in the serving cell, by utilizing neighboring BS spectrum to fairly co-exist with neighboring LTE primary users.
{"title":"Enhancing spectral efficiency in LTE-D2D networks","authors":"S. Kumar, V. Sathya, Sreenath Ramanath","doi":"10.1109/COMSNETS.2017.7945413","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945413","url":null,"abstract":"Base Stations (BSs) in LTE networks face heavy traffic demand from User Equipments (UEs) for voice, online gaming, video calls, file transfers, etc., We consider a LTE Device-to-device (D2D) network where LTE UEs have primary access to the spectrum and D2D pairs have secondary access. In order to offload traffic from BS and to enhance spectral efficiency, operators can activate multiple D2D pairs within the serving BS coverage area, by reusing the same radio resources across the primary LTE UEs and different D2D pairs. However the reuse of spectrum by D2D pairs may not be sufficient to offload the entire user traffic demand in the LTE cellular network. In this context, we propose to enable more D2D secondary users in the serving cell, by utilizing neighboring BS spectrum to fairly co-exist with neighboring LTE primary users.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"18 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":"125435291","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945440
Arindam Ghosh, Anubrata Sanyal, Amartya Chakraborty, P. K. Sharma, M. Saha, S. Nandi, Sujoy Saha
Human activity recognition is an important problem in health care, ambient-assisted living, surveillance-based security, etc. and has crucial applications in smart environment. A non-invasive, automated system for monitoring human activity using array of heterogeneous ultrasonic sensors has been proposed in this work. Ultrasonic sensors are widely used for distance measurement in many applications. In the proposed system experiments have been conducted using ten volunteers in a controlled laboratory environment. The data collection unit has two kinds of setups of ultrasonic sensors: the former with five HC-SR04 sensors, and the latter with four HC-SR04 ultrasonic sensors and an LV-MaxSonar-EZ0 sensor. The proposed method is found capable of detecting standing, sitting and falling of a person, and also the movements in different directions. Based on the collected data, we have performed classification analysis using multiple machine learning algorithms. The experimental results show 81% to 90% correct detection of different activities of the volunteers.
{"title":"On automatizing recognition of multiple human activities using ultrasonic sensor grid","authors":"Arindam Ghosh, Anubrata Sanyal, Amartya Chakraborty, P. K. Sharma, M. Saha, S. Nandi, Sujoy Saha","doi":"10.1109/COMSNETS.2017.7945440","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945440","url":null,"abstract":"Human activity recognition is an important problem in health care, ambient-assisted living, surveillance-based security, etc. and has crucial applications in smart environment. A non-invasive, automated system for monitoring human activity using array of heterogeneous ultrasonic sensors has been proposed in this work. Ultrasonic sensors are widely used for distance measurement in many applications. In the proposed system experiments have been conducted using ten volunteers in a controlled laboratory environment. The data collection unit has two kinds of setups of ultrasonic sensors: the former with five HC-SR04 sensors, and the latter with four HC-SR04 ultrasonic sensors and an LV-MaxSonar-EZ0 sensor. The proposed method is found capable of detecting standing, sitting and falling of a person, and also the movements in different directions. Based on the collected data, we have performed classification analysis using multiple machine learning algorithms. The experimental results show 81% to 90% correct detection of different activities of the volunteers.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"51 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":"121341133","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
扫码关注我们
求助内容：
应助结果提醒方式：