Near-Optimal Flow in wireless sensor networks

Author

Homayounnejad, Saman ; Bagheri, Alireza ; Ghebleh, Abbas

Author_Institution

CEIT, Amirkabir Univ. of Technol., Tehran, Iran

fYear

2011

fDate

23-27 May 2011

Firstpage

434

Lastpage

439

Abstract

In this paper the Max-Flow (MF) problem is redefined to make its solution implementable in location-aware large-scale wireless networks, especially wireless sensor networks (WSNs). This restatement transforms MF problem to the multi-objective problem called Near-Optimal Flow (NOF) problem. In NOF problem, objectives are time and message overheads on one side, and flow value on the other side. Moreover, this paper provides a Lightweight Asynchronous Near-Optimal Algorithm (LANOFA) which relaxes MF limitations and finds NOF in the network. Simulation results show that applying introduced heuristics simultaneously, reduces around 65% of control messages, by sacrificing only 9% of flow value.

Keywords

optimisation; sensor placement; wireless sensor networks; control message; lightweight asynchronous near optimal algorithm; location aware large scale wireless network; max-flow problem; multiobjective problem; near optimal flow; restatement transforms; wireless sensor networks; Algorithm design and analysis; Complexity theory; Heuristic algorithms; Relays; Simulation; Wireless networks; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

MIPRO, 2011 Proceedings of the 34th International Convention

Conference_Location

Opatija

Print_ISBN

978-1-4577-0996-8

Type

conf

Filename

5967096