Won-Suk Kim, Sang-Hwa Chung, Chang-Woo Ahn, Mi-Rim Do
The enterprise WLANs that are composed of multiple access points (APs) and AP controller, provide wireless backbone networks in the building and campus. In this paper, we propose the Open Flow AP system that is a software-defined enterprise WLAN system based on the Open Flow-based AP and the Open Flow controller. Also, we propose the seamless handoff and performance anomaly reduction schemes based on the Open Flow AP system in order to improve total throughput of the networks while user experience is guaranteed. We deployed the Open Flow AP system in the lab building and performed several experiments to evaluate the efficiency of the proposed system and applications. When the proposed system is compared with the existing WLANs, it performs handoff seamlessly without reassociation and increases total throughput of the network by 26.7% when client is located in overlapped service area.
{"title":"Seamless Handoff and Performance Anomaly Reduction Schemes Based on OpenFlow Access Points","authors":"Won-Suk Kim, Sang-Hwa Chung, Chang-Woo Ahn, Mi-Rim Do","doi":"10.1109/WAINA.2014.58","DOIUrl":"https://doi.org/10.1109/WAINA.2014.58","url":null,"abstract":"The enterprise WLANs that are composed of multiple access points (APs) and AP controller, provide wireless backbone networks in the building and campus. In this paper, we propose the Open Flow AP system that is a software-defined enterprise WLAN system based on the Open Flow-based AP and the Open Flow controller. Also, we propose the seamless handoff and performance anomaly reduction schemes based on the Open Flow AP system in order to improve total throughput of the networks while user experience is guaranteed. We deployed the Open Flow AP system in the lab building and performed several experiments to evaluate the efficiency of the proposed system and applications. When the proposed system is compared with the existing WLANs, it performs handoff seamlessly without reassociation and increases total throughput of the network by 26.7% when client is located in overlapped service area.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123485114","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}
An abnormal behavior detection algorithm for surveillance is required to correctly identify the targets as being in a normal or chaotic movement. A model is developed here for this purpose. The uniqueness of this algorithm is the use of foreground detection with Gaussian mixture (FGMM) model before passing the video frames to optical flow model using Lucas-Kanade approach. Information of horizontal and vertical displacements and directions associated with each pixel for object of interest is extracted. These features are then fed to feed forward neural network for classification and simulation. The study is being conducted on the real time videos and some synthesized videos. Accuracy of method has been calculated by using the performance parameters for Neural Networks. In comparison of plain optical flow with this model, improved results have been obtained without noise. Classes are correctly identified with an overall performance equal to 3.4e-02 with & error percentage of 2.5.
{"title":"Tracking and Abnormal Behavior Detection in Video Surveillance Using Optical Flow and Neural Networks","authors":"Nida Rasheed, S. Khan, A. Khalid","doi":"10.1109/WAINA.2014.18","DOIUrl":"https://doi.org/10.1109/WAINA.2014.18","url":null,"abstract":"An abnormal behavior detection algorithm for surveillance is required to correctly identify the targets as being in a normal or chaotic movement. A model is developed here for this purpose. The uniqueness of this algorithm is the use of foreground detection with Gaussian mixture (FGMM) model before passing the video frames to optical flow model using Lucas-Kanade approach. Information of horizontal and vertical displacements and directions associated with each pixel for object of interest is extracted. These features are then fed to feed forward neural network for classification and simulation. The study is being conducted on the real time videos and some synthesized videos. Accuracy of method has been calculated by using the performance parameters for Neural Networks. In comparison of plain optical flow with this model, improved results have been obtained without noise. Classes are correctly identified with an overall performance equal to 3.4e-02 with & error percentage of 2.5.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123708072","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}
Israel Leyva Mayorga, M. E. Rivero-Angeles, Chadwick Carreto Arellano
Evolution in Wireless Sensor Networks (WSNs) has allowed new applications that led to an increase in the complexity of communication protocols. Specifically, mobile surveillance applications (where the network is set to monitor mobile objects) require the system to respond in a certain manner so adequate and reliable object tracking and status reporting takes place. Mobile objects can be either independent or controlled by the system, in the former, some sort of transmitter is attached to the mobile entity in order to perform status reporting duties, which, in the case of human beings or specimens may comprise the reporting of vital signs. In view of this, information obtained from mobile objects must be sent with minimal delay and with certain degree of reliability in order to achieve adequate emergency handling when required. Furthermore, mobile environments usually incorporate additional phenomena that creates a multi-event environment, increasing the rate of detection and transmission in the nodes, hence, delaying the report. Hybrid algorithms that allow sensor networks to perform continuous monitoring and event driven applications have proven their ability to enhance performance in different environments where emergency alarms are required while performing a permanent surveillance of the phenomena. Also, these protocols may consider priority assignment in order to reduce report delay and increase reliability in important packets, thus enhancing QoS parameters. In this work, the performance of a non-preemptive hybrid protocol for WSN is studied considering multi-event environments containing mobile targets. Results show that, by using different transmission probabilities, assigned to high and low priority data packets, mobile event reporting delay can be reduced despite the occurrence of other events within the network. As such, a better performance is obtained for critical-time applications where emergency handling is a must.
{"title":"Performance Analysis of a Non-preemptive Hybrid WSN Protocol in Mobile Environments","authors":"Israel Leyva Mayorga, M. E. Rivero-Angeles, Chadwick Carreto Arellano","doi":"10.1109/WAINA.2014.83","DOIUrl":"https://doi.org/10.1109/WAINA.2014.83","url":null,"abstract":"Evolution in Wireless Sensor Networks (WSNs) has allowed new applications that led to an increase in the complexity of communication protocols. Specifically, mobile surveillance applications (where the network is set to monitor mobile objects) require the system to respond in a certain manner so adequate and reliable object tracking and status reporting takes place. Mobile objects can be either independent or controlled by the system, in the former, some sort of transmitter is attached to the mobile entity in order to perform status reporting duties, which, in the case of human beings or specimens may comprise the reporting of vital signs. In view of this, information obtained from mobile objects must be sent with minimal delay and with certain degree of reliability in order to achieve adequate emergency handling when required. Furthermore, mobile environments usually incorporate additional phenomena that creates a multi-event environment, increasing the rate of detection and transmission in the nodes, hence, delaying the report. Hybrid algorithms that allow sensor networks to perform continuous monitoring and event driven applications have proven their ability to enhance performance in different environments where emergency alarms are required while performing a permanent surveillance of the phenomena. Also, these protocols may consider priority assignment in order to reduce report delay and increase reliability in important packets, thus enhancing QoS parameters. In this work, the performance of a non-preemptive hybrid protocol for WSN is studied considering multi-event environments containing mobile targets. Results show that, by using different transmission probabilities, assigned to high and low priority data packets, mobile event reporting delay can be reduced despite the occurrence of other events within the network. As such, a better performance is obtained for critical-time applications where emergency handling is a must.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"345 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115292013","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 fractional-pixel displacement has been proposed in the motion compensation prediction for the H.264/AVC algorithm. In this paper, a cubic convolution interpolation filter with four coefficients is presented to improve the coding efficiency of fractional-pixel displacement for H.264/AVC. Experimental results show that the proposed cubic convolution interpolation filter can be used to increase the fractional-pixel precisions and also obtain a superior performance for motion compensation.
{"title":"A Fast Efficient Fractional-Pixel Displacement for H.264/AVC Motion Compensation","authors":"Lung-Jen Wang, Chia-Tzu Shu","doi":"10.1109/WAINA.2014.13","DOIUrl":"https://doi.org/10.1109/WAINA.2014.13","url":null,"abstract":"The fractional-pixel displacement has been proposed in the motion compensation prediction for the H.264/AVC algorithm. In this paper, a cubic convolution interpolation filter with four coefficients is presented to improve the coding efficiency of fractional-pixel displacement for H.264/AVC. Experimental results show that the proposed cubic convolution interpolation filter can be used to increase the fractional-pixel precisions and also obtain a superior performance for motion compensation.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129757049","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}
In this paper, we present a 3DCG (three-dimensional computer graphics) distribution system for the augmented reality user interface (UI). Specifically, we create a platform for collecting and managing 3DCG content for the augmented reality UI. The platform mainly consists of local 3DCG distribution servers that are implemented as a Web service, a crawler that collects metadata of 3DCG content from local 3DCG servers, and a global 3DCG distribution system that manages the overall metadata of the 3DCG content collected from local 3DCG servers by the crawler. In addition, we present a method for personalizing additional information related to the user's selected 3DCG in the augmented reality UI based on the user's preferences and metadata-based classification. The feasibility of our system is experimentally evaluated and discussed using a 3DCG content database regarding plants and animals.
{"title":"A 3DCG Distribution System with Personalized Ranking for Augmented Reality User Interface","authors":"Hiroshi Honda, Kosuke Takano","doi":"10.1109/WAINA.2014.42","DOIUrl":"https://doi.org/10.1109/WAINA.2014.42","url":null,"abstract":"In this paper, we present a 3DCG (three-dimensional computer graphics) distribution system for the augmented reality user interface (UI). Specifically, we create a platform for collecting and managing 3DCG content for the augmented reality UI. The platform mainly consists of local 3DCG distribution servers that are implemented as a Web service, a crawler that collects metadata of 3DCG content from local 3DCG servers, and a global 3DCG distribution system that manages the overall metadata of the 3DCG content collected from local 3DCG servers by the crawler. In addition, we present a method for personalizing additional information related to the user's selected 3DCG in the augmented reality UI based on the user's preferences and metadata-based classification. The feasibility of our system is experimentally evaluated and discussed using a 3DCG content database regarding plants and animals.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128876600","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}
In wireless sensor networks (WSNs), contention occurs when two or more nodes in a proximity simultaneously try to access the channel. The contention causes collisions, which are very likely to occur when traffic is correlated. The excessive collision not only affects the reliability and the QoS of the application, but also the lifetime of the network. It is well known that random access mechanisms do not efficiently handle correlated-contention, and therefore, suffer from high collision rate. Most of the existing TDMA scheduling techniques try to find an optimal or a sub-optimal schedule. Usually, the situation of correlated-contention persists only for a short duration, and therefore, it is not worthwhile to take a long time to generate an optimal or a sub-optimal schedule. We propose a randomized distributed TDMA scheduling (RD-TDMA) algorithm to quickly generate a feasible schedule (not necessarily optimal) to handle correlated-contention in WSNs. In RD-TDMA, a node in the network negotiates a slot with its neighbors using the message exchange mechanism. The proposed protocol has been simulated using the Castalia simulator to evaluate its runtime performance. Simulation results show that the RD-TDMA algorithm considerably reduces the time required to schedule.
{"title":"RD-TDMA: A Randomized Distributed TDMA Scheduling for Correlated Contention in WSNs","authors":"Ashutosh Bhatia, R. Hansdah","doi":"10.1109/WAINA.2014.65","DOIUrl":"https://doi.org/10.1109/WAINA.2014.65","url":null,"abstract":"In wireless sensor networks (WSNs), contention occurs when two or more nodes in a proximity simultaneously try to access the channel. The contention causes collisions, which are very likely to occur when traffic is correlated. The excessive collision not only affects the reliability and the QoS of the application, but also the lifetime of the network. It is well known that random access mechanisms do not efficiently handle correlated-contention, and therefore, suffer from high collision rate. Most of the existing TDMA scheduling techniques try to find an optimal or a sub-optimal schedule. Usually, the situation of correlated-contention persists only for a short duration, and therefore, it is not worthwhile to take a long time to generate an optimal or a sub-optimal schedule. We propose a randomized distributed TDMA scheduling (RD-TDMA) algorithm to quickly generate a feasible schedule (not necessarily optimal) to handle correlated-contention in WSNs. In RD-TDMA, a node in the network negotiates a slot with its neighbors using the message exchange mechanism. The proposed protocol has been simulated using the Castalia simulator to evaluate its runtime performance. Simulation results show that the RD-TDMA algorithm considerably reduces the time required to schedule.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130216066","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}
Chelsea Dobbins, M. Merabti, P. Fergus, D. Llewellyn-Jones
Living in the digital age has resulted in a data rich society where the ability to log every moment of our lives is now possible. This chronicle is known as a human digital memory and is a heterogeneous record of our lives, which grows alongside its human counterpart. Managing a lifetime of data results in these sets of big data growing to enormous proportions, as these records increase in size the problem of effectively managing them becomes more difficult. This paper explores the challenges of searching such big data sets of human digital memory data and posits a new approach that treats the searching of human digital memory data as a machine learning problem.
{"title":"The Big Data Obstacle of Lifelogging","authors":"Chelsea Dobbins, M. Merabti, P. Fergus, D. Llewellyn-Jones","doi":"10.1109/WAINA.2014.142","DOIUrl":"https://doi.org/10.1109/WAINA.2014.142","url":null,"abstract":"Living in the digital age has resulted in a data rich society where the ability to log every moment of our lives is now possible. This chronicle is known as a human digital memory and is a heterogeneous record of our lives, which grows alongside its human counterpart. Managing a lifetime of data results in these sets of big data growing to enormous proportions, as these records increase in size the problem of effectively managing them becomes more difficult. This paper explores the challenges of searching such big data sets of human digital memory data and posits a new approach that treats the searching of human digital memory data as a machine learning problem.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116349931","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}
Due to its ease of use combined with its efficiency, traditional email service constitutes one of the main success story brought by the Internet. Its popularity hides however significant gaps. Professional email systems usually remedy such deficiencies by compiling a lot of sophisticated features in a single monolithic policy which should ideally take into account security requirements together with various other specific needs. The main drawback of these approaches lies in their inherent rigidity. They indeed grant no place for the concepts of usage and context which are fundamental for any modern communication service. The usage is determined by a user's intention of communication: private, professional, administrative, official, military. Context is clearly orthogonal to usage because a same usage may require different features depending of the context. We propose to define a correspondence model which for a given usage and context allows to dynamically derive a correspondence type encapsulating the exact set of required features. With this model, it becomes possible to define an advanced email system which may dynamically cope with multiple policies instead of a single monolithic one. By allowing a user to select the exact policy matching her needs, we argue that our approach reduces her risk-taking, providing in this way a confident advanced email system.
{"title":"Building a Confident Advanced Email System Using a New Correspondence Model","authors":"Laurent Cailleux, A. Bouabdallah, J. Bonnin","doi":"10.1109/WAINA.2014.24","DOIUrl":"https://doi.org/10.1109/WAINA.2014.24","url":null,"abstract":"Due to its ease of use combined with its efficiency, traditional email service constitutes one of the main success story brought by the Internet. Its popularity hides however significant gaps. Professional email systems usually remedy such deficiencies by compiling a lot of sophisticated features in a single monolithic policy which should ideally take into account security requirements together with various other specific needs. The main drawback of these approaches lies in their inherent rigidity. They indeed grant no place for the concepts of usage and context which are fundamental for any modern communication service. The usage is determined by a user's intention of communication: private, professional, administrative, official, military. Context is clearly orthogonal to usage because a same usage may require different features depending of the context. We propose to define a correspondence model which for a given usage and context allows to dynamically derive a correspondence type encapsulating the exact set of required features. With this model, it becomes possible to define an advanced email system which may dynamically cope with multiple policies instead of a single monolithic one. By allowing a user to select the exact policy matching her needs, we argue that our approach reduces her risk-taking, providing in this way a confident advanced email system.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122013929","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}
Jorge López, Xiaoping Che, S. Maag, Gerardo Morales
Communications systems are growing in use and in popularity. While their interactions are becoming more numerous, trust those interactions now becomes a priority. In this paper, we focus on trust management systems based on observations of trustee behaviors. Based on a formal testing methodology, we propose a formal distributed network monitoring approach to analyze the packets exchanged between the trust or, trustee and other points of observation in order to prove the trustee is acting in a trustworthy manner. Based on formal "trust properties", the monitored systems behaviors provide a verdict of trust by analyzing and testing those properties. Finally, our methodology is applied to a real industrial DNS use case scenario.
{"title":"A Distributed Monitoring Approach for Trust Assessment Based on Formal Testing","authors":"Jorge López, Xiaoping Che, S. Maag, Gerardo Morales","doi":"10.1109/WAINA.2014.114","DOIUrl":"https://doi.org/10.1109/WAINA.2014.114","url":null,"abstract":"Communications systems are growing in use and in popularity. While their interactions are becoming more numerous, trust those interactions now becomes a priority. In this paper, we focus on trust management systems based on observations of trustee behaviors. Based on a formal testing methodology, we propose a formal distributed network monitoring approach to analyze the packets exchanged between the trust or, trustee and other points of observation in order to prove the trustee is acting in a trustworthy manner. Based on formal \"trust properties\", the monitored systems behaviors provide a verdict of trust by analyzing and testing those properties. Finally, our methodology is applied to a real industrial DNS use case scenario.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122574016","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}
Social communication networks have been widely investigated in recent years. From fine-grained temporal information's point of view, social vector clock (SVC) is a useful mechanism to track the most recent communication with all other local peers in a social network. A modification of conventional social vector clocks has been proposed to deal with the issue of poor scalability without keeping whole temporal views [1]. In this paper, we propose an idea of variable social vector clocks (VSVCs) and the corresponding incremental algorithm. Not only does it maintain the lower bound of how out-of-date each peer can be with respect to others, but it also considers the shortest friendship separation to restrict how far information may be transmitted along time respecting paths. Unless this separation is bounded to be infinite, some communication messages could be lost implicitly. We also focus on studying message inconsistency and reachable in-degree communication distribution in several social networks based on variable social vector clocks.
{"title":"Modeling User Interactions in Social Communication Networks with Variable Social Vector Clocks","authors":"T. Hsu, A. Kshemkalyani, Min Shen","doi":"10.1109/WAINA.2014.29","DOIUrl":"https://doi.org/10.1109/WAINA.2014.29","url":null,"abstract":"Social communication networks have been widely investigated in recent years. From fine-grained temporal information's point of view, social vector clock (SVC) is a useful mechanism to track the most recent communication with all other local peers in a social network. A modification of conventional social vector clocks has been proposed to deal with the issue of poor scalability without keeping whole temporal views [1]. In this paper, we propose an idea of variable social vector clocks (VSVCs) and the corresponding incremental algorithm. Not only does it maintain the lower bound of how out-of-date each peer can be with respect to others, but it also considers the shortest friendship separation to restrict how far information may be transmitted along time respecting paths. Unless this separation is bounded to be infinite, some communication messages could be lost implicitly. We also focus on studying message inconsistency and reachable in-degree communication distribution in several social networks based on variable social vector clocks.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124136102","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
扫码关注我们
求助内容：
应助结果提醒方式：