Name
Abstract | ||
|---|---|---|
We consider source-initiated broadcast session traffic in an ad hoc wireless network operating under a hard constraint on the end-to-end delay between the source and any node in the network. Our objective in this paper is to construct an energy-efficient broadcast tree that has a maximum depth A, where A represents the end-to-end delay constraint in the network. We first characterize the optimal solution to a closely related problem in dense networks using a dynamic programming formulation. The solution to the dynamic program indicates that there is a single optimal, policy applicable to all dense networks. Elaborating on the insights provided by the structure of the problem in dense networks, we design an algorithm for finding a solution to the delay constrained minimum power broadcasting problem in sparse networks. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/WIOPT.2007.4480041 | 2007 5TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC AND WIRELESS NETWORKS AND WORKSHOPS, VOLS 1-2 |
Keywords | Field | DocType |
dynamic programming,broadcasting,ad hoc wireless network,algorithm design and analysis,end to end delay,energy efficient,wireless network,wireless networks,energy efficiency,ad hoc networks,transmitters | Dynamic programming,Wireless network,Broadcasting,Radio networks,Network delay,Computer science,Computer network,Wireless ad hoc network,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kerem Bulbul | 1 | 71 | 9.69 |
| Özgür Erçetin | 2 | 146 | 22.96 |
| Tonguç Ünlüyurt | 3 | 102 | 8.94 |