Pub Date : 2013-12-01DOI: 10.1109/ANTS.2013.6802859
Manish Chaturvedi, S. Srivastava
Availability of city wide accurate traffic information enables optimal flow of vehicles in a road network. Intelligent Transportation Systems (ITS) play major role in generating fine grained traffic information. However, in developing countries like India, limited ITS infrastructure is available and city wide manual traffic surveys are the basic source of traffic information. Manual traffic surveys are carried out by government agencies once every year or even less frequently and this instantaneous traffic information is extrapolated to presume traffic condition in a region for the whole year. The generated traffic information has limited application and government generally use it for planning transportation infrastructure development. Cellular infrastructure is widely deployed in India. As per TRAI Press Release No. 38/2013, there are more than 867 million cellular connections in India and cellular density is reported to be more than 70% [1]. Aim of our work is to study feasibility of using cellular infrastructure to generate useful traffic information. Our preliminary experiment with a vehicle carrying GSM modem shows that it is possible to track regions through which vehicle traverses just by using raw data about cell ID updates. The experiment also establishes need for a sophisticated map matching algorithm for determining exact route of a vehicle. We develop a map matching algorithm which can work with large location errors and show using simulations that it is possible to generate useful traffic information such as origin-destination of a trip, route and duration of a trip with in reasonable error bounds even with location error of 250-500 meters. However, for generating accurate travel time estimates for individual road segments, lower location error bounds are needed.
{"title":"Real time vehicular traffic estimation using cellular infrastructure","authors":"Manish Chaturvedi, S. Srivastava","doi":"10.1109/ANTS.2013.6802859","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802859","url":null,"abstract":"Availability of city wide accurate traffic information enables optimal flow of vehicles in a road network. Intelligent Transportation Systems (ITS) play major role in generating fine grained traffic information. However, in developing countries like India, limited ITS infrastructure is available and city wide manual traffic surveys are the basic source of traffic information. Manual traffic surveys are carried out by government agencies once every year or even less frequently and this instantaneous traffic information is extrapolated to presume traffic condition in a region for the whole year. The generated traffic information has limited application and government generally use it for planning transportation infrastructure development. Cellular infrastructure is widely deployed in India. As per TRAI Press Release No. 38/2013, there are more than 867 million cellular connections in India and cellular density is reported to be more than 70% [1]. Aim of our work is to study feasibility of using cellular infrastructure to generate useful traffic information. Our preliminary experiment with a vehicle carrying GSM modem shows that it is possible to track regions through which vehicle traverses just by using raw data about cell ID updates. The experiment also establishes need for a sophisticated map matching algorithm for determining exact route of a vehicle. We develop a map matching algorithm which can work with large location errors and show using simulations that it is possible to generate useful traffic information such as origin-destination of a trip, route and duration of a trip with in reasonable error bounds even with location error of 250-500 meters. However, for generating accurate travel time estimates for individual road segments, lower location error bounds are needed.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115760363","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 : 2013-12-01DOI: 10.1109/ANTS.2013.6802863
S. Savas, F. Dikbiyik, M. F. Habib, B. Mukherjee
Disasters may cause large-area failures in high-capacity telecom networks, leading to huge data loss. Survivable service provisioning is crucial to minimize the effects of network / datacenter failures and maintain critical services in case of a disaster. We propose a novel disaster-aware service-provisioning scheme that multiplexes service over multiple paths destined to multiple servers/datacenters with manycasting. Our scheme maintains some bandwidth (i.e., reduced service) after a disaster failure vs. no service at all. Numerical examples show that our approach offers high level of survivability against link and node failures that may be caused by disasters and post-disaster failures at no extra cost compared to the other survivable schemes.
{"title":"Disaster-aware service provisioning by exploiting multipath routing with manycasting in telecom networks","authors":"S. Savas, F. Dikbiyik, M. F. Habib, B. Mukherjee","doi":"10.1109/ANTS.2013.6802863","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802863","url":null,"abstract":"Disasters may cause large-area failures in high-capacity telecom networks, leading to huge data loss. Survivable service provisioning is crucial to minimize the effects of network / datacenter failures and maintain critical services in case of a disaster. We propose a novel disaster-aware service-provisioning scheme that multiplexes service over multiple paths destined to multiple servers/datacenters with manycasting. Our scheme maintains some bandwidth (i.e., reduced service) after a disaster failure vs. no service at all. Numerical examples show that our approach offers high level of survivability against link and node failures that may be caused by disasters and post-disaster failures at no extra cost compared to the other survivable schemes.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131396549","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 : 2013-12-01DOI: 10.1109/ANTS.2013.6802882
Siddharth Srivastava, Aritra Sarkar, B. S. Manoj
Robots exploring unknown terrains autonomously always face the threat of getting isolated or lost from the rest. Geo-coordination technologies such as GPS cannot be used in extra terrestrial situations. Therefore, an inbuilt mechanism is needed in the robot that helps to track the robot's position and prevents it from getting off the network's coverage. We define hazard-control as the task of executing a series of decisions for recovering lost robots and bringing them back to the robotic swarm network. For a swarm of robots, this task involves communicating with other robots in the system to make sure that all the robots are within the range of the multi-hop network formed by the robots. If one robot goes away of the robotic network, hazard-control algorithms help the robots to recover the lost robot back in the network. We propose three robot-centric hazard control algorithms that help to get the lost robot in a robotic swarm back in the network: (i) Random Motion algorithm, (ii) Variable Spiral algorithm, and (iii) Motion Reversal algorithm. We study the performance of the proposed algorithms, compared their efficiency and identify the scenarios where each algorithm is most suited.
{"title":"Hazard control algorithms for heterogenous multi-agent cloud-enabled robotic network","authors":"Siddharth Srivastava, Aritra Sarkar, B. S. Manoj","doi":"10.1109/ANTS.2013.6802882","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802882","url":null,"abstract":"Robots exploring unknown terrains autonomously always face the threat of getting isolated or lost from the rest. Geo-coordination technologies such as GPS cannot be used in extra terrestrial situations. Therefore, an inbuilt mechanism is needed in the robot that helps to track the robot's position and prevents it from getting off the network's coverage. We define hazard-control as the task of executing a series of decisions for recovering lost robots and bringing them back to the robotic swarm network. For a swarm of robots, this task involves communicating with other robots in the system to make sure that all the robots are within the range of the multi-hop network formed by the robots. If one robot goes away of the robotic network, hazard-control algorithms help the robots to recover the lost robot back in the network. We propose three robot-centric hazard control algorithms that help to get the lost robot in a robotic swarm back in the network: (i) Random Motion algorithm, (ii) Variable Spiral algorithm, and (iii) Motion Reversal algorithm. We study the performance of the proposed algorithms, compared their efficiency and identify the scenarios where each algorithm is most suited.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131315812","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 : 2013-12-01DOI: 10.1109/ANTS.2013.6802881
Sifat Ferdousi, F. Dikbiyik, M. F. Habib, B. Mukherjee
Recent occurrences of disasters and targeted attacks have made disaster-resilient data-center network design an important issue. Network operators are investigating proactive and reactive measures to avoid huge data loss and service disruptions in case of a disaster. Disaster-aware data-center and content placement can mitigate the effects of such failures by avoiding placement in disaster-vulnerable locations. Compared to disaster-unaware approach, this approach can significantly reduce the risk, i.e., expected loss of content due to a disaster, in a cloud network.
{"title":"Disaster-aware data-center and content placement in cloud networks","authors":"Sifat Ferdousi, F. Dikbiyik, M. F. Habib, B. Mukherjee","doi":"10.1109/ANTS.2013.6802881","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802881","url":null,"abstract":"Recent occurrences of disasters and targeted attacks have made disaster-resilient data-center network design an important issue. Network operators are investigating proactive and reactive measures to avoid huge data loss and service disruptions in case of a disaster. Disaster-aware data-center and content placement can mitigate the effects of such failures by avoiding placement in disaster-vulnerable locations. Compared to disaster-unaware approach, this approach can significantly reduce the risk, i.e., expected loss of content due to a disaster, in a cloud network.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115563297","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 : 2013-12-01DOI: 10.1109/ANTS.2013.6802843
Suvadip Batabyal, Parama Bhaumik
Lack of global knowledge in a delay tolerant network proves detrimental, for a replication based routing strategy, in terms of resource utilization. It has often been noticed that nodes keep on replicating a message although it has already been delivered to the destination since such information remains unknown to most of the nodes in the network. Moreover recovery mechanisms (like VACCINE for epidemic routing) take time to propagate and incur additional transmission overhead. Global information such as number of nodes in the network, node meeting schedule, and whether a message has already been delivered to the destination is vital for optimal network performance. In this paper we propose model for estimating some of these vital information and show that replication based routing algorithm like epidemic routing, can perform better with minimum resource utilization. First, we use a uniformly minimum variance unbiased estimator (UMVUE) to estimate the number of nodes in the network. Second, we estimate the number of replicas of any given message in the network, at any given instant (t). Third, we show that epidemic routing with a node population of N can perform best with only N/2 message replicas for any given message and that further replication only leads additional overhead without any performance improvement. We show the simulated results using random waypoint mobility model and Shanghai taxi trace.
{"title":"Estimators for global information in mobile opportunistic network","authors":"Suvadip Batabyal, Parama Bhaumik","doi":"10.1109/ANTS.2013.6802843","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802843","url":null,"abstract":"Lack of global knowledge in a delay tolerant network proves detrimental, for a replication based routing strategy, in terms of resource utilization. It has often been noticed that nodes keep on replicating a message although it has already been delivered to the destination since such information remains unknown to most of the nodes in the network. Moreover recovery mechanisms (like VACCINE for epidemic routing) take time to propagate and incur additional transmission overhead. Global information such as number of nodes in the network, node meeting schedule, and whether a message has already been delivered to the destination is vital for optimal network performance. In this paper we propose model for estimating some of these vital information and show that replication based routing algorithm like epidemic routing, can perform better with minimum resource utilization. First, we use a uniformly minimum variance unbiased estimator (UMVUE) to estimate the number of nodes in the network. Second, we estimate the number of replicas of any given message in the network, at any given instant (t). Third, we show that epidemic routing with a node population of N can perform best with only N/2 message replicas for any given message and that further replication only leads additional overhead without any performance improvement. We show the simulated results using random waypoint mobility model and Shanghai taxi trace.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129593368","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 : 2013-12-01DOI: 10.1109/ANTS.2013.6802846
S. Raman, Kamakoti Veezhinathan, B. Venkat, G. Raina
Ternary Content Addressable Memory (TCAM) is the de-facto standard for route lookup in routers. While TCAMs support fast packet header lookup, they also consume high power. In this paper, we propose algorithms to save power in routers by dynamically switching-on/off TCAM banks based on their usage. Using three timers that monitor the usage of TCAMs, we remove unused entries and save TCAM space. As a result, unused TCAM banks in distributed linecards of routers can be switched-off. The algorithm used to switch-on the TCAM banks ensures that no packets are lost during header lookup, but introduces extra lookup delay. We show that by introducing parallel search for header lookup, the additional delay can be avoided. Simulations, conducted in software, serve to highlight that it is indeed possible to achieve power savings by using the proposed algorithms. The proposed methods are mainly applicable for campus and enterprise networks, where compaction of prefixes can be readily achieved.
{"title":"Using timers to switch-off TCAM banks in routers","authors":"S. Raman, Kamakoti Veezhinathan, B. Venkat, G. Raina","doi":"10.1109/ANTS.2013.6802846","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802846","url":null,"abstract":"Ternary Content Addressable Memory (TCAM) is the de-facto standard for route lookup in routers. While TCAMs support fast packet header lookup, they also consume high power. In this paper, we propose algorithms to save power in routers by dynamically switching-on/off TCAM banks based on their usage. Using three timers that monitor the usage of TCAMs, we remove unused entries and save TCAM space. As a result, unused TCAM banks in distributed linecards of routers can be switched-off. The algorithm used to switch-on the TCAM banks ensures that no packets are lost during header lookup, but introduces extra lookup delay. We show that by introducing parallel search for header lookup, the additional delay can be avoided. Simulations, conducted in software, serve to highlight that it is indeed possible to achieve power savings by using the proposed algorithms. The proposed methods are mainly applicable for campus and enterprise networks, where compaction of prefixes can be readily achieved.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132042732","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 : 2013-12-01DOI: 10.1109/ANTS.2013.6802847
Himal Kumar, H. Gharakheili, V. Sivaraman
Home networks are becoming increasingly complex, with many household devices (PCs tablets, phones, media gateways, smart TVs) and diverse user applications (browsing, video streaming, peer-to-peer, VoIP, gaming) sharing the single broadband access link. In today's architecture the traffic streams compete for bandwidth on a best-effort basis, resulting in poor quality of experience for users. In this paper, we leverage the emerging paradigm of software defined networking (SDN) to enable the ISP to expose some controls to the users to manage service quality for specific devices and applications in their household. Our contributions are to develop an architecture and interface for delegation of such control to the user, and to demonstrate its value via experiments in a laboratory test-bed using three representative applications: video, web-browsing, and large downloads.
{"title":"User control of quality of experience in home networks using SDN","authors":"Himal Kumar, H. Gharakheili, V. Sivaraman","doi":"10.1109/ANTS.2013.6802847","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802847","url":null,"abstract":"Home networks are becoming increasingly complex, with many household devices (PCs tablets, phones, media gateways, smart TVs) and diverse user applications (browsing, video streaming, peer-to-peer, VoIP, gaming) sharing the single broadband access link. In today's architecture the traffic streams compete for bandwidth on a best-effort basis, resulting in poor quality of experience for users. In this paper, we leverage the emerging paradigm of software defined networking (SDN) to enable the ISP to expose some controls to the users to manage service quality for specific devices and applications in their household. Our contributions are to develop an architecture and interface for delegation of such control to the user, and to demonstrate its value via experiments in a laboratory test-bed using three representative applications: video, web-browsing, and large downloads.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132303609","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 : 2013-12-01DOI: 10.1109/ANTS.2013.6802848
Vanniarajan Chellappan, K. Krithivasan
This paper proposes a heuristic approach for the distance realization problem, which arises in Network Tomography. Network Tomography is the study of estimating internal network structure and link-level performance from end-to-end measurements. A distance realization problem is to reconstruct a graph or topology from its distance matrix, i.e., the matrix containing the pairwise distances between the terminal nodes. The graph, thus realized from the pairwise distances of terminal nodes, can either be a tree or a general graph. There are efficient polynomial algorithms developed for the case of tree realization. However, the problem of finding optimal realization (i.e., the total length of the graph realized is minimum) of distance matrix for a general graph is shown to be NP-hard. Our proposed heuristic approach for distance realization consists of three stages: (i) find a closer tree realizable distance matrix based on the shortest paths, (ii) construct a tree and (iii) fix the differences between the tree realizable distance matrix and the original distance matrix. It also attempts to maximize the `entropy of betweenness-centrality' measure in the network while satisfying the distance constraints.
{"title":"Distance realization problem in Network Tomography: A heuristic approach","authors":"Vanniarajan Chellappan, K. Krithivasan","doi":"10.1109/ANTS.2013.6802848","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802848","url":null,"abstract":"This paper proposes a heuristic approach for the distance realization problem, which arises in Network Tomography. Network Tomography is the study of estimating internal network structure and link-level performance from end-to-end measurements. A distance realization problem is to reconstruct a graph or topology from its distance matrix, i.e., the matrix containing the pairwise distances between the terminal nodes. The graph, thus realized from the pairwise distances of terminal nodes, can either be a tree or a general graph. There are efficient polynomial algorithms developed for the case of tree realization. However, the problem of finding optimal realization (i.e., the total length of the graph realized is minimum) of distance matrix for a general graph is shown to be NP-hard. Our proposed heuristic approach for distance realization consists of three stages: (i) find a closer tree realizable distance matrix based on the shortest paths, (ii) construct a tree and (iii) fix the differences between the tree realizable distance matrix and the original distance matrix. It also attempts to maximize the `entropy of betweenness-centrality' measure in the network while satisfying the distance constraints.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126342414","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 : 2013-12-01DOI: 10.1109/ANTS.2013.6802875
N. Arulselvan, Manjari Chhawchharia, Moushumi Sen
The need for Inter-cell Interference Coordination (ICIC) schemes in LTE heterogeneous networks, is well elucidated in literature [1]. We consider distributed scheduling mechanisms so that multiple base-station vendors can co-exist. Moreover, in legacy LTE networks, fast timescale coordination across base-stations may not be possible due to the inherent backhaul latency. In such a framework, we study the relative performance of frequency-domain and time-domain interference coordination schemes. We also compare the performance of legacy users who are agnostic to the ICIC scheme employed by the network, with users who can intelligently report channel measurements, depending on the param-eters used in the ICIC scheme. Surprisingly, we find that network can efficiently compensate for the legacy user's inadequacy in reporting. Overall, these studies can help the cellular operator to prioritize the strategy for network evolution and decide the timelines to offer advanced user equipment.
{"title":"Time-domain and frequency-domain muting schemes for interference co-ordination in LTE heterogeneous networks","authors":"N. Arulselvan, Manjari Chhawchharia, Moushumi Sen","doi":"10.1109/ANTS.2013.6802875","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802875","url":null,"abstract":"The need for Inter-cell Interference Coordination (ICIC) schemes in LTE heterogeneous networks, is well elucidated in literature [1]. We consider distributed scheduling mechanisms so that multiple base-station vendors can co-exist. Moreover, in legacy LTE networks, fast timescale coordination across base-stations may not be possible due to the inherent backhaul latency. In such a framework, we study the relative performance of frequency-domain and time-domain interference coordination schemes. We also compare the performance of legacy users who are agnostic to the ICIC scheme employed by the network, with users who can intelligently report channel measurements, depending on the param-eters used in the ICIC scheme. Surprisingly, we find that network can efficiently compensate for the legacy user's inadequacy in reporting. Overall, these studies can help the cellular operator to prioritize the strategy for network evolution and decide the timelines to offer advanced user equipment.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126517191","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 : 2013-12-01DOI: 10.1109/ANTS.2013.6802866
B. S. Adiga, M. Rajan, Ravishankara Shastry, V. Shivraj, P. Balamuralidhar
Application of cryptography for secure Wireless Sensor Networks poses challenging problems because all the cryptographic algorithms are computationally intensive and wireless nodes have limited resources. In this paper, we describe an Identity Based Elliptic Curve Cryptosystem (IBE-ECC) based on Tate pairing which is lightweight without any Public Key Infrastructure (PKI) and no key exchanges. In addition, we propose a novel lightweight IBE-ECC scheme in which encryption is performed with no Tate pairing (computationally intensive) and is used only in decryption. This scheme is relevant for wireless nodes and in particular for Internet of Things (IoT) framework, wherein the wireless nodes do only message encryption, whereas the decryption is delegated to centralized servers or Gateways. We have also implemented our proposed scheme on a mobile phone with android platform for performance analysis. We observed that our proposed IBE-ECC scheme outperforms the existing IBE scheme in terms of complexity and efficiency of operation. Further, our scheme is based on super singular elliptic curves E/GF(p) where p is a special prime of the form Crandall primes. For such primes modular reduction can be implemented efficiently fast using Mohan-Adiga algorithm.
{"title":"Lightweight IBE scheme for Wireless Sensor nodes","authors":"B. S. Adiga, M. Rajan, Ravishankara Shastry, V. Shivraj, P. Balamuralidhar","doi":"10.1109/ANTS.2013.6802866","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802866","url":null,"abstract":"Application of cryptography for secure Wireless Sensor Networks poses challenging problems because all the cryptographic algorithms are computationally intensive and wireless nodes have limited resources. In this paper, we describe an Identity Based Elliptic Curve Cryptosystem (IBE-ECC) based on Tate pairing which is lightweight without any Public Key Infrastructure (PKI) and no key exchanges. In addition, we propose a novel lightweight IBE-ECC scheme in which encryption is performed with no Tate pairing (computationally intensive) and is used only in decryption. This scheme is relevant for wireless nodes and in particular for Internet of Things (IoT) framework, wherein the wireless nodes do only message encryption, whereas the decryption is delegated to centralized servers or Gateways. We have also implemented our proposed scheme on a mobile phone with android platform for performance analysis. We observed that our proposed IBE-ECC scheme outperforms the existing IBE scheme in terms of complexity and efficiency of operation. Further, our scheme is based on super singular elliptic curves E/GF(p) where p is a special prime of the form Crandall primes. For such primes modular reduction can be implemented efficiently fast using Mohan-Adiga algorithm.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121490357","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
扫码关注我们
求助内容：
应助结果提醒方式：