Markov Random Fields Based Probabilistic Relaying For Multihop Networks
2013 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC)(2013)
摘要
In this paper, we demonstrate how a Markov Random Field (MRF) based framework can be used for multihop networks analysis and design. In fields such as image processing it has been shown that MRFs is a powerful tool to analyse distributed systems with strong spacial interactions, which is also a defining characteristic of multihop networks. In this work we focus on using MRFs to model traffic intensity of sensor networks using shortest path routing. Later we propose a probabilistic relaying mechanism to recreate a traffic pattern similar to that observed in a network using shortest path routing. The objective is to emulate the shortest path performance without complex routing protocols and associated overheads. Using a simulation study we then show that the proposed mechanism achieves 95% of the throughput of shortest path, without using a routing protocol.
更多查看译文
关键词
ad hoc networks,mathematical model,sensor networks,nickel,probabilistic logic,mobile communication,markov processes,spread spectrum communication,routing,mrf,wireless sensor networks,image processing,probability
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络