延遲容忍網(wǎng)絡(luò)中能量有效的接觸探測(cè)研究
doi: 10.11999/JEIT140995
基金項(xiàng)目:
國(guó)家自然科學(xué)基金(61174177, 41172298)，國(guó)家863計(jì)劃項(xiàng)目(2013AA10230207)，湖北省自然科學(xué)基金(2014CFB145)，湖北省水電工程智能視覺監(jiān)測(cè)重點(diǎn)實(shí)驗(yàn)室開放基金(2014KLA07)和三峽大學(xué)人才科研啟動(dòng)基金(KJ2014B056, KJ2014B060)資助課題
Research on Energy-efficient Contact Probing in Delay Tolerant Networks
-
摘要: 在延遲容忍網(wǎng)絡(luò)中，為了發(fā)現(xiàn)在其通信范圍內(nèi)的鄰居節(jié)點(diǎn)，網(wǎng)絡(luò)中的節(jié)點(diǎn)必須不斷地探測(cè)周圍的環(huán)境。這個(gè)接觸探測(cè)過程極其耗費(fèi)能量。如果網(wǎng)絡(luò)中的節(jié)點(diǎn)探測(cè)太過頻繁，會(huì)耗費(fèi)很多能量，且使得網(wǎng)絡(luò)能量的使用效率降低。另一方面，稀疏的探測(cè)可能導(dǎo)致節(jié)點(diǎn)失去和其它節(jié)點(diǎn)的接觸，從而錯(cuò)失交換數(shù)據(jù)的機(jī)會(huì)。因此，在延遲容忍網(wǎng)絡(luò)中能量效率和接觸機(jī)會(huì)之間存在著一種折中的關(guān)系。為了研究這種折中關(guān)系，該文首先對(duì)基于隨機(jī)路點(diǎn)模型(Random Way-Point model, RWP)的接觸探測(cè)過程進(jìn)行建模，得到恒定探測(cè)間隔下接觸探測(cè)概率的表達(dá)式，并且證明在所有平均探測(cè)間隔相同的策略中，以恒定間隔探測(cè)的策略是最優(yōu)的。其次，基于提出的理論模型，分析不同情況下能量效率和接觸探測(cè)概率之間的折中。最后，通過仿真實(shí)驗(yàn)驗(yàn)證該理論模型的正確性。
-
關(guān)鍵詞:
- 延遲容忍網(wǎng)絡(luò) /
- 能量效率 /
- 接觸探測(cè) /
- 隨機(jī)路點(diǎn)模型
Abstract: In the Delay Tolerant Networks (DTNs), in order to discover the neighbors, the nodes in the network have to probe the surrounding environment continually. This can be an extremely energy-consuming process. If the nodes probe very frequently, they consume a lot of energy, and may be energy inefficient. On the other hand, infrequent contact probing might cause loss of many contacts, and thus missing the opportunities to exchange data. Therefore, there exists a trade-off between the energy efficiency and contact opportunities in the DTNs. In order to investigate this trade-off, this study first proposes a model to quantify the contact detecting probability when the contact probing interval is constant based on the Random Way-Point (RWP) model. Moreover, this study also demonstrates that the strategy which probes at a constant interval performs the best performance, among all contact probing strategies with the same average contact probing interval. Then, based on the proposed model, this study analyzes the trade-off between the energy efficiency and contact detecting probability under different situations. Finally, extensive simulations are conducted to validate the correctness of the proposed model. -
Wei Kai-min, Liang Xiao, and Xu Ke. A survey of social-aware routing protocols in delay tolerant networks: applications, taxonomy and design-related issues[J]. IEEE Communications Surveys and Tutorials, 2014, 16(1): 556-578. 吳亞輝, 鄧蘇, 黃宏斌. 延遲容忍網(wǎng)絡(luò)狀態(tài)感知的路由策略研究[J]. 電子與信息學(xué)報(bào), 2011, 33(3): 575-579. Wu Ya-hui, Deng Su, and Huang Hong-bin. Research of situation-aware routing method in delay tolerant network [J]. Journal of Electronics Information Technology, 2011, 33(3): 575-579. Zhou Huan, Chen Ji-ming, Fan Jia-lu, et al.. Consub: incentive-based content subscribing in selfish opportunistic mobile networks[J]. IEEE Journal on Selected Areas in Communications, 2013, 31(9): 669-679. 張振京, 金志剛, 舒炎泰. 基于節(jié)點(diǎn)運(yùn)動(dòng)預(yù)測(cè)的社會(huì)性DTN高效路由[J]. 計(jì)算機(jī)學(xué)報(bào), 2013, 36(3): 626-635. Zhang Zhen-jing, Jin Zhi-gang, and Shu Yan-tai. Efficient routing in social DTN based on nodes, movement prediction [J]. Journal of Computers, 2013, 36(3): 626-635. Zhou Huan, Chen Ji-ming, Zhao Hong-yang, et al.. On exploiting contact patterns for data forwarding in duty-cycle opportunistic mobile networks[J]. IEEE Transactions on Vehicular Technology, 2013, 62(9): 4629-4642. Drula C, Amza C, Rousseau F, et al.. Adaptive energy conserving algorithms for neighbor discovery in opportunistic bluetooth networks[J]. IEEE Journal on Selected Areas in Communications, 2007, 25(1): 96-107. Wang, Wei, Srinivasan V, and Motani M. Adaptive contact probing mechanisms for delay tolerant applications[C]. Proceedings of the ACM MobiCom, Montreal, Canada, 2007: 230-241. Wang Wei, Srinivasan V, and Motani M. Opportunistic energy-efficient contact probing in delay-tolerant applications [J]. IEEE/ACM Transactions on Networking, 2009, 17(5): 1592-1605. Qin Shuang, Feng Gang, and Zhang Yi-de. How the contact-probing mechanism affects the transmission capacity of delay-tolerant networks[J]. IEEE Transactions on Vehicular Technology, 2011, 60(4): 1825-1834. Zhou Huan, Zheng Huan-yang, Wu Jie, et al.. Energy- efficient contact probing in opportunistic mobile networks[C]. Proceedings of the IEEE ICCCN, Nassau, Bahamas, 2013: 1-7. 李文霽, 鄭康鋒, 張冬梅, 等. 一種高效的延遲容忍移動(dòng)傳感器網(wǎng)絡(luò)異步探測(cè)機(jī)制[J]. 電子與信息學(xué)報(bào), 2012, 34(12): 2891-2897. Li Wen-ji, Zheng Kang-feng, Zhang Dong-mei, et al.. An efficient asynchronous probing scheme for delay-tolerant mobility sensor network[J]. Journal of Electronics Information Technology, 2012, 34(12): 2891-2897. Hess A, Hyyti? E, and Ott J. Efficient neighbor discovery in mobile opportunistic networking using mobility awareness[C]. Proceedings of COMSNETS, Bangalore, India, 2014: 1-8. Broch J, Maltz D, Johnson D, et al.. A performance comparison of multi-hop wireless ad hoc network routing protocols[C]. Proceedings of the ACM Mobicom, Dallas, USA, 1998: 85-97. McDonald B and Znati T. A path availability model for wireless Ad-hoc networks[C]. Proceedings of the IEEE WCNC, New Orleans, USA, 1999: 35-40. Eagle N, Pentland A, and Lazer D. Inferring social network structure using mobile phone data[J]. Proceedings of National Academy of Sciences, 2009, 106(36): 15274-15278. Tsao Cheng-lin, Liao Wan-jiun, and Kuo Jia-chun. Link duration of the random way point model in mobile Ad hoc networks[C]. Proceedings of the IEEE WCNC, Las Vegas, USA, 2006: 367-371. Wu Yueh-ting, Liao Wan-jiun, Tsao Cheng-lin, et al.. Impact of node mobility on link duration in multihop mobile networks[J]. IEEE Transactions on Vehicular Technology, 2009, 58(5): 2435-2442. Abdulla M and Simon R. The impact of intercontact time within opportunistic networks: protocol implications and mobility models[R]. TechRepublic White Paper, 2009. Spyropoulos T, Psounis K, and Raghavendra C. Performance analysis of mobility-assisted routing[C]. Proceedings of the ACM Mobihoc, Los Angeles, USA, 2006: 49-60. -
計(jì)量
- 文章訪問數(shù): 1457
- HTML全文瀏覽量: 140
- PDF下載量: 445
- 被引次數(shù): 0
下載:
