Range Assignment Problem on the Steiner Tree Based Topology in Ad Hoc Wireless Networks | Zendy

Rashid Bin Muhammad | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Range Assignment Problem on the Steiner Tree Based Topology in Ad Hoc Wireless Networks

Author(s) -

Rashid Bin Muhammad

Publication year - 2009

Publication title -

mobile information systems

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.346

H-Index - 34

eISSN - 1875-905X

pISSN - 1574-017X

DOI - 10.1155/2009/707968

Subject(s) - computer science , relay , steiner tree problem , wireless ad hoc network , graph , relay channel , computer network , topology (electrical circuits) , connectivity , range (aeronautics) , wireless , algorithm , theoretical computer science , discrete mathematics , combinatorics , mathematics , telecommunications , power (physics) , physics , materials science , quantum mechanics , composite material

This paper describes an efficient method for introducing relay nodes in the given communication graph. Our algorithm assigns transmitting ranges to the nodes such that the cost of range assignment function is minimal over all connecting range assignments in the graph. The main contribution of this paper is the O(N log N) algorithm to add relay nodes to the wireless communication network and 2-approximation to assign transmitting ranges to nodes (original and relay). It does not assume that communication graph to be a unit disk graph. The output of the algorithm is the minimal Steiner tree on the graph consists of terminal (original) nodes and relay (additional) nodes. The output of approximation is the range assignments to the nodes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research