2016 8th International Conference on Communication Systems and Networks (COMSNETS)最新文献

{"title":"Memory efficient deep packet inspection using transition functions","authors":"K. V. Lakshmi","doi":"10.1109/COMSNETS.2016.7440011","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440011","url":null,"abstract":"Regular expression matching is the state of the art in signature based intrusion detection systems. A regular expression matching algorithm used in intrusion detection systems is expected to process data at a speed linear in size of the incoming data and also to be able to run on network devices with limited memory. Traditional DFA and NFA based algorithms fail to meet either of these two requirements. The existing techniques try to either modify a DFA or a NFA, or combine both these to find a trade off between speed and memory requirements. The idea we propose in this paper is orthogonal to existing techniques. We propose a new approach to store a finite automaton in memory which otherwise is stored as a transition table. Our approach can be used by existing algorithms to further reduce the memory requirements with a minimal increase in the processing speed.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121097898","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}

{"title":"MYO Armband for physiotherapy healthcare: A case study using gesture recognition application","authors":"Mithileysh Sathiyanarayanan, S. Rajan","doi":"10.1109/COMSNETS.2016.7439933","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439933","url":null,"abstract":"As there is a need for innovative and new medical technologies in the healthcare, we identified Thalmic's “MYO Armband”, which is used for gaming systems and controlling applications in mobiles and computers. We can exploit this development in the field of medicine and healthcare to improve public health care system. So, we spotted “MYO diagnostics”, a computer-based application developed by Thalmic labs to understand Electromyography (EMG) lines (graphs), bits of vector data, and electrical signals of our complicated biology inside our arm. The human gestures will allow to gather huge amount of data and series of EMG lines which can be analysed to detect medical abnormalities and hand movements. This application has powerful algorithms which are translated into commands to recognise human hand gestures. The effect of doctors experience on user satisfaction metrics in using MYO armband can be measured in terms of effectiveness, efficiency and satisfaction which are based on the metrics-task completion, error counts, task times and satisfaction scores. In this paper, we considered only satisfaction metrics using a widely used System Usability Scale (SUS) questionnaire model to study the usability on the twenty-four medical students of the Brighton and Sussex Medical School. This helps in providing guidelines about the use of MYO armband for physiotherapy analysis by the doctors and patients. Another questionnaire with a focus on ergonomic (human factors) issues related to the use of the device such as social acceptability, ease of use and ease of learning, comfort and stress, attempted to discover characteristics of hand gestures using MYO. The results of this study can be used in a way to support the development of interactive physiotherapy analysis by individuals using MYO and hand gesture applications at their home for self-examination. Also, the relationship and correlation between the signals received will lead to a better understanding of the whole myocardium system and assist doctors in early diagnosis.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130655966","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}

{"title":"A new technique to find candidate links for map matching for transportation applications","authors":"Prashant Kumar, R. Ganti, G. Raina","doi":"10.1109/COMSNETS.2016.7439965","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439965","url":null,"abstract":"Algorithms for map matching are important for numerous transport applications. Typically, the first step in the development of such algorithms one needs techniques for finding candidate road segments. Most proposals for finding candidate road segments are either computationally very intensive, or not very precise, which puts additional burden on the rest of the algorithm. In this paper, we propose a new quantity called an Alignment Quotient (AQ) to find road segments in close proximity to a GPS data point. We also propose an algorithm that employs the AQ to find candidate road segments, and we conduct a preliminary analysis for the same.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115255207","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}

{"title":"Multi-constrained reliable multicast routing protocol for MANETs","authors":"Sujata V. Mallapur, S. Patil, Jayashree Agarkhed","doi":"10.1109/COMSNETS.2016.7439967","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439967","url":null,"abstract":"Mobile ad hoc network (MANET) is a distributed wireless network with highly dynamic topology. So, the nodes keep moving in and out of the network instantly and a path formed between two distant nodes through several intermediate nodes cannot be maintained for long duration of time. But, the availability of the link between any two nodes can be predicted up to the certain extent based on specific constraints such as the available bandwidth, available power and delay etc. Even then the guaranteed data delivery through the path cannot be made. Therefore, reliable multicast routing in MANET is very challenging problem. This paper proposed a multi-constrained reliable multicast routing protocol (MRMRP) using network coding. This technique initially builds the stable path between the desired distant for data transmission and then uses network coding for recovery of any packet that is lost during data transmission. We demonstrate through simulation results, that the proposed scheme shows its better performance compared to other methods. The simulation results show that the MRMRP increases the packet delivery ratio by reducing the packet drop ratio and control overhead as compared to multicast ad hoc on demand routing protocol (MAODV) and dynamic general coding Scheme (DGC).","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126186061","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}

{"title":"End-to-end reliability- and delay-aware scheduling with slot sharing for wireless sensor networks","authors":"Masafumi Hashimoto, N. Wakamiya, M. Murata, Yasutaka Kawamoto, K. Fukui","doi":"10.1109/COMSNETS.2016.7439984","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439984","url":null,"abstract":"Applications that require the stringent reliability with delay constraint such as industrial process automation and patient monitoring have been emerged as new area of applications of wireless sensor networks (WSNs). This paper presents a per-flow reliability- and delay-aware scheduling algorithm for industrial WSNs. The proposed method adds time slots for retransmission to each link in order to satisfy required reliability. Furthermore, by sharing retransmission slots among different flows, the proposed method achieves the required reliability and forwarding delay while suppressing increase in the number of allocated slots. Through simulation-based evaluations, we show that the proposed method can reduce the number of slots allocated to neighbor links of a sink by up to 70% compared with conventional methods, which contributes to shorten the slotframe size, while satisfying the requirements of end-to-end reliability and forwarding delay.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126027382","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}

{"title":"Three challenges in cyber-physical systems","authors":"R. Mangharam, Houssam Abbas, Madhur Behl, Kuk Jin Jang, M. Pajic, Zhihao Jiang","doi":"10.1109/COMSNETS.2016.7440015","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440015","url":null,"abstract":"The tight coupling of computation, communication and control with physical systems such as actuation of closed-loop medical devices within the human body, peak power minimization by coordination of controllers across large industrial plants, and fast life-critical decision making by autonomous vehicles, present a set of fundamental and unique challenges. Each of these require new approaches at the intersection of multiple scientific, human and systems disciplines. We discuss five such challenges which require creative insights and application of model-based design, control systems, scheduling theory, formal methods, statistical machine learning and domain-specific experimentation. We ask the following questions: (1) An autonomous medical device is implanted to control your heart over a period of 5-7 years. How do you guarantee the software in the device provides safe and effective treatment under all physiological conditions? (2) Electricity prices in the US have summer peaks that are over 32× their average prices and winter peaks that are 86×. How can buildings respond to massive swings in energy prices at fast time scales? (3) While wireless has been successfully used for open-loop monitoring and tracking, how can we operate closed-loop control systems over a network of wireless controllers. Furthermore, how can we ensure robust, optimal and secure control in the presence of node/link failures and topology changes?","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126749811","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}

{"title":"A probabilistic approach for filtering out spam reports in a vehicular participatory sensing system","authors":"Nirnay Ghosh, R. P. Barnwal, S. Ghosh, Sajal K. Das","doi":"10.1109/COMSNETS.2016.7439932","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439932","url":null,"abstract":"Participatory sensing (PS) is an emerging socio-technological paradigm by which citizens voluntarily participate and contribute to a distributed information management system using applications installed in their hand-held devices. However, a common problem in participatory sensing is that some users generate spam (false) reports to increase their degree of participation to maliciously gain undue incentives. Such spam reports make the usage of the PS system unreliable and vulnerable to illusion attacks. This work proposes a novel approach to make PS applications authentic by identifying and filtering out spam reports through automated confidence assignment based on a probabilistic model. Waze traffic alerts have been used to validate the proposed report filtering mechanism. Results have been found to be satisfactory and useful in enhancing reliability of the PS system.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124150880","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}

{"title":"Best-effort delivery of emergency messages in post-disaster scenario with content-based filtering and Priority-enhanced PRoPHET over DTN","authors":"S. Bhattacharjee, Souvik Basu, Siuli Roy, S. Bit","doi":"10.1109/COMSNETS.2016.7439936","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439936","url":null,"abstract":"Despite concerted efforts for relaying crucial situational information, disaster relief volunteers experience significant communication challenges owing to failures of critical infrastructure and longstanding power outages in disaster affected areas. Researchers have proposed the use of smartphones, working in delay tolerant (DTN) mode, for setting up a peer-to-peer network enabling post disaster communication. However, due to opportunistic contacts, intermittent connectivity and constrained resources (mainly battery) of mobile devices, not all messages get forwarded in such a network. As a result, several crucial messages, waiting in the buffer may get dropped and unimportant, extraneous (sentimental comments of victims, etc.) messages may get transmitted at the cost of expensive network resources. Therefore, filtering out such irrelevant messages (containing unrelated information and emotional expressions) and prioritizing relevant messages according to its importance becomes crucial so that messages which are critical for decision making receive the highest priority and get disseminated in the network at the minimum possible time. In this paper, our objective is to ensure best-effort delivery of emergency messages using a two-step approach, (i) segregation of high priority messages through natural language processing based filtering and (ii) dissemination of filtered messages over DTN using a Priority-enhanced PRoPHET routing protocol which is developed by adapting the popular PRoPHET routing protocol. The protocol successfully achieves on-the-fly message prioritization and ensures best effort delivery of such prioritized messages to their appropriate destinations. The proposed protocol is evaluated using the ONE simulator. Simulation results suggest that our protocol outperforms other well known DTN routing protocols like PRoPHET, Spray-And-Wait, MaxProp and Epidemic in terms of delivery ratio of prioritized messages and overhead ratio.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126469091","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}

{"title":"Dynamics of urban traffic congestion: A kinetic Monte Carlo approach to simulating collective vehicular dynamics","authors":"N. AbdulMajith, S. Sinha","doi":"10.1109/COMSNETS.2016.7439986","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439986","url":null,"abstract":"Transitions observed in the dynamical patterns of vehicular traffic, for instance, as a result of changes in traffic density, form an important class of phenomena that is sought to be explained by large-scale modeling using many interacting agents. While the dynamics of highway traffic has been the subject of intense investigation over the last few decades, there is as yet comparatively little understanding of the patterns of urban traffic. The macroscopic collective behavior of cars in the network of roads inside a city is marked by relatively high vehicular densities and the presence of signals that coordinate movement of cross-flowing traffic traveling along several directions. In this article, we have presented a novel kinetic Monte Carlo simulation approach for studying the dynamics of urban traffic congestion. This allows us to study continuous-time, continuous-space models of traffic flow in the presence of stochastic fluctuations, which contrast with the dominant paradigm of cellular automata models. We first reproduce well-known results of such discrete models for traffic flow in the absence of any intersections, and then, show the corresponding behavior in the presence of an intersection where cross-flowing traffic is regulated by a signal. The fundamental diagram of traffic flow in the presence of a signal shows a broad plateau indicating that the flow is almost independent of small variations in vehicle density for an intermediate range of densities. This is unlike the case where there are no intersections, where a sharp transition is observed between free flow behavior and jamming on changing vehicle density. The distribution of congestion times shows a power-law scaling regime over an extended range for the stochastic case when exponential-like right skewed probability distributions are used. These results reproduce in a simple setting the empirically observed power-law behavior in congestion time distributions for Indian urban traffic that is validated here with a much larger data-set.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131712822","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}

{"title":"Streamlined medical imaging network transfer","authors":"I. Prabhu, R. Aparna","doi":"10.1109/COMSNETS.2016.7439994","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439994","url":null,"abstract":"In medical imaging, the speed and reliability with which the data is transferred is crucial since it is life-critical. Data transfer should be robust to withstand bottlenecks so that images can be transferred reliably. This paper proposes a better approach to streamline the medical image transfer and to improve transfer performance across a DICOM network. Our study indicated that the performance of medical image transfer is lowered because of waiting for the responses and this delay attributed to 25-60 percent of total transfer time. The scope of this paper is to propose an approach to overcome the delay and to improve the performance of the medical image transfer.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130313538","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}