Pub Date : 2016-12-01DOI: 10.1109/ATNAC.2016.7878783
J. Y. Mambu, Jairo Gutiérrez
When an earthquake hits, the dissemination of tsunami warnings can be crucial in saving lives. Unfortunately, some dissemination channels may be insufficient as they may be affected by the earthquake itself (damaged, loss of power or overloaded), may be expensive to build and are not available at certain places. In this research we propose a tsunami warning dissemination system that can serve as an additional channel to the existing systems. The system is lightweight, affordable, and can be powered autonomously. It disseminates messages to the commonly used GSM handsets and may reach numerous at-risk civilians. This paper also reports on the suggested integration plan of our proposed system within the current disaster management operation procedure in Indonesia. A set of experiments were carried out and they showed that the system has adequately met the users' requirements. It also shows the feasibility of the system to be integrated within the existing operational system and its associated early warning dissemination channels.
{"title":"Emergency broadcast system: A reverse 911 tsunami information dissemination system prototype","authors":"J. Y. Mambu, Jairo Gutiérrez","doi":"10.1109/ATNAC.2016.7878783","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878783","url":null,"abstract":"When an earthquake hits, the dissemination of tsunami warnings can be crucial in saving lives. Unfortunately, some dissemination channels may be insufficient as they may be affected by the earthquake itself (damaged, loss of power or overloaded), may be expensive to build and are not available at certain places. In this research we propose a tsunami warning dissemination system that can serve as an additional channel to the existing systems. The system is lightweight, affordable, and can be powered autonomously. It disseminates messages to the commonly used GSM handsets and may reach numerous at-risk civilians. This paper also reports on the suggested integration plan of our proposed system within the current disaster management operation procedure in Indonesia. A set of experiments were carried out and they showed that the system has adequately met the users' requirements. It also shows the feasibility of the system to be integrated within the existing operational system and its associated early warning dissemination channels.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125359573","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878820
M. A. Arfeen, K. Pawlikowski, A. Willig, D. McNickle
The statistical properties of traffic in Internet access networks have long been of interest to networking researchers and practitioners. In this paper, we analyse network traffic originating and terminating from various types of Internet access networks (Ethernet, Digital Subscriber Line, Wireless hotspot and their next tier Internet Service Provider's core network) and show that renewal processes having heavy-tail distributed interarrival times (also known as fractal renewal processes) have a great potential in capturing statistical properties of traffic in access networks.
{"title":"Fractal renewal process based analysis of emerging network traffic in access networks","authors":"M. A. Arfeen, K. Pawlikowski, A. Willig, D. McNickle","doi":"10.1109/ATNAC.2016.7878820","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878820","url":null,"abstract":"The statistical properties of traffic in Internet access networks have long been of interest to networking researchers and practitioners. In this paper, we analyse network traffic originating and terminating from various types of Internet access networks (Ethernet, Digital Subscriber Line, Wireless hotspot and their next tier Internet Service Provider's core network) and show that renewal processes having heavy-tail distributed interarrival times (also known as fractal renewal processes) have a great potential in capturing statistical properties of traffic in access networks.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115518117","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878793
David Airehrour, Jairo Gutiérrez, S. K. Ray
This research addresses blackhole routing attacks —a fundamental security attack on the routing of data in IoT networks. Most IoT devices today, from medical devices to connected vehicles and even smart buildings, come bundled with the capability of communicating wirelessly with one another. Consumers are progressively embracing the concept of connected devices while recent studies indicate that security is not high on the priority list of manufacturers especially in the way these devices route and communicate data amongst themselves thus, leaving the door wide open to attacks and compromises. We propose a trust-based RPL routing protocol, which addresses the blackhole attacks. We show that our proposed system is both secure from blackhole attacks while not imposing undue overheads on network traffic.
{"title":"Securing RPL routing protocol from blackhole attacks using a trust-based mechanism","authors":"David Airehrour, Jairo Gutiérrez, S. K. Ray","doi":"10.1109/ATNAC.2016.7878793","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878793","url":null,"abstract":"This research addresses blackhole routing attacks —a fundamental security attack on the routing of data in IoT networks. Most IoT devices today, from medical devices to connected vehicles and even smart buildings, come bundled with the capability of communicating wirelessly with one another. Consumers are progressively embracing the concept of connected devices while recent studies indicate that security is not high on the priority list of manufacturers especially in the way these devices route and communicate data amongst themselves thus, leaving the door wide open to attacks and compromises. We propose a trust-based RPL routing protocol, which addresses the blackhole attacks. We show that our proposed system is both secure from blackhole attacks while not imposing undue overheads on network traffic.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124247349","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878774
S. Zareei, Jeremiah D. Deng
The idea of employing scavenged power from human daily routines to run electronic devices are attracting increased attention of many researchers worldwide. However, there is still limited knowledge of energy characteristics generated by human motions. Moreover, level of human activities vary during a day from sitting for several hours to running on a treadmill. This highlights a vital need for energy management strategies. Hence, in this paper, we analyse more than 200 hours of day-scale human activities collected from 5 participants in 25 days. We divide energy generated by human daily routines into mild and intense activities. Subsequently, we develop an energy management policy which estimates required time for a device to store needed power between each active interval. We also evaluate the validity of our model using real world data. The results present an understanding towards a design of energy harvesting fitness gadgets.
{"title":"Energy management policy for fitness gadgets: A case study of human daily routines","authors":"S. Zareei, Jeremiah D. Deng","doi":"10.1109/ATNAC.2016.7878774","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878774","url":null,"abstract":"The idea of employing scavenged power from human daily routines to run electronic devices are attracting increased attention of many researchers worldwide. However, there is still limited knowledge of energy characteristics generated by human motions. Moreover, level of human activities vary during a day from sitting for several hours to running on a treadmill. This highlights a vital need for energy management strategies. Hence, in this paper, we analyse more than 200 hours of day-scale human activities collected from 5 participants in 25 days. We divide energy generated by human daily routines into mild and intense activities. Subsequently, we develop an energy management policy which estimates required time for a device to store needed power between each active interval. We also evaluate the validity of our model using real world data. The results present an understanding towards a design of energy harvesting fitness gadgets.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129512211","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878819
H. Tokel, G. Alirezaei, R. Mathar
A large-scale roll-out of a communication and measurement infrastructure is an essential prerequisite for more efficient and robust power grids with a high number of renewable energy resources. In this work, we propose an integrated optimization model for the minimum cost design of a wide area measurement system in smart power grids. The planning approaches proposed so far in the literature mostly consider the optimal placement of measurement devices and the design of a communication network independently, and assume the existence of only one communication technology. In contrast, our proposed novel model enables an integrated planning with a minimum number of both data concentrator and measurement units for observability of the whole power system, and a hierarchical heterogeneous communication network design under data communication requirements of delay and capacity. The application of the proposed model on test networks validates the reduction of the deployment and operational costs as a result of the integrated modeling.
{"title":"Integrated network design for measurement and communication infrastructures in smart grids","authors":"H. Tokel, G. Alirezaei, R. Mathar","doi":"10.1109/ATNAC.2016.7878819","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878819","url":null,"abstract":"A large-scale roll-out of a communication and measurement infrastructure is an essential prerequisite for more efficient and robust power grids with a high number of renewable energy resources. In this work, we propose an integrated optimization model for the minimum cost design of a wide area measurement system in smart power grids. The planning approaches proposed so far in the literature mostly consider the optimal placement of measurement devices and the design of a communication network independently, and assume the existence of only one communication technology. In contrast, our proposed novel model enables an integrated planning with a minimum number of both data concentrator and measurement units for observability of the whole power system, and a hierarchical heterogeneous communication network design under data communication requirements of delay and capacity. The application of the proposed model on test networks validates the reduction of the deployment and operational costs as a result of the integrated modeling.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127359930","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878772
B. Fraser, R. Hunjet
Swarming and emergent behaviour techniques can offer simple control schemes for the organisation of many nodes, with little communications overhead and processing time. These mechanisms are robust against node losses, and are able to run on cheap, disposable platforms. For these reasons, we argue that these techniques are well suited to the tactical environment. This paper examines the usefulness of swarming techniques to address data ferrying in fragmented networks to provide delay-tolerant type communications. Simulation results from static, regular and irregular network topologies, and a dynamic topology representing a fictitious amphibious landing scenario show encouraging results in coordinating data ferries in a disconnected environment.
{"title":"Data ferrying in tactical networks using swarm intelligence and stigmergic coordination","authors":"B. Fraser, R. Hunjet","doi":"10.1109/ATNAC.2016.7878772","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878772","url":null,"abstract":"Swarming and emergent behaviour techniques can offer simple control schemes for the organisation of many nodes, with little communications overhead and processing time. These mechanisms are robust against node losses, and are able to run on cheap, disposable platforms. For these reasons, we argue that these techniques are well suited to the tactical environment. This paper examines the usefulness of swarming techniques to address data ferrying in fragmented networks to provide delay-tolerant type communications. Simulation results from static, regular and irregular network topologies, and a dynamic topology representing a fictitious amphibious landing scenario show encouraging results in coordinating data ferries in a disconnected environment.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126912312","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878802
Andrew Curtis-Black, A. Willig, M. Galster
Network policy description languages (PDLs) enable the unambiguous specification of network behaviour. Due to the increasing number of PDLs and new and emerging network paradigms (eg: software defined networking) there is a need for tools to analyze these languages in an effective, efficient, and consistent manner. In this paper we present a taxonomy for policy description languages to help compare, understand, and create PDLs. This taxonomy is based on the policy-based network management (PBNM) literature and on consultations with industry experts, and has been validated by applying it to three PDLs (Ponder, Ponder2 and Kinetic). From this application we determine that all three PDLs promote reusability, maintainability and scalability, and that Ponder2 is easier to use in practice.
{"title":"A taxonomy for network policy description languages","authors":"Andrew Curtis-Black, A. Willig, M. Galster","doi":"10.1109/ATNAC.2016.7878802","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878802","url":null,"abstract":"Network policy description languages (PDLs) enable the unambiguous specification of network behaviour. Due to the increasing number of PDLs and new and emerging network paradigms (eg: software defined networking) there is a need for tools to analyze these languages in an effective, efficient, and consistent manner. In this paper we present a taxonomy for policy description languages to help compare, understand, and create PDLs. This taxonomy is based on the policy-based network management (PBNM) literature and on consultations with industry experts, and has been validated by applying it to three PDLs (Ponder, Ponder2 and Kinetic). From this application we determine that all three PDLs promote reusability, maintainability and scalability, and that Ponder2 is easier to use in practice.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122308546","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878809
John Robert Mendoza, Josuel Racca, Isabel Montes, R. Ocampo, C. Festin
Network operators need to assess the effects of routing policies and traffic engineering methods in order to guide planning and operational decisions related to peering. We propose a peering analysis framework based on the correlation of inferred AS paths and traffic flow information. We define the data sets needed and a four-step methodology designed to reduce network data dimensionality, determine traffic proximity, identify traffic propensity, and quantify the impact of traffic locality. We demonstrate how the correlation of traffic flow and AS paths, and the application of our four-step approach, uncovers rich information when applied to a real-world case study of a local Internet service provider.
{"title":"Peering into peering: Building better tools for better peering decisions","authors":"John Robert Mendoza, Josuel Racca, Isabel Montes, R. Ocampo, C. Festin","doi":"10.1109/ATNAC.2016.7878809","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878809","url":null,"abstract":"Network operators need to assess the effects of routing policies and traffic engineering methods in order to guide planning and operational decisions related to peering. We propose a peering analysis framework based on the correlation of inferred AS paths and traffic flow information. We define the data sets needed and a four-step methodology designed to reduce network data dimensionality, determine traffic proximity, identify traffic propensity, and quantify the impact of traffic locality. We demonstrate how the correlation of traffic flow and AS paths, and the application of our four-step approach, uncovers rich information when applied to a real-world case study of a local Internet service provider.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124995226","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878794
M. N. Sakib, Chin-Tser Huang
The availability of GPS in smartphones and other wireless devices has made location based services extremely popular. One of the most widely used location based services is finding nearby friends. Popular social networks like Facebook offer this service purely based on exact user locations. To subscribe to this feature, users are forced to let the service provider know their actual locations, compromising their location privacy. In this paper, we present a protocol based on elliptic curve cryptography concepts for proximity testing which can preserve location privacy of the users. Our protocol enables two parties, Alice and Bob, to test whether they are within an agreed upon distance range from each other without revealing their exact location. Our security analysis shows that our protocol is secure against most known location privacy threats including location triangulation attacks. From experimental evaluation performed on prototype implementation, we found that our protocol is practical for resource-constrained smartphone devices requiring a reasonably small execution time (53 ms) without the communication overhead.
{"title":"Privacy preserving proximity testing using elliptic curves","authors":"M. N. Sakib, Chin-Tser Huang","doi":"10.1109/ATNAC.2016.7878794","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878794","url":null,"abstract":"The availability of GPS in smartphones and other wireless devices has made location based services extremely popular. One of the most widely used location based services is finding nearby friends. Popular social networks like Facebook offer this service purely based on exact user locations. To subscribe to this feature, users are forced to let the service provider know their actual locations, compromising their location privacy. In this paper, we present a protocol based on elliptic curve cryptography concepts for proximity testing which can preserve location privacy of the users. Our protocol enables two parties, Alice and Bob, to test whether they are within an agreed upon distance range from each other without revealing their exact location. Our security analysis shows that our protocol is secure against most known location privacy threats including location triangulation attacks. From experimental evaluation performed on prototype implementation, we found that our protocol is practical for resource-constrained smartphone devices requiring a reasonably small execution time (53 ms) without the communication overhead.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"295 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122977079","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878790
F. Wibowo, M. Gregory
Software Defined Networking (SDN) is an approach developed to facilitate next generation computer networking by decoupling the traffic control system from the underlying traffic transmission system. One key focus in the transition of next-generation computer networking is the service management improvement of network connectivity services. Connectivity across the global digital network requires a multi-domain capability. Decoupled of the control plane from data plane is the main character of SDN, along with the programmability for network services, utilizing management controllers. SDN had intrinsic potential to improve how a multi-domain implementation might occur utilizing the programmability capability. In this paper, we provide the outcomes of research into how SDN's decoupled programmable control regime affects the performance of multi-domain connectivity services.
{"title":"Software Defined Networking properties in multi-domain networks","authors":"F. Wibowo, M. Gregory","doi":"10.1109/ATNAC.2016.7878790","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878790","url":null,"abstract":"Software Defined Networking (SDN) is an approach developed to facilitate next generation computer networking by decoupling the traffic control system from the underlying traffic transmission system. One key focus in the transition of next-generation computer networking is the service management improvement of network connectivity services. Connectivity across the global digital network requires a multi-domain capability. Decoupled of the control plane from data plane is the main character of SDN, along with the programmability for network services, utilizing management controllers. SDN had intrinsic potential to improve how a multi-domain implementation might occur utilizing the programmability capability. In this paper, we provide the outcomes of research into how SDN's decoupled programmable control regime affects the performance of multi-domain connectivity services.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"5 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113963328","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
扫码关注我们
求助内容：
应助结果提醒方式：