cqu_10639+ATTACHMENT02+ATTACHMENT02.6.pdf (1.14 MB)

Markov Random Fields based probabilistic relaying for multihop networks

Download (1.14 MB)
conference contribution
posted on 06.12.2017, 00:00 by Aruna Jayasuriya, S Perreau, M Sigelle
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.

History

Parent Title

2013 IEEE Wireless Communications and Networking Conference (WCNC).

Start Page

1458

End Page

1463

Number of Pages

6

Start Date

01/01/2013

Finish Date

01/01/2013

ISBN-13

9781467359382

Location

Shanghai, Shanghai, China

Publisher

IEEE

Place of Publication

New York

Peer Reviewed

Yes

Open Access

No

External Author Affiliations

Institut TELECOM; Not affiliated to a Research Institute; School of Engineering and Technology (2013- ); University of South Australia;

Era Eligible

Yes

Name of Conference

IEEE Wireless Communications and Networking Conference