Analysis of Energy and Mobility Model on Opportunistic Routing Algorithms

被引:0
|
作者
Kerdsri, Jiradett [1 ]
Veeraklaew, Tawiwat [1 ]
机构
[1] Minist Def, Def Technol Inst, Bangkok, Thailand
来源
PROCEEDINGS OF THE 11TH EAI INTERNATIONAL CONFERENCE ON HETEROGENEOUS NETWORKING FOR QUALITY, RELIABILITY, SECURITY AND ROBUSTNESS | 2015年
关键词
NETWORKS;
D O I
10.4108/eai.19-8-2015.2260703
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
An Opportunistic Network is an extreme network where the communication mainly depends on the mobility of the participating nodes to address the intermittent connectivity. This opportunistic routing utilizes a store-carry-forward paradigm exploiting node mobility and local forwarding to transfer the messages. The mobile nodes are normally low-power portable wireless communication devices employing as wireless ad hoc network for multi-hop transmission. With the limited resource, the performance of the routing protocols can be degraded. Thus, it is vital to consider the energy consumption of the mobile node in this opportunistic environment, especially with different mobility patterns. This paper aims to study and analyze the energy usage on the node mobility. The results from the simulations show that MapBased mobility models consume more energy than random based mobility models while gaining higher delivery ratio. In the random based models, random direction consume more power than random waypoint and random walk respectively.
引用
收藏
页码:60 / 65
页数:6
相关论文
共 50 条
  • [31] Social context-aware routing algorithms in opportunistic networks
    Computer School, Wuhan University, Wuhan
    Hubei
    430072, China
    不详
    Hubei
    432000, China
    Tien Tzu Hsueh Pao, 5 (833-840):
  • [32] Candidate selection algorithms in opportunistic routing based on distance progress
    Darehshoorzadeh, Amir
    Cerda-Alabern, Llorenc
    Pla, Vicent
    INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2015, 20 (03) : 137 - 147
  • [33] Effective and efficient collection of control messages for opportunistic routing algorithms
    Yuan, Peiyan
    Song, Mingyang
    Zhao, Xiaoyan
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2017, 98 : 125 - 130
  • [34] Survey on Mobility Model of Opportunistic Networks
    Zhang, Sheng
    Yao, Ming-Hui
    Wang, Xin
    Khan, Imran
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATION AND SENSOR NETWORKS (WCSN 2016), 2016, 44 : 475 - 483
  • [35] Analysis of Cooperative HARQ with Opportunistic Routing
    Rajanna, Amogh
    Kaveh, Mostafa
    2013 IEEE 14TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (SPAWC), 2013, : 71 - 75
  • [36] Performance Analysis of Energy Efficient Routing Algorithms for Adhoc Network
    Nitnaware, Dhiraj
    Verma, Ajay
    ADVANCES IN COMPUTING, COMMUNICATION AND CONTROL, 2011, 125 : 222 - 230
  • [37] An Optimized Link Correlation Model for Opportunistic Routing
    Kamari, Ahmad
    Bag-Mohammadi, Mozafar
    IEEE COMMUNICATIONS LETTERS, 2018, 22 (12) : 2543 - 2546
  • [38] Model-Driven Optimization of Opportunistic Routing
    Rozner, Eric
    Han, Mi Kyung
    Qiu, Lili
    Zhang, Yin
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2013, 21 (02) : 594 - 609
  • [39] Toward a Comprehensive Model for Performance Analysis of Opportunistic Routing in Wireless Mesh Networks
    Darehshoorzadeh, Amir
    De Grande, Robson E.
    Boukerche, Azzedine
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2016, 65 (07) : 5424 - 5438
  • [40] Energy Aware Opportunistic Routing in Wireless Sensor Networks
    Spachos, Petros
    Chatzimisios, Periklis
    Hatzinakos, Dimitrios
    2012 IEEE GLOBECOM WORKSHOPS (GC WKSHPS), 2012, : 405 - 409