Broadcast Algorithms for Mobile Ad hoc Networks based on Depth-first Traversal

Koushik Sinha; Pradip K Srimani

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Broadcast Algorithms for Mobile Ad hoc Networks based on Depth-first Traversal

In Proceedings of the 3rd International Workshop on Wireless Information Systems - Volume 0ICEIS, 170-177, 2004 , Porto, Portugal

Authors: Koushik Sinha ¹ and Pradip K Srimani ²

Affiliations: ¹ University of Arizona, United States ; ² Clemson University, United States

Abstract: Two deterministic broadcast algorithms are presented for mobile ad hoc networks where the mobile nodes possess collision detection capabilities. The first algorithm, based on a depth-first traversal of the nodes, accomplishes broadcast in O(n log n) time in the worst case. The second algorithm is mobility resilient even when the topology changes very frequently, with O(∆•n log n+n•|M |) time to broadcast in the worst case, where |M | is the length of the message to be broadcasted and ∆ is the maximum node degree.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.135.214.139

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Sinha, K. and K Srimani, P. (2004). Broadcast Algorithms for Mobile Ad hoc Networks based on Depth-first Traversal. In Proceedings of the 3rd International Workshop on Wireless Information Systems (ICEIS 2004) - WIS; ISBN 972-8865-02-3, SciTePress, pages 170-177. DOI: 10.5220/0002662401700177

@conference{wis04,
author={Koushik Sinha. and Pradip {K Srimani}.},
title={Broadcast Algorithms for Mobile Ad hoc Networks based on Depth-first Traversal},
booktitle={Proceedings of the 3rd International Workshop on Wireless Information Systems (ICEIS 2004) - WIS},
year={2004},
pages={170-177},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002662401700177},
isbn={972-8865-02-3},
}

TY - CONF

JO - Proceedings of the 3rd International Workshop on Wireless Information Systems (ICEIS 2004) - WIS
TI - Broadcast Algorithms for Mobile Ad hoc Networks based on Depth-first Traversal
SN - 972-8865-02-3
AU - Sinha, K.
AU - K Srimani, P.
PY - 2004
SP - 170
EP - 177
DO - 10.5220/0002662401700177
PB - SciTePress