MULTICAST ROUTING IN MOBILE AD HOC NETWORKS WITH CLUSTERING

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SEPEHRI M.M.; BAGHERPOUR MATIN

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: AMIRKABIR Year:2008 | Volume:18 | Issue:67-B Page(s): 13-20

Download Full-Text

Persian Verion

View:

1,101

Download:

Cites:

Information Journal Paper

Title

MULTICAST ROUTING IN MOBILE AD HOC NETWORKS WITH CLUSTERING

Author(s)

SEPEHRI M.M. | BAGHERPOUR MATIN | Issue Writer Certificate

Keywords

MOBILE AD HOC NETWORKQ3

MULTICAST ROUTINGQ3

CLUSTERINGQ3

STABLE ROUTEQ3

Abstract

A MOBILE AD HOC NETWORK is a wireless network, which supports mobile nodes without any fixed infrastructure. MULTICAST ROUTING is one of the main challenges in MOBILE AD HOC NETWORKs. There is no fixed router in MANETs, so nodes act as routers and determine required routes. However, the route once found is not necessarily valid after movement of nodes. Since there is no centralized information, finding STABLE ROUTEs satisfying global constraints is challenging. In this paper, a method is proposed for sharing nodes information to form a virtual infrastructure. A mathematical formulation of maximum stable multicast tree construction problem with delay constraint is developed and a heuristic algorithm is proposed to solve it. By simulation, we evaluate the performance of proposed algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

SEPEHRI, M.M., & BAGHERPOUR, MATIN. (2008). MULTICAST ROUTING IN MOBILE AD HOC NETWORKS WITH CLUSTERING. AMIRKABIR, 18(67-B), 13-20. SID. https://sid.ir/paper/746/en

Vancouver: Copy

SEPEHRI M.M., BAGHERPOUR MATIN. MULTICAST ROUTING IN MOBILE AD HOC NETWORKS WITH CLUSTERING. AMIRKABIR[Internet]. 2008;18(67-B):13-20. Available from: https://sid.ir/paper/746/en

IEEE: Copy

M.M. SEPEHRI, and MATIN BAGHERPOUR, “MULTICAST ROUTING IN MOBILE AD HOC NETWORKS WITH CLUSTERING,” AMIRKABIR, vol. 18, no. 67-B, pp. 13–20, 2008, [Online]. Available: https://sid.ir/paper/746/en

Related Journal Papers