Pub Date : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928879
B. Cheng, Zhezhuang Xu, Cailian Chen, X. Guan
Due to the high density of node deployment in wireless sensor network, the sensing data of nodes in spatially proximate locations are highly correlated. By effectively exploiting this spatial correlation in the data collection process, unnecessary energy costs for redundant data transmission can be largely reduced. In this paper, we focus on collecting spatial correlated data in multi-sink scenario. The main challenge in this scenario is that data collection process should consider how to exploit the spatial correlation and decide which sink the data are transmitted to at the same time. To address this challenge, we propose an algorithm to select a subset of sensor nodes to represent the whole multi-sink sensor network based on the spatial correlated sensing readings. In this algorithm, only these representatives named sources need to upload their data to the chosen sinks. The problem is firstly formulated as a Binary Integer Linear Programming (BILP). Since the problem is proved to be NP-Complete, two heuristic algorithms are designed for approximation. The simulation results show that the proposed algorithms can largely reduce the number of the sources and then significantly improve energy efficiency.
{"title":"Spatial correlated data collection in wireless sensor networks with multiple sinks","authors":"B. Cheng, Zhezhuang Xu, Cailian Chen, X. Guan","doi":"10.1109/INFCOMW.2011.5928879","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928879","url":null,"abstract":"Due to the high density of node deployment in wireless sensor network, the sensing data of nodes in spatially proximate locations are highly correlated. By effectively exploiting this spatial correlation in the data collection process, unnecessary energy costs for redundant data transmission can be largely reduced. In this paper, we focus on collecting spatial correlated data in multi-sink scenario. The main challenge in this scenario is that data collection process should consider how to exploit the spatial correlation and decide which sink the data are transmitted to at the same time. To address this challenge, we propose an algorithm to select a subset of sensor nodes to represent the whole multi-sink sensor network based on the spatial correlated sensing readings. In this algorithm, only these representatives named sources need to upload their data to the chosen sinks. The problem is firstly formulated as a Binary Integer Linear Programming (BILP). Since the problem is proved to be NP-Complete, two heuristic algorithms are designed for approximation. The simulation results show that the proposed algorithms can largely reduce the number of the sources and then significantly improve energy efficiency.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130466041","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928786
Shuhang Liu, Rongqing Zhang, Lingyang Song, Zhu Han, B. Jiao
To ensure security in data transmission is one of the most important issues for wireless relay networks. In this paper, we consider a cooperative network, consisting of one source node, one destination node, one eavesdropper node, and a number of relay nodes. Specifically, the source selects several relay nodes which can help forward the signal to the corresponding destination to achieve the best security performance. However, the relay nodes may have the incentive not to report their true private channel information in order to get more chance to be selected and gain more payoff from the source. We employ a self-enforcing truth-telling mechanism into the network to solve this cheating problem. By adding a transfer payoff to the total payoff of each selected relay node, we prove that each relay node would get its maximum expected payoff only when it tells the truth to the source. And then, an optimal secrecy capacity of the network can be achieved. Simulation results verify the efficiency of the proposed mechanism.
{"title":"Enforce truth-telling in wireless relay networks for secure communication","authors":"Shuhang Liu, Rongqing Zhang, Lingyang Song, Zhu Han, B. Jiao","doi":"10.1109/INFCOMW.2011.5928786","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928786","url":null,"abstract":"To ensure security in data transmission is one of the most important issues for wireless relay networks. In this paper, we consider a cooperative network, consisting of one source node, one destination node, one eavesdropper node, and a number of relay nodes. Specifically, the source selects several relay nodes which can help forward the signal to the corresponding destination to achieve the best security performance. However, the relay nodes may have the incentive not to report their true private channel information in order to get more chance to be selected and gain more payoff from the source. We employ a self-enforcing truth-telling mechanism into the network to solve this cheating problem. By adding a transfer payoff to the total payoff of each selected relay node, we prove that each relay node would get its maximum expected payoff only when it tells the truth to the source. And then, an optimal secrecy capacity of the network can be achieved. Simulation results verify the efficiency of the proposed mechanism.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131021856","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928944
Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, Dacheng Yang
In order to solve the problem that the existing resource allocation strategies cannot give integrative consideration to QoS, spectrum efficiency for mixed traffic, this paper proposes a utility-based resource allocation algorithm for mixed traffic in wireless networks. The unified utility function for users with different traffics is studied first. After that, the optimization model for the resource allocation is established based on the unified utility function. A heuristic algorithm based on the solution of the model is proposed in the mixed traffic scenario after analyzing the optimization model. The algorithm which has lower complexity than the existing work can automatically guarantee the QoS requirement for the real-time traffic and make a tradeoff between throughput and fairness for users with best effort traffic due to the unified utility function. Numeric simulation results indicate that the algorithm is very applicable for mixed traffic, and the resource requirements for QoS users can be satisfied preferentially in the mixed traffic scenario.
{"title":"Utility-based resource allocation for mixed traffic in wireless networks","authors":"Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, Dacheng Yang","doi":"10.1109/INFCOMW.2011.5928944","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928944","url":null,"abstract":"In order to solve the problem that the existing resource allocation strategies cannot give integrative consideration to QoS, spectrum efficiency for mixed traffic, this paper proposes a utility-based resource allocation algorithm for mixed traffic in wireless networks. The unified utility function for users with different traffics is studied first. After that, the optimization model for the resource allocation is established based on the unified utility function. A heuristic algorithm based on the solution of the model is proposed in the mixed traffic scenario after analyzing the optimization model. The algorithm which has lower complexity than the existing work can automatically guarantee the QoS requirement for the real-time traffic and make a tradeoff between throughput and fairness for users with best effort traffic due to the unified utility function. Numeric simulation results indicate that the algorithm is very applicable for mixed traffic, and the resource requirements for QoS users can be satisfied preferentially in the mixed traffic scenario.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131162785","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928900
Liming Xie, X. Jia, Kunxiao Zhou
In this paper, we discuss the causal ordering group communication for cognitive radio (CR) networks. The issue of causal ordering has been studied extensively by previous works. However, these works considered the problem at the application layer and the methods in the works incurred high communication overhead and the long latency for message delivery. In this paper, we discuss the causal ordering at the network layer.The problem of our concern is: given a group communication request in a CR network, how to set up the connection so that the causal ordering of the group communication can be preserved, and the bandwidth consumption of the communication is minimized. We propose a two-phase method to solve it. In the method, we first construct a multicast tree for the communication, and then assign slots for all tree links. It is proved that the method can preserve the causal ordering of messages without extra communication overhead nor the latency for delivering messages. Simulations are conducted to show the performance of our proposed method.
{"title":"Causal ordering group communication for cognitive radio ad hoc networks","authors":"Liming Xie, X. Jia, Kunxiao Zhou","doi":"10.1109/INFCOMW.2011.5928900","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928900","url":null,"abstract":"In this paper, we discuss the causal ordering group communication for cognitive radio (CR) networks. The issue of causal ordering has been studied extensively by previous works. However, these works considered the problem at the application layer and the methods in the works incurred high communication overhead and the long latency for message delivery. In this paper, we discuss the causal ordering at the network layer.The problem of our concern is: given a group communication request in a CR network, how to set up the connection so that the causal ordering of the group communication can be preserved, and the bandwidth consumption of the communication is minimized. We propose a two-phase method to solve it. In the method, we first construct a multicast tree for the communication, and then assign slots for all tree links. It is proved that the method can preserve the causal ordering of messages without extra communication overhead nor the latency for delivering messages. Simulations are conducted to show the performance of our proposed method.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":" 37","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132187428","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928820
Xiaolei Wang, Yanan Bao, Xin Liu, Z. Niu
In this work, we design a relay caching mechanism to improve the energy efficiency in cellular networks, especially for multimedia applications. We consider a single cell with one or more fixed relay stations (RSs) installed near the cell edge. In our design, RSs can receive and cache demanded multimedia content in the cell. After caching, a RS directly serves the users in its coverage area instead of the base station (BS) to reduce energy consumption. In order to find the optimal policy of when and how to cache, we formulate the problem as a Markov decision process (MDP) and obtain the optimal decision table. The numerical results show that the relay caching can save about 15% of total energy. We also present two heuristic policies that perform very close to the optimal one and have low complexity.
{"title":"On the design of relay caching in cellular networks for energy efficiency","authors":"Xiaolei Wang, Yanan Bao, Xin Liu, Z. Niu","doi":"10.1109/INFCOMW.2011.5928820","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928820","url":null,"abstract":"In this work, we design a relay caching mechanism to improve the energy efficiency in cellular networks, especially for multimedia applications. We consider a single cell with one or more fixed relay stations (RSs) installed near the cell edge. In our design, RSs can receive and cache demanded multimedia content in the cell. After caching, a RS directly serves the users in its coverage area instead of the base station (BS) to reduce energy consumption. In order to find the optimal policy of when and how to cache, we formulate the problem as a Markov decision process (MDP) and obtain the optimal decision table. The numerical results show that the relay caching can save about 15% of total energy. We also present two heuristic policies that perform very close to the optimal one and have low complexity.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114769745","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928858
I. Llatser, E. Alarcón, Massimiliano Pierobony
Nanotechnology is enabling the development of devices in a scale ranging from one to a few hundred nanometers, known as nanomachines. How these nanomachines will communicate is still an open debate. Molecular communication is a promising paradigm that has been proposed to implement nanonetworks, i.e., the interconnection of nanomachines. Recent studies have attempted to model the physical channel of molecular communication, mainly from a communication or information-theoretical point of view. In this work, we focus on the diffusion-based molecular communication, whose physical channel is governed by Fick's laws of diffusion. We characterize the molecular channel following two complementary approaches: first, we obtain the channel impulse response, transfer function and group delay; second, we propose a pulse-based modulation scheme and we obtain analytical expressions for the most relevant performance evaluation metrics, which we also validate by simulation. Finally, we compare the scalability of these metrics with their equivalents in a wireless electromagnetic channel. We consider that these results provide interesting insights which may serve designers as a guide to implement future molecular nanonetworks.
{"title":"Diffusion-based channel characterization in molecular nanonetworks","authors":"I. Llatser, E. Alarcón, Massimiliano Pierobony","doi":"10.1109/INFCOMW.2011.5928858","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928858","url":null,"abstract":"Nanotechnology is enabling the development of devices in a scale ranging from one to a few hundred nanometers, known as nanomachines. How these nanomachines will communicate is still an open debate. Molecular communication is a promising paradigm that has been proposed to implement nanonetworks, i.e., the interconnection of nanomachines. Recent studies have attempted to model the physical channel of molecular communication, mainly from a communication or information-theoretical point of view. In this work, we focus on the diffusion-based molecular communication, whose physical channel is governed by Fick's laws of diffusion. We characterize the molecular channel following two complementary approaches: first, we obtain the channel impulse response, transfer function and group delay; second, we propose a pulse-based modulation scheme and we obtain analytical expressions for the most relevant performance evaluation metrics, which we also validate by simulation. Finally, we compare the scalability of these metrics with their equivalents in a wireless electromagnetic channel. We consider that these results provide interesting insights which may serve designers as a guide to implement future molecular nanonetworks.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116453290","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928779
Ho-Yu Lam, Donghan Wang, H. Jonathan Chao
Packet classification is widely used in various network security and operation applications. Two of the main challenges are the increasing number of classification rules, amount of traffic and network line speed. In this paper, we investigate an approximation algorithm for selecting the top- N most frequently matched subset of rules from the original ruleset. The goal is to obtain Top-N rules that covers as much traffic as possible while preserving the dependency relationships. Through simulations, we show that our approaches the optimal while runs in seconds, allowing online adaptation to changing traffic patterns.
{"title":"A traffic-aware top-N firewall approximation algorithm","authors":"Ho-Yu Lam, Donghan Wang, H. Jonathan Chao","doi":"10.1109/INFCOMW.2011.5928779","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928779","url":null,"abstract":"Packet classification is widely used in various network security and operation applications. Two of the main challenges are the increasing number of classification rules, amount of traffic and network line speed. In this paper, we investigate an approximation algorithm for selecting the top- N most frequently matched subset of rules from the original ruleset. The goal is to obtain Top-N rules that covers as much traffic as possible while preserving the dependency relationships. Through simulations, we show that our approaches the optimal while runs in seconds, allowing online adaptation to changing traffic patterns.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122093287","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928806
Hongbin Liang, Dijiang Huang, L. Cai, X. Shen, D. Peng
Mobile cloud is a machine-to-machine service model, where a mobile device can use the cloud for searching, data mining, and multimedia processing. To protect the processed data, security services, i.e., encryption, decryption, authentications, etc., are performed in the cloud. In general, we can classify cloud security services in two categories: Critical Security (CS) service and Normal Security (NS) service. CS service provides strong security protection such as using longer key size, strict security access policies, isolations for protecting data, and so on. The CS service usually occupies more cloud computing resources, however it generates more rewards to the cloud provider since the CS service users need to pay more for using the CS service. With the increase of the number of CS and NS service users, it is important to allocate the cloud resource to maximize the system rewards with the considerations of the cloud resource consumption and incomes generated from cloud users. To address this issue, we propose a Security Service Admission Model (SSAM) based on Semi-Markov Decision Process to model the system reward for the cloud provider. We, first, define system states by a tuple represented by the numbers of cloud users and their associated security service categories, and current event type (i.e., arrival or departure).We then derive the system steady-state probability and service request blocking probability by using the proposed SSAM. Numerical results show that the obtained theoretic probabilities are consistent with our simulation results.
{"title":"Resource allocation for security services in mobile cloud computing","authors":"Hongbin Liang, Dijiang Huang, L. Cai, X. Shen, D. Peng","doi":"10.1109/INFCOMW.2011.5928806","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928806","url":null,"abstract":"Mobile cloud is a machine-to-machine service model, where a mobile device can use the cloud for searching, data mining, and multimedia processing. To protect the processed data, security services, i.e., encryption, decryption, authentications, etc., are performed in the cloud. In general, we can classify cloud security services in two categories: Critical Security (CS) service and Normal Security (NS) service. CS service provides strong security protection such as using longer key size, strict security access policies, isolations for protecting data, and so on. The CS service usually occupies more cloud computing resources, however it generates more rewards to the cloud provider since the CS service users need to pay more for using the CS service. With the increase of the number of CS and NS service users, it is important to allocate the cloud resource to maximize the system rewards with the considerations of the cloud resource consumption and incomes generated from cloud users. To address this issue, we propose a Security Service Admission Model (SSAM) based on Semi-Markov Decision Process to model the system reward for the cloud provider. We, first, define system states by a tuple represented by the numbers of cloud users and their associated security service categories, and current event type (i.e., arrival or departure).We then derive the system steady-state probability and service request blocking probability by using the proposed SSAM. Numerical results show that the obtained theoretic probabilities are consistent with our simulation results.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124010814","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928815
Farah I. Kandah, Yashaswi Singh, Chonggang Wang
The growth of laptops, personal digital assistant (PDA) and 802.11/Wi-Fi wireless networking have made mobile ad-hoc network (MANET) and machine-to-machine (M2M) popular research topics recently. With more attention on M2M and MANETs lately, the security issues become more important and urgent for managing and deploying in such networks. The flexible deployment nature and the lack of fixed infrastructure make MANETs suffer from varieties of security attacks. In this paper, we show how an adversary can utilize a colluding attack in MANET by injecting malicious nodes in the network, while hiding their identities from other legitimate nodes. We will name this attack as the Colluding Injected Attack (CIA). These injected nodes will work together to generate a severe attack in the network, which aims to create a collision at an arbitrary node, which in turn will result in making the attacked node unable to receive or relay any packet. As a result this node could be wrongly reported as having a malicious behavior by any other node in the same neighborhood, or it might be reported as unreachable if it is a destination node. Our simulation results show that the existence of an adversary that launching the colluding injected attack (CIA) will mislead the decision of previous attack detection schemes.
{"title":"Colluding injected attack in mobile ad-hoc networks","authors":"Farah I. Kandah, Yashaswi Singh, Chonggang Wang","doi":"10.1109/INFCOMW.2011.5928815","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928815","url":null,"abstract":"The growth of laptops, personal digital assistant (PDA) and 802.11/Wi-Fi wireless networking have made mobile ad-hoc network (MANET) and machine-to-machine (M2M) popular research topics recently. With more attention on M2M and MANETs lately, the security issues become more important and urgent for managing and deploying in such networks. The flexible deployment nature and the lack of fixed infrastructure make MANETs suffer from varieties of security attacks. In this paper, we show how an adversary can utilize a colluding attack in MANET by injecting malicious nodes in the network, while hiding their identities from other legitimate nodes. We will name this attack as the Colluding Injected Attack (CIA). These injected nodes will work together to generate a severe attack in the network, which aims to create a collision at an arbitrary node, which in turn will result in making the attacked node unable to receive or relay any packet. As a result this node could be wrongly reported as having a malicious behavior by any other node in the same neighborhood, or it might be reported as unreachable if it is a destination node. Our simulation results show that the existence of an adversary that launching the colluding injected attack (CIA) will mislead the decision of previous attack detection schemes.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126185266","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928877
J. Jun, W. Fu, D. Agrawal
In Mobile Opportunistic Networks, the cost and effectiveness of any opportunistic forwarding is measured by the expected delay of a message. Hence, its critical goal is to have low delay for a message. This paper studies the average delay of a message in a Mobile Opportunistic Network on Manhattan area. We first model the mobility of a message as a biased random walk in tilted grid and analyze the delay of a message based on the hitting time of a bias random walk. We have derived an exact expression of expected delay for a walk starting from any point in tilted grid for both biased and unbiased random walks and provide a closed form approximation of average delay of a message for the case of unbiased random walk. The key result is that the average delay of a message in Mobile Opportunistic Networks is very sensitive to the biased level of a random walk at each stage of the walk (depends on the distance from destination at its current stage). Then, this key result explains why most of the smart message forwarding algorithm in Mobile Opportunistic Network works reasonably well.
{"title":"Average delay analysis of opportunistic single copy delivery in Manhattan area using biased random walk","authors":"J. Jun, W. Fu, D. Agrawal","doi":"10.1109/INFCOMW.2011.5928877","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928877","url":null,"abstract":"In Mobile Opportunistic Networks, the cost and effectiveness of any opportunistic forwarding is measured by the expected delay of a message. Hence, its critical goal is to have low delay for a message. This paper studies the average delay of a message in a Mobile Opportunistic Network on Manhattan area. We first model the mobility of a message as a biased random walk in tilted grid and analyze the delay of a message based on the hitting time of a bias random walk. We have derived an exact expression of expected delay for a walk starting from any point in tilted grid for both biased and unbiased random walks and provide a closed form approximation of average delay of a message for the case of unbiased random walk. The key result is that the average delay of a message in Mobile Opportunistic Networks is very sensitive to the biased level of a random walk at each stage of the walk (depends on the distance from destination at its current stage). Then, this key result explains why most of the smart message forwarding algorithm in Mobile Opportunistic Network works reasonably well.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128717654","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}