Patrick Armengol, Rachelle Tobkes, K. Akkaya, Bekir Sait Ciftler, Ismail Güvenç
Indoor localization has been widely studied due to the inability of GPS to function indoors. Numerous approaches have been proposed in the past and a number of these approaches are currently being used commercially. However, little attention was paid to the privacy of the users especially in the commercial products. Malicious individuals can determine a client's daily habits and activities by simply analyzing their WiFi signals and tracking information. In this paper, we implemented a privacy-preserving indoor localization scheme that is based on a fingerprinting approach to analyze the performance issues in terms of accuracy, complexity, scalability and privacy. We developed an Android app and collected a large number of data on the third floor of the FIU Engineering Center. The analysis of data provided excellent opportunities for performance improvement which have been incorporated to the privacy-preserving localization scheme.
{"title":"Efficient Privacy-Preserving Fingerprint-Based Indoor Localization Using Crowdsourcing","authors":"Patrick Armengol, Rachelle Tobkes, K. Akkaya, Bekir Sait Ciftler, Ismail Güvenç","doi":"10.1109/MASS.2015.76","DOIUrl":"https://doi.org/10.1109/MASS.2015.76","url":null,"abstract":"Indoor localization has been widely studied due to the inability of GPS to function indoors. Numerous approaches have been proposed in the past and a number of these approaches are currently being used commercially. However, little attention was paid to the privacy of the users especially in the commercial products. Malicious individuals can determine a client's daily habits and activities by simply analyzing their WiFi signals and tracking information. In this paper, we implemented a privacy-preserving indoor localization scheme that is based on a fingerprinting approach to analyze the performance issues in terms of accuracy, complexity, scalability and privacy. We developed an Android app and collected a large number of data on the third floor of the FIU Engineering Center. The analysis of data provided excellent opportunities for performance improvement which have been incorporated to the privacy-preserving localization scheme.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129757375","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}
One of the main challenges in wireless networks is addressing the unreliability of the wireless links, and providing reliable transmissions. Two important sources of errors in wireless transmissions are noise and interference. In order to address the errors due to noise, forward error correction methods can be used, in which redundancy is added to the packets to detect and correct the bit errors. However, when the environment is too noisy, or there is interference among the transmissions, the forward error correction codes might not be able to correct the bit errors, resulting in packet erasures. In this case, application layer erasure codes, such as network coding, are useful. In this paper, we consider a wireless network which faces both random bit errors and packet erasures. In order to provide reliable transmissions, we benefit from joint forward error correction and erasure codes, and formulate the successful transmission probability. We also propose a low-complexity method to find the optimal redundancy that should be assign to the forward error correction and erasure code. Our method consists of two phases: offline and online phases. In the offline phase, we generate a reference table, which shows the successful delivery of the packets for each possible transmission strategy. The source node uses this reference table in the second phase to find the optimal strategy depending on the noise and interference level. We show the effectiveness of our proposed method through extensive simulations.
{"title":"Reliable Broadcast with Joint Forward Error Correction and Erasure Codes in Wireless Communication Networks","authors":"P. Ostovari, Jie Wu","doi":"10.1109/MASS.2015.68","DOIUrl":"https://doi.org/10.1109/MASS.2015.68","url":null,"abstract":"One of the main challenges in wireless networks is addressing the unreliability of the wireless links, and providing reliable transmissions. Two important sources of errors in wireless transmissions are noise and interference. In order to address the errors due to noise, forward error correction methods can be used, in which redundancy is added to the packets to detect and correct the bit errors. However, when the environment is too noisy, or there is interference among the transmissions, the forward error correction codes might not be able to correct the bit errors, resulting in packet erasures. In this case, application layer erasure codes, such as network coding, are useful. In this paper, we consider a wireless network which faces both random bit errors and packet erasures. In order to provide reliable transmissions, we benefit from joint forward error correction and erasure codes, and formulate the successful transmission probability. We also propose a low-complexity method to find the optimal redundancy that should be assign to the forward error correction and erasure code. Our method consists of two phases: offline and online phases. In the offline phase, we generate a reference table, which shows the successful delivery of the packets for each possible transmission strategy. The source node uses this reference table in the second phase to find the optimal strategy depending on the noise and interference level. We show the effectiveness of our proposed method through extensive simulations.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132383746","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}
This paper proposes efficient multiple-access schemes for large wireless networks based on the transmitters' buffer state information and their transceivers' duplex transmission capability. First, we investigate the case of half-duplex nodes where a node can either transmit or receive in a given time instant. In this case, for a given frame, the transmitters send their buffer states to the destination which assigns the available time duration in the frame for data transmission among the transmitters based on their buffer state information. The network is said to be naturally sparse if the number of nonempty-queue transmitters in a given frame is much smaller than the number of users, which is the case when the arrival rates to the queues are very small and the number of users is large. If the network is not naturally sparse, we design the user requests to be sparse such that only few requests are sent to the destination. We refer to the detected nonempty-queue transmitters in a given frame as frame owners. Our design goal is to minimize the nodes' total transmit power in a given frame. In the case of unslotted-time data transmission, the optimization problem is shown to be a convex optimization program. We propose an approximate formulation to simplify the problem and obtain a closed-form expression for the assigned time durations to the nodes. The solution of the approximate optimization problem demonstrates that the time duration assigned to a node in the set of frame owners is the ratio of the square-root of the buffer occupancy of that node to the sum of the square-roots of each occupancy of all the frame owners. We then investigate the slotted-time data transmission scenario, where the time durations assigned for data transmission are slotted. In addition, we show that the full-duplex capability of a node increases the data transmission portion of the frame and enables a distributed implementation of the proposed schemes. Our numerical results demonstrate that the proposed schemes achieve higher average bits per unit power than the fixed-assignment scheme where each node is assigned a predetermined fraction of the frame duration.
{"title":"Sparsity-Cognizant Multiple-Access Schemes for Large Wireless Networks with Node Buffers","authors":"A. Shafie, N. Al-Dhahir, R. Hamila","doi":"10.1109/MASS.2015.23","DOIUrl":"https://doi.org/10.1109/MASS.2015.23","url":null,"abstract":"This paper proposes efficient multiple-access schemes for large wireless networks based on the transmitters' buffer state information and their transceivers' duplex transmission capability. First, we investigate the case of half-duplex nodes where a node can either transmit or receive in a given time instant. In this case, for a given frame, the transmitters send their buffer states to the destination which assigns the available time duration in the frame for data transmission among the transmitters based on their buffer state information. The network is said to be naturally sparse if the number of nonempty-queue transmitters in a given frame is much smaller than the number of users, which is the case when the arrival rates to the queues are very small and the number of users is large. If the network is not naturally sparse, we design the user requests to be sparse such that only few requests are sent to the destination. We refer to the detected nonempty-queue transmitters in a given frame as frame owners. Our design goal is to minimize the nodes' total transmit power in a given frame. In the case of unslotted-time data transmission, the optimization problem is shown to be a convex optimization program. We propose an approximate formulation to simplify the problem and obtain a closed-form expression for the assigned time durations to the nodes. The solution of the approximate optimization problem demonstrates that the time duration assigned to a node in the set of frame owners is the ratio of the square-root of the buffer occupancy of that node to the sum of the square-roots of each occupancy of all the frame owners. We then investigate the slotted-time data transmission scenario, where the time durations assigned for data transmission are slotted. In addition, we show that the full-duplex capability of a node increases the data transmission portion of the frame and enables a distributed implementation of the proposed schemes. Our numerical results demonstrate that the proposed schemes achieve higher average bits per unit power than the fixed-assignment scheme where each node is assigned a predetermined fraction of the frame duration.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129003215","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}
Recently, a new class of mobile applications has appeared that takes into account the behavior of physical phenomenon. Prominent examples of such applications include augmented reality applications visualizing physical processes on a mobile device or mobile cyber-physical systems like autonomous vehicles or robots. Typically, these applications need to solve partial differential equations (PDE) to simulate the behavior of a physical system. There are two basic strategies to numerically solve these PDEs: (1) offload all computations to a remote server, (2) solve the PDE on the resource-constrained mobile device. However, both strategies have severe drawbacks. Offloading will fail if the mobile device is disconnected, and resource constraints require to reduce the quality of the solution. Therefore, we propose a new approach for mobile simulations using a hybrid strategy that is robust to communication failures and can still benefit from powerful server resources. The basic idea of this approach is to dynamically decide on the placement of the PDE solver based on a prediction of the wireless link availability using Markov Chains. Our tests based on measurement in real cellular networks and real mobile devices show that this approach is able to keep deadline constraints in more than 61 % of the cases compared to a pure offloading approach, while saving up to 74 % of energy compared to a simplified approach.
{"title":"Numerical Analysis of Complex Physical Systems on Networked Mobile Devices","authors":"Christoph Dibak, Frank Dürr, K. Rothermel","doi":"10.1109/MASS.2015.12","DOIUrl":"https://doi.org/10.1109/MASS.2015.12","url":null,"abstract":"Recently, a new class of mobile applications has appeared that takes into account the behavior of physical phenomenon. Prominent examples of such applications include augmented reality applications visualizing physical processes on a mobile device or mobile cyber-physical systems like autonomous vehicles or robots. Typically, these applications need to solve partial differential equations (PDE) to simulate the behavior of a physical system. There are two basic strategies to numerically solve these PDEs: (1) offload all computations to a remote server, (2) solve the PDE on the resource-constrained mobile device. However, both strategies have severe drawbacks. Offloading will fail if the mobile device is disconnected, and resource constraints require to reduce the quality of the solution. Therefore, we propose a new approach for mobile simulations using a hybrid strategy that is robust to communication failures and can still benefit from powerful server resources. The basic idea of this approach is to dynamically decide on the placement of the PDE solver based on a prediction of the wireless link availability using Markov Chains. Our tests based on measurement in real cellular networks and real mobile devices show that this approach is able to keep deadline constraints in more than 61 % of the cases compared to a pure offloading approach, while saving up to 74 % of energy compared to a simplified approach.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127990693","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}
Chen Lyu, A. Pande, Xinlei Wang, Jindan Zhu, Dawu Gu, P. Mohapatra
Many location-based services require a mobile user to continuously prove his location. In absence of a secure mechanism, malicious users may lie about their locations to get these services. Mobility trace, a sequence of past mobility points, provides evidence for the user's locations. In this paper, we propose a Continuous Location Integrity and Provenance (CLIP) Scheme to provide authentication for mobility trace, and protect users' privacy. CLIP uses low-power inertial accelerometer sensor with a light-weight entropy-based commitment mechanism and is able to authenticate the user's mobility trace without any cost of trusted hardware. CLIP maintains the user's privacy, allowing the user to submit a portion of his mobility trace with which the commitment can be also verified. Wireless Access Points (APs) or colocated mobile devices are used to generate the location proofs. We also propose a light-weight spatial-temporal trust model to detect fake location proofs from collusion attacks. The prototype implementation on Android demonstrates that CLIP requires low computational and storage resources. Our extensive simulations show that the spatial-temporal trust model can achieve high (> 0.9) detection accuracy against collusion attacks.
{"title":"CLIP: Continuous Location Integrity and Provenance for Mobile Phones","authors":"Chen Lyu, A. Pande, Xinlei Wang, Jindan Zhu, Dawu Gu, P. Mohapatra","doi":"10.1109/MASS.2015.33","DOIUrl":"https://doi.org/10.1109/MASS.2015.33","url":null,"abstract":"Many location-based services require a mobile user to continuously prove his location. In absence of a secure mechanism, malicious users may lie about their locations to get these services. Mobility trace, a sequence of past mobility points, provides evidence for the user's locations. In this paper, we propose a Continuous Location Integrity and Provenance (CLIP) Scheme to provide authentication for mobility trace, and protect users' privacy. CLIP uses low-power inertial accelerometer sensor with a light-weight entropy-based commitment mechanism and is able to authenticate the user's mobility trace without any cost of trusted hardware. CLIP maintains the user's privacy, allowing the user to submit a portion of his mobility trace with which the commitment can be also verified. Wireless Access Points (APs) or colocated mobile devices are used to generate the location proofs. We also propose a light-weight spatial-temporal trust model to detect fake location proofs from collusion attacks. The prototype implementation on Android demonstrates that CLIP requires low computational and storage resources. Our extensive simulations show that the spatial-temporal trust model can achieve high (> 0.9) detection accuracy against collusion attacks.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127998856","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 propose a new MAC protocol for multi-beam directional antenna. In the protocol, each beam-sector has its own control channel, thus the communications among different beam-sectors are independent. It uses the Directional Network Allocation Vector (DNAV) to record the establishment processes. After sensing all the sectors of multi-beam antenna, it uses the global assignment strategy to assign the directional communication channels. Extensive simulation results show that our protocol can significantly improve the throughput of entire wireless network at the expense of the slightly increased RTS/DRTS requests during establishment process.
{"title":"MBDMAC: A MAC Protocol for Multi-beam Directional Antennas in Wireless Networks","authors":"G. Wang, Wenming Li, Xingyu Cai","doi":"10.1109/MASS.2015.94","DOIUrl":"https://doi.org/10.1109/MASS.2015.94","url":null,"abstract":"In this paper, we propose a new MAC protocol for multi-beam directional antenna. In the protocol, each beam-sector has its own control channel, thus the communications among different beam-sectors are independent. It uses the Directional Network Allocation Vector (DNAV) to record the establishment processes. After sensing all the sectors of multi-beam antenna, it uses the global assignment strategy to assign the directional communication channels. Extensive simulation results show that our protocol can significantly improve the throughput of entire wireless network at the expense of the slightly increased RTS/DRTS requests during establishment process.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125441799","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}
Delay Tolerant Networks (DTNs) have attracted significant interests due to the adaptability in areas without infrastructures. In such scenarios, moving data from one place (landmark) to another place (landmark) is essential for data communication between different areas. However, current DTN routing algorithms either fail to fully utilize node mobility or have additional requirements that cannot be satisfied easily (i.e., Require base stations or the global traffic distribution). Therefore, in this paper, we propose a distributed greedy routing algorithm, namely Greedy Flow, for efficient packet routing between landmarks. Greedy Flow builds a local traffic map and a global landmark map on each node. The local traffic map indicates the node's knowledge about the amount of traffic (node transition) between landmarks in the area where it primarily visits. It is constructed by collecting encountered nodes' transit frequencies between these landmarks. The global landmark map shows the distribution of landmarks in the system and is built offline. In packet routing, the global landmark map shows the general packet forwarding direction, while the local traffic map helps determine the next-hop landmark on the fastest path in the forwarding direction. As a result, packets are greedily forwarded toward their destination landmarks. Extensive real trace driven experiments demonstrate the high efficiency of Greedy Flow.
{"title":"GreedyFlow: Distributed Greedy Packet Routing between Landmarks in DTNs","authors":"Kang-Peng Chen, Haiying Shen","doi":"10.1109/MASS.2015.67","DOIUrl":"https://doi.org/10.1109/MASS.2015.67","url":null,"abstract":"Delay Tolerant Networks (DTNs) have attracted significant interests due to the adaptability in areas without infrastructures. In such scenarios, moving data from one place (landmark) to another place (landmark) is essential for data communication between different areas. However, current DTN routing algorithms either fail to fully utilize node mobility or have additional requirements that cannot be satisfied easily (i.e., Require base stations or the global traffic distribution). Therefore, in this paper, we propose a distributed greedy routing algorithm, namely Greedy Flow, for efficient packet routing between landmarks. Greedy Flow builds a local traffic map and a global landmark map on each node. The local traffic map indicates the node's knowledge about the amount of traffic (node transition) between landmarks in the area where it primarily visits. It is constructed by collecting encountered nodes' transit frequencies between these landmarks. The global landmark map shows the distribution of landmarks in the system and is built offline. In packet routing, the global landmark map shows the general packet forwarding direction, while the local traffic map helps determine the next-hop landmark on the fastest path in the forwarding direction. As a result, packets are greedily forwarded toward their destination landmarks. Extensive real trace driven experiments demonstrate the high efficiency of Greedy Flow.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126154029","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}
Shuai-zhao Jin, Zixiao Wang, W. Leong, B. Leong, Yabo Dong, Dongming Lu
Neighbor discovery is essential for docking applications, where mobile nodes communicate with static nodes situated at various rendezvous points. In existing neighbor discovery protocols, the probabilistic protocols perform well in the average-case but have a periodic, unpredictable and unbounded discovery latency. While the deterministic protocols can provide a bounded worst-case discovery latency, they achieve this by sacrificing the average-case performance. In this paper, we propose a new synchronization technique, called Mobility-Assisted Slot index Synchronization (MASS). MASS improves the average-case performance of deterministic neighbor discovery protocols via slot index synchronization, without incurring additional energy consumption. We evaluate MASS through both theoretical analysis and simulations of the real traces from a tourist tracking system deployed at Mogao Grottoes, a famous cultural heritage site in China. We show that MASS can reduce the average discovery latency of state-of-the-art deterministic neighbor discovery protocols by up to 2 orders of magnitude.
{"title":"Improving Neighbor Discovery with Slot Index Synchronization","authors":"Shuai-zhao Jin, Zixiao Wang, W. Leong, B. Leong, Yabo Dong, Dongming Lu","doi":"10.1109/MASS.2015.14","DOIUrl":"https://doi.org/10.1109/MASS.2015.14","url":null,"abstract":"Neighbor discovery is essential for docking applications, where mobile nodes communicate with static nodes situated at various rendezvous points. In existing neighbor discovery protocols, the probabilistic protocols perform well in the average-case but have a periodic, unpredictable and unbounded discovery latency. While the deterministic protocols can provide a bounded worst-case discovery latency, they achieve this by sacrificing the average-case performance. In this paper, we propose a new synchronization technique, called Mobility-Assisted Slot index Synchronization (MASS). MASS improves the average-case performance of deterministic neighbor discovery protocols via slot index synchronization, without incurring additional energy consumption. We evaluate MASS through both theoretical analysis and simulations of the real traces from a tourist tracking system deployed at Mogao Grottoes, a famous cultural heritage site in China. We show that MASS can reduce the average discovery latency of state-of-the-art deterministic neighbor discovery protocols by up to 2 orders of magnitude.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121763373","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}
A. Afanasyev, Zhenkai Zhu, Yingdi Yu, Lijing Wang, Lixia Zhang
Information sharing among a group of friends or colleagues in real life is usually a distributed process: we tell each other interesting or important news without any mandatory assistance or approval from a third party. Surprisingly, this is not what happens when sharing files among a group of friends over the Internet. While the goal of file sharing is to disseminate files among multiple parties, due to the constraints imposed by IP's point-to-point communication model, most of today's file sharing applications, such as Drop box, Google Drive, etc., resort to a centralized design paradigm: a user first uploads files to the server (cloud), and the server (cloud) re-distributes these files to other users, resulting in unnecessary tussles and inefficient data distribution paths. To bring the truly distributed file sharing back into the cyberspace, this paper presents Chrono Share, a distributed file sharing application built on top of the Named Data Networking (NDN) architecture. By walking through Chrono Share design details, we show how file sharing, as well as many other similar applications, can be effectively implemented over NDN in a truly distributed and secure manner.
{"title":"The Story of ChronoShare, or How NDN Brought Distributed Secure File Sharing Back","authors":"A. Afanasyev, Zhenkai Zhu, Yingdi Yu, Lijing Wang, Lixia Zhang","doi":"10.1109/MASS.2015.59","DOIUrl":"https://doi.org/10.1109/MASS.2015.59","url":null,"abstract":"Information sharing among a group of friends or colleagues in real life is usually a distributed process: we tell each other interesting or important news without any mandatory assistance or approval from a third party. Surprisingly, this is not what happens when sharing files among a group of friends over the Internet. While the goal of file sharing is to disseminate files among multiple parties, due to the constraints imposed by IP's point-to-point communication model, most of today's file sharing applications, such as Drop box, Google Drive, etc., resort to a centralized design paradigm: a user first uploads files to the server (cloud), and the server (cloud) re-distributes these files to other users, resulting in unnecessary tussles and inefficient data distribution paths. To bring the truly distributed file sharing back into the cyberspace, this paper presents Chrono Share, a distributed file sharing application built on top of the Named Data Networking (NDN) architecture. By walking through Chrono Share design details, we show how file sharing, as well as many other similar applications, can be effectively implemented over NDN in a truly distributed and secure manner.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125499541","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}
We investigate the quality of sensor localization achievable in a slow Rayleigh fading environment using three different localizations approaches.
我们研究了使用三种不同的定位方法在缓慢瑞利衰落环境中实现的传感器定位质量。
{"title":"Localization in a Rayleigh Fading Environment Using RSS Based Methodologies","authors":"Rojina Adhikary, J. Daigle","doi":"10.1109/MASS.2015.54","DOIUrl":"https://doi.org/10.1109/MASS.2015.54","url":null,"abstract":"We investigate the quality of sensor localization achievable in a slow Rayleigh fading environment using three different localizations approaches.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122208794","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
扫码关注我们
求助内容：
应助结果提醒方式：