Proceedings of ICUPC - 5th International Conference on Universal Personal Communications
DOI: 10.1109/icupc.1996.562623
|View full text |Cite
|
Sign up to set email alerts
|

Routing and channel assignment for low power transmission in PCS

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
103
0
3

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 166 publications
(107 citation statements)
references
References 7 publications
1
103
0
3
Order By: Relevance
“…However, it also yields higher interference to other mobile hosts, which can destroy an existing transmission band and may cause the network to have blocked calls. This could result in a decrease in network capacity [7]. Therefore, lower power transmission does not always have a negative impact on throughput.…”
Section: Power-efficient Ad Hoc Mobile Network Efficient Utilizationmentioning
confidence: 99%
See 1 more Smart Citation
“…However, it also yields higher interference to other mobile hosts, which can destroy an existing transmission band and may cause the network to have blocked calls. This could result in a decrease in network capacity [7]. Therefore, lower power transmission does not always have a negative impact on throughput.…”
Section: Power-efficient Ad Hoc Mobile Network Efficient Utilizationmentioning
confidence: 99%
“…In [7], Dijkstra's shortest path algorithm was modified to obtain the minimum total power route. However, since transmission power depends on distance 1 (proportional to d n ), this algorithm will select routes with more hops than other routing algorithms.…”
Section: Power-efficient Ad Hoc Routing Power-efficient Routing Protomentioning
confidence: 99%
“…In early work in the networking literature, minimum-energy routing algorithms, which select the paths with the minimum total transmission power over all the nodes, are developed (see e.g., [1], [2]). As described in [3], if the links are assumed to be error-free and hence there is no need for retransmission, energy-efficient routing algorithms choose the minimum-hop paths in cases in which the transmitter power is fixed.…”
Section: Introductionmentioning
confidence: 99%
“…Such a formulation often leads to the formation of a path with a large number of hops. In [11], the authors extend this basic approach by including energy expenditure for packet reception in the link cost.…”
Section: Related Workmentioning
confidence: 99%