Pub Date : 2013-05-15DOI: 10.1109/CFIC.2013.6566321
D. Fiems, S. Andreev, Thomas Demoor, H. Bruneel, Y. Koucheryavy, K. De Turck
This paper addresses the effects of power saving mechanisms on cooperation in wireless networks. Cooperation by relaying data of other wireless nodes is crucial in (next-generation) wireless networks as it can greatly attribute to ensuring connectivity, reliability, performance, etc. As power saving relies on sleep mode, turning off the communication subsystem for predetermined amounts of time, it can greatly affect data relaying as a cooperator node may not be awake when there is data to relay. Rather than modelling one of the wireless protocols in detail, we construct a high-level queuing model capturing the two essential characteristics of cooperation and energy efficiency: relaying and sleep mode. The used analytical approach allows for accurate performance evaluation and enables us to investigate the trade-off between data relaying and energy efficiency.
{"title":"Analytic evaluation of power saving in cooperative communication","authors":"D. Fiems, S. Andreev, Thomas Demoor, H. Bruneel, Y. Koucheryavy, K. De Turck","doi":"10.1109/CFIC.2013.6566321","DOIUrl":"https://doi.org/10.1109/CFIC.2013.6566321","url":null,"abstract":"This paper addresses the effects of power saving mechanisms on cooperation in wireless networks. Cooperation by relaying data of other wireless nodes is crucial in (next-generation) wireless networks as it can greatly attribute to ensuring connectivity, reliability, performance, etc. As power saving relies on sleep mode, turning off the communication subsystem for predetermined amounts of time, it can greatly affect data relaying as a cooperator node may not be awake when there is data to relay. Rather than modelling one of the wireless protocols in detail, we construct a high-level queuing model capturing the two essential characteristics of cooperation and energy efficiency: relaying and sleep mode. The used analytical approach allows for accurate performance evaluation and enables us to investigate the trade-off between data relaying and energy efficiency.","PeriodicalId":271890,"journal":{"name":"2013 Conference on Future Internet Communications (CFIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129245568","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-05-15DOI: 10.1109/CFIC.2013.6566325
Naércio Magaia, P. Pereira, M. Correia
Vehicular Delay-Tolerant Networks (VDTNs) are composed of mobile nodes that communicate wirelessly with each other to forward data despite connectivity issues. This paper focuses on the problem of some nodes trying to impair the communication of a VDTN. In the paper we study the case of nodes that delay the forwarding of messages that is a particularly difficult to detect form of misbehavior. We study the impact of this form of misbehavior on eight VDTN routing protocols using a large set of simulations and two scenarios. The results show that depending on the type of misbehavior, message replication and intelligent selection of the next hop can help routing protocols to be resilient to node misbehavior.
{"title":"Nodes' misbehavior in Vehicular Delay-Tolerant Networks","authors":"Naércio Magaia, P. Pereira, M. Correia","doi":"10.1109/CFIC.2013.6566325","DOIUrl":"https://doi.org/10.1109/CFIC.2013.6566325","url":null,"abstract":"Vehicular Delay-Tolerant Networks (VDTNs) are composed of mobile nodes that communicate wirelessly with each other to forward data despite connectivity issues. This paper focuses on the problem of some nodes trying to impair the communication of a VDTN. In the paper we study the case of nodes that delay the forwarding of messages that is a particularly difficult to detect form of misbehavior. We study the impact of this form of misbehavior on eight VDTN routing protocols using a large set of simulations and two scenarios. The results show that depending on the type of misbehavior, message replication and intelligent selection of the next hop can help routing protocols to be resilient to node misbehavior.","PeriodicalId":271890,"journal":{"name":"2013 Conference on Future Internet Communications (CFIC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114797630","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-05-15DOI: 10.1109/CFIC.2013.6566319
A. Udugama, Sameera Palipana, C. Goerg
Content Centric Networking (CCN) is an evolving paradigm in networking where communications are based on named content rather than the named hosts model of today's networks. Though CCN is capable of multi-path communications by design, no work has been done to characterise multi-path content transfers in CCN with an analytical model. In this work, we have developed an analytical model to evaluate the performance of multi-path content transfers in CCN. The performance of this model is then compared against a packet level CCN simulator built in OPNET. Round trip times, throughput and download times are obtained for both multi-path and single path to make comparisons of performances. The comparisons indicate that the results obtained from the simulator are in agreement with the results of the analytical model.
{"title":"Analytical characterisation of multi-path content delivery in Content Centric Networks","authors":"A. Udugama, Sameera Palipana, C. Goerg","doi":"10.1109/CFIC.2013.6566319","DOIUrl":"https://doi.org/10.1109/CFIC.2013.6566319","url":null,"abstract":"Content Centric Networking (CCN) is an evolving paradigm in networking where communications are based on named content rather than the named hosts model of today's networks. Though CCN is capable of multi-path communications by design, no work has been done to characterise multi-path content transfers in CCN with an analytical model. In this work, we have developed an analytical model to evaluate the performance of multi-path content transfers in CCN. The performance of this model is then compared against a packet level CCN simulator built in OPNET. Round trip times, throughput and download times are obtained for both multi-path and single path to make comparisons of performances. The comparisons indicate that the results obtained from the simulator are in agreement with the results of the analytical model.","PeriodicalId":271890,"journal":{"name":"2013 Conference on Future Internet Communications (CFIC)","volume":"404 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124313161","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-05-15DOI: 10.1109/CFIC.2013.6566318
A. Dudin, V. Klimenok
We consider a multi-server retrial queueing system with the Batch Markovian Arrival Process and phase type service time distribution. Such a quite general queueing system suits for modeling, e.g., modern wireless communication networks. We assume that arriving customers, which do not succeed to start the service immediately upon arrival due to the lack of available servers, may leave the system forever (balk) or join the orbit for further retrials. Customers in the orbit are impatient (they may leave the system forever after exponentially distributed duration of the stay in the orbit) and non-persistent (they may leave the system forever after any unsuccessful attempt to reach the service). Approach by V. Ramaswami and D. Lucantoni for description of several independent Markov processes in parallel that allows to compute the stationary distribution of the system for large number of servers is used along with the results for multi-dimensional asymptotically quasi-Toeplitz Markov chains for computation of steady state distribution of the system states and some its performance measures.
{"title":"Retrial queue of BMAP/PH/N type with customers balking, impatience and non-persistence","authors":"A. Dudin, V. Klimenok","doi":"10.1109/CFIC.2013.6566318","DOIUrl":"https://doi.org/10.1109/CFIC.2013.6566318","url":null,"abstract":"We consider a multi-server retrial queueing system with the Batch Markovian Arrival Process and phase type service time distribution. Such a quite general queueing system suits for modeling, e.g., modern wireless communication networks. We assume that arriving customers, which do not succeed to start the service immediately upon arrival due to the lack of available servers, may leave the system forever (balk) or join the orbit for further retrials. Customers in the orbit are impatient (they may leave the system forever after exponentially distributed duration of the stay in the orbit) and non-persistent (they may leave the system forever after any unsuccessful attempt to reach the service). Approach by V. Ramaswami and D. Lucantoni for description of several independent Markov processes in parallel that allows to compute the stationary distribution of the system for large number of servers is used along with the results for multi-dimensional asymptotically quasi-Toeplitz Markov chains for computation of steady state distribution of the system states and some its performance measures.","PeriodicalId":271890,"journal":{"name":"2013 Conference on Future Internet Communications (CFIC)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114295961","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-05-15DOI: 10.1109/CFIC.2013.6566324
M. Antunes, D. Gomes, R. Aguiar
Smart environments are physical places that are richly and invisibly populated with sensors, actuators and computational elements. The objective of such environments is to adapt themselves to its users in order to increase their comfort and usefulness. This paper proposes a platform, named APOLLO, capable of inferring behaviour rules from a smart environment and apply them to provide an intelligent space. The APOLLO platform is built upon a Service Oriented Architecture (SOA), in which collected context information is used to infer behaviour rules though statistical and machine learning techniques. The proposed platform is to be deployed in a home automation scenario.
{"title":"Towards behaviour inference in smart environments","authors":"M. Antunes, D. Gomes, R. Aguiar","doi":"10.1109/CFIC.2013.6566324","DOIUrl":"https://doi.org/10.1109/CFIC.2013.6566324","url":null,"abstract":"Smart environments are physical places that are richly and invisibly populated with sensors, actuators and computational elements. The objective of such environments is to adapt themselves to its users in order to increase their comfort and usefulness. This paper proposes a platform, named APOLLO, capable of inferring behaviour rules from a smart environment and apply them to provide an intelligent space. The APOLLO platform is built upon a Service Oriented Architecture (SOA), in which collected context information is used to infer behaviour rules though statistical and machine learning techniques. The proposed platform is to be deployed in a home automation scenario.","PeriodicalId":271890,"journal":{"name":"2013 Conference on Future Internet Communications (CFIC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127909904","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-05-15DOI: 10.1109/CFIC.2013.6566326
O. Salameh, K. De Turck, S. Wittevrongel, S. De Vuyst, H. Bruneel
The first phase in the operation of a Cognitive Radio Network (CRN) is the investigation of the availability of idle channels through channel sensing. In this paper we study the impact of the sensing rate of Secondary Users (SUs) in a CRN. We develop a continuous-time Markov chain (CTMC) to study the effect of the sensing rate σ on the performance measures of the CRN including the expected SU delay, the SU interruption probability, the probability a SU is discarded after entering the system and the SU blocking probability. The obtained results reveal that the sensing rate has a crucial impact on these measures.
{"title":"On the impact of the sensing rate of secondary users in Cognitive Radio Networks","authors":"O. Salameh, K. De Turck, S. Wittevrongel, S. De Vuyst, H. Bruneel","doi":"10.1109/CFIC.2013.6566326","DOIUrl":"https://doi.org/10.1109/CFIC.2013.6566326","url":null,"abstract":"The first phase in the operation of a Cognitive Radio Network (CRN) is the investigation of the availability of idle channels through channel sensing. In this paper we study the impact of the sensing rate of Secondary Users (SUs) in a CRN. We develop a continuous-time Markov chain (CTMC) to study the effect of the sensing rate σ on the performance measures of the CRN including the expected SU delay, the SU interruption probability, the probability a SU is discarded after entering the system and the SU blocking probability. The obtained results reveal that the sensing rate has a crucial impact on these measures.","PeriodicalId":271890,"journal":{"name":"2013 Conference on Future Internet Communications (CFIC)","volume":"49 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132026484","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-05-15DOI: 10.1109/CFIC.2013.6566320
B. Alzahrani, V. Vassilakis, M. Reed
The in-packet Bloom filter forwarding mechanism is a source routing approach used in Information-centric networking (ICN). This mechanism is vulnerable to brute-force attacks that can be used for distributed denial-of-service (DDoS) attacks and unsolicited messages (spam). In this paper we analytically calculate the probability of brute-force attacks and determine the time required by the attacker to launch a successful attack. We find that using scenarios reported by other researchers this type of attacks is achievable in few seconds, which is unacceptable. The paper proposes a solution to mitigate the brute-force attacks by significantly increasing the time before a successful attack. Consequently, it is possible to change link identifiers before the attacker can adapt to the changes. We evaluate the proposed solution in terms of network security and scalability.
{"title":"Mitigating brute-force attacks on Bloom-filter based forwarding","authors":"B. Alzahrani, V. Vassilakis, M. Reed","doi":"10.1109/CFIC.2013.6566320","DOIUrl":"https://doi.org/10.1109/CFIC.2013.6566320","url":null,"abstract":"The in-packet Bloom filter forwarding mechanism is a source routing approach used in Information-centric networking (ICN). This mechanism is vulnerable to brute-force attacks that can be used for distributed denial-of-service (DDoS) attacks and unsolicited messages (spam). In this paper we analytically calculate the probability of brute-force attacks and determine the time required by the attacker to launch a successful attack. We find that using scenarios reported by other researchers this type of attacks is achievable in few seconds, which is unacceptable. The paper proposes a solution to mitigate the brute-force attacks by significantly increasing the time before a successful attack. Consequently, it is possible to change link identifiers before the attacker can adapt to the changes. We evaluate the proposed solution in terms of network security and scalability.","PeriodicalId":271890,"journal":{"name":"2013 Conference on Future Internet Communications (CFIC)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123105724","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-05-15DOI: 10.1109/CFIC.2013.6566322
D. Namiot, M. Schneps-Schneppe
This paper describes a new model for local messaging based on the network proximity. We present a novelty mobile mashup which combines Wi-Fi proximity measurements with Cloud Messaging. Our mobile mashup combines passive monitoring for smart phones and cloud based messaging for mobile operational systems. Passive monitoring can determine the location of mobile subscribers (mobile phones, actually) without the active participation of mobile users. This paper describes how to combine the passive monitoring and notifications.
{"title":"Local messages for smartphones","authors":"D. Namiot, M. Schneps-Schneppe","doi":"10.1109/CFIC.2013.6566322","DOIUrl":"https://doi.org/10.1109/CFIC.2013.6566322","url":null,"abstract":"This paper describes a new model for local messaging based on the network proximity. We present a novelty mobile mashup which combines Wi-Fi proximity measurements with Cloud Messaging. Our mobile mashup combines passive monitoring for smart phones and cloud based messaging for mobile operational systems. Passive monitoring can determine the location of mobile subscribers (mobile phones, actually) without the active participation of mobile users. This paper describes how to combine the passive monitoring and notifications.","PeriodicalId":271890,"journal":{"name":"2013 Conference on Future Internet Communications (CFIC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132700820","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-05-15DOI: 10.1109/CFIC.2013.6566323
Frederico Gonçalves, L. Suresh, Ricardo Lopes Pereira, J. Trindade, T. Vazão
Using a Wireless Sensor Network (WSN) for monitoring single source events, such as volcanic activity, involves many challenges. One of these challenges is that of accurate timer synchronization of the data collecting nodes, so as to ensure that there is a consistent view of the data retrieval times. In this paper we discuss a novel approach for an one-way time synchronization protocol that relies on the use of cross-layer timing information to estimate the accumulated delay since a block of data is created until it is received at the sink node. The accumulated delay is computed using the Application, Network and Link layers in the 802.11b technology. At each node which belongs to a route a Protocol Data Unit (PDU) inserted between the User Datagram Protocol (UDP) header and the application payload, is manipulated in order to accumulate the calculated delay. This delay is iteratively incremented along the path until it is finally provided to the receiving application. The developed protocol provides a fairly accurate estimation of the delay a message experiences through a WSN, adding no extra packets and little data overhead. Our experimental evaluation showed that it is able to determine the end-to-end delay of most messages with an error inferior to 700μs in one hop scenarios and to 1500μs in two hops scenarios.
{"title":"Light-weight time synchronization for Wireless Sensor Networks","authors":"Frederico Gonçalves, L. Suresh, Ricardo Lopes Pereira, J. Trindade, T. Vazão","doi":"10.1109/CFIC.2013.6566323","DOIUrl":"https://doi.org/10.1109/CFIC.2013.6566323","url":null,"abstract":"Using a Wireless Sensor Network (WSN) for monitoring single source events, such as volcanic activity, involves many challenges. One of these challenges is that of accurate timer synchronization of the data collecting nodes, so as to ensure that there is a consistent view of the data retrieval times. In this paper we discuss a novel approach for an one-way time synchronization protocol that relies on the use of cross-layer timing information to estimate the accumulated delay since a block of data is created until it is received at the sink node. The accumulated delay is computed using the Application, Network and Link layers in the 802.11b technology. At each node which belongs to a route a Protocol Data Unit (PDU) inserted between the User Datagram Protocol (UDP) header and the application payload, is manipulated in order to accumulate the calculated delay. This delay is iteratively incremented along the path until it is finally provided to the receiving application. The developed protocol provides a fairly accurate estimation of the delay a message experiences through a WSN, adding no extra packets and little data overhead. Our experimental evaluation showed that it is able to determine the end-to-end delay of most messages with an error inferior to 700μs in one hop scenarios and to 1500μs in two hops scenarios.","PeriodicalId":271890,"journal":{"name":"2013 Conference on Future Internet Communications (CFIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125185205","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-05-15DOI: 10.1109/CFIC.2013.6566327
D. Milic, T. Braun
Greedy routing can be used in mobile ad-hoc networks as geographic routing protocol. This paper proposes to use greedy routing also in overlay networks by positioning overlay nodes into a multi-dimensional Euclidean space. Greedy routing can only be applied when a routing decision makes progress towards the final destination. Our proposed overlay network is built such that there will be always progress at each forwarding node. This is achieved by constructing at each node a so-called nearest neighbor convex set (NNCS). NNCSs can be used for various applications such as multicast routing, service discovery and Quality-of-Service routing. NNCS has been compared with Pastry, another topology-aware overlay network. NNCS has superior relative path stretches indicating the optimality of a path.
{"title":"Guaranteed greedy routing in overlay networks","authors":"D. Milic, T. Braun","doi":"10.1109/CFIC.2013.6566327","DOIUrl":"https://doi.org/10.1109/CFIC.2013.6566327","url":null,"abstract":"Greedy routing can be used in mobile ad-hoc networks as geographic routing protocol. This paper proposes to use greedy routing also in overlay networks by positioning overlay nodes into a multi-dimensional Euclidean space. Greedy routing can only be applied when a routing decision makes progress towards the final destination. Our proposed overlay network is built such that there will be always progress at each forwarding node. This is achieved by constructing at each node a so-called nearest neighbor convex set (NNCS). NNCSs can be used for various applications such as multicast routing, service discovery and Quality-of-Service routing. NNCS has been compared with Pastry, another topology-aware overlay network. NNCS has superior relative path stretches indicating the optimality of a path.","PeriodicalId":271890,"journal":{"name":"2013 Conference on Future Internet Communications (CFIC)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134493673","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
扫码关注我们
求助内容：
应助结果提醒方式：