2014 IEEE 13th International Symposium on Network Computing and Applications最新文献_第5页

Using Virtual Mobile Nodes for Neighbor Detection in Proximity-Based Mobile Applications 基于接近度的移动应用中使用虚拟移动节点进行邻居检测

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.6

Behnaz Bostanipour, B. Garbinato

{"title":"Using Virtual Mobile Nodes for Neighbor Detection in Proximity-Based Mobile Applications","authors":"Behnaz Bostanipour, B. Garbinato","doi":"10.1109/NCA.2014.6","DOIUrl":"https://doi.org/10.1109/NCA.2014.6","url":null,"abstract":"We introduce a time-limited neighbor detector service for mobile ad hoc networks, which enables a mobile device to detect other nearby devices in the past, present and up to some bounded time interval in the future. Our motivation lies in the emergence of a new trend of mobile applications known as proximity-based mobile applications, which enable a user to communicate with other users within some defined range and for a certain amount of time. Neighbor discovery is a fundamental requirement for these applications and is not restricted to the current neighbors but can include past or future neighbors. To implement the time-limited neighbor detector service, we apply an approach based on virtual mobile nodes. A virtual mobile node is an abstraction that is akin to a mobile node that travels in the network in a predefined trajectory. In practice it can be implemented by a set of mobile nodes based on a replicated state machine approach. In this paper, we assume that each node can accurately predict its own locations up to some bounded time interval in the future. Thus, we present a time-limited neighbor detector algorithm that uses a virtual mobile node that continuously travels in the network, collects the predicted locations of all nodes, performs the neighborhood matching between nodes and sends the list of neighbors to each node. We show that our algorithm correctly implements the time-limited neighbor detector service under a set of conditions.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124280295","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}

引用次数: 3

Deploying Large-Scale Service Compositions on the Cloud with the CHOReOS Enactment Engine 使用CHOReOS颁布引擎在云上部署大规模服务组合

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-01 DOI: 10.1109/NCA.2014.25

Leonardo A. F. Leite, C. Santos, Daniel Cordeiro, M. Gerosa, Fabio Kon

引用次数: 25

Local Search Heuristics for Media Streams Planning with Transcoding 基于转码的媒体流规划的局部搜索启发式算法

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-01 DOI: 10.1109/NCA.2014.32

Jiri Marek, Hana Rudová, P. Holub

引用次数: 0

Solvability-Based Comparison of Failure Detectors 基于可解性的故障检测器比较

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-07-11 DOI: 10.1109/NCA.2014.46

S. Sastry, Josef Widder

{"title":"Solvability-Based Comparison of Failure Detectors","authors":"S. Sastry, Josef Widder","doi":"10.1109/NCA.2014.46","DOIUrl":"https://doi.org/10.1109/NCA.2014.46","url":null,"abstract":"Failure detectors are oracles that have been introduced to provide processes in asynchronous systems with information about faults. This information can then be used to solve problems otherwise unsolvable in asynchronous systems. A natural question is on the \"minimum amount of information\" a failure detector has to provide for a given problem. This question is classically addressed using a relation that states that a failure detector D is stronger (that is, provides \"more, or better, information\") than a failure detector D' if D can be used to implement D'. It has recently been shown that this classic implementability relation has some drawbacks. To overcome this, different relations have been defined, one of which states that a failure detector D is stronger than D' if D can solve all the time-free problems solvable by D'. In this paper we compare the implementability-based hierarchy of failure detectors to the hierarchy based on solvability. This is done by introducing a new proof technique for establishing the solvability relation. We apply this technique to known failure detectors from the literature and demonstrate significant differences between the hierarchies.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127559271","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}

引用次数: 1

Parallel Deferred Update Replication 并行延迟更新复制

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2013-12-03 DOI: 10.1109/NCA.2014.38

L. P. D. Sousa, Daniele Sciascia, F. Pedone

引用次数: 9

Time and Location Power Based Malicious Code Detection Techniques for Smartphones 基于时间和位置功率的智能手机恶意代码检测技术

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2013-07-16 DOI: 10.1109/TrustCom.2013.22

Bryan Dixon, Shivakant Mishra

引用次数: 14