ESTABLISHING RELIABILITY FOR EFFICIENT ROUTING IN OPPORTUNISTIC NETWORKS

被引:1
作者
Sharma, Deepak Kumar [1 ]
Kukreja, Deepika [1 ]
机构
[1] Netaji Subhas Univ Technol, Netaji Subhas Inst Technol, Div Informat Technol, New Delhi, India
来源
SCALABLE COMPUTING-PRACTICE AND EXPERIENCE | 2019年 / 20卷 / 01期
关键词
Routing Protocol; Reliability; Opportunistic networks; Average message delivery; Network errors; ONE simulator; PROTOCOL; AWARE;
D O I
10.12694/scpe.v20i1.1479
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Opportunistic network (Oppnet) is a class of networks where connections between the nodes are not permanent. The nodes are continuously moving and some nodes even switch off their batteries to conserve energy. Reliable delivery of messages in Opportunistic network is one major inherent issue. It is unreliable in the sense that once the source node has forwarded its message, then it will never get to know about its status in the network like whether the message has got discarded at an intermediate node or at the destination node (due to buffer overflow) or the successful delivery of the message has taken place. This work tries to make Oppnet as much reliable as possible. It proposes a reliability protocol named as Reliability in Oppnet (RIO). RIO improves the routing in Oppnet and works in parallel with the existing routing protocols. It makes the source node aware about the status of message so that if an error occurs then the source node can take suitable action to resend the message. It considers the redirection error, buffer overflow error, Time Limit Exceeded (TLE), parameter problem and destination unreachable errors that may occur inside the network. RIO has been tested using ONE simulator and implemented with Spray and Wait routing protocol. Results show that the RIO with Spray and Wait protocol outperforms normal Spray and Wait protocol in terms of average message delivery probability.
引用
收藏
页码:27 / 40
页数:14
相关论文
共 31 条
  • [1] [Anonymous], P IEEE IND INT C INF
  • [2] [Anonymous], P IEEE 10 INT C CONT
  • [3] [Anonymous], P IEEE 30 INT C ADV
  • [4] [Anonymous], P 20 INT C NETW BAS
  • [5] [Anonymous], 2006, CHALLENGES PRIVACY S
  • [6] [Anonymous], 2000, CS200006 DUK U DEP C
  • [7] [Anonymous], 2003, ACM SIGMOBILE mobile computing and communications review, DOI DOI 10.1145/961268.961272
  • [8] [Anonymous], P ACMSIGCOMM 2004
  • [9] Burgess J., 2006, Proc. IEEE INFOCOM 2006. 25TH IEEE Int. Conf. Comput. Commun, P1
  • [10] A fuzzy logic and game theory based adaptive approach for securing opportunistic networks against black hole attacks
    Chhabra, Anshuman
    Vashishth, Vidushi
    Sharma, Deepak Kumar
    [J]. INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2018, 31 (04)