Mobile Communication Networks [18]
论文作者:www.51lunwen.org论文属性:学期论文 termpaper登出时间:2014-05-31编辑:lzm点击率:19732
论文字数:10545论文编号:org201405302339058373语种:英语 English地区:中国价格:免费论文
关键词:Implementation WorkMobile Communication Networks移动通信移动无线网络communication protocols
摘要:Any node can receive a lot of information about the network by placing its interface into promiscuous mode. The information the node can receive can be used to build trust levels for different modes.
Cpa = (Cps – Cpa)
These trust levels are than assigned weights. Weights can be assigned be either assigned in a static or dynamic manner depending on their utility and importance. The situational trust T(PA) in node n for trust category PA is computed using the following equation:
T(PA)= (W(Rd) x Dpa) + (W(Rc) x Cpa)
Where W is the weight assigned to the event
Trust Category Received Packets
We derive trust category PR derived from the events recorded in Table 5-2 based upon the Packet Received. The events are quantized as per the following equations to provide trust levels:
Dpr = (Dps – Dpf)
Cpr = (Cps – Cpf)
Pp = (Pps – Ppf)
These trust levels are than assigned weights. Weights can be assigned be either assigned in a static or dynamic manner depending on their utility and importance. The situational trust T(PR) in a node for trust category PR is computed using the following equation:
T(PR)= (W(Rd) x Dpr)+ (W(Rc) x Cpr)+ (W(Rp) x Pp)
5.3.4 Trust Computation
The situational trust values from all trust categories both categories (PA,PR) are then combined according to assigned weights, to determine an aggregate trust level for a particular node. Aggregate Trustis represented as T and given by the following equation:
T=W(PA) x T(PA) + W(PR) x T(PP)
Where W(PA)represents the weight assigned to Forwarded or Acknowledged packets and W(PR) represents the weight assigned to Received packets.
The aggregate and situational trust values are then maintained and updated for each MPR. Each node selects most trusty MPR from a set of its MPRs that have a route to the destination node. The Receiving MPR then forwards the Packets from a set of MPRs that have a route to the destination node. The routes thus found using this method may not be safe in terms of security but they all carry along an associated level of trustworthiness with them.
Chapter 6 Conclusion, Drawbacks and Future Work
6.1 Conclusion
The amount of trust established using the proposed model is currently being investigated, but inherently the model is simple, flexible and pragmatic for use in pure ad-hoc networks. Any node can receive a lot of information about the network by placing its interface into promiscuous mode. The information the node can receive can be used to build trust levels for different modes.
This model addresses OLSR routing issues in the following way:
6.1.1 Link Breakages due to Longer Links:
Finding paths between nodes that want to communicate in wireless ad hoc networks is not trivial due to network mobility, environmental conditions and constantly changing multi-hop paths (constructed by several nodes). Even more, once that the paths have been found, they have to be also maintained. Therefore, robust and efficient ad hoc routing algorithms are required. OLSR is a routing algorithm for ad hoc wireless networks that makes use of an optimized broadcasting mechanism, based on Multipoint Relay nodes (MPRs), to reduce the network load when broadcasting control messages and to support path computation. OLSR proactively
本论文由英语论文网提供整理,提供论文代写,英语论文代写,代写论文,代写英语论文,代写留学生论文,代写英文论文,留学生论文代写相关核心关键词搜索。