Pub Date : 2015-05-04DOI: 10.1109/COMSNETS.2015.7098685
P. Deshpande, Palanivel A. Kodeswaran, N. Banerjee, A. A. Nanavati, Deepika Chhabra, Shalini Kapoor
The true potential of the Internet of Things (IoT) will be realized only when devices are able to harness the collective capabilities of a wide range of peer-devices. In this paper, we propose a novel model where friends in a social network can share device capabilities with their peers in an access controlled manner. We develop a theoretical model of such a peer-to-peer network in which devices can search for remote capabilities, and elaborate on the trade-offs of different algorithms in terms of capability searching and execution. We study various types of social network models to understand the degree of sharing in such networks. Our results show that Barabási-Albert graphs that approximate most real world social networks have a high degree of sharing, validating the utility of our social network based model. We also propose an algorithm that takes any given network and augments it to increase the level of sharing by intelligently suggesting friendship recommendations among vertices. Finally, we describe the prototype implementation of an android mobile application that uses facebook APIs to allow smartphones share GPS and camera capabilities with other devices owned by friends.
{"title":"M4M: A model for enabling social network based sharing in the Internet of Things","authors":"P. Deshpande, Palanivel A. Kodeswaran, N. Banerjee, A. A. Nanavati, Deepika Chhabra, Shalini Kapoor","doi":"10.1109/COMSNETS.2015.7098685","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098685","url":null,"abstract":"The true potential of the Internet of Things (IoT) will be realized only when devices are able to harness the collective capabilities of a wide range of peer-devices. In this paper, we propose a novel model where friends in a social network can share device capabilities with their peers in an access controlled manner. We develop a theoretical model of such a peer-to-peer network in which devices can search for remote capabilities, and elaborate on the trade-offs of different algorithms in terms of capability searching and execution. We study various types of social network models to understand the degree of sharing in such networks. Our results show that Barabási-Albert graphs that approximate most real world social networks have a high degree of sharing, validating the utility of our social network based model. We also propose an algorithm that takes any given network and augments it to increase the level of sharing by intelligently suggesting friendship recommendations among vertices. Finally, we describe the prototype implementation of an android mobile application that uses facebook APIs to allow smartphones share GPS and camera capabilities with other devices owned by friends.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114911304","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 : 2015-05-04DOI: 10.1109/COMSNETS.2015.7098683
Shreyasee Mukherjee, A. Baid, D. Raychaudhuri
This paper discusses the design challenges associated with supporting advanced mobility services in the future Internet. The recent transition of the Internet from the fixed host-server model to one in which mobile platforms are the norm motivates a next-generation protocol architecture which provides integrated and efficient support for advanced mobility services. Key wireless access and mobility usage scenarios are identified including host mobility, multihoming, vehicular access and context addressability, and key protocol support requirements are identified in each case. The MobilityFirst (MF) architecture being developed under the National Science Foundation's future Internet Architecture (FIA) program is proposed as a possible realization that meets the identified requirements. MF protocol specifics are given for each wireless/mobile use case, along with sample evaluation results demonstrating achievable performance benefits.
{"title":"Integrating advanced mobility services into the future Internet Architecture","authors":"Shreyasee Mukherjee, A. Baid, D. Raychaudhuri","doi":"10.1109/COMSNETS.2015.7098683","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098683","url":null,"abstract":"This paper discusses the design challenges associated with supporting advanced mobility services in the future Internet. The recent transition of the Internet from the fixed host-server model to one in which mobile platforms are the norm motivates a next-generation protocol architecture which provides integrated and efficient support for advanced mobility services. Key wireless access and mobility usage scenarios are identified including host mobility, multihoming, vehicular access and context addressability, and key protocol support requirements are identified in each case. The MobilityFirst (MF) architecture being developed under the National Science Foundation's future Internet Architecture (FIA) program is proposed as a possible realization that meets the identified requirements. MF protocol specifics are given for each wireless/mobile use case, along with sample evaluation results demonstrating achievable performance benefits.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125257955","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}
Availability of healthcare data allows governments to analyze effectiveness of their policies, monitor spread of a disease, etc. Data collection for public healthcare is still a big challenge, especially in developing countries where most of the data collection is still done on paper. Therefore, recently many tools, e.g. ODK, Commcare, have become available that allow data collection on mobile devices. Similarly, during data collection, use of health sensors to measure some of the health parameters, e.g. ECG, Oxygen Saturation, is increasing, but then the data measured by sensors is often entered manually to the mobile device. Finally, the data collected on a mobile device is then entered into a database (either an EMR or a general database) manually, which is time consuming and introduces error due to manual input. While partial solutions that enable connectivity of sensors to mobile device or mobile device to a specific EMR are available, there is a lack of a comprehensive end-to-end solution. In this paper, we present our framework which works on mobile devices to allow collection of sensor data at one end and stores data into an EMR on the other end, thus provides a comprehensive solution for data collection. The requirements of the framework were derived after interviewing healthcare workers who conduct regular field studies. We have tested our framework with a publicly available standard health sensor and OpenMRS.
{"title":"An EMR-enabled medical sensor data collection framework","authors":"Rakshit Wadhwa, Pushpendra Singh, Meenu Singh, Saurabh Kumar","doi":"10.1109/COMSNETS.2015.7098703","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098703","url":null,"abstract":"Availability of healthcare data allows governments to analyze effectiveness of their policies, monitor spread of a disease, etc. Data collection for public healthcare is still a big challenge, especially in developing countries where most of the data collection is still done on paper. Therefore, recently many tools, e.g. ODK, Commcare, have become available that allow data collection on mobile devices. Similarly, during data collection, use of health sensors to measure some of the health parameters, e.g. ECG, Oxygen Saturation, is increasing, but then the data measured by sensors is often entered manually to the mobile device. Finally, the data collected on a mobile device is then entered into a database (either an EMR or a general database) manually, which is time consuming and introduces error due to manual input. While partial solutions that enable connectivity of sensors to mobile device or mobile device to a specific EMR are available, there is a lack of a comprehensive end-to-end solution. In this paper, we present our framework which works on mobile devices to allow collection of sensor data at one end and stores data into an EMR on the other end, thus provides a comprehensive solution for data collection. The requirements of the framework were derived after interviewing healthcare workers who conduct regular field studies. We have tested our framework with a publicly available standard health sensor and OpenMRS.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127024383","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 : 2015-05-04DOI: 10.1109/COMSNETS.2015.7098722
Ravi Bhandari, Megha Chaudhary, A. Bansal, B. Raman, N. Aggarwal, D. Bansal, K. Ramakrishnan
Crowd-sourcing of information about various aspects of a road is an important mechanism in Intelligent Transportation Systems (ITS). In this work, we consider crowd-sourcing from public transportation commuters, information about the road, traffic, and the specific public transportation unit. Any crowd-sourced information has to be tagged with the information provider's location. Since GPS-based location determination is energy-expensive, we focus on GSM signal based location determination. A specific dimension we explore, not considered in prior work, is the use of GSM signal information from multiple commuters' phones. This consideration is triggered by the observation that a large set of commuters have (almost) the same physical location for large durations of time: when they share the same bus. We present an analysis of data collected from two different Indian cities: Mumbai and Chandigarh. We find that such combination of information can lower the median location error by a factor of 2-10.
{"title":"GSM-based positioning for public transportation commuters","authors":"Ravi Bhandari, Megha Chaudhary, A. Bansal, B. Raman, N. Aggarwal, D. Bansal, K. Ramakrishnan","doi":"10.1109/COMSNETS.2015.7098722","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098722","url":null,"abstract":"Crowd-sourcing of information about various aspects of a road is an important mechanism in Intelligent Transportation Systems (ITS). In this work, we consider crowd-sourcing from public transportation commuters, information about the road, traffic, and the specific public transportation unit. Any crowd-sourced information has to be tagged with the information provider's location. Since GPS-based location determination is energy-expensive, we focus on GSM signal based location determination. A specific dimension we explore, not considered in prior work, is the use of GSM signal information from multiple commuters' phones. This consideration is triggered by the observation that a large set of commuters have (almost) the same physical location for large durations of time: when they share the same bus. We present an analysis of data collected from two different Indian cities: Mumbai and Chandigarh. We find that such combination of information can lower the median location error by a factor of 2-10.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"85 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114037747","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 : 2015-05-04DOI: 10.1109/COMSNETS.2015.7098707
M. Sarvabhatla, C. Vorugunti
Emerging markets looks cloud computing as a facilitator to lower their investments related to ICT. Unlimited throughput, on demand and elastic nature of cloud attracted the medium and large scale organizations to adopt it and move their critical data, software resources to cloud. Outsourcing of critical data to third party results in lots of security issues like user authentication, integrity of data etc. and need to be addressed very effectively. In 2011, Hao et al of SUNY, have proposed a time-bound ticket-based mutual authentication scheme and claimed that their scheme is secure. In 2013, Jaidhar et al claimed that Hao et al scheme is vulnerable to DoS attack and proposed an improved scheme. In this paper, we will show that Jaidhar et al scheme is still vulnerable to all major cryptographic attacks like offline password guessing attack, user impersonation attack, server masquerade attack etc. As a part of our contribution, we propose an improved mutual authentication scheme, which is secure and resistant to all major cryptographic attacks.
{"title":"A robust mutual authentication scheme for data security in cloud architecture","authors":"M. Sarvabhatla, C. Vorugunti","doi":"10.1109/COMSNETS.2015.7098707","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098707","url":null,"abstract":"Emerging markets looks cloud computing as a facilitator to lower their investments related to ICT. Unlimited throughput, on demand and elastic nature of cloud attracted the medium and large scale organizations to adopt it and move their critical data, software resources to cloud. Outsourcing of critical data to third party results in lots of security issues like user authentication, integrity of data etc. and need to be addressed very effectively. In 2011, Hao et al of SUNY, have proposed a time-bound ticket-based mutual authentication scheme and claimed that their scheme is secure. In 2013, Jaidhar et al claimed that Hao et al scheme is vulnerable to DoS attack and proposed an improved scheme. In this paper, we will show that Jaidhar et al scheme is still vulnerable to all major cryptographic attacks like offline password guessing attack, user impersonation attack, server masquerade attack etc. As a part of our contribution, we propose an improved mutual authentication scheme, which is secure and resistant to all major cryptographic attacks.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128047700","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 : 2015-05-04DOI: 10.1109/COMSNETS.2015.7098736
Chandrika Bhardwaj
This paper argues that the security and integrity requirements of mHealth systems are best addressed by end-to-end information flow control (IFC). The paper extends proposals of decentralized IFC to a distributed smartphone-based mHealth system, identifying the basic threat model and the necessary trusted computing base. We show how the framework proposed can be integrated into an existing communication stack between a phalanx of sensors and an Android smartphone. The central idea of the framework involves systematically and automatically labelling data and metadata collected during medical encounters with security and integrity tags. These mechanisms provided can then be used for enforcing a wide variety of complex information flow control policies in diverse applications. The chief novelty over existing DIFC approaches is that users are relieved of having to create tags for each class of data and metadata that is collected in the system, thus making it user-friendly and scalable.
{"title":"Systematic information flow control in mHealth systems","authors":"Chandrika Bhardwaj","doi":"10.1109/COMSNETS.2015.7098736","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098736","url":null,"abstract":"This paper argues that the security and integrity requirements of mHealth systems are best addressed by end-to-end information flow control (IFC). The paper extends proposals of decentralized IFC to a distributed smartphone-based mHealth system, identifying the basic threat model and the necessary trusted computing base. We show how the framework proposed can be integrated into an existing communication stack between a phalanx of sensors and an Android smartphone. The central idea of the framework involves systematically and automatically labelling data and metadata collected during medical encounters with security and integrity tags. These mechanisms provided can then be used for enforcing a wide variety of complex information flow control policies in diverse applications. The chief novelty over existing DIFC approaches is that users are relieved of having to create tags for each class of data and metadata that is collected in the system, thus making it user-friendly and scalable.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122030905","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 : 2015-05-04DOI: 10.1109/COMSNETS.2015.7098667
Saiful Khan, A. Gani, S. Raviraja, Shashikantha
An efficient and scalable broadcast are two essential features of structured overlay networks which used in large scale distributed computing systems and in peer-to-peer networks. The existing broadcast based algorithms over the structured overlays experience certain issues due to a decentralised nature of such networks in which nodes join and leave the network dynamically. This causes poor routing efficiency and high maintenance bandwidth overhead. In this paper, we study routing efficiency and maintenance bandwidth overhead while broadcasting messages over the structured overlay networks in dynamic environment. We also propose an improved message broadcasting algorithm over the structured overlay networks. The simulation results show that although there is a trade off between routing efficiency and maintenance bandwidth, with optimisation we can improve one without severely effecting the other parameter.
{"title":"A study of broadcasting over structured overlay","authors":"Saiful Khan, A. Gani, S. Raviraja, Shashikantha","doi":"10.1109/COMSNETS.2015.7098667","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098667","url":null,"abstract":"An efficient and scalable broadcast are two essential features of structured overlay networks which used in large scale distributed computing systems and in peer-to-peer networks. The existing broadcast based algorithms over the structured overlays experience certain issues due to a decentralised nature of such networks in which nodes join and leave the network dynamically. This causes poor routing efficiency and high maintenance bandwidth overhead. In this paper, we study routing efficiency and maintenance bandwidth overhead while broadcasting messages over the structured overlay networks in dynamic environment. We also propose an improved message broadcasting algorithm over the structured overlay networks. The simulation results show that although there is a trade off between routing efficiency and maintenance bandwidth, with optimisation we can improve one without severely effecting the other parameter.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116578325","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 : 2015-05-04DOI: 10.1109/COMSNETS.2015.7098733
N. AbdulMajith, S. Sinha
The movement of large numbers of vehicles along the complex network of roads in a city result in interactions between them that become stronger as the traffic density increases. The non-trivial behavior arising from the collective dynamics of vehicles include the occurrence of persistent congestion at different points of the transport network that typically reduce the efficiency of overall traffic flow. In order to understand the mechanisms responsible for the characteristic spatio-temporal patterns of urban traffic, we first need to identify statistically robust features from empirical observations, which one can then try to recreate in computational models of traffic dynamics. In this article, we have analyzed the GPS traces collected round the clock for more than a hundred taxis operating in a major Indian city over a period of 1 month. The available information allows us to precisely measure the periods during which the vehicle is static and when it is moving. We focus on the intermittent patterns of rest and motion that a car exhibits during its passage through city traffic, which provides a window into key aspects of collective dynamics resulting from congestion. We show that the distribution of waiting time, i.e., the period during which a car is static between two successive epochs of movement, has a highly skewed nature. The bulk of the probability distribution appears to follow power-law scaling with exponent value of 1.78. As city traffic has very different densities during peak hours and off-peak hours, we have also investigated this distribution at different times of the day. While the power-law scaling is found to be robust, the exact value of the exponent does change slightly.We have also considered the active time distribution, i.e., the period of movement between two epochs when the car is static, which does not exhibit a power-law signature but rather resembles a inverse Gaussian or a log-logistic distribution. We also look at the recurrence relation between the durations of successive waiting times, as well as, that between active time duration and the duration of the preceding waiting time. Our results can be used to help understand how the statistical properties of large-scale traffic movement over complex road networks which characterize cities deviate from that of other types of collective dynamics, e.g., the diffusion of random walkers.
{"title":"Statistics of stop-and-go traffic: Emergent properties of congestion behavior arising from collective vehicular dynamics in an urban environment","authors":"N. AbdulMajith, S. Sinha","doi":"10.1109/COMSNETS.2015.7098733","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098733","url":null,"abstract":"The movement of large numbers of vehicles along the complex network of roads in a city result in interactions between them that become stronger as the traffic density increases. The non-trivial behavior arising from the collective dynamics of vehicles include the occurrence of persistent congestion at different points of the transport network that typically reduce the efficiency of overall traffic flow. In order to understand the mechanisms responsible for the characteristic spatio-temporal patterns of urban traffic, we first need to identify statistically robust features from empirical observations, which one can then try to recreate in computational models of traffic dynamics. In this article, we have analyzed the GPS traces collected round the clock for more than a hundred taxis operating in a major Indian city over a period of 1 month. The available information allows us to precisely measure the periods during which the vehicle is static and when it is moving. We focus on the intermittent patterns of rest and motion that a car exhibits during its passage through city traffic, which provides a window into key aspects of collective dynamics resulting from congestion. We show that the distribution of waiting time, i.e., the period during which a car is static between two successive epochs of movement, has a highly skewed nature. The bulk of the probability distribution appears to follow power-law scaling with exponent value of 1.78. As city traffic has very different densities during peak hours and off-peak hours, we have also investigated this distribution at different times of the day. While the power-law scaling is found to be robust, the exact value of the exponent does change slightly.We have also considered the active time distribution, i.e., the period of movement between two epochs when the car is static, which does not exhibit a power-law signature but rather resembles a inverse Gaussian or a log-logistic distribution. We also look at the recurrence relation between the durations of successive waiting times, as well as, that between active time duration and the duration of the preceding waiting time. Our results can be used to help understand how the statistical properties of large-scale traffic movement over complex road networks which characterize cities deviate from that of other types of collective dynamics, e.g., the diffusion of random walkers.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130337968","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 : 2015-05-04DOI: 10.1109/COMSNETS.2015.7098719
Suraj Verma, P. Pillai, Yim-Fun Hu
The recent advancements in wireless sensor hardware ensures sensing multiple sensor data such as temperature, pressure, humidity, etc. using a single hardware unit, thus defining it as multi-sensor data communication in wireless sensor networks (WSNs). The in-processing technique of data aggregation is crucial in energy-efficient WSNs; however, with the requirement of end-to-end data confidentiality it may prove to be a challenge. End-to-end data confidentiality along with data aggregation is possible with the implementation of a special type of encryption scheme called privacy homomorphic (PH) encryption schemes. This paper proposes an optimized PH encryption scheme for WSN integrated networks handling multi-sensor data. The proposed scheme ensures light-weight payloads, significant energy and bandwidth consumption along with lower latencies. The performance analysis of the proposed scheme is presented in this paper with respect to the existing scheme. The working principle of the multi-sensor data framework is also presented in this paper along with the appropriate packet structures and process. It can be concluded that the scheme proves to decrease the payload size by 56.86% and spend an average energy of 8-18 mJ at the aggregator node for sensor nodes varying from 10-50 thereby ensuring scalability of the WSN unlike the existing scheme.
{"title":"Energy-efficient privacy homomorphic encryption scheme for multi-sensor data in WSNs","authors":"Suraj Verma, P. Pillai, Yim-Fun Hu","doi":"10.1109/COMSNETS.2015.7098719","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098719","url":null,"abstract":"The recent advancements in wireless sensor hardware ensures sensing multiple sensor data such as temperature, pressure, humidity, etc. using a single hardware unit, thus defining it as multi-sensor data communication in wireless sensor networks (WSNs). The in-processing technique of data aggregation is crucial in energy-efficient WSNs; however, with the requirement of end-to-end data confidentiality it may prove to be a challenge. End-to-end data confidentiality along with data aggregation is possible with the implementation of a special type of encryption scheme called privacy homomorphic (PH) encryption schemes. This paper proposes an optimized PH encryption scheme for WSN integrated networks handling multi-sensor data. The proposed scheme ensures light-weight payloads, significant energy and bandwidth consumption along with lower latencies. The performance analysis of the proposed scheme is presented in this paper with respect to the existing scheme. The working principle of the multi-sensor data framework is also presented in this paper along with the appropriate packet structures and process. It can be concluded that the scheme proves to decrease the payload size by 56.86% and spend an average energy of 8-18 mJ at the aggregator node for sensor nodes varying from 10-50 thereby ensuring scalability of the WSN unlike the existing scheme.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128677276","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 : 2015-05-04DOI: 10.1109/COMSNETS.2015.7098729
P. Pandey, Bibhas Adhikari, Ruchir Gupta
In this paper, we propose a distorted information diffusion protocol to detect diversity of different network models. The protocol is inspired by the fact that, in real social networks, the information diffusion get influenced by the property of nodes and conduct of the links. Thus, information get deformed/distorted during diffusion process and true amount of information from a spreader never reach to all the nodes in the network. We consider a single spreader which has maximum degree in the network. We divide the entire network in to different layers where the nodes in a layer are defined by the nodes having a fixed distance from the spreader. We observe that the amount of information available at every node in a layer after the diffusion process reaches to saturation, is not equal. Thus, we define density of information profile of a layer that measures the density of information available in a layer. Finally, we define a vector, which we call information diversity vector whose components are density of information of the layers. The dimension of the diversity vector is the number of layers in the entire network. We implement the protocol in standard network models which include Albert-Barabasi preferential attachment Model (ABM), Hierarchical network generation Model (HM), and Watts-Strogatz Model (WSM). We also simulate the protocol in real world networks which include ego-Facebook Network, Collaboration network of ArXiv General Relativity, and Collaboration network of ArXiv High Energy Physics Theory. The simulated results show that the information diversity vectors of ABM and HM is far from reflecting the same in real world networks. However, diversity vector of WSM is similar to that of real world networks which we consider in this paper.
{"title":"Measuring diversity of network models using distorted information diffusion process","authors":"P. Pandey, Bibhas Adhikari, Ruchir Gupta","doi":"10.1109/COMSNETS.2015.7098729","DOIUrl":"https://doi.org/10.1109/COMSNETS.2015.7098729","url":null,"abstract":"In this paper, we propose a distorted information diffusion protocol to detect diversity of different network models. The protocol is inspired by the fact that, in real social networks, the information diffusion get influenced by the property of nodes and conduct of the links. Thus, information get deformed/distorted during diffusion process and true amount of information from a spreader never reach to all the nodes in the network. We consider a single spreader which has maximum degree in the network. We divide the entire network in to different layers where the nodes in a layer are defined by the nodes having a fixed distance from the spreader. We observe that the amount of information available at every node in a layer after the diffusion process reaches to saturation, is not equal. Thus, we define density of information profile of a layer that measures the density of information available in a layer. Finally, we define a vector, which we call information diversity vector whose components are density of information of the layers. The dimension of the diversity vector is the number of layers in the entire network. We implement the protocol in standard network models which include Albert-Barabasi preferential attachment Model (ABM), Hierarchical network generation Model (HM), and Watts-Strogatz Model (WSM). We also simulate the protocol in real world networks which include ego-Facebook Network, Collaboration network of ArXiv General Relativity, and Collaboration network of ArXiv High Energy Physics Theory. The simulated results show that the information diversity vectors of ABM and HM is far from reflecting the same in real world networks. However, diversity vector of WSM is similar to that of real world networks which we consider in this paper.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"268 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121351309","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
扫码关注我们
求助内容：
应助结果提醒方式：