Acknowledgment-based punishment and stimulation scheme for mobile ad hoc network

被引:0
|
作者
Mahdi Bounouni
Louiza Bouallouche-Medjkoune
机构
[1] University of Bejaia,LaMOS Research Unit, Faculty of Exact Sciences
[2] University of Setif 2,Faculty of Law and Political Sciences
来源
The Journal of Supercomputing | 2018年 / 74卷
关键词
MANET; Malicious nodes; Selfish nodes; Reputation; Credit; Performance evaluation;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we propose an acknowledgment-based punishment and stimulation scheme, called APS. The purposes are to punish malicious nodes dropping data packets and to stimulate the cooperation of selfish nodes. APS approach is structured around four interactive modules. The monitoring module monitors the correct forwarding of routing and data packets. The reputation module assesses the reputation of neighbors. We have proposed a reputation exchange method that enables nodes to share their recommendations about other nodes only within their neighborhoods, and the combination is done based on CIF rules (Combined trust on Importance Factor). The stimulator module is responsible for updating and managing the nodes credit accounts. The price and the reward in term of credit are determined based on the cooperativeness state of a node. Finally, the isolator module punishes both malicious and selfish nodes. The simulation results show that APS scheme increases the throughput and minimizes the malicious dropping ratio, while improving the success ratio of cooperative nodes, and reducing the success ratio and the isolation time of selfish nodes as well.
引用
收藏
页码:5373 / 5398
页数:25
相关论文
共 50 条
  • [1] Acknowledgment-based punishment and stimulation scheme for mobile ad hoc network
    Bounouni, Mahdi
    Bouallouche-Medjkoune, Louiza
    JOURNAL OF SUPERCOMPUTING, 2018, 74 (10): : 5373 - 5398
  • [2] Acknowledgment-Based Broadcast Protocol for Reliable and Efficient Data Dissemination in Vehicular Ad Hoc Networks
    Javier Ros, Francisco
    Miguel Ruiz, Pedro
    Stojmenovic, Ivan
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2012, 11 (01) : 33 - 46
  • [3] AN ACKNOWLEDGMENT-BASED ACCESS SCHEME IN A 2-NODE PACKET-RADIO NETWORK
    SIDI, M
    SEGALL, A
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1984, 32 (06) : 741 - 744
  • [4] An effective authentication scheme in mobile ad hoc network
    Shin, Kiho
    Kim, Yoonho
    Kim, Yanggon
    SNPD 2006: SEVENTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, PROCEEDINGS, 2006, : 249 - +
  • [5] A Threshold Cryptography Based Authentication Scheme for Mobile Ad-hoc Network
    Dey, Haimabati
    Datta, Raja
    ADVANCES IN NETWORKS AND COMMUNICATIONS, PT II, 2011, 132 : 400 - 409
  • [6] Hybrid Zone Based Multicast Routing Scheme for Mobile Ad hoc Network
    Lu, Jun
    Bin, Liao
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 2600 - 2603
  • [7] Path quality based internet access scheme for mobile Ad hoc network
    Zhuang, Lin
    Liu, Yuan-An
    Liu, Kai-Ming
    Zhai, Lin-Bo
    Zhao, Chuan-Qiang
    Peng, Qi
    Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 2010, 33 (04): : 54 - 58
  • [8] Energy conservation scheme based on reliable transportation in mobile Ad Hoc network
    Dept. of Maths and Computer Science, Chongqing University of Arts and Science, Chongqing 402160, China
    Wuhan Ligong Daxue Xuebao (Jiaotong Kexue Yu Gongcheng Ban)/Journal of Wuhan University of Technology (Transportation Science and Engineering), 2008, 32 (01): : 183 - 186
  • [9] Secure multipath routing scheme for mobile ad hoc network
    Vaidya, Binod
    Pyun, JaeYoung
    Park, JongAn
    Han, SeungJo
    DASC 2007: THIRD IEEE INTERNATIONAL SYMPOSIUM ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, PROCEEDINGS, 2007, : 163 - +
  • [10] A Secure Path Selection Scheme for Mobile Ad Hoc Network
    Ubarhande, Sachin D.
    Doye, Dharmpal D.
    Nalwade, Prakash S.
    WIRELESS PERSONAL COMMUNICATIONS, 2017, 97 (02) : 2087 - 2096