Pub Date : 2011-10-17DOI: 10.1109/ICNP.2011.6089076
Zi Li, Yang Peng, Wensheng Zhang, D. Qiao
The emerging wireless charging technology creates a controllable and perpetual energy source to provide wireless power over distance. Schemes have been proposed to make use of wireless charging to prolong the sensor network lifetime. Unfortunately, existing schemes only passively replenish sensors that are deficient in energy supply, and cannot fully leverage the strengths of this technology. To address the limitation, we propose J-RoC — a practical and efficient Joint Routing and Charging scheme. Through proactively guiding the routing activities in the network and delivering energy to where it is needed, J-RoC not only replenishes energy into the network but also effectively improves the network energy utilization, thus prolonging the network lifetime. To evaluate the performance of the J-RoC scheme, we conduct experiments in a small-scale testbed and simulations in large-scale networks. Evaluation results demonstrate that J-RoC significantly elongates the network lifetime compared to existing wireless charging based schemes.
{"title":"J-RoC: A Joint Routing and Charging scheme to prolong sensor network lifetime","authors":"Zi Li, Yang Peng, Wensheng Zhang, D. Qiao","doi":"10.1109/ICNP.2011.6089076","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089076","url":null,"abstract":"The emerging wireless charging technology creates a controllable and perpetual energy source to provide wireless power over distance. Schemes have been proposed to make use of wireless charging to prolong the sensor network lifetime. Unfortunately, existing schemes only passively replenish sensors that are deficient in energy supply, and cannot fully leverage the strengths of this technology. To address the limitation, we propose J-RoC — a practical and efficient Joint Routing and Charging scheme. Through proactively guiding the routing activities in the network and delivering energy to where it is needed, J-RoC not only replenishes energy into the network but also effectively improves the network energy utilization, thus prolonging the network lifetime. To evaluate the performance of the J-RoC scheme, we conduct experiments in a small-scale testbed and simulations in large-scale networks. Evaluation results demonstrate that J-RoC significantly elongates the network lifetime compared to existing wireless charging based schemes.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"160 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129022033","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-10-17DOI: 10.1109/ICNP.2011.6089051
X. Che, Xi Ju, Hongwei Zhang
Co-channel interference is a limiting factor to the predictability and performance of wireless networks, thus interference-oriented scheduling of channel access has become a basic building block of wireless networking. Despite much work in this area, the existing algorithms did not address the limiting impact of interference when optimizing transmission scheduling. Towards understanding the importance of considering the limiting impact of interference, we formulate the concept of interference budget, and we propose the scheduling algorithm iOrder that maximizes the schedulability of future channel access when scheduling concurrent transmissions. When selecting concurrent transmitters for a time slot, more specifically, iOrder tries to maximize the additional interference that can be tolerated by all the receivers while satisfying the application requirement on link reliability. We analyze the approximation ratio of iOrder, and, through extensive simulation and testbed-based measurement, we observe that addressing the limiting impact of interference can improve the performance of existing algorithms by a significant margin, for instance, improving the throughput of the well-known algorithm LQF by a factor up to 2. Thus our study demonstrates the importance of explicitly addressing the limiting impact of interference, which opens up new avenues for future research and for optimizing wireless network performance.
{"title":"The case for addressing the limiting impact of interference on wireless scheduling","authors":"X. Che, Xi Ju, Hongwei Zhang","doi":"10.1109/ICNP.2011.6089051","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089051","url":null,"abstract":"Co-channel interference is a limiting factor to the predictability and performance of wireless networks, thus interference-oriented scheduling of channel access has become a basic building block of wireless networking. Despite much work in this area, the existing algorithms did not address the limiting impact of interference when optimizing transmission scheduling. Towards understanding the importance of considering the limiting impact of interference, we formulate the concept of interference budget, and we propose the scheduling algorithm iOrder that maximizes the schedulability of future channel access when scheduling concurrent transmissions. When selecting concurrent transmitters for a time slot, more specifically, iOrder tries to maximize the additional interference that can be tolerated by all the receivers while satisfying the application requirement on link reliability. We analyze the approximation ratio of iOrder, and, through extensive simulation and testbed-based measurement, we observe that addressing the limiting impact of interference can improve the performance of existing algorithms by a significant margin, for instance, improving the throughput of the well-known algorithm LQF by a factor up to 2. Thus our study demonstrates the importance of explicitly addressing the limiting impact of interference, which opens up new avenues for future research and for optimizing wireless network performance.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125453366","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-10-17DOI: 10.1109/ICNP.2011.6089070
Yating Hsu, David Lee
In 2009 UnrealIRCd 3.2.8.1, an IRC (Internet Relay Chat) server, was replaced by a version with a backdoor at its mirror sites. It was not detected until seven months later and it had caused irrevocable damages in IRC services. It is of vital importance and also a challenge to detect implanted malicious code in newly developed systems before their deployment. We apply machine learning to uncover a system implementation structure that includes its normal functions from the design, as well as the hidden malicious behaviors. Published works with machine learning often assume that systems are completely specified. Unfortunately, practical system implementations are usually incompletely specified and the prevalent algorithms do not apply. We design generalized and efficient machine learning algorithms for incompletely specified protocol system implementations for detecting implanted malicious code. We further extend the results where machine learning starts from an approximate model instead of an empty conjecture — a usual approach of machine learning algorithms, and our approach learns an implementation structure more efficiently than the known algorithms. We implement and apply our method to two case studies: an IRC server with backdoor and an MSN client with message flooder. Experiments show that our procedures successfully and efficiently detect the implanted malicious behaviors.
{"title":"Machine learning for implanted malicious code detection with incompletely specified system implementations","authors":"Yating Hsu, David Lee","doi":"10.1109/ICNP.2011.6089070","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089070","url":null,"abstract":"In 2009 UnrealIRCd 3.2.8.1, an IRC (Internet Relay Chat) server, was replaced by a version with a backdoor at its mirror sites. It was not detected until seven months later and it had caused irrevocable damages in IRC services. It is of vital importance and also a challenge to detect implanted malicious code in newly developed systems before their deployment. We apply machine learning to uncover a system implementation structure that includes its normal functions from the design, as well as the hidden malicious behaviors. Published works with machine learning often assume that systems are completely specified. Unfortunately, practical system implementations are usually incompletely specified and the prevalent algorithms do not apply. We design generalized and efficient machine learning algorithms for incompletely specified protocol system implementations for detecting implanted malicious code. We further extend the results where machine learning starts from an approximate model instead of an empty conjecture — a usual approach of machine learning algorithms, and our approach learns an implementation structure more efficiently than the known algorithms. We implement and apply our method to two case studies: an IRC server with backdoor and an MSN client with message flooder. Experiments show that our procedures successfully and efficiently detect the implanted malicious behaviors.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116635267","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-10-17DOI: 10.1109/ICNP.2011.6089062
Ahmed Mansy, M. Ammar
Most commercial video streaming systems rely on Content Distribution Networks (CDNs) to distribute video content. HTTP adaptive streaming has been recently adopted by major video streaming providers and is now considered the standard technique used with CDN-based streaming systems. Despite the success of these systems, cost-effective scalability continues to be of concern in their design and deployment. To address this, recent work has proposed the use of hybrid CDN and Peer-to-peer (P2P) live streaming systems. The design of these systems aims to combine the scalability of P2P systems and the desirable performance properties of CDN-based systems. However, the use of adaptive streaming, has not been explored extensively in such hybrid systems. Designing and operating an adaptive hybrid streaming system is very challenging. Two design decisions are very critical in the operation of any such system. The first one is the bitrate adaptation strategy which specifies how different bitrates are assigned to different users while maximizing user satisfaction. The second is defining the operational guidelines for switching the system between the CDN and the P2P modes while efficiently utilizing the available resources. In this paper we present a model and analysis of a hybrid CDN-P2P adaptive live streaming system with the objective of answering these two design questions. We first present a stochastic fluid model to the hybrid streaming system with a single video bitrate and we obtain theoretical results to guide the system operation as described above. We then extend the analysis to the adaptive streaming case with multiple video bitrates. We model adaptive streaming as a linear optimization problem to obtain the best bitrate adaptation strategy. We validate our analysis using simulations. Our conclusion is that adaptive hybrid streaming can significantly improve the ability of the system to satisfy more users with higher video bitrates over CDN-based systems.
{"title":"Analysis of adaptive streaming for hybrid CDN/P2P live video systems","authors":"Ahmed Mansy, M. Ammar","doi":"10.1109/ICNP.2011.6089062","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089062","url":null,"abstract":"Most commercial video streaming systems rely on Content Distribution Networks (CDNs) to distribute video content. HTTP adaptive streaming has been recently adopted by major video streaming providers and is now considered the standard technique used with CDN-based streaming systems. Despite the success of these systems, cost-effective scalability continues to be of concern in their design and deployment. To address this, recent work has proposed the use of hybrid CDN and Peer-to-peer (P2P) live streaming systems. The design of these systems aims to combine the scalability of P2P systems and the desirable performance properties of CDN-based systems. However, the use of adaptive streaming, has not been explored extensively in such hybrid systems. Designing and operating an adaptive hybrid streaming system is very challenging. Two design decisions are very critical in the operation of any such system. The first one is the bitrate adaptation strategy which specifies how different bitrates are assigned to different users while maximizing user satisfaction. The second is defining the operational guidelines for switching the system between the CDN and the P2P modes while efficiently utilizing the available resources. In this paper we present a model and analysis of a hybrid CDN-P2P adaptive live streaming system with the objective of answering these two design questions. We first present a stochastic fluid model to the hybrid streaming system with a single video bitrate and we obtain theoretical results to guide the system operation as described above. We then extend the analysis to the adaptive streaming case with multiple video bitrates. We model adaptive streaming as a linear optimization problem to obtain the best bitrate adaptation strategy. We validate our analysis using simulations. Our conclusion is that adaptive hybrid streaming can significantly improve the ability of the system to satisfy more users with higher video bitrates over CDN-based systems.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120958870","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-10-17DOI: 10.1109/ICNP.2011.6089079
Qian Wang, K. Ren, P. Ning
Recently, many opportunistic spectrum sensing and access protocols have been proposed for cognitive radio networks (CRNs). For achieving optimized spectrum usage, existing solutions model the spectrum sensing and access problem as a partially observed Markov decision process (POMDP) and assume that the information states and/or the primary users' (PUs) traffic statistics are known a priori to the secondary users (SUs). While theoretically sound, these existing approaches may not be effective in practice due to two main concerns. First, the assumptions they made are not practical, as before the communication starts, PUs' traffic statistics may not be readily available to the SUs. Secondly and more seriously, existing approaches are extremely vulnerable to malicious jamming attacks. A cognitive attacker can always jam the channels to be accessed by leveraging the same statistic information and stochastic dynamic decision making process that the SUs would follow. To address the above concerns, we formulate the problem of anti-jamming multichannel access in CRNs and solve it as a non-stochastic multi-armed bandit (NS-MAB) problem, where the secondary sender and receiver adaptively choose their arms (i.e., sending and receiving channels) to operate. The proposed protocol enables them to hop to the same set of channels with high probability in the presence of jamming. We analytically show the convergence of the learning algorithms, i.e., the performance difference between the secondary sende and receiver's optimal strategies is no more than O(20k/√ε √Tn ln n). Extensive simulations are conducted to validate the theoretical analysis and show that the proposed protocol is highly resilient to various jamming attacks.
{"title":"Anti-jamming communication in cognitive radio networks with unknown channel statistics","authors":"Qian Wang, K. Ren, P. Ning","doi":"10.1109/ICNP.2011.6089079","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089079","url":null,"abstract":"Recently, many opportunistic spectrum sensing and access protocols have been proposed for cognitive radio networks (CRNs). For achieving optimized spectrum usage, existing solutions model the spectrum sensing and access problem as a partially observed Markov decision process (POMDP) and assume that the information states and/or the primary users' (PUs) traffic statistics are known a priori to the secondary users (SUs). While theoretically sound, these existing approaches may not be effective in practice due to two main concerns. First, the assumptions they made are not practical, as before the communication starts, PUs' traffic statistics may not be readily available to the SUs. Secondly and more seriously, existing approaches are extremely vulnerable to malicious jamming attacks. A cognitive attacker can always jam the channels to be accessed by leveraging the same statistic information and stochastic dynamic decision making process that the SUs would follow. To address the above concerns, we formulate the problem of anti-jamming multichannel access in CRNs and solve it as a non-stochastic multi-armed bandit (NS-MAB) problem, where the secondary sender and receiver adaptively choose their arms (i.e., sending and receiving channels) to operate. The proposed protocol enables them to hop to the same set of channels with high probability in the presence of jamming. We analytically show the convergence of the learning algorithms, i.e., the performance difference between the secondary sende and receiver's optimal strategies is no more than O(20k/√ε √Tn ln n). Extensive simulations are conducted to validate the theoretical analysis and show that the proposed protocol is highly resilient to various jamming attacks.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133930218","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-10-17DOI: 10.1109/ICNP.2011.6089080
Yang Xiang, Zhiliang Wang, Xia Yin, Jianping Wu
The de facto inter-domain routing protocol, Border Gateway Protocol (BGP), plays a critical role in the Internet routing reliability. Invalid routes generated by mis-configurations or malicious attacks will devastate the Internet routing system. In the near future, deploying a secure BGP in the Internet to completely prevent hijacking is impossible. As a result, lots of hijacking detection systems have emerged. However, they have more or less weaknesses such as long detection delay, high false alarm rate or deploy hardness. This paper proposes Argus, an agile system to fast and accurate detect prefix hijacking. Argus already keeps on running in the Internet for two months and identified several possible hijackings. Initial results show that it usually discovers a hijacking in less than ten seconds, and can significantly decrease the false alarm rate.
{"title":"Argus: An accurate and agile system to detecting IP prefix hijacking","authors":"Yang Xiang, Zhiliang Wang, Xia Yin, Jianping Wu","doi":"10.1109/ICNP.2011.6089080","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089080","url":null,"abstract":"The de facto inter-domain routing protocol, Border Gateway Protocol (BGP), plays a critical role in the Internet routing reliability. Invalid routes generated by mis-configurations or malicious attacks will devastate the Internet routing system. In the near future, deploying a secure BGP in the Internet to completely prevent hijacking is impossible. As a result, lots of hijacking detection systems have emerged. However, they have more or less weaknesses such as long detection delay, high false alarm rate or deploy hardness. This paper proposes Argus, an agile system to fast and accurate detect prefix hijacking. Argus already keeps on running in the Internet for two months and identified several possible hijackings. Initial results show that it usually discovers a hijacking in less than ten seconds, and can significantly decrease the false alarm rate.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133011245","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-10-17DOI: 10.1109/ICNP.2011.6089054
Xuejun Zhuo, Wei Gao, G. Cao, Yiqi Dai
3G networks are currently facing severe traffic overload problems caused by excessive demands of mobile users. Offloading part of the 3G traffic through other forms of networks, such as Delay Tolerant Networks (DTNs), WiFi hotspots, and Femtocells, is a promising solution. However, since these networks can only provide intermittent and opportunistic connectivity to mobile users, utilizing them for 3G traffic offloading may result in a non-negligible delay. As the delay increases, the users' satisfaction decreases. In this paper, we investigate the tradeoff between the amount of traffic being offloaded and the users' satisfaction. We provide a novel incentive framework to motivate users to leverage their delay tolerance for 3G traffic offloading. To minimize the incentive cost given an offloading target, users with high delay tolerance and large offloading potential should be prioritized for traffic offloading. To effectively capture the dynamic characteristics of users' delay tolerance, our incentive framework is based on reverse auction to let users proactively express their delay tolerance by submitting bids. We further take DTN as a case study to illustrate how to predict the offloading potential of the users by using stochastic analysis. Extensive trace-driven simulations verify the efficiency of our incentive framework for 3G traffic offloading.
{"title":"Win-Coupon: An incentive framework for 3G traffic offloading","authors":"Xuejun Zhuo, Wei Gao, G. Cao, Yiqi Dai","doi":"10.1109/ICNP.2011.6089054","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089054","url":null,"abstract":"3G networks are currently facing severe traffic overload problems caused by excessive demands of mobile users. Offloading part of the 3G traffic through other forms of networks, such as Delay Tolerant Networks (DTNs), WiFi hotspots, and Femtocells, is a promising solution. However, since these networks can only provide intermittent and opportunistic connectivity to mobile users, utilizing them for 3G traffic offloading may result in a non-negligible delay. As the delay increases, the users' satisfaction decreases. In this paper, we investigate the tradeoff between the amount of traffic being offloaded and the users' satisfaction. We provide a novel incentive framework to motivate users to leverage their delay tolerance for 3G traffic offloading. To minimize the incentive cost given an offloading target, users with high delay tolerance and large offloading potential should be prioritized for traffic offloading. To effectively capture the dynamic characteristics of users' delay tolerance, our incentive framework is based on reverse auction to let users proactively express their delay tolerance by submitting bids. We further take DTN as a case study to illustrate how to predict the offloading potential of the users by using stochastic analysis. Extensive trace-driven simulations verify the efficiency of our incentive framework for 3G traffic offloading.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130183668","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-10-17DOI: 10.1109/ICNP.2011.6089066
A. Junior, Rute C. Sofia, António D. Costa
This work is focused on explore different heuristics that may be applied to provide a link-based cost for energy-aware multihop routing for wireless environments which integrate heterogeneous devices that are carried or owned by Internet end-users. We propose to analyze based on simulations of the different heuristics when applied to both distance-vector and link-state approaches, namely the AODV and OLSR routing protocols.
{"title":"Energy-efficient routing","authors":"A. Junior, Rute C. Sofia, António D. Costa","doi":"10.1109/ICNP.2011.6089066","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089066","url":null,"abstract":"This work is focused on explore different heuristics that may be applied to provide a link-based cost for energy-aware multihop routing for wireless environments which integrate heterogeneous devices that are carried or owned by Internet end-users. We propose to analyze based on simulations of the different heuristics when applied to both distance-vector and link-state approaches, namely the AODV and OLSR routing protocols.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129428219","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-10-17DOI: 10.1109/ICNP.2011.6089063
Namusale Chama, Rute C. Sofia, S. Sargento
This paper presents a summary of work aimed at making current multihop routing in mobile ad hoc networks more sensitive to node mobility and ultimately improve routing performance in the face of node mobility. We discuss the various existing mobility tracking parameters, how they capture node mobility and also their shortfalls. We propose some mobility tracking schemes(heuristics) based on one of the mobility tracking parameters(Link Duration) and also show the performance of one of the proposed heuristics.
{"title":"Impact of mobility on user-centric routing","authors":"Namusale Chama, Rute C. Sofia, S. Sargento","doi":"10.1109/ICNP.2011.6089063","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089063","url":null,"abstract":"This paper presents a summary of work aimed at making current multihop routing in mobile ad hoc networks more sensitive to node mobility and ultimately improve routing performance in the face of node mobility. We discuss the various existing mobility tracking parameters, how they capture node mobility and also their shortfalls. We propose some mobility tracking schemes(heuristics) based on one of the mobility tracking parameters(Link Duration) and also show the performance of one of the proposed heuristics.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114311856","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-10-17DOI: 10.1109/ICNP.2011.6089043
L. Feeney
We present a preliminary study of self-organizing TDMA for battery-constrained multihop wireless networks, such as sensor networks. Compared with existing TDMA approaches, this work emphasizes operation in the context of battery saving techniques that allow the radio to spend most of its time powered down, relying on some rendezvous mechanism to ensure that sender and receiver are simultaneously powered on and able to communicate. While such techniques reduce battery consumption, they also significantly limit the amount of information — even local information — that nodes can obtain from channel sensing or packet exchange. We therefore focus on self-organizing TDMA in the case of very limited state information. This work is also relevant to the practical case of independent, co-located sensor networks, which need to adapt to each other's presence without explicit coordination.
{"title":"Self-organizing TDMA for multihop networks","authors":"L. Feeney","doi":"10.1109/ICNP.2011.6089043","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089043","url":null,"abstract":"We present a preliminary study of self-organizing TDMA for battery-constrained multihop wireless networks, such as sensor networks. Compared with existing TDMA approaches, this work emphasizes operation in the context of battery saving techniques that allow the radio to spend most of its time powered down, relying on some rendezvous mechanism to ensure that sender and receiver are simultaneously powered on and able to communicate. While such techniques reduce battery consumption, they also significantly limit the amount of information — even local information — that nodes can obtain from channel sensing or packet exchange. We therefore focus on self-organizing TDMA in the case of very limited state information. This work is also relevant to the practical case of independent, co-located sensor networks, which need to adapt to each other's presence without explicit coordination.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115828964","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
扫码关注我们
求助内容：
应助结果提醒方式：